{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KOISFQTVMR6GLJXH3KNZPLNRWH","short_pith_number":"pith:KOISFQTV","schema_version":"1.0","canonical_sha256":"539122c275647c65a6e7da9b97adb1b1db8961767703a7a12ede628ce2e4378c","source":{"kind":"arxiv","id":"2506.23141","version":2},"attestation_state":"computed","paper":{"title":"Context-Driven Knowledge Graph Completion with Semantic-Aware Relational Message Passing","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jingyi Kang, Ruihao Zhou, Ruitong Liu, Siyuan Li, Te Sun, Yan Wen, Yunjia Wu","submitted_at":"2025-06-29T08:37:48Z","abstract_excerpt":"Semantic context surrounding a triplet $(h, r, t)$ is crucial for Knowledge Graph Completion (KGC), providing vital cues for prediction. However, traditional node-based message passing mechanisms, when applied to knowledge graphs, often introduce noise and suffer from information dilution or over-smoothing by indiscriminately aggregating information from all neighboring edges. To address this challenge, we propose a semantic-aware relational message passing. A core innovation of this framework is the introduction of a semantic-aware Top-K neighbor selection strategy. Specifically, this strateg"},"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":"2506.23141","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2025-06-29T08:37:48Z","cross_cats_sorted":[],"title_canon_sha256":"3fc4aaf568f860807b4d0c23ed855e0d2c622511cd8fd23f068d3eef198a4e5b","abstract_canon_sha256":"fce2ec90ecba5f983aa22e760a80703fdcfe9e121a1ed881cc06c1e4aac253ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:08:04.578396Z","signature_b64":"rQQ/u1OLnwYClleno2paA3Ftg0Lu1ZJ7iHTJc6d9TKDw15Fjj8yL7K/dvT1U0Z+PAUB3Hjd8fFGbjPo6TFMhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"539122c275647c65a6e7da9b97adb1b1db8961767703a7a12ede628ce2e4378c","last_reissued_at":"2026-07-05T12:08:04.577764Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:08:04.577764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Context-Driven Knowledge Graph Completion with Semantic-Aware Relational Message Passing","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jingyi Kang, Ruihao Zhou, Ruitong Liu, Siyuan Li, Te Sun, Yan Wen, Yunjia Wu","submitted_at":"2025-06-29T08:37:48Z","abstract_excerpt":"Semantic context surrounding a triplet $(h, r, t)$ is crucial for Knowledge Graph Completion (KGC), providing vital cues for prediction. However, traditional node-based message passing mechanisms, when applied to knowledge graphs, often introduce noise and suffer from information dilution or over-smoothing by indiscriminately aggregating information from all neighboring edges. To address this challenge, we propose a semantic-aware relational message passing. A core innovation of this framework is the introduction of a semantic-aware Top-K neighbor selection strategy. Specifically, this strateg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23141","kind":"arxiv","version":2},"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/2506.23141/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":"2506.23141","created_at":"2026-07-05T12:08:04.577846+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.23141v2","created_at":"2026-07-05T12:08:04.577846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23141","created_at":"2026-07-05T12:08:04.577846+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOISFQTVMR6G","created_at":"2026-07-05T12:08:04.577846+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOISFQTVMR6GLJXH","created_at":"2026-07-05T12:08:04.577846+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOISFQTV","created_at":"2026-07-05T12:08:04.577846+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/KOISFQTVMR6GLJXH3KNZPLNRWH","json":"https://pith.science/pith/KOISFQTVMR6GLJXH3KNZPLNRWH.json","graph_json":"https://pith.science/api/pith-number/KOISFQTVMR6GLJXH3KNZPLNRWH/graph.json","events_json":"https://pith.science/api/pith-number/KOISFQTVMR6GLJXH3KNZPLNRWH/events.json","paper":"https://pith.science/paper/KOISFQTV"},"agent_actions":{"view_html":"https://pith.science/pith/KOISFQTVMR6GLJXH3KNZPLNRWH","download_json":"https://pith.science/pith/KOISFQTVMR6GLJXH3KNZPLNRWH.json","view_paper":"https://pith.science/paper/KOISFQTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.23141&json=true","fetch_graph":"https://pith.science/api/pith-number/KOISFQTVMR6GLJXH3KNZPLNRWH/graph.json","fetch_events":"https://pith.science/api/pith-number/KOISFQTVMR6GLJXH3KNZPLNRWH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOISFQTVMR6GLJXH3KNZPLNRWH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOISFQTVMR6GLJXH3KNZPLNRWH/action/storage_attestation","attest_author":"https://pith.science/pith/KOISFQTVMR6GLJXH3KNZPLNRWH/action/author_attestation","sign_citation":"https://pith.science/pith/KOISFQTVMR6GLJXH3KNZPLNRWH/action/citation_signature","submit_replication":"https://pith.science/pith/KOISFQTVMR6GLJXH3KNZPLNRWH/action/replication_record"}},"created_at":"2026-07-05T12:08:04.577846+00:00","updated_at":"2026-07-05T12:08:04.577846+00:00"}