{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VXDVSIXZ4HDBG4AY4OWGYEILO2","short_pith_number":"pith:VXDVSIXZ","schema_version":"1.0","canonical_sha256":"adc75922f9e1c6137018e3ac6c110b76b38c5364540a4c4cf773fbc3b9a96c01","source":{"kind":"arxiv","id":"2606.29860","version":1},"attestation_state":"computed","paper":{"title":"Beyond Triplet Plausibility: Relation Set Completion in Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Borui Cai, Keshav Sood, Yao Zhao, Yong Xiang, Zihao Zheng","submitted_at":"2026-06-29T06:54:40Z","abstract_excerpt":"Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications. Due to their inherent incompleteness, knowledge graph completion (KGC) is widely studied and is typically formulated as triplet prediction, with link prediction as the dominant paradigm. However, this formulation focuses on the incompleteness of triplet-wise information and overlooks the incompleteness of entity-relation compatibility information. To address this limitation, we introduce a relation set completion task (RSC), which complements the link prediction task and aims to reason a"},"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":"2606.29860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-29T06:54:40Z","cross_cats_sorted":[],"title_canon_sha256":"eb0ffe8ddcdb0661bb46da1b06c0c750b2861fe3146b6eef06054a314d09b4bb","abstract_canon_sha256":"113507f20a71b0a7114d6c78e53e94b89b33a60af3b992e187863c6a1c015fc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:38.644836Z","signature_b64":"BPceF/kPR6ucMh58Deq3XF6Shq7bwMSxrDOqb7Z2cW8DcbqNGInDtF2wxDttvkaaYurmVNKZNr7KWW4jo4/RBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adc75922f9e1c6137018e3ac6c110b76b38c5364540a4c4cf773fbc3b9a96c01","last_reissued_at":"2026-06-30T02:17:38.644085Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:38.644085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Triplet Plausibility: Relation Set Completion in Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Borui Cai, Keshav Sood, Yao Zhao, Yong Xiang, Zihao Zheng","submitted_at":"2026-06-29T06:54:40Z","abstract_excerpt":"Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications. Due to their inherent incompleteness, knowledge graph completion (KGC) is widely studied and is typically formulated as triplet prediction, with link prediction as the dominant paradigm. However, this formulation focuses on the incompleteness of triplet-wise information and overlooks the incompleteness of entity-relation compatibility information. To address this limitation, we introduce a relation set completion task (RSC), which complements the link prediction task and aims to reason a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29860","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/2606.29860/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":"2606.29860","created_at":"2026-06-30T02:17:38.644194+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.29860v1","created_at":"2026-06-30T02:17:38.644194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29860","created_at":"2026-06-30T02:17:38.644194+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXDVSIXZ4HDB","created_at":"2026-06-30T02:17:38.644194+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXDVSIXZ4HDBG4AY","created_at":"2026-06-30T02:17:38.644194+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXDVSIXZ","created_at":"2026-06-30T02:17:38.644194+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VXDVSIXZ4HDBG4AY4OWGYEILO2","json":"https://pith.science/pith/VXDVSIXZ4HDBG4AY4OWGYEILO2.json","graph_json":"https://pith.science/api/pith-number/VXDVSIXZ4HDBG4AY4OWGYEILO2/graph.json","events_json":"https://pith.science/api/pith-number/VXDVSIXZ4HDBG4AY4OWGYEILO2/events.json","paper":"https://pith.science/paper/VXDVSIXZ"},"agent_actions":{"view_html":"https://pith.science/pith/VXDVSIXZ4HDBG4AY4OWGYEILO2","download_json":"https://pith.science/pith/VXDVSIXZ4HDBG4AY4OWGYEILO2.json","view_paper":"https://pith.science/paper/VXDVSIXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.29860&json=true","fetch_graph":"https://pith.science/api/pith-number/VXDVSIXZ4HDBG4AY4OWGYEILO2/graph.json","fetch_events":"https://pith.science/api/pith-number/VXDVSIXZ4HDBG4AY4OWGYEILO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXDVSIXZ4HDBG4AY4OWGYEILO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXDVSIXZ4HDBG4AY4OWGYEILO2/action/storage_attestation","attest_author":"https://pith.science/pith/VXDVSIXZ4HDBG4AY4OWGYEILO2/action/author_attestation","sign_citation":"https://pith.science/pith/VXDVSIXZ4HDBG4AY4OWGYEILO2/action/citation_signature","submit_replication":"https://pith.science/pith/VXDVSIXZ4HDBG4AY4OWGYEILO2/action/replication_record"}},"created_at":"2026-06-30T02:17:38.644194+00:00","updated_at":"2026-06-30T02:17:38.644194+00:00"}