{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PSXCHP27HCTGKKZJYSXU54IEHG","short_pith_number":"pith:PSXCHP27","schema_version":"1.0","canonical_sha256":"7cae23bf5f38a6652b29c4af4ef10439b5f6c456a9143791a71b0e3d0b7d976a","source":{"kind":"arxiv","id":"2411.06191","version":1},"attestation_state":"computed","paper":{"title":"Generalizing Hyperedge Expansion for Hyper-relational Knowledge Graph Modeling","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Jingtao Ding, Quanming Yao, Shu Yang, Yong Li, Yu Liu","submitted_at":"2024-11-09T14:16:41Z","abstract_excerpt":"By representing knowledge in a primary triple associated with additional attribute-value qualifiers, hyper-relational knowledge graph (HKG) that generalizes triple-based knowledge graph (KG) has been attracting research attention recently. Compared with KG, HKG is enriched with the semantic qualifiers as well as the hyper-relational graph structure. However, to model HKG, existing studies mainly focus on either semantic information or structural information therein, which however fail to capture both simultaneously. To tackle this issue, in this paper, we generalize the hyperedge expansion in "},"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":"2411.06191","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-11-09T14:16:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6d642af677deb179c68cf47c45ea49b4ed39bd9ddb8fe05a512fc90e06ec0f30","abstract_canon_sha256":"25d70e778264dba36dcde2ed1833e37e3280f2a2cd74c67a7fae6c666e681d93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:42.698135Z","signature_b64":"94wI2/ShUFmNtFKfqc+t2WiRdC8OMWT3IOIEUXUHwT0Rp+yA9ZWydsJfh95h4kLgqIVOSTXZ8OalUzNkhVRcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cae23bf5f38a6652b29c4af4ef10439b5f6c456a9143791a71b0e3d0b7d976a","last_reissued_at":"2026-07-05T09:33:42.697700Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:42.697700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalizing Hyperedge Expansion for Hyper-relational Knowledge Graph Modeling","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Jingtao Ding, Quanming Yao, Shu Yang, Yong Li, Yu Liu","submitted_at":"2024-11-09T14:16:41Z","abstract_excerpt":"By representing knowledge in a primary triple associated with additional attribute-value qualifiers, hyper-relational knowledge graph (HKG) that generalizes triple-based knowledge graph (KG) has been attracting research attention recently. Compared with KG, HKG is enriched with the semantic qualifiers as well as the hyper-relational graph structure. However, to model HKG, existing studies mainly focus on either semantic information or structural information therein, which however fail to capture both simultaneously. To tackle this issue, in this paper, we generalize the hyperedge expansion in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.06191","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/2411.06191/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":"2411.06191","created_at":"2026-07-05T09:33:42.697762+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.06191v1","created_at":"2026-07-05T09:33:42.697762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.06191","created_at":"2026-07-05T09:33:42.697762+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSXCHP27HCTG","created_at":"2026-07-05T09:33:42.697762+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSXCHP27HCTGKKZJ","created_at":"2026-07-05T09:33:42.697762+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSXCHP27","created_at":"2026-07-05T09:33:42.697762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05626","citing_title":"Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods","ref_index":214,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PSXCHP27HCTGKKZJYSXU54IEHG","json":"https://pith.science/pith/PSXCHP27HCTGKKZJYSXU54IEHG.json","graph_json":"https://pith.science/api/pith-number/PSXCHP27HCTGKKZJYSXU54IEHG/graph.json","events_json":"https://pith.science/api/pith-number/PSXCHP27HCTGKKZJYSXU54IEHG/events.json","paper":"https://pith.science/paper/PSXCHP27"},"agent_actions":{"view_html":"https://pith.science/pith/PSXCHP27HCTGKKZJYSXU54IEHG","download_json":"https://pith.science/pith/PSXCHP27HCTGKKZJYSXU54IEHG.json","view_paper":"https://pith.science/paper/PSXCHP27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.06191&json=true","fetch_graph":"https://pith.science/api/pith-number/PSXCHP27HCTGKKZJYSXU54IEHG/graph.json","fetch_events":"https://pith.science/api/pith-number/PSXCHP27HCTGKKZJYSXU54IEHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSXCHP27HCTGKKZJYSXU54IEHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSXCHP27HCTGKKZJYSXU54IEHG/action/storage_attestation","attest_author":"https://pith.science/pith/PSXCHP27HCTGKKZJYSXU54IEHG/action/author_attestation","sign_citation":"https://pith.science/pith/PSXCHP27HCTGKKZJYSXU54IEHG/action/citation_signature","submit_replication":"https://pith.science/pith/PSXCHP27HCTGKKZJYSXU54IEHG/action/replication_record"}},"created_at":"2026-07-05T09:33:42.697762+00:00","updated_at":"2026-07-05T09:33:42.697762+00:00"}