{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HOXOFYV5YPLXE2FV4XMEOTTPYK","short_pith_number":"pith:HOXOFYV5","schema_version":"1.0","canonical_sha256":"3baee2e2bdc3d77268b5e5d8474e6fc28a24a8abd5db663cae59c6fce5cae9f5","source":{"kind":"arxiv","id":"2408.15257","version":1},"attestation_state":"computed","paper":{"title":"Text classification optimization algorithm based on graph neural network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Dan Sun, Erdi Gao, Haohao Xia, Haowei Yang, Yuanjing Zhu, Yuhan Ma","submitted_at":"2024-08-09T23:25:37Z","abstract_excerpt":"In the field of natural language processing, text classification, as a basic task, has important research value and application prospects. Traditional text classification methods usually rely on feature representations such as the bag of words model or TF-IDF, which overlook the semantic connections between words and make it challenging to grasp the deep structural details of the text. Recently, GNNs have proven to be a valuable asset for text classification tasks, thanks to their capability to handle non-Euclidean data efficiently. However, the existing text classification methods based on GN"},"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":"2408.15257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-08-09T23:25:37Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"66d4d4cb9488c9688e607c6465068a343f260696fe40ea24d885ec3b83cbe33e","abstract_canon_sha256":"60591865c0df236e8ada4781e3b9f79f312aee29ae2836215124872cb9d9cf0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:00:09.112861Z","signature_b64":"mKjTrrQrdy3R2LH2BzgRC8wLiDL46LtERiLi+9M7NnezhDg9jPF0jBfQP02icm0u81hkMmIIdhsFvbV+TTS/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3baee2e2bdc3d77268b5e5d8474e6fc28a24a8abd5db663cae59c6fce5cae9f5","last_reissued_at":"2026-07-05T09:00:09.112361Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:00:09.112361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Text classification optimization algorithm based on graph neural network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Dan Sun, Erdi Gao, Haohao Xia, Haowei Yang, Yuanjing Zhu, Yuhan Ma","submitted_at":"2024-08-09T23:25:37Z","abstract_excerpt":"In the field of natural language processing, text classification, as a basic task, has important research value and application prospects. Traditional text classification methods usually rely on feature representations such as the bag of words model or TF-IDF, which overlook the semantic connections between words and make it challenging to grasp the deep structural details of the text. Recently, GNNs have proven to be a valuable asset for text classification tasks, thanks to their capability to handle non-Euclidean data efficiently. However, the existing text classification methods based on GN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.15257","kind":"arxiv","version":1},"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/2408.15257/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":"2408.15257","created_at":"2026-07-05T09:00:09.112422+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.15257v1","created_at":"2026-07-05T09:00:09.112422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.15257","created_at":"2026-07-05T09:00:09.112422+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOXOFYV5YPLX","created_at":"2026-07-05T09:00:09.112422+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOXOFYV5YPLXE2FV","created_at":"2026-07-05T09:00:09.112422+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOXOFYV5","created_at":"2026-07-05T09:00:09.112422+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.03105","citing_title":"Few-Shot Learning with Adaptive Weight Masking in Conditional GANs","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HOXOFYV5YPLXE2FV4XMEOTTPYK","json":"https://pith.science/pith/HOXOFYV5YPLXE2FV4XMEOTTPYK.json","graph_json":"https://pith.science/api/pith-number/HOXOFYV5YPLXE2FV4XMEOTTPYK/graph.json","events_json":"https://pith.science/api/pith-number/HOXOFYV5YPLXE2FV4XMEOTTPYK/events.json","paper":"https://pith.science/paper/HOXOFYV5"},"agent_actions":{"view_html":"https://pith.science/pith/HOXOFYV5YPLXE2FV4XMEOTTPYK","download_json":"https://pith.science/pith/HOXOFYV5YPLXE2FV4XMEOTTPYK.json","view_paper":"https://pith.science/paper/HOXOFYV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.15257&json=true","fetch_graph":"https://pith.science/api/pith-number/HOXOFYV5YPLXE2FV4XMEOTTPYK/graph.json","fetch_events":"https://pith.science/api/pith-number/HOXOFYV5YPLXE2FV4XMEOTTPYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOXOFYV5YPLXE2FV4XMEOTTPYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOXOFYV5YPLXE2FV4XMEOTTPYK/action/storage_attestation","attest_author":"https://pith.science/pith/HOXOFYV5YPLXE2FV4XMEOTTPYK/action/author_attestation","sign_citation":"https://pith.science/pith/HOXOFYV5YPLXE2FV4XMEOTTPYK/action/citation_signature","submit_replication":"https://pith.science/pith/HOXOFYV5YPLXE2FV4XMEOTTPYK/action/replication_record"}},"created_at":"2026-07-05T09:00:09.112422+00:00","updated_at":"2026-07-05T09:00:09.112422+00:00"}