{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XCPQVPJPCFXYDUFAWIP3EFHPOY","short_pith_number":"pith:XCPQVPJP","schema_version":"1.0","canonical_sha256":"b89f0abd2f116f81d0a0b21fb214ef763cf1c2897887b95847e4bb4a685c8f0d","source":{"kind":"arxiv","id":"2105.00644","version":1},"attestation_state":"computed","paper":{"title":"Schema-Aware Deep Graph Convolutional Networks for Heterogeneous Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Da Zheng, George Karypis, Saurav Manchanda","submitted_at":"2021-05-03T06:24:27Z","abstract_excerpt":"Graph convolutional network (GCN) based approaches have achieved significant progress for solving complex, graph-structured problems. GCNs incorporate the graph structure information and the node (or edge) features through message passing and computes 'deep' node representations. Despite significant progress in the field, designing GCN architectures for heterogeneous graphs still remains an open challenge. Due to the schema of a heterogeneous graph, useful information may reside multiple hops away. A key question is how to perform message passing to incorporate information of neighbors multipl"},"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":"2105.00644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-03T06:24:27Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"eddc8c187a36f79d4c501bd4290fdacc07a238dfd38ca2e6497c9ab8d97d28c3","abstract_canon_sha256":"af196a37d0670b69cbb3f911202a2f25631b40c341df04565ae1e3fac28f6016"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:36:56.328980Z","signature_b64":"NE6w5BQ2cN2o73m2lChPv5eASqTOnjLMb+9Nz/Z/aq9kfWdNqqkDR5zks6Y2p3WF418SD7IiK58GnjcDEEmLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89f0abd2f116f81d0a0b21fb214ef763cf1c2897887b95847e4bb4a685c8f0d","last_reissued_at":"2026-07-05T02:36:56.328576Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:36:56.328576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Schema-Aware Deep Graph Convolutional Networks for Heterogeneous Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Da Zheng, George Karypis, Saurav Manchanda","submitted_at":"2021-05-03T06:24:27Z","abstract_excerpt":"Graph convolutional network (GCN) based approaches have achieved significant progress for solving complex, graph-structured problems. GCNs incorporate the graph structure information and the node (or edge) features through message passing and computes 'deep' node representations. Despite significant progress in the field, designing GCN architectures for heterogeneous graphs still remains an open challenge. Due to the schema of a heterogeneous graph, useful information may reside multiple hops away. A key question is how to perform message passing to incorporate information of neighbors multipl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.00644","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/2105.00644/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":"2105.00644","created_at":"2026-07-05T02:36:56.328635+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.00644v1","created_at":"2026-07-05T02:36:56.328635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.00644","created_at":"2026-07-05T02:36:56.328635+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCPQVPJPCFXY","created_at":"2026-07-05T02:36:56.328635+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCPQVPJPCFXYDUFA","created_at":"2026-07-05T02:36:56.328635+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCPQVPJP","created_at":"2026-07-05T02:36:56.328635+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/XCPQVPJPCFXYDUFAWIP3EFHPOY","json":"https://pith.science/pith/XCPQVPJPCFXYDUFAWIP3EFHPOY.json","graph_json":"https://pith.science/api/pith-number/XCPQVPJPCFXYDUFAWIP3EFHPOY/graph.json","events_json":"https://pith.science/api/pith-number/XCPQVPJPCFXYDUFAWIP3EFHPOY/events.json","paper":"https://pith.science/paper/XCPQVPJP"},"agent_actions":{"view_html":"https://pith.science/pith/XCPQVPJPCFXYDUFAWIP3EFHPOY","download_json":"https://pith.science/pith/XCPQVPJPCFXYDUFAWIP3EFHPOY.json","view_paper":"https://pith.science/paper/XCPQVPJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.00644&json=true","fetch_graph":"https://pith.science/api/pith-number/XCPQVPJPCFXYDUFAWIP3EFHPOY/graph.json","fetch_events":"https://pith.science/api/pith-number/XCPQVPJPCFXYDUFAWIP3EFHPOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCPQVPJPCFXYDUFAWIP3EFHPOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCPQVPJPCFXYDUFAWIP3EFHPOY/action/storage_attestation","attest_author":"https://pith.science/pith/XCPQVPJPCFXYDUFAWIP3EFHPOY/action/author_attestation","sign_citation":"https://pith.science/pith/XCPQVPJPCFXYDUFAWIP3EFHPOY/action/citation_signature","submit_replication":"https://pith.science/pith/XCPQVPJPCFXYDUFAWIP3EFHPOY/action/replication_record"}},"created_at":"2026-07-05T02:36:56.328635+00:00","updated_at":"2026-07-05T02:36:56.328635+00:00"}