{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GUHKRHSAN2QUQENYHCE3D6RALU","short_pith_number":"pith:GUHKRHSA","schema_version":"1.0","canonical_sha256":"350ea89e406ea14811b83889b1fa205d35e4d8b3bc7d6edc4ec64385b99bef26","source":{"kind":"arxiv","id":"2207.02547","version":3},"attestation_state":"computed","paper":{"title":"Simple and Efficient Heterogeneous Graph Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dongrui Fan, Mingyu Yan, Shirui Pan, Xiaocheng Yang, Xiaochun Ye","submitted_at":"2022-07-06T10:01:46Z","abstract_excerpt":"Heterogeneous graph neural networks (HGNNs) have powerful capability to embed rich structural and semantic information of a heterogeneous graph into node representations. Existing HGNNs inherit many mechanisms from graph neural networks (GNNs) over homogeneous graphs, especially the attention mechanism and the multi-layer structure. These mechanisms bring excessive complexity, but seldom work studies whether they are really effective on heterogeneous graphs. This paper conducts an in-depth and detailed study of these mechanisms and proposes Simple and Efficient Heterogeneous Graph Neural Netwo"},"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":"2207.02547","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-06T10:01:46Z","cross_cats_sorted":[],"title_canon_sha256":"6d80bd9404bb142e8e6b75e0d6e89b855e1b52aea529444593d383b27a844b55","abstract_canon_sha256":"47b2c3a6a4cd11a273feaf9f5071cb1e7ca710ca3ad2131bf334f69dc5466abd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:46:43.489984Z","signature_b64":"WvJuRz0/AhGIvUnlPtHk6tBJj26VMldsEDxyIxxIzhhLvKQiAoW2MaSiP7PRNCgJRFkAkLNqBqXZczQ0jQBjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"350ea89e406ea14811b83889b1fa205d35e4d8b3bc7d6edc4ec64385b99bef26","last_reissued_at":"2026-07-05T06:46:43.489407Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:46:43.489407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple and Efficient Heterogeneous Graph Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dongrui Fan, Mingyu Yan, Shirui Pan, Xiaocheng Yang, Xiaochun Ye","submitted_at":"2022-07-06T10:01:46Z","abstract_excerpt":"Heterogeneous graph neural networks (HGNNs) have powerful capability to embed rich structural and semantic information of a heterogeneous graph into node representations. Existing HGNNs inherit many mechanisms from graph neural networks (GNNs) over homogeneous graphs, especially the attention mechanism and the multi-layer structure. These mechanisms bring excessive complexity, but seldom work studies whether they are really effective on heterogeneous graphs. This paper conducts an in-depth and detailed study of these mechanisms and proposes Simple and Efficient Heterogeneous Graph Neural Netwo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.02547","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/2207.02547/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":"2207.02547","created_at":"2026-07-05T06:46:43.489487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.02547v3","created_at":"2026-07-05T06:46:43.489487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.02547","created_at":"2026-07-05T06:46:43.489487+00:00"},{"alias_kind":"pith_short_12","alias_value":"GUHKRHSAN2QU","created_at":"2026-07-05T06:46:43.489487+00:00"},{"alias_kind":"pith_short_16","alias_value":"GUHKRHSAN2QUQENY","created_at":"2026-07-05T06:46:43.489487+00:00"},{"alias_kind":"pith_short_8","alias_value":"GUHKRHSA","created_at":"2026-07-05T06:46:43.489487+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.00646","citing_title":"MoltGraph: A Longitudinal Temporal Graph Dataset of Moltbook for Coordinated-Agent Detection","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2603.04545","citing_title":"An LLM-Guided Query-Aware Inference System for GNN Models on Large Knowledge Graphs","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GUHKRHSAN2QUQENYHCE3D6RALU","json":"https://pith.science/pith/GUHKRHSAN2QUQENYHCE3D6RALU.json","graph_json":"https://pith.science/api/pith-number/GUHKRHSAN2QUQENYHCE3D6RALU/graph.json","events_json":"https://pith.science/api/pith-number/GUHKRHSAN2QUQENYHCE3D6RALU/events.json","paper":"https://pith.science/paper/GUHKRHSA"},"agent_actions":{"view_html":"https://pith.science/pith/GUHKRHSAN2QUQENYHCE3D6RALU","download_json":"https://pith.science/pith/GUHKRHSAN2QUQENYHCE3D6RALU.json","view_paper":"https://pith.science/paper/GUHKRHSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.02547&json=true","fetch_graph":"https://pith.science/api/pith-number/GUHKRHSAN2QUQENYHCE3D6RALU/graph.json","fetch_events":"https://pith.science/api/pith-number/GUHKRHSAN2QUQENYHCE3D6RALU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GUHKRHSAN2QUQENYHCE3D6RALU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GUHKRHSAN2QUQENYHCE3D6RALU/action/storage_attestation","attest_author":"https://pith.science/pith/GUHKRHSAN2QUQENYHCE3D6RALU/action/author_attestation","sign_citation":"https://pith.science/pith/GUHKRHSAN2QUQENYHCE3D6RALU/action/citation_signature","submit_replication":"https://pith.science/pith/GUHKRHSAN2QUQENYHCE3D6RALU/action/replication_record"}},"created_at":"2026-07-05T06:46:43.489487+00:00","updated_at":"2026-07-05T06:46:43.489487+00:00"}