{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EUVAR5LVG6GNY275IFOWG4FDDW","short_pith_number":"pith:EUVAR5LV","schema_version":"1.0","canonical_sha256":"252a08f575378cdc6bfd415d6370a31d888b7015fabd9a0d238d3601a46b29ea","source":{"kind":"arxiv","id":"2302.06132","version":3},"attestation_state":"computed","paper":{"title":"NNKGC: Improving Knowledge Graph Completion with Node Neighborhoods","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Boming Yang, Irene Li","submitted_at":"2023-02-13T06:38:25Z","abstract_excerpt":"Knowledge graph completion (KGC) aims to discover missing relations of query entities. Current text-based models utilize the entity name and description to infer the tail entity given the head entity and a certain relation. Existing approaches also consider the neighborhood of the head entity. However, these methods tend to model the neighborhood using a flat structure and are only restricted to 1-hop neighbors. In this work, we propose a node neighborhood-enhanced framework for knowledge graph completion. It models the head entity neighborhood from multiple hops using graph neural networks to"},"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":"2302.06132","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CL","submitted_at":"2023-02-13T06:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"11dfa42656f68b639bc939a584a41853fedc5dc72aaadb74cfd4f98a0609f923","abstract_canon_sha256":"202a23ebcc8bfa0e33c2110db681dbf79708f16a2d0b2553aaa69dd63fb97469"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:02:27.225894Z","signature_b64":"7vtH2FkNH4f84JnBHdzLPUfkwwnUK2uJshxPmKVzTwfZ9v5KzHkFr6xt5EImGXlJJxPMoGDf2NkXTpz3RHzBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"252a08f575378cdc6bfd415d6370a31d888b7015fabd9a0d238d3601a46b29ea","last_reissued_at":"2026-07-05T07:02:27.225428Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:02:27.225428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NNKGC: Improving Knowledge Graph Completion with Node Neighborhoods","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Boming Yang, Irene Li","submitted_at":"2023-02-13T06:38:25Z","abstract_excerpt":"Knowledge graph completion (KGC) aims to discover missing relations of query entities. Current text-based models utilize the entity name and description to infer the tail entity given the head entity and a certain relation. Existing approaches also consider the neighborhood of the head entity. However, these methods tend to model the neighborhood using a flat structure and are only restricted to 1-hop neighbors. In this work, we propose a node neighborhood-enhanced framework for knowledge graph completion. It models the head entity neighborhood from multiple hops using graph neural networks to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06132","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/2302.06132/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":"2302.06132","created_at":"2026-07-05T07:02:27.225484+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.06132v3","created_at":"2026-07-05T07:02:27.225484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06132","created_at":"2026-07-05T07:02:27.225484+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUVAR5LVG6GN","created_at":"2026-07-05T07:02:27.225484+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUVAR5LVG6GNY275","created_at":"2026-07-05T07:02:27.225484+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUVAR5LV","created_at":"2026-07-05T07:02:27.225484+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.11016","citing_title":"A Contextualized BERT model for Knowledge Graph Completion","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EUVAR5LVG6GNY275IFOWG4FDDW","json":"https://pith.science/pith/EUVAR5LVG6GNY275IFOWG4FDDW.json","graph_json":"https://pith.science/api/pith-number/EUVAR5LVG6GNY275IFOWG4FDDW/graph.json","events_json":"https://pith.science/api/pith-number/EUVAR5LVG6GNY275IFOWG4FDDW/events.json","paper":"https://pith.science/paper/EUVAR5LV"},"agent_actions":{"view_html":"https://pith.science/pith/EUVAR5LVG6GNY275IFOWG4FDDW","download_json":"https://pith.science/pith/EUVAR5LVG6GNY275IFOWG4FDDW.json","view_paper":"https://pith.science/paper/EUVAR5LV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.06132&json=true","fetch_graph":"https://pith.science/api/pith-number/EUVAR5LVG6GNY275IFOWG4FDDW/graph.json","fetch_events":"https://pith.science/api/pith-number/EUVAR5LVG6GNY275IFOWG4FDDW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUVAR5LVG6GNY275IFOWG4FDDW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUVAR5LVG6GNY275IFOWG4FDDW/action/storage_attestation","attest_author":"https://pith.science/pith/EUVAR5LVG6GNY275IFOWG4FDDW/action/author_attestation","sign_citation":"https://pith.science/pith/EUVAR5LVG6GNY275IFOWG4FDDW/action/citation_signature","submit_replication":"https://pith.science/pith/EUVAR5LVG6GNY275IFOWG4FDDW/action/replication_record"}},"created_at":"2026-07-05T07:02:27.225484+00:00","updated_at":"2026-07-05T07:02:27.225484+00:00"}