{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YVQNPHK3S4A6SOZ32SPX5LK4V4","short_pith_number":"pith:YVQNPHK3","schema_version":"1.0","canonical_sha256":"c560d79d5b9701e93b3bd49f7ead5caf10df3ef977e82d90f6bbb2e03954d759","source":{"kind":"arxiv","id":"2403.00165","version":3},"attestation_state":"computed","paper":{"title":"TELEClass: Taxonomy Enrichment and LLM-Enhanced Hierarchical Text Classification with Minimal Supervision","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Jiaming Shen, Jiawei Han, Jinfeng Xiao, Rui Li, Ruozhen Yang, Xueqiang Xu, Yunyi Zhang","submitted_at":"2024-02-29T22:26:07Z","abstract_excerpt":"Hierarchical text classification aims to categorize each document into a set of classes in a label taxonomy, which is a fundamental web text mining task with broad applications such as web content analysis and semantic indexing. Most earlier works focus on fully or semi-supervised methods that require a large amount of human annotated data which is costly and time-consuming to acquire. To alleviate human efforts, in this paper, we work on hierarchical text classification with a minimal amount of supervision: using the sole class name of each node as the only supervision. Recently, large langua"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2403.00165","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-02-29T22:26:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b460e5e6b909d8c8d42647ac84345b2e18b68077e6e5f670eb903b581049547f","abstract_canon_sha256":"4013e82d78248f719eb9135d2a0afa97f73ddca13d87bb529c283eb47a1ce149"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:42.639767Z","signature_b64":"YV9M7AmkAtKTkkHZfdLzCRWtYYXuo2TWZNSxwhFhcpOPD0yVQoJgkk+bRsNOQ3CpHMy3Vh3R+CQ/NZ1L3pnwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c560d79d5b9701e93b3bd49f7ead5caf10df3ef977e82d90f6bbb2e03954d759","last_reissued_at":"2026-07-05T10:09:42.639254Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:42.639254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TELEClass: Taxonomy Enrichment and LLM-Enhanced Hierarchical Text Classification with Minimal Supervision","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Jiaming Shen, Jiawei Han, Jinfeng Xiao, Rui Li, Ruozhen Yang, Xueqiang Xu, Yunyi Zhang","submitted_at":"2024-02-29T22:26:07Z","abstract_excerpt":"Hierarchical text classification aims to categorize each document into a set of classes in a label taxonomy, which is a fundamental web text mining task with broad applications such as web content analysis and semantic indexing. Most earlier works focus on fully or semi-supervised methods that require a large amount of human annotated data which is costly and time-consuming to acquire. To alleviate human efforts, in this paper, we work on hierarchical text classification with a minimal amount of supervision: using the sole class name of each node as the only supervision. Recently, large langua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.00165","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.00165/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.00165","created_at":"2026-07-05T10:09:42.639329+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.00165v3","created_at":"2026-07-05T10:09:42.639329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.00165","created_at":"2026-07-05T10:09:42.639329+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVQNPHK3S4A6","created_at":"2026-07-05T10:09:42.639329+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVQNPHK3S4A6SOZ3","created_at":"2026-07-05T10:09:42.639329+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVQNPHK3","created_at":"2026-07-05T10:09:42.639329+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.05583","citing_title":"KG-HTC: Integrating Knowledge Graphs into LLMs for Effective Zero-shot Hierarchical Text Classification","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07937","citing_title":"HCRE: LLM-based Hierarchical Classification for Cross-Document Relation Extraction with a Prediction-then-Verification Strategy","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YVQNPHK3S4A6SOZ32SPX5LK4V4","json":"https://pith.science/pith/YVQNPHK3S4A6SOZ32SPX5LK4V4.json","graph_json":"https://pith.science/api/pith-number/YVQNPHK3S4A6SOZ32SPX5LK4V4/graph.json","events_json":"https://pith.science/api/pith-number/YVQNPHK3S4A6SOZ32SPX5LK4V4/events.json","paper":"https://pith.science/paper/YVQNPHK3"},"agent_actions":{"view_html":"https://pith.science/pith/YVQNPHK3S4A6SOZ32SPX5LK4V4","download_json":"https://pith.science/pith/YVQNPHK3S4A6SOZ32SPX5LK4V4.json","view_paper":"https://pith.science/paper/YVQNPHK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.00165&json=true","fetch_graph":"https://pith.science/api/pith-number/YVQNPHK3S4A6SOZ32SPX5LK4V4/graph.json","fetch_events":"https://pith.science/api/pith-number/YVQNPHK3S4A6SOZ32SPX5LK4V4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVQNPHK3S4A6SOZ32SPX5LK4V4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVQNPHK3S4A6SOZ32SPX5LK4V4/action/storage_attestation","attest_author":"https://pith.science/pith/YVQNPHK3S4A6SOZ32SPX5LK4V4/action/author_attestation","sign_citation":"https://pith.science/pith/YVQNPHK3S4A6SOZ32SPX5LK4V4/action/citation_signature","submit_replication":"https://pith.science/pith/YVQNPHK3S4A6SOZ32SPX5LK4V4/action/replication_record"}},"created_at":"2026-07-05T10:09:42.639329+00:00","updated_at":"2026-07-05T10:09:42.639329+00:00"}