{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CLOIBZAYTVORZAWQ3NRXL3AIQ6","short_pith_number":"pith:CLOIBZAY","schema_version":"1.0","canonical_sha256":"12dc80e4189d5d1c82d0db6375ec088783103f632d34cad8e869f558c5aefbb5","source":{"kind":"arxiv","id":"2306.02199","version":1},"attestation_state":"computed","paper":{"title":"Shrinking Embeddings for Hyper-Relational Knowledge Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bo Xiong, Mojtaba Nayyer, Shirui Pan, Steffen Staab","submitted_at":"2023-06-03T21:14:59Z","abstract_excerpt":"Link prediction on knowledge graphs (KGs) has been extensively studied on binary relational KGs, wherein each fact is represented by a triple. A significant amount of important knowledge, however, is represented by hyper-relational facts where each fact is composed of a primal triple and a set of qualifiers comprising a key-value pair that allows for expressing more complicated semantics. Although some recent works have proposed to embed hyper-relational KGs, these methods fail to capture essential inference patterns of hyper-relational facts such as qualifier monotonicity, qualifier implicati"},"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":"2306.02199","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-06-03T21:14:59Z","cross_cats_sorted":[],"title_canon_sha256":"b1ed242a5d59b7acf0675786e6511dc4dba5ae2b8e730f0134955ab819d23896","abstract_canon_sha256":"1ab4b3a4015615b0e6bd51461f1d68140ec77296e69b52f87267ad69ed92cc89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:17:14.193235Z","signature_b64":"XImEy/qzlR9M77sjRhQT4X4sqTZnYjgGytD5b+Rgrb6vfi3X2E+pn0nYlPO/D4gN8t3W+5Vz71B8SydttQXpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12dc80e4189d5d1c82d0db6375ec088783103f632d34cad8e869f558c5aefbb5","last_reissued_at":"2026-07-05T06:17:14.192798Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:17:14.192798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shrinking Embeddings for Hyper-Relational Knowledge Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bo Xiong, Mojtaba Nayyer, Shirui Pan, Steffen Staab","submitted_at":"2023-06-03T21:14:59Z","abstract_excerpt":"Link prediction on knowledge graphs (KGs) has been extensively studied on binary relational KGs, wherein each fact is represented by a triple. A significant amount of important knowledge, however, is represented by hyper-relational facts where each fact is composed of a primal triple and a set of qualifiers comprising a key-value pair that allows for expressing more complicated semantics. Although some recent works have proposed to embed hyper-relational KGs, these methods fail to capture essential inference patterns of hyper-relational facts such as qualifier monotonicity, qualifier implicati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.02199","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/2306.02199/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":"2306.02199","created_at":"2026-07-05T06:17:14.192855+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.02199v1","created_at":"2026-07-05T06:17:14.192855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.02199","created_at":"2026-07-05T06:17:14.192855+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLOIBZAYTVOR","created_at":"2026-07-05T06:17:14.192855+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLOIBZAYTVORZAWQ","created_at":"2026-07-05T06:17:14.192855+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLOIBZAY","created_at":"2026-07-05T06:17:14.192855+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08970","citing_title":"A Survey of Link Prediction in N-ary Knowledge Graphs","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CLOIBZAYTVORZAWQ3NRXL3AIQ6","json":"https://pith.science/pith/CLOIBZAYTVORZAWQ3NRXL3AIQ6.json","graph_json":"https://pith.science/api/pith-number/CLOIBZAYTVORZAWQ3NRXL3AIQ6/graph.json","events_json":"https://pith.science/api/pith-number/CLOIBZAYTVORZAWQ3NRXL3AIQ6/events.json","paper":"https://pith.science/paper/CLOIBZAY"},"agent_actions":{"view_html":"https://pith.science/pith/CLOIBZAYTVORZAWQ3NRXL3AIQ6","download_json":"https://pith.science/pith/CLOIBZAYTVORZAWQ3NRXL3AIQ6.json","view_paper":"https://pith.science/paper/CLOIBZAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.02199&json=true","fetch_graph":"https://pith.science/api/pith-number/CLOIBZAYTVORZAWQ3NRXL3AIQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/CLOIBZAYTVORZAWQ3NRXL3AIQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLOIBZAYTVORZAWQ3NRXL3AIQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLOIBZAYTVORZAWQ3NRXL3AIQ6/action/storage_attestation","attest_author":"https://pith.science/pith/CLOIBZAYTVORZAWQ3NRXL3AIQ6/action/author_attestation","sign_citation":"https://pith.science/pith/CLOIBZAYTVORZAWQ3NRXL3AIQ6/action/citation_signature","submit_replication":"https://pith.science/pith/CLOIBZAYTVORZAWQ3NRXL3AIQ6/action/replication_record"}},"created_at":"2026-07-05T06:17:14.192855+00:00","updated_at":"2026-07-05T06:17:14.192855+00:00"}