{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:7T7NDV232YMNDCZF3AR5CZTM67","short_pith_number":"pith:7T7NDV23","canonical_record":{"source":{"id":"2211.02744","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-11-04T20:38:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4bb30986150a6a361c8112eda1f355d38e7c17d612d99a7b6a04a1a5438d2e30","abstract_canon_sha256":"5a43deb4047b1fa25af174d574e64e1f7ebd88b13b37945757cfc17ba97dd27d"},"schema_version":"1.0"},"canonical_sha256":"fcfed1d75bd618d18b25d823d1666cf7ea6104a885d019d5315aede98112b456","source":{"kind":"arxiv","id":"2211.02744","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02744","created_at":"2026-07-05T06:11:01Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02744v2","created_at":"2026-07-05T06:11:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02744","created_at":"2026-07-05T06:11:01Z"},{"alias_kind":"pith_short_12","alias_value":"7T7NDV232YMN","created_at":"2026-07-05T06:11:01Z"},{"alias_kind":"pith_short_16","alias_value":"7T7NDV232YMNDCZF","created_at":"2026-07-05T06:11:01Z"},{"alias_kind":"pith_short_8","alias_value":"7T7NDV23","created_at":"2026-07-05T06:11:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:7T7NDV232YMNDCZF3AR5CZTM67","target":"record","payload":{"canonical_record":{"source":{"id":"2211.02744","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-11-04T20:38:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4bb30986150a6a361c8112eda1f355d38e7c17d612d99a7b6a04a1a5438d2e30","abstract_canon_sha256":"5a43deb4047b1fa25af174d574e64e1f7ebd88b13b37945757cfc17ba97dd27d"},"schema_version":"1.0"},"canonical_sha256":"fcfed1d75bd618d18b25d823d1666cf7ea6104a885d019d5315aede98112b456","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:11:01.990305Z","signature_b64":"1iuQ9K9ravHT6eVNLULG1Id4ufC+ZLvJ4MpPV8yemA6XgE/ZpptlhWyG6k4qNYjS7pNiFio+uIWG3INntPY/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcfed1d75bd618d18b25d823d1666cf7ea6104a885d019d5315aede98112b456","last_reissued_at":"2026-07-05T06:11:01.989886Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:11:01.989886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.02744","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:11:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UrMUx9UCoYQ3x2qeh2blshA8iWIYO+nnwE4qu1Pi7pKj/Itbs6u4uHc8ke/yFXf4ZWaRLDr7D4mdvxGQmuUOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:46:32.915454Z"},"content_sha256":"aa28d7827e5e630262e2b87a5547341fdef6e97af5c9fa0af8322fbd85d6fa9a","schema_version":"1.0","event_id":"sha256:aa28d7827e5e630262e2b87a5547341fdef6e97af5c9fa0af8322fbd85d6fa9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:7T7NDV232YMNDCZF3AR5CZTM67","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Ilias Tagkopoulos, Jason Youn","submitted_at":"2022-11-04T20:38:12Z","abstract_excerpt":"The ability of knowledge graphs to represent complex relationships at scale has led to their adoption for various needs including knowledge representation, question-answering, and recommendation systems. Knowledge graphs are often incomplete in the information they represent, necessitating the need for knowledge graph completion tasks. Pre-trained and fine-tuned language models have shown promise in these tasks although these models ignore the intrinsic information encoded in the knowledge graph, namely the entity and relation types. In this work, we propose the Knowledge Graph Language Model "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02744","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/2211.02744/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:11:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2y/1aiyHQvxKPNeZhCgAbNsqJBesyTkvHL0J83oTqDf+GSYd3nm/y1phIE3RLoC3RSSOz77RYv9VYYoQldPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:46:32.915959Z"},"content_sha256":"3c55c9675a60a5479fe5bbddec78484ca010315aa4f59fc361f306fee3c8d637","schema_version":"1.0","event_id":"sha256:3c55c9675a60a5479fe5bbddec78484ca010315aa4f59fc361f306fee3c8d637"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7T7NDV232YMNDCZF3AR5CZTM67/bundle.json","state_url":"https://pith.science/pith/7T7NDV232YMNDCZF3AR5CZTM67/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7T7NDV232YMNDCZF3AR5CZTM67/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T08:46:32Z","links":{"resolver":"https://pith.science/pith/7T7NDV232YMNDCZF3AR5CZTM67","bundle":"https://pith.science/pith/7T7NDV232YMNDCZF3AR5CZTM67/bundle.json","state":"https://pith.science/pith/7T7NDV232YMNDCZF3AR5CZTM67/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7T7NDV232YMNDCZF3AR5CZTM67/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:7T7NDV232YMNDCZF3AR5CZTM67","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5a43deb4047b1fa25af174d574e64e1f7ebd88b13b37945757cfc17ba97dd27d","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-11-04T20:38:12Z","title_canon_sha256":"4bb30986150a6a361c8112eda1f355d38e7c17d612d99a7b6a04a1a5438d2e30"},"schema_version":"1.0","source":{"id":"2211.02744","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02744","created_at":"2026-07-05T06:11:01Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02744v2","created_at":"2026-07-05T06:11:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02744","created_at":"2026-07-05T06:11:01Z"},{"alias_kind":"pith_short_12","alias_value":"7T7NDV232YMN","created_at":"2026-07-05T06:11:01Z"},{"alias_kind":"pith_short_16","alias_value":"7T7NDV232YMNDCZF","created_at":"2026-07-05T06:11:01Z"},{"alias_kind":"pith_short_8","alias_value":"7T7NDV23","created_at":"2026-07-05T06:11:01Z"}],"graph_snapshots":[{"event_id":"sha256:3c55c9675a60a5479fe5bbddec78484ca010315aa4f59fc361f306fee3c8d637","target":"graph","created_at":"2026-07-05T06:11:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.02744/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The ability of knowledge graphs to represent complex relationships at scale has led to their adoption for various needs including knowledge representation, question-answering, and recommendation systems. Knowledge graphs are often incomplete in the information they represent, necessitating the need for knowledge graph completion tasks. Pre-trained and fine-tuned language models have shown promise in these tasks although these models ignore the intrinsic information encoded in the knowledge graph, namely the entity and relation types. In this work, we propose the Knowledge Graph Language Model ","authors_text":"Ilias Tagkopoulos, Jason Youn","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-11-04T20:38:12Z","title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02744","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aa28d7827e5e630262e2b87a5547341fdef6e97af5c9fa0af8322fbd85d6fa9a","target":"record","created_at":"2026-07-05T06:11:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5a43deb4047b1fa25af174d574e64e1f7ebd88b13b37945757cfc17ba97dd27d","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-11-04T20:38:12Z","title_canon_sha256":"4bb30986150a6a361c8112eda1f355d38e7c17d612d99a7b6a04a1a5438d2e30"},"schema_version":"1.0","source":{"id":"2211.02744","kind":"arxiv","version":2}},"canonical_sha256":"fcfed1d75bd618d18b25d823d1666cf7ea6104a885d019d5315aede98112b456","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcfed1d75bd618d18b25d823d1666cf7ea6104a885d019d5315aede98112b456","first_computed_at":"2026-07-05T06:11:01.989886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:11:01.989886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1iuQ9K9ravHT6eVNLULG1Id4ufC+ZLvJ4MpPV8yemA6XgE/ZpptlhWyG6k4qNYjS7pNiFio+uIWG3INntPY/AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:11:01.990305Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.02744","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa28d7827e5e630262e2b87a5547341fdef6e97af5c9fa0af8322fbd85d6fa9a","sha256:3c55c9675a60a5479fe5bbddec78484ca010315aa4f59fc361f306fee3c8d637"],"state_sha256":"3b13d6f60c354f3bdf3fd23ac45b69b53c9c8ec54bf65bea2f3da70b00dc2f8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ilyC745/OOmn2SGujAshtJBHjqpgvB+ft+MLPjBv6bYny1nvrSxkr0MHjx5TIlRZTBw6Ct4Mxn0M9haagNF8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T08:46:32.919813Z","bundle_sha256":"54d38f08ee8cec25f70d5f7421a824d0c2c79877bf476b6ecbc16f86f68e2969"}}