{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DXX45JKAZB46QEOKJJ3B22GDKG","short_pith_number":"pith:DXX45JKA","schema_version":"1.0","canonical_sha256":"1defcea540c879e811ca4a761d68c3519939f185772c58fae02d8447eb019883","source":{"kind":"arxiv","id":"2106.08166","version":3},"attestation_state":"computed","paper":{"title":"Query Embedding on Hyper-relational Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.IR","cs.LG"],"primary_cat":"cs.AI","authors_text":"Dimitrios Alivanistos, Max Berrendorf, Michael Cochez, Mikhail Galkin","submitted_at":"2021-06-15T14:08:50Z","abstract_excerpt":"Multi-hop logical reasoning is an established problem in the field of representation learning on knowledge graphs (KGs). It subsumes both one-hop link prediction as well as other more complex types of logical queries. Existing algorithms operate only on classical, triple-based graphs, whereas modern KGs often employ a hyper-relational modeling paradigm. In this paradigm, typed edges may have several key-value pairs known as qualifiers that provide fine-grained context for facts. In queries, this context modifies the meaning of relations, and usually reduces the answer set. Hyper-relational que"},"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":"2106.08166","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-06-15T14:08:50Z","cross_cats_sorted":["cs.DB","cs.IR","cs.LG"],"title_canon_sha256":"e5dc6c6c5dbf50fd4c65f904136e9ed5d50ec566eeab3cec17dc7b39665f06cf","abstract_canon_sha256":"8fd2ee86eb6a0202bf13e1b7c567d224acb598a060d2e777534b02bb8516a984"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:54:45.498049Z","signature_b64":"IIo8RMOnr3YJXa5WAs30LVsXF8k2sdSpRSr8GoiGh6iBy58qW5pn1EombkE6FWSKK/QE9uTtfqXrc/ywJ4w3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1defcea540c879e811ca4a761d68c3519939f185772c58fae02d8447eb019883","last_reissued_at":"2026-07-05T04:54:45.497589Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:54:45.497589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Query Embedding on Hyper-relational Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.IR","cs.LG"],"primary_cat":"cs.AI","authors_text":"Dimitrios Alivanistos, Max Berrendorf, Michael Cochez, Mikhail Galkin","submitted_at":"2021-06-15T14:08:50Z","abstract_excerpt":"Multi-hop logical reasoning is an established problem in the field of representation learning on knowledge graphs (KGs). It subsumes both one-hop link prediction as well as other more complex types of logical queries. Existing algorithms operate only on classical, triple-based graphs, whereas modern KGs often employ a hyper-relational modeling paradigm. In this paradigm, typed edges may have several key-value pairs known as qualifiers that provide fine-grained context for facts. In queries, this context modifies the meaning of relations, and usually reduces the answer set. Hyper-relational que"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.08166","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.08166/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":"2106.08166","created_at":"2026-07-05T04:54:45.497647+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.08166v3","created_at":"2026-07-05T04:54:45.497647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.08166","created_at":"2026-07-05T04:54:45.497647+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXX45JKAZB46","created_at":"2026-07-05T04:54:45.497647+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXX45JKAZB46QEOK","created_at":"2026-07-05T04:54:45.497647+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXX45JKA","created_at":"2026-07-05T04:54:45.497647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07422","citing_title":"InductWave: Inductive Multi-Hop Logical Query Answering on Knowledge Graphs","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03104","citing_title":"AlertStar: Path-Aware Alert Prediction on Hyper-Relational Knowledge Graphs","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DXX45JKAZB46QEOKJJ3B22GDKG","json":"https://pith.science/pith/DXX45JKAZB46QEOKJJ3B22GDKG.json","graph_json":"https://pith.science/api/pith-number/DXX45JKAZB46QEOKJJ3B22GDKG/graph.json","events_json":"https://pith.science/api/pith-number/DXX45JKAZB46QEOKJJ3B22GDKG/events.json","paper":"https://pith.science/paper/DXX45JKA"},"agent_actions":{"view_html":"https://pith.science/pith/DXX45JKAZB46QEOKJJ3B22GDKG","download_json":"https://pith.science/pith/DXX45JKAZB46QEOKJJ3B22GDKG.json","view_paper":"https://pith.science/paper/DXX45JKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.08166&json=true","fetch_graph":"https://pith.science/api/pith-number/DXX45JKAZB46QEOKJJ3B22GDKG/graph.json","fetch_events":"https://pith.science/api/pith-number/DXX45JKAZB46QEOKJJ3B22GDKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXX45JKAZB46QEOKJJ3B22GDKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXX45JKAZB46QEOKJJ3B22GDKG/action/storage_attestation","attest_author":"https://pith.science/pith/DXX45JKAZB46QEOKJJ3B22GDKG/action/author_attestation","sign_citation":"https://pith.science/pith/DXX45JKAZB46QEOKJJ3B22GDKG/action/citation_signature","submit_replication":"https://pith.science/pith/DXX45JKAZB46QEOKJJ3B22GDKG/action/replication_record"}},"created_at":"2026-07-05T04:54:45.497647+00:00","updated_at":"2026-07-05T04:54:45.497647+00:00"}