{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TTNKT6DGDDPLGJPB64NYYJ773F","short_pith_number":"pith:TTNKT6DG","schema_version":"1.0","canonical_sha256":"9cdaa9f86618deb325e1f71b8c27ffd95d101203e8052535b01a087444eef370","source":{"kind":"arxiv","id":"1809.09401","version":3},"attestation_state":"computed","paper":{"title":"Hypergraph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Haoxuan You, Rongrong Ji, Yifan Feng, Yue Gao, Zizhao Zhang","submitted_at":"2018-09-25T10:42:28Z","abstract_excerpt":"In this paper, we present a hypergraph neural networks (HGNN) framework for data representation learning, which can encode high-order data correlation in a hypergraph structure. Confronting the challenges of learning representation for complex data in real practice, we propose to incorporate such data structure in a hypergraph, which is more flexible on data modeling, especially when dealing with complex data. In this method, a hyperedge convolution operation is designed to handle the data correlation during representation learning. In this way, traditional hypergraph learning procedure can be"},"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":"1809.09401","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-25T10:42:28Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"99fe27d0fb7ff73eb86ece4c7e84236cca78a8b574cfb35b70c6d8daf24ae296","abstract_canon_sha256":"1cde6b2d8e0090228c7f5bd8cb01e8c817490e85424657a6898bf0df25df4ce7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:52.140018Z","signature_b64":"7xyDaDGfOG/B4YBkDvsutDnHsm7gpXh4z/rm9VsZDPUEjxTpIEfX2XVeR43GewpS+HemvwpioaZx9C0HAVp5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cdaa9f86618deb325e1f71b8c27ffd95d101203e8052535b01a087444eef370","last_reissued_at":"2026-05-17T23:52:52.139352Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:52.139352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Haoxuan You, Rongrong Ji, Yifan Feng, Yue Gao, Zizhao Zhang","submitted_at":"2018-09-25T10:42:28Z","abstract_excerpt":"In this paper, we present a hypergraph neural networks (HGNN) framework for data representation learning, which can encode high-order data correlation in a hypergraph structure. Confronting the challenges of learning representation for complex data in real practice, we propose to incorporate such data structure in a hypergraph, which is more flexible on data modeling, especially when dealing with complex data. In this method, a hyperedge convolution operation is designed to handle the data correlation during representation learning. In this way, traditional hypergraph learning procedure can be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09401","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":""},"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":"1809.09401","created_at":"2026-05-17T23:52:52.139466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09401v3","created_at":"2026-05-17T23:52:52.139466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09401","created_at":"2026-05-17T23:52:52.139466+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTNKT6DGDDPL","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTNKT6DGDDPLGJPB","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTNKT6DG","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.18382","citing_title":"Probing SMEFT Operators through $t\\bar{t}t\\bar{t}$ Production with Hyper-Graph Neural Networks at the LHC","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15524","citing_title":"Neural Point-Forms","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03063","citing_title":"From Information Geometry to Jet Substructure: A Triality of Cumulant Tensors, Energy Correlators, and Hypergraphs","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TTNKT6DGDDPLGJPB64NYYJ773F","json":"https://pith.science/pith/TTNKT6DGDDPLGJPB64NYYJ773F.json","graph_json":"https://pith.science/api/pith-number/TTNKT6DGDDPLGJPB64NYYJ773F/graph.json","events_json":"https://pith.science/api/pith-number/TTNKT6DGDDPLGJPB64NYYJ773F/events.json","paper":"https://pith.science/paper/TTNKT6DG"},"agent_actions":{"view_html":"https://pith.science/pith/TTNKT6DGDDPLGJPB64NYYJ773F","download_json":"https://pith.science/pith/TTNKT6DGDDPLGJPB64NYYJ773F.json","view_paper":"https://pith.science/paper/TTNKT6DG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09401&json=true","fetch_graph":"https://pith.science/api/pith-number/TTNKT6DGDDPLGJPB64NYYJ773F/graph.json","fetch_events":"https://pith.science/api/pith-number/TTNKT6DGDDPLGJPB64NYYJ773F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTNKT6DGDDPLGJPB64NYYJ773F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTNKT6DGDDPLGJPB64NYYJ773F/action/storage_attestation","attest_author":"https://pith.science/pith/TTNKT6DGDDPLGJPB64NYYJ773F/action/author_attestation","sign_citation":"https://pith.science/pith/TTNKT6DGDDPLGJPB64NYYJ773F/action/citation_signature","submit_replication":"https://pith.science/pith/TTNKT6DGDDPLGJPB64NYYJ773F/action/replication_record"}},"created_at":"2026-05-17T23:52:52.139466+00:00","updated_at":"2026-05-17T23:52:52.139466+00:00"}