{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SMBKEN6UCH5NSIX2P7GRIVFDBD","short_pith_number":"pith:SMBKEN6U","schema_version":"1.0","canonical_sha256":"9302a237d411fad922fa7fcd1454a308d7b025d9fcd7fed4b9c14043e2e773ca","source":{"kind":"arxiv","id":"2008.12842","version":1},"attestation_state":"computed","paper":{"title":"HeteGCN: Heterogeneous Graph Convolutional Networks for Text Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Arun Iyer, Rahul Ragesh, Ram Bairi, Sundararajan Sellamanickam, Vijay Lingam","submitted_at":"2020-08-19T12:24:35Z","abstract_excerpt":"We consider the problem of learning efficient and inductive graph convolutional networks for text classification with a large number of examples and features. Existing state-of-the-art graph embedding based methods such as predictive text embedding (PTE) and TextGCN have shortcomings in terms of predictive performance, scalability and inductive capability. To address these limitations, we propose a heterogeneous graph convolutional network (HeteGCN) modeling approach that unites the best aspects of PTE and TextGCN together. The main idea is to learn feature embeddings and derive document embed"},"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":"2008.12842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-08-19T12:24:35Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"9b4c8a3c67b958e122ff132037cfc0155ecfaa326022fb9378b27879092aca36","abstract_canon_sha256":"d52a95e31ccc280da7bb4f647c2da15bded28271ef5677e511e1951b538ec481"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:31:31.385142Z","signature_b64":"Lxa9K2OAcz7bzmrSFHnYknijp7mVLyZ4b9Z4u/CAmXUcEXRRACVS+L+s0NCnOrSBQscuHgkwf5Y0HhsOSkxMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9302a237d411fad922fa7fcd1454a308d7b025d9fcd7fed4b9c14043e2e773ca","last_reissued_at":"2026-07-05T01:31:31.384734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:31:31.384734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HeteGCN: Heterogeneous Graph Convolutional Networks for Text Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Arun Iyer, Rahul Ragesh, Ram Bairi, Sundararajan Sellamanickam, Vijay Lingam","submitted_at":"2020-08-19T12:24:35Z","abstract_excerpt":"We consider the problem of learning efficient and inductive graph convolutional networks for text classification with a large number of examples and features. Existing state-of-the-art graph embedding based methods such as predictive text embedding (PTE) and TextGCN have shortcomings in terms of predictive performance, scalability and inductive capability. To address these limitations, we propose a heterogeneous graph convolutional network (HeteGCN) modeling approach that unites the best aspects of PTE and TextGCN together. The main idea is to learn feature embeddings and derive document embed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.12842","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/2008.12842/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":"2008.12842","created_at":"2026-07-05T01:31:31.384802+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.12842v1","created_at":"2026-07-05T01:31:31.384802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.12842","created_at":"2026-07-05T01:31:31.384802+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMBKEN6UCH5N","created_at":"2026-07-05T01:31:31.384802+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMBKEN6UCH5NSIX2","created_at":"2026-07-05T01:31:31.384802+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMBKEN6U","created_at":"2026-07-05T01:31:31.384802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SMBKEN6UCH5NSIX2P7GRIVFDBD","json":"https://pith.science/pith/SMBKEN6UCH5NSIX2P7GRIVFDBD.json","graph_json":"https://pith.science/api/pith-number/SMBKEN6UCH5NSIX2P7GRIVFDBD/graph.json","events_json":"https://pith.science/api/pith-number/SMBKEN6UCH5NSIX2P7GRIVFDBD/events.json","paper":"https://pith.science/paper/SMBKEN6U"},"agent_actions":{"view_html":"https://pith.science/pith/SMBKEN6UCH5NSIX2P7GRIVFDBD","download_json":"https://pith.science/pith/SMBKEN6UCH5NSIX2P7GRIVFDBD.json","view_paper":"https://pith.science/paper/SMBKEN6U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.12842&json=true","fetch_graph":"https://pith.science/api/pith-number/SMBKEN6UCH5NSIX2P7GRIVFDBD/graph.json","fetch_events":"https://pith.science/api/pith-number/SMBKEN6UCH5NSIX2P7GRIVFDBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMBKEN6UCH5NSIX2P7GRIVFDBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMBKEN6UCH5NSIX2P7GRIVFDBD/action/storage_attestation","attest_author":"https://pith.science/pith/SMBKEN6UCH5NSIX2P7GRIVFDBD/action/author_attestation","sign_citation":"https://pith.science/pith/SMBKEN6UCH5NSIX2P7GRIVFDBD/action/citation_signature","submit_replication":"https://pith.science/pith/SMBKEN6UCH5NSIX2P7GRIVFDBD/action/replication_record"}},"created_at":"2026-07-05T01:31:31.384802+00:00","updated_at":"2026-07-05T01:31:31.384802+00:00"}