{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7IV3BRFNA4VH3CVQ5GRDMFV5SF","short_pith_number":"pith:7IV3BRFN","schema_version":"1.0","canonical_sha256":"fa2bb0c4ad072a7d8ab0e9a23616bd9161ef011424729756afdb1274cb16abb5","source":{"kind":"arxiv","id":"2206.11081","version":4},"attestation_state":"computed","paper":{"title":"Descent Steps of a Relation-Aware Energy Produce Heterogeneous Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"David Wipf, Hongjoon Ahn, Quan Gan, Taesup Moon, Yongyi Yang","submitted_at":"2022-06-22T13:48:08Z","abstract_excerpt":"Heterogeneous graph neural networks (GNNs) achieve strong performance on node classification tasks in a semi-supervised learning setting. However, as in the simpler homogeneous GNN case, message-passing-based heterogeneous GNNs may struggle to balance between resisting the oversmoothing that may occur in deep models, and capturing long-range dependencies of graph structured data. Moreover, the complexity of this trade-off is compounded in the heterogeneous graph case due to the disparate heterophily relationships between nodes of different types. To address these issues, we propose a novel het"},"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":"2206.11081","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-22T13:48:08Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ea2d6bba198e8aaf2b57129ea82f01bae8eb2644eb7df3aad062476ce8e742b8","abstract_canon_sha256":"93d43dfd1ecf9268e1b08958a32485adda105b31acca0c31149a34079cf7746f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:08:52.446149Z","signature_b64":"tz7vcU8rSg+gRw8cCDBexYL62+qcA8zz+lXfAihMjWY1tz+IaTkHhmdQbjwqe7zkmt6MKFyQMHE9jMxi6ehGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa2bb0c4ad072a7d8ab0e9a23616bd9161ef011424729756afdb1274cb16abb5","last_reissued_at":"2026-07-05T05:08:52.445707Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:08:52.445707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Descent Steps of a Relation-Aware Energy Produce Heterogeneous Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"David Wipf, Hongjoon Ahn, Quan Gan, Taesup Moon, Yongyi Yang","submitted_at":"2022-06-22T13:48:08Z","abstract_excerpt":"Heterogeneous graph neural networks (GNNs) achieve strong performance on node classification tasks in a semi-supervised learning setting. However, as in the simpler homogeneous GNN case, message-passing-based heterogeneous GNNs may struggle to balance between resisting the oversmoothing that may occur in deep models, and capturing long-range dependencies of graph structured data. Moreover, the complexity of this trade-off is compounded in the heterogeneous graph case due to the disparate heterophily relationships between nodes of different types. To address these issues, we propose a novel het"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.11081","kind":"arxiv","version":4},"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/2206.11081/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":"2206.11081","created_at":"2026-07-05T05:08:52.445770+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.11081v4","created_at":"2026-07-05T05:08:52.445770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.11081","created_at":"2026-07-05T05:08:52.445770+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IV3BRFNA4VH","created_at":"2026-07-05T05:08:52.445770+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IV3BRFNA4VH3CVQ","created_at":"2026-07-05T05:08:52.445770+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IV3BRFN","created_at":"2026-07-05T05:08:52.445770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13137","citing_title":"Domain Adaptive Unfolded Graph Neural Networks","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7IV3BRFNA4VH3CVQ5GRDMFV5SF","json":"https://pith.science/pith/7IV3BRFNA4VH3CVQ5GRDMFV5SF.json","graph_json":"https://pith.science/api/pith-number/7IV3BRFNA4VH3CVQ5GRDMFV5SF/graph.json","events_json":"https://pith.science/api/pith-number/7IV3BRFNA4VH3CVQ5GRDMFV5SF/events.json","paper":"https://pith.science/paper/7IV3BRFN"},"agent_actions":{"view_html":"https://pith.science/pith/7IV3BRFNA4VH3CVQ5GRDMFV5SF","download_json":"https://pith.science/pith/7IV3BRFNA4VH3CVQ5GRDMFV5SF.json","view_paper":"https://pith.science/paper/7IV3BRFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.11081&json=true","fetch_graph":"https://pith.science/api/pith-number/7IV3BRFNA4VH3CVQ5GRDMFV5SF/graph.json","fetch_events":"https://pith.science/api/pith-number/7IV3BRFNA4VH3CVQ5GRDMFV5SF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IV3BRFNA4VH3CVQ5GRDMFV5SF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IV3BRFNA4VH3CVQ5GRDMFV5SF/action/storage_attestation","attest_author":"https://pith.science/pith/7IV3BRFNA4VH3CVQ5GRDMFV5SF/action/author_attestation","sign_citation":"https://pith.science/pith/7IV3BRFNA4VH3CVQ5GRDMFV5SF/action/citation_signature","submit_replication":"https://pith.science/pith/7IV3BRFNA4VH3CVQ5GRDMFV5SF/action/replication_record"}},"created_at":"2026-07-05T05:08:52.445770+00:00","updated_at":"2026-07-05T05:08:52.445770+00:00"}