{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5RFE5BS4PASLME6I375KQJEVZZ","short_pith_number":"pith:5RFE5BS4","schema_version":"1.0","canonical_sha256":"ec4a4e865c7824b613c8dffaa82495ce459b2a1567e4ff7582d622e78b0faf75","source":{"kind":"arxiv","id":"2503.03091","version":2},"attestation_state":"computed","paper":{"title":"MuCo-KGC: Multi-Context-Aware Knowledge Graph Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Abdul Ghani Haji Naim, Ajaz Ahmad Bhat, Haji Gul","submitted_at":"2025-03-05T01:18:11Z","abstract_excerpt":"Knowledge graph completion (KGC) seeks to predict missing entities (e.g., heads or tails) or relationships in knowledge graphs (KGs), which often contain incomplete data. Traditional embedding-based methods, such as TransE and ComplEx, have improved tail entity prediction but struggle to generalize to unseen entities during testing. Textual-based models mitigate this issue by leveraging additional semantic context; however, their reliance on negative triplet sampling introduces high computational overhead, semantic inconsistencies, and data imbalance. Recent approaches, like KG-BERT, show prom"},"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":"2503.03091","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-03-05T01:18:11Z","cross_cats_sorted":[],"title_canon_sha256":"349777b737fffdc7a06b48971ea0b04ae24ead816535ca869423b18ec4dba87b","abstract_canon_sha256":"1246922663068c56d347468087055f8ab33362df441c6d755f1dd4134191fd79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:27:27.370070Z","signature_b64":"ciLAB8mNB2bmaueHBi//j56Ed92nm3O5MXH/wvMGgNXH0mU/YhAjTPZZN456LHRipj9eeONY1Ui1jB9mRzQdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec4a4e865c7824b613c8dffaa82495ce459b2a1567e4ff7582d622e78b0faf75","last_reissued_at":"2026-07-05T10:27:27.369434Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:27:27.369434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MuCo-KGC: Multi-Context-Aware Knowledge Graph Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Abdul Ghani Haji Naim, Ajaz Ahmad Bhat, Haji Gul","submitted_at":"2025-03-05T01:18:11Z","abstract_excerpt":"Knowledge graph completion (KGC) seeks to predict missing entities (e.g., heads or tails) or relationships in knowledge graphs (KGs), which often contain incomplete data. Traditional embedding-based methods, such as TransE and ComplEx, have improved tail entity prediction but struggle to generalize to unseen entities during testing. Textual-based models mitigate this issue by leveraging additional semantic context; however, their reliance on negative triplet sampling introduces high computational overhead, semantic inconsistencies, and data imbalance. Recent approaches, like KG-BERT, show prom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.03091","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/2503.03091/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":"2503.03091","created_at":"2026-07-05T10:27:27.369507+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.03091v2","created_at":"2026-07-05T10:27:27.369507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.03091","created_at":"2026-07-05T10:27:27.369507+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RFE5BS4PASL","created_at":"2026-07-05T10:27:27.369507+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RFE5BS4PASLME6I","created_at":"2026-07-05T10:27:27.369507+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RFE5BS4","created_at":"2026-07-05T10:27:27.369507+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.02399","citing_title":"Evaluating Cumulative Spectral Gradient as a Complexity Measure","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5RFE5BS4PASLME6I375KQJEVZZ","json":"https://pith.science/pith/5RFE5BS4PASLME6I375KQJEVZZ.json","graph_json":"https://pith.science/api/pith-number/5RFE5BS4PASLME6I375KQJEVZZ/graph.json","events_json":"https://pith.science/api/pith-number/5RFE5BS4PASLME6I375KQJEVZZ/events.json","paper":"https://pith.science/paper/5RFE5BS4"},"agent_actions":{"view_html":"https://pith.science/pith/5RFE5BS4PASLME6I375KQJEVZZ","download_json":"https://pith.science/pith/5RFE5BS4PASLME6I375KQJEVZZ.json","view_paper":"https://pith.science/paper/5RFE5BS4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.03091&json=true","fetch_graph":"https://pith.science/api/pith-number/5RFE5BS4PASLME6I375KQJEVZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5RFE5BS4PASLME6I375KQJEVZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RFE5BS4PASLME6I375KQJEVZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RFE5BS4PASLME6I375KQJEVZZ/action/storage_attestation","attest_author":"https://pith.science/pith/5RFE5BS4PASLME6I375KQJEVZZ/action/author_attestation","sign_citation":"https://pith.science/pith/5RFE5BS4PASLME6I375KQJEVZZ/action/citation_signature","submit_replication":"https://pith.science/pith/5RFE5BS4PASLME6I375KQJEVZZ/action/replication_record"}},"created_at":"2026-07-05T10:27:27.369507+00:00","updated_at":"2026-07-05T10:27:27.369507+00:00"}