{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UDMOXNLITNMTCL4DKUXQ5YCKQR","short_pith_number":"pith:UDMOXNLI","schema_version":"1.0","canonical_sha256":"a0d8ebb5689b59312f83552f0ee04a845666199a43287ad4dffae32f6a30d0ad","source":{"kind":"arxiv","id":"2412.12158","version":1},"attestation_state":"computed","paper":{"title":"Hyperbolic Hypergraph Neural Networks for Multi-Relational Knowledge Hypergraph Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chenqi Qiao, Hai Jin, Mengfan Li, Teng Zhang, Xuanhua Shi","submitted_at":"2024-12-11T12:03:33Z","abstract_excerpt":"Knowledge hypergraphs generalize knowledge graphs using hyperedges to connect multiple entities and depict complicated relations. Existing methods either transform hyperedges into an easier-to-handle set of binary relations or view hyperedges as isolated and ignore their adjacencies. Both approaches have information loss and may potentially lead to the creation of sub-optimal models. To fix these issues, we propose the Hyperbolic Hypergraph Neural Network (H2GNN), whose essential component is the hyper-star message passing, a novel scheme motivated by a lossless expansion of hyperedges into hi"},"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":"2412.12158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-11T12:03:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8bbf612786713786118d8689dc71481eb84cb59a4255bfdd6eab768049a2c2ac","abstract_canon_sha256":"048552d982ac65612eb2cffe0c5db528f7f41a6567716003ed3f588c3e28e580"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:10.741559Z","signature_b64":"AwPDFqF9QdgStRMmD4oAEIPANNcUsGivarYOCflixqBWOG0Bhd3MelOo1bPjjpeYOpjBmGnPw35hkR/hs9OBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0d8ebb5689b59312f83552f0ee04a845666199a43287ad4dffae32f6a30d0ad","last_reissued_at":"2026-07-05T09:50:10.741016Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:10.741016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyperbolic Hypergraph Neural Networks for Multi-Relational Knowledge Hypergraph Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chenqi Qiao, Hai Jin, Mengfan Li, Teng Zhang, Xuanhua Shi","submitted_at":"2024-12-11T12:03:33Z","abstract_excerpt":"Knowledge hypergraphs generalize knowledge graphs using hyperedges to connect multiple entities and depict complicated relations. Existing methods either transform hyperedges into an easier-to-handle set of binary relations or view hyperedges as isolated and ignore their adjacencies. Both approaches have information loss and may potentially lead to the creation of sub-optimal models. To fix these issues, we propose the Hyperbolic Hypergraph Neural Network (H2GNN), whose essential component is the hyper-star message passing, a novel scheme motivated by a lossless expansion of hyperedges into hi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12158","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/2412.12158/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":"2412.12158","created_at":"2026-07-05T09:50:10.741079+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.12158v1","created_at":"2026-07-05T09:50:10.741079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12158","created_at":"2026-07-05T09:50:10.741079+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDMOXNLITNMT","created_at":"2026-07-05T09:50:10.741079+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDMOXNLITNMTCL4D","created_at":"2026-07-05T09:50:10.741079+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDMOXNLI","created_at":"2026-07-05T09:50:10.741079+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12509","citing_title":"Representing Higher-Order Networks: A Survey of Graph-Based Frameworks","ref_index":222,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UDMOXNLITNMTCL4DKUXQ5YCKQR","json":"https://pith.science/pith/UDMOXNLITNMTCL4DKUXQ5YCKQR.json","graph_json":"https://pith.science/api/pith-number/UDMOXNLITNMTCL4DKUXQ5YCKQR/graph.json","events_json":"https://pith.science/api/pith-number/UDMOXNLITNMTCL4DKUXQ5YCKQR/events.json","paper":"https://pith.science/paper/UDMOXNLI"},"agent_actions":{"view_html":"https://pith.science/pith/UDMOXNLITNMTCL4DKUXQ5YCKQR","download_json":"https://pith.science/pith/UDMOXNLITNMTCL4DKUXQ5YCKQR.json","view_paper":"https://pith.science/paper/UDMOXNLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.12158&json=true","fetch_graph":"https://pith.science/api/pith-number/UDMOXNLITNMTCL4DKUXQ5YCKQR/graph.json","fetch_events":"https://pith.science/api/pith-number/UDMOXNLITNMTCL4DKUXQ5YCKQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDMOXNLITNMTCL4DKUXQ5YCKQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDMOXNLITNMTCL4DKUXQ5YCKQR/action/storage_attestation","attest_author":"https://pith.science/pith/UDMOXNLITNMTCL4DKUXQ5YCKQR/action/author_attestation","sign_citation":"https://pith.science/pith/UDMOXNLITNMTCL4DKUXQ5YCKQR/action/citation_signature","submit_replication":"https://pith.science/pith/UDMOXNLITNMTCL4DKUXQ5YCKQR/action/replication_record"}},"created_at":"2026-07-05T09:50:10.741079+00:00","updated_at":"2026-07-05T09:50:10.741079+00:00"}