{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2SXZH45VLITOAL2BAY4XADUDWC","short_pith_number":"pith:2SXZH45V","schema_version":"1.0","canonical_sha256":"d4af93f3b55a26e02f410639700e83b0bf4529e29c76406beae8ecad2f62d98d","source":{"kind":"arxiv","id":"2212.14077","version":1},"attestation_state":"computed","paper":{"title":"A Hypergraph Neural Network Framework for Learning Hyperedge-Dependent Node Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.SI"],"primary_cat":"cs.LG","authors_text":"Chang Xiao, Eunyee Koh, Gromit Chan, Jane Hoffswell, Nedim Lipka, Nesreen Ahmed, Ryan Aponte, Ryan A. Rossi, Shunan Guo","submitted_at":"2022-12-28T19:45:38Z","abstract_excerpt":"In this work, we introduce a hypergraph representation learning framework called Hypergraph Neural Networks (HNN) that jointly learns hyperedge embeddings along with a set of hyperedge-dependent embeddings for each node in the hypergraph. HNN derives multiple embeddings per node in the hypergraph where each embedding for a node is dependent on a specific hyperedge of that node. Notably, HNN is accurate, data-efficient, flexible with many interchangeable components, and useful for a wide range of hypergraph learning tasks. We evaluate the effectiveness of the HNN framework for hyperedge predict"},"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":"2212.14077","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-12-28T19:45:38Z","cross_cats_sorted":["cs.DM","cs.SI"],"title_canon_sha256":"0d24388bb99876b5aa891154496f9d970d4703bd083ac53f3d26bc5a49f91b79","abstract_canon_sha256":"9362cc0a51a367c4cf84fcb516eb45ddfb0aaecd0db34619755ff470c9cae6a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:29:05.922306Z","signature_b64":"SeW5+b7kT1aQUECq/p2G9diuaKlguGSralDeebZTXjtD3xcWnwbHjxI6EazeyZe3hxSMtqiTyI4nfCTFMDzxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4af93f3b55a26e02f410639700e83b0bf4529e29c76406beae8ecad2f62d98d","last_reissued_at":"2026-07-05T05:29:05.921954Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:29:05.921954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hypergraph Neural Network Framework for Learning Hyperedge-Dependent Node Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.SI"],"primary_cat":"cs.LG","authors_text":"Chang Xiao, Eunyee Koh, Gromit Chan, Jane Hoffswell, Nedim Lipka, Nesreen Ahmed, Ryan Aponte, Ryan A. Rossi, Shunan Guo","submitted_at":"2022-12-28T19:45:38Z","abstract_excerpt":"In this work, we introduce a hypergraph representation learning framework called Hypergraph Neural Networks (HNN) that jointly learns hyperedge embeddings along with a set of hyperedge-dependent embeddings for each node in the hypergraph. HNN derives multiple embeddings per node in the hypergraph where each embedding for a node is dependent on a specific hyperedge of that node. Notably, HNN is accurate, data-efficient, flexible with many interchangeable components, and useful for a wide range of hypergraph learning tasks. We evaluate the effectiveness of the HNN framework for hyperedge predict"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.14077","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/2212.14077/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":"2212.14077","created_at":"2026-07-05T05:29:05.922011+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.14077v1","created_at":"2026-07-05T05:29:05.922011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.14077","created_at":"2026-07-05T05:29:05.922011+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SXZH45VLITO","created_at":"2026-07-05T05:29:05.922011+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SXZH45VLITOAL2B","created_at":"2026-07-05T05:29:05.922011+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SXZH45V","created_at":"2026-07-05T05:29:05.922011+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07330","citing_title":"Hypergraph Neural Stochastic Diffusion: An SDE Framework for Uncertainty Estimation","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2SXZH45VLITOAL2BAY4XADUDWC","json":"https://pith.science/pith/2SXZH45VLITOAL2BAY4XADUDWC.json","graph_json":"https://pith.science/api/pith-number/2SXZH45VLITOAL2BAY4XADUDWC/graph.json","events_json":"https://pith.science/api/pith-number/2SXZH45VLITOAL2BAY4XADUDWC/events.json","paper":"https://pith.science/paper/2SXZH45V"},"agent_actions":{"view_html":"https://pith.science/pith/2SXZH45VLITOAL2BAY4XADUDWC","download_json":"https://pith.science/pith/2SXZH45VLITOAL2BAY4XADUDWC.json","view_paper":"https://pith.science/paper/2SXZH45V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.14077&json=true","fetch_graph":"https://pith.science/api/pith-number/2SXZH45VLITOAL2BAY4XADUDWC/graph.json","fetch_events":"https://pith.science/api/pith-number/2SXZH45VLITOAL2BAY4XADUDWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SXZH45VLITOAL2BAY4XADUDWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SXZH45VLITOAL2BAY4XADUDWC/action/storage_attestation","attest_author":"https://pith.science/pith/2SXZH45VLITOAL2BAY4XADUDWC/action/author_attestation","sign_citation":"https://pith.science/pith/2SXZH45VLITOAL2BAY4XADUDWC/action/citation_signature","submit_replication":"https://pith.science/pith/2SXZH45VLITOAL2BAY4XADUDWC/action/replication_record"}},"created_at":"2026-07-05T05:29:05.922011+00:00","updated_at":"2026-07-05T05:29:05.922011+00:00"}