{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4VCDQGIALXB76M2UUQ6RYLHGAB","short_pith_number":"pith:4VCDQGIA","schema_version":"1.0","canonical_sha256":"e5443819005dc3ff3354a43d1c2ce600605d00f8338d5b1e61c0dec7e4f4ef12","source":{"kind":"arxiv","id":"2305.14126","version":1},"attestation_state":"computed","paper":{"title":"To Copy Rather Than Memorize: A Vertical Learning Paradigm for Knowledge Graph Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chaozhuo Li, Hao Sun, Jianan Zhao, Qi Zhang, Rui Li, Weihao Han, Weiwei Deng, Xing Xie, Xu Chen, Yanming Shen, Yujing Wang","submitted_at":"2023-05-23T14:53:20Z","abstract_excerpt":"Embedding models have shown great power in knowledge graph completion (KGC) task. By learning structural constraints for each training triple, these methods implicitly memorize intrinsic relation rules to infer missing links. However, this paper points out that the multi-hop relation rules are hard to be reliably memorized due to the inherent deficiencies of such implicit memorization strategy, making embedding models underperform in predicting links between distant entity pairs. To alleviate this problem, we present Vertical Learning Paradigm (VLP), which extends embedding models by allowing "},"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":"2305.14126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-05-23T14:53:20Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3c9b061837f5d165443f201f3f0a50c96f7ce0a48fc561528a1ba50967779e97","abstract_canon_sha256":"32164aea4bc7d267526dd97a0aa5abe0e78cff777d087ff3e97944c6b3032dfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:13:01.315522Z","signature_b64":"q83KL5HAe2AHe5V/saJOf/8sNKtu+cAq0NV1eaH1ZXoz/xlr7bu8Ha23JYLdr1MAnlorya5fROkpmLMNf4gDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5443819005dc3ff3354a43d1c2ce600605d00f8338d5b1e61c0dec7e4f4ef12","last_reissued_at":"2026-07-05T06:13:01.314975Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:13:01.314975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"To Copy Rather Than Memorize: A Vertical Learning Paradigm for Knowledge Graph Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chaozhuo Li, Hao Sun, Jianan Zhao, Qi Zhang, Rui Li, Weihao Han, Weiwei Deng, Xing Xie, Xu Chen, Yanming Shen, Yujing Wang","submitted_at":"2023-05-23T14:53:20Z","abstract_excerpt":"Embedding models have shown great power in knowledge graph completion (KGC) task. By learning structural constraints for each training triple, these methods implicitly memorize intrinsic relation rules to infer missing links. However, this paper points out that the multi-hop relation rules are hard to be reliably memorized due to the inherent deficiencies of such implicit memorization strategy, making embedding models underperform in predicting links between distant entity pairs. To alleviate this problem, we present Vertical Learning Paradigm (VLP), which extends embedding models by allowing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.14126","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/2305.14126/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":"2305.14126","created_at":"2026-07-05T06:13:01.315057+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.14126v1","created_at":"2026-07-05T06:13:01.315057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.14126","created_at":"2026-07-05T06:13:01.315057+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VCDQGIALXB7","created_at":"2026-07-05T06:13:01.315057+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VCDQGIALXB76M2U","created_at":"2026-07-05T06:13:01.315057+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VCDQGIA","created_at":"2026-07-05T06:13:01.315057+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/4VCDQGIALXB76M2UUQ6RYLHGAB","json":"https://pith.science/pith/4VCDQGIALXB76M2UUQ6RYLHGAB.json","graph_json":"https://pith.science/api/pith-number/4VCDQGIALXB76M2UUQ6RYLHGAB/graph.json","events_json":"https://pith.science/api/pith-number/4VCDQGIALXB76M2UUQ6RYLHGAB/events.json","paper":"https://pith.science/paper/4VCDQGIA"},"agent_actions":{"view_html":"https://pith.science/pith/4VCDQGIALXB76M2UUQ6RYLHGAB","download_json":"https://pith.science/pith/4VCDQGIALXB76M2UUQ6RYLHGAB.json","view_paper":"https://pith.science/paper/4VCDQGIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.14126&json=true","fetch_graph":"https://pith.science/api/pith-number/4VCDQGIALXB76M2UUQ6RYLHGAB/graph.json","fetch_events":"https://pith.science/api/pith-number/4VCDQGIALXB76M2UUQ6RYLHGAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VCDQGIALXB76M2UUQ6RYLHGAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VCDQGIALXB76M2UUQ6RYLHGAB/action/storage_attestation","attest_author":"https://pith.science/pith/4VCDQGIALXB76M2UUQ6RYLHGAB/action/author_attestation","sign_citation":"https://pith.science/pith/4VCDQGIALXB76M2UUQ6RYLHGAB/action/citation_signature","submit_replication":"https://pith.science/pith/4VCDQGIALXB76M2UUQ6RYLHGAB/action/replication_record"}},"created_at":"2026-07-05T06:13:01.315057+00:00","updated_at":"2026-07-05T06:13:01.315057+00:00"}