Skip to content
Smart Scholars🛡 Scholar Shield🏛 Research Integrity Desk🧩 Portfolio Console📰 Journals🔧 DOI MembersTools🔎 Journal AuditGI GetIndexedDr DOI Doctor

Kernel Metadata Declaration — on demand

ISO 26324 asks a DOI Registration Agency to produce a Kernel Metadata Declaration for every DOI it issues. Give any DOI: its public record becomes a record in the Smart Scholars DOI Metadata Format (1.0, or 1.1 when it carries what 1.1 added on 9 Oct 2026), checked against every rule, and declared as the Kernel XML.

Reads the DOI's public Crossref record; nothing is stored. Until Smart Scholars is accredited, every Declaration is marked as a draft in the XML itself.

✓ Meets every rule of the format

The record below is complete and every controlled value is a DOI Attribute Value Set 2.3 spelling. The Declaration on the right follows DOIMetadataKernel.xsd element by element.

What the DOI identifies

Extraction of Multidimensional Data using Subset Selection Algorithm

10.46243/jstj.2018.v3.i5.175 · JournalArticle — an article in a journal · Digital · Visual · Language · en

Published 2018-09-26

Part of Journal of Science & Technology · ISSN 2456-5660 · vol. 03 · no. 05 · pp. 08–11

Principal agents

  • Basanthapur Ruthu (author → Author)
  • Dr. M. Sreedhar Reddy (author → Author)
  • Longman Publishers (publisher → Publisher)

Also in the record, outside the Kernel: the abstract, the licence, 4 links, 7 references. Source: Crossref (member 25296), registered 2026-09-08, last deposited 2026-10-15.

⬇ Record (JSON) ⬇ Declaration (XML)

System metadata — ISO 26324:2025, Annex B · DOI Handbook 10.1

Each element by the standard's name and the Handbook's (in grey), read off the record.

DOI Name
DOI name
10.46243/jstj.2018.v3.i5.175
Referent Type
referentType
Creation
Referent Sub-Type
referentSubType
JournalArticle — an article in a journal
Referent Name(s)
referentName(s)
Extraction of Multidimensional Data using Subset Selection Algorithm (PrincipalTitle, en)
Basic Metadata
basicMetadata
author: Basanthapur Ruthu
author: Dr. M. Sreedhar Reddy
publisher: Longman Publishers
published: 2018-09-26
part of: Journal of Science & Technology · ISSN 2456-5660 · vol. 03 · no. 05 · pp. 08–11
language: en
form: Digital · Visual · Language
Referent Identifier(s)
alternateIdentifier(s)
none besides the DOI
Registration Authority
registrationAuthorityCode
Crossref — issued by Crossref (member 25296); held here as a copy
Created Date
issueDate
2026-09-08
relatedIdentifiersnone needed — the descriptive metadata is in this record

The record

{
    "format": "smartscholars-doi-metadata/1.1",
    "doi": "10.46243/jstj.2018.v3.i5.175",
    "referent": "Creation",
    "type": "JournalArticle",
    "structural_type": "Digital",
    "modes": [
        "Visual"
    ],
    "characters": [
        "Language"
    ],
    "titles": [
        {
            "value": "Extraction of Multidimensional Data using Subset Selection Algorithm",
            "type": "PrincipalTitle",
            "lang": "en"
        }
    ],
    "identifiers": [
        {
            "type": "DOI",
            "value": "10.46243/jstj.2018.v3.i5.175"
        }
    ],
    "agents": [
        {
            "role": "author",
            "name": {
                "given": "Basanthapur",
                "family": "Ruthu"
            },
            "sequence": "first",
            "affiliations": [
                {
                    "name": "CSE Department, Samskruti College of Engineering Kondapur, Ghatkesar, Hyderabad"
                }
            ]
        },
        {
            "role": "author",
            "name": {
                "given": "Dr. M.",
                "family": "Sreedhar Reddy"
            },
            "sequence": "additional",
            "affiliations": [
                {
                    "name": "CSE Department, Samskruti College of Engineering Kondapur, Ghatkesar, Hyderabad"
                }
            ]
        },
        {
            "role": "publisher",
            "name": {
                "org": "Longman Publishers"
            }
        }
    ],
    "dates": {
        "published": "2018-09-26",
        "date_type": "PublicationDate",
        "online": "2018-09-26"
    },
    "language": "en",
    "container": {
        "type": "Journal",
        "titles": [
            {
                "value": "Journal of Science & Technology",
                "type": "PrincipalTitle"
            }
        ],
        "identifiers": [
            {
                "type": "ISSN",
                "value": "2456-5660",
                "medium": "electronic"
            }
        ],
        "volume": "03",
        "issue": "05",
        "pages": {
            "first": "08",
            "last": "11"
        }
    },
    "links": [
        {
            "url": "https://www.jst.org.in/index.php/pub/article/view/175",
            "return_type": "text/html",
            "primary": true
        },
        {
            "url": "https://www.jst.org.in/index.php/pub/article/download/175/154",
            "purpose": "text-mining",
            "return_type": "application/pdf"
        },
        {
            "url": "https://www.jst.org.in/index.php/pub/article/download/175/3347",
            "purpose": "text-mining",
            "return_type": "application/xml"
        },
        {
            "url": "https://www.jst.org.in/index.php/pub/article/view/175/154",
            "purpose": "similarity-checking"
        }
    ],
    "abstract": {
        "value": "Highlight Extraction includes recognizing a subset of the most helpful elements that produces perfect outcomes as the first whole arrangement of components. An element determination calculation might be assessed from both the productivity and adequacy perspectives. While the productivity concerns the time required to discover a subset of elements, the adequacy is identified with the nature of the subset of components. In light of these criteria, a quick bunching based element determination calculation, FAST, is proposed and tentatively assessed in this paper. The FAST calculation works in two stages.In the initial step, highlights are separated into bunches by utilizing chart theoretic grouping strategies. In the second step, the most illustrative component that is unequivocally identified with target classes is chosen from each bunch to shape a subset of elements. Elements in various groups are generally free; the bunching based system of FAST has a high likelihood of creating a subset of helpful and autonomous elements. To guarantee the proficiency of FAST, we receive the productive least crossing tree grouping technique",
        "lang": "en"
    },
    "license": {
        "url": "https://creativecommons.org/licenses/by/4.0/",
        "start": "2018-09-26",
        "applies_to": "vor"
    },
    "references": [
        {
            "key": "ref1",
            "unstructured": "Almuallim H. and Dietterich T.G., Algorithms for Identifying Relevant Features, In Proceedings of the 9th Canadian Conference on AI, pp 38-45, 1992"
        },
        {
            "key": "ref2",
            "unstructured": "Arauzo-Azofra A., Benitez J.M. and Castro J.L., A feature set measure based on relief, In Proceedings of the fifth international conference on Recent Advances in Soft Computing, pp 104- 109, 2004"
        },
        {
            "key": "ref3",
            "doi": "10.1023/a:1007612503587",
            "unstructured": "Bell D.A. and Wang, H., A formalism for relevance and its application in feature subset selection, Machine Learning, 41(2), pp 175-195, 2000"
        },
        {
            "key": "ref4",
            "doi": "10.1007/978-3-540-75175-5_30",
            "unstructured": "Biesiada J. and Duch W., Features election for high-dimensionaldatała Pearson redundancy based filter, AdvancesinSoftComputing, 45, pp 242C249, 2008"
        },
        {
            "key": "ref5",
            "doi": "10.1109/icdm.2005.106",
            "unstructured": "Butterworth R., Piatetsky-Shapiro G. and Simovici D.A., On Feature Selection through Clustering, In Proceedings of the Fifth IEEE international Conference on Data Mining, pp 581-584, 2005"
        },
        {
            "key": "ref6",
            "doi": "10.1016/b978-1-55860-307-3.50010-1",
            "unstructured": "Cardie, C., Using decision trees to improve case-based learning, In Proceedings of Tenth International Conference on Machine Learning, pp 25-32, 1993"
        },
        {
            "key": "ref7",
            "doi": "10.1109/icdm.2005.106",
            "unstructured": "Butterworth R., Piatetsky-Shapiro G. and Simovici D.A., On Feature Selection through Clustering, In Proceedings of the Fifth IEEE international Conference on Data Mining, pp 581-584, 2005"
        }
    ],
    "crossmark": {
        "policy": "10.46243/jst.crossmark-policy",
        "domains": [
            "www.jst.org.in"
        ],
        "domain_exclusive": false
    },
    "record": {
        "registrant": "Longman Publishers",
        "registered": "2026-09-08",
        "updated": "2026-10-15",
        "issue_number": 1,
        "source": "crossref-api",
        "source_agency": "Crossref (member 25296)"
    }
}

The Kernel Metadata Declaration

DOIMetadataKernel.xsd · namespace http://www.doi.org/2010/DOISchema · Attribute Value Sets 2.3 · draft — the agency's DOI name is filled in on accreditation

<?xml version="1.0" encoding="UTF-8"?>
<!-- DRAFT declaration: Smart Scholars is not yet a DOI Registration Agency. registrationAgencyDoiName is a marker (10.0/ is no RA's prefix) and is filled in on accreditation. -->
<kernelMetadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.doi.org/2010/DOISchema https://www.doi.org/doi_schemas/DOIMetadataKernel.xsd" xmlns="http://www.doi.org/2010/DOISchema">
  <referentDoiName>10.46243/jstj.2018.v3.i5.175</referentDoiName>
  <primaryReferentType>Creation</primaryReferentType>
  <registrationAgencyDoiName>10.0/smart-scholars-draft</registrationAgencyDoiName>
  <issueDate>2026-11-18</issueDate>
  <issueNumber>1</issueNumber>
  <referentCreation>
    <name primaryLanguage="en">
      <value>Extraction of Multidimensional Data using Subset Selection Algorithm</value>
      <type>PrincipalTitle</type>
    </name>
    <identifier>
      <nonUriValue>10.46243/jstj.2018.v3.i5.175</nonUriValue>
      <uri returnType="text/html" doesContentNegotiation="true">https://doi.org/10.46243/jstj.2018.v3.i5.175</uri>
      <type>DOI</type>
    </identifier>
    <identifier>
      <uri returnType="text/html">https://www.jst.org.in/index.php/pub/article/view/175</uri>
      <type>URI</type>
    </identifier>
    <identifier>
      <uri>https://www.jst.org.in/index.php/pub/article/download/175/154</uri>
      <type>URI</type>
    </identifier>
    <identifier>
      <uri returnType="application/xml">https://www.jst.org.in/index.php/pub/article/download/175/3347</uri>
      <type>URI</type>
    </identifier>
    <identifier>
      <uri>https://www.jst.org.in/index.php/pub/article/view/175/154</uri>
      <type>URI</type>
    </identifier>
    <structuralType>Digital</structuralType>
    <mode>Visual</mode>
    <character>Language</character>
    <type>JournalArticle</type>
    <principalAgent>
      <name>
        <value>Basanthapur Ruthu</value>
        <type>PrincipalName</type>
      </name>
      <role>Author</role>
    </principalAgent>
    <principalAgent>
      <name>
        <value>Dr. M. Sreedhar Reddy</value>
        <type>PrincipalName</type>
      </name>
      <role>Author</role>
    </principalAgent>
    <principalAgent>
      <name>
        <value>Longman Publishers</value>
        <type>PrincipalName</type>
      </name>
      <role>Publisher</role>
    </principalAgent>
    <linkedCreation>
      <name>
        <value>Journal of Science &amp; Technology</value>
        <type>PrincipalTitle</type>
      </name>
      <identifier>
        <nonUriValue>2456-5660</nonUriValue>
        <type>ISSN</type>
      </identifier>
      <referentCreationRole>Part</referentCreationRole>
      <referentCreationSequenceIdentifier>
        <value>03</value>
        <type>VolumeNumber</type>
      </referentCreationSequenceIdentifier>
      <referentCreationSequenceIdentifier>
        <value>05</value>
        <type>IssueNumber</type>
      </referentCreationSequenceIdentifier>
      <referentCreationSequenceIdentifier>
        <value>08-11</value>
        <type>PageNumber</type>
      </referentCreationSequenceIdentifier>
    </linkedCreation>
    <language>en</language>
    <languageOfReferentContent>
      <language>en</language>
      <languageOfReferentContentType>Original</languageOfReferentContentType>
    </languageOfReferentContent>
    <creationDate>
      <date>2018-09-26</date>
      <creationDateType>PublicationDate</creationDateType>
    </creationDate>
  </referentCreation>
</kernelMetadata>

Everything Smart Scholars runs

Nine sites, one account. A journal starts at the audit; an author starts at Scholar Shield.

What we do: DOIs registered from what a journal already has · Crossref records completed — references, abstracts, licences, ORCID iDs, affiliations and ROR IDs, funding · DOIs that resolve · articles preserved · journals rated on the public record · see everything we do →

Book a free call

For journals & publishers

Start with the audit — ₹4,999 per journal, and the gate to everything else.

DOI care

Every service on one journal profile — each previews first and acts only on your approval.

  • DOI Doctor — check & repairevery DOI tested at doi.org and Crossref; dead links, abstracts, licences, ORCIDs
  • Smart Deposita new DOI from your PDF, Word file, article page, JATS XML or spreadsheet — every value shown with its source, deposited once you confirm it
  • DOI census (Excel)site against Crossref, both directions, with a copy-paste fix per article
  • Backfile DOIsDOIs for older articles that never had one — no per-DOI fee of ours
  • DOIs for conference proceedingsthe conference, the volume and every paper — registered in the organiser's own name
  • Scopus indexing guidethe minimum criteria, the 14 CSAB criteria and how a title is suggested — from Elsevier's own page
  • Embase indexing guidewhat Embase asks of a biomedical journal and how to suggest it
  • Write DOIs into OJSthe verified DOIs pushed onto your article pages through your own API
  • Silent-failure monitorweekly checks of site, OAI-PMH, Scholar tags, ISSN, preservation, hijack lists
  • Journal Radarevery journal, every day: SSL, DNS, redirects, robots.txt, OJS, DOIs, Crossref metadata, broken links — what broke since yesterday first
  • Verified metrics & badgesa public, dated, source-linked metrics page and a "cited by" badge
  • Quality dossier (PDF)one PDF for universities, authors and reviewers
  • Author citation enginethe citation steps emailed to each author from the journal's own mailbox
  • JATS XMLmachine-readable JATS per article
  • Duplicate articlesthe same paper published twice — you choose which copy stays

For authors & researchers

Free to use. Nothing you check is shared with the journal.

For institutions, sponsors & DOI operators

Smart Scholars

Mon–Sat, 10:00–19:00 IST. The Ask AI button on every page answers about our services at any hour.

News

Policies

What we can register a DOI for

20 kinds of record, one account, one place. Every one gets a DOI that resolves, metadata that indexes read, and a record that stays correct afterwards.

Journals

  • Journal articles
  • Journal titles
  • Pending publications
  • Peer reviews
  • Preprints & posted content

Books & conferences

  • Books
  • Book chapters
  • Book series
  • Book sets
  • Conference proceedings
  • Proceedings series
  • Conference papers

Other research output

  • Theses & dissertations
  • Reports & working papers
  • Report series
  • Standards
  • Databases
  • Datasets
  • Figures, tables & supplements

Funding

  • Grants & funding awards

Elsewhere

The same company, in the places our publishers already read.
Add Smart Scholars as a preferred source on GoogleSee more of our newsroom in Google’s Top Stories.
Smart Scholars · Every service on one pageNewsroom posts CC BY 4.0 · DOI metadata CC0 · everything else ©Data from OpenAlex (openalex.org), CC0 · Crossref · ISSN Portal · DOAJContact
WhatsApp