{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KWAOVQAZRVYOWU6K7KU7UHWESY","short_pith_number":"pith:KWAOVQAZ","canonical_record":{"source":{"id":"1707.01476","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-05T17:18:17Z","cross_cats_sorted":[],"title_canon_sha256":"24e6d8ee80b0b760b73d0deb15b0e42a612bdf0d1eafaa5d4730d42486ac313d","abstract_canon_sha256":"7b807f5a6fa1e884f117b40c8b92cf80b8516551a357fbd6ea36892ef53e43cf"},"schema_version":"1.0"},"canonical_sha256":"5580eac0198d70eb53cafaa9fa1ec4961c694add783c52e2a57a37e754d8ec53","source":{"kind":"arxiv","id":"1707.01476","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01476","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01476v6","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01476","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"KWAOVQAZRVYO","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KWAOVQAZRVYOWU6K","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KWAOVQAZ","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KWAOVQAZRVYOWU6K7KU7UHWESY","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01476","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-05T17:18:17Z","cross_cats_sorted":[],"title_canon_sha256":"24e6d8ee80b0b760b73d0deb15b0e42a612bdf0d1eafaa5d4730d42486ac313d","abstract_canon_sha256":"7b807f5a6fa1e884f117b40c8b92cf80b8516551a357fbd6ea36892ef53e43cf"},"schema_version":"1.0"},"canonical_sha256":"5580eac0198d70eb53cafaa9fa1ec4961c694add783c52e2a57a37e754d8ec53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:32.512701Z","signature_b64":"YyiugH0Qb22TWBDSWnkwD165G8ZhgeErBCU2kbvt4usZclmtQAT6Q5A+knpFmg11zxCiUgOZopCof4d2R85iAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5580eac0198d70eb53cafaa9fa1ec4961c694add783c52e2a57a37e754d8ec53","last_reissued_at":"2026-05-18T00:11:32.512076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:32.512076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01476","source_version":6,"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-05-18T00:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VVdrqy0NoPt2GszTDlLG5AC7CJTikCGiqw71NpRnFvBUE9dMNC+V1OZwU9E2DnXM9FOBWpkFxhGN2c8cIJYUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:02:49.685634Z"},"content_sha256":"8e2cbf99e8147ac37ce617ac8341a9c5ac0dc412510dcd0220f6a540fa78f892","schema_version":"1.0","event_id":"sha256:8e2cbf99e8147ac37ce617ac8341a9c5ac0dc412510dcd0220f6a540fa78f892"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KWAOVQAZRVYOWU6K7KU7UHWESY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convolutional 2D Knowledge Graph Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Pasquale Minervini, Pontus Stenetorp, Sebastian Riedel, Tim Dettmers","submitted_at":"2017-07-05T17:18:17Z","abstract_excerpt":"Link prediction for knowledge graphs is the task of predicting missing relationships between entities. Previous work on link prediction has focused on shallow, fast models which can scale to large knowledge graphs. However, these models learn less expressive features than deep, multi-layer models -- which potentially limits performance. In this work, we introduce ConvE, a multi-layer convolutional network model for link prediction, and report state-of-the-art results for several established datasets. We also show that the model is highly parameter efficient, yielding the same performance as Di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01476","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n25vk+b0yfO3Si5RwcK0KyaX+b+mrwQYqm6wcEoSk1y0LXnjAnBeuPuev8WJD0QKuxPAviqORkh+huhuHX8RDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:02:49.686294Z"},"content_sha256":"1b7e1a3d6a04b2b76372ab459600a2c6ce71e3b93c11f70f6438257ac749469f","schema_version":"1.0","event_id":"sha256:1b7e1a3d6a04b2b76372ab459600a2c6ce71e3b93c11f70f6438257ac749469f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWAOVQAZRVYOWU6K7KU7UHWESY/bundle.json","state_url":"https://pith.science/pith/KWAOVQAZRVYOWU6K7KU7UHWESY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWAOVQAZRVYOWU6K7KU7UHWESY/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-05-26T22:02:49Z","links":{"resolver":"https://pith.science/pith/KWAOVQAZRVYOWU6K7KU7UHWESY","bundle":"https://pith.science/pith/KWAOVQAZRVYOWU6K7KU7UHWESY/bundle.json","state":"https://pith.science/pith/KWAOVQAZRVYOWU6K7KU7UHWESY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWAOVQAZRVYOWU6K7KU7UHWESY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KWAOVQAZRVYOWU6K7KU7UHWESY","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":"7b807f5a6fa1e884f117b40c8b92cf80b8516551a357fbd6ea36892ef53e43cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-05T17:18:17Z","title_canon_sha256":"24e6d8ee80b0b760b73d0deb15b0e42a612bdf0d1eafaa5d4730d42486ac313d"},"schema_version":"1.0","source":{"id":"1707.01476","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01476","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01476v6","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01476","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"KWAOVQAZRVYO","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KWAOVQAZRVYOWU6K","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KWAOVQAZ","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:1b7e1a3d6a04b2b76372ab459600a2c6ce71e3b93c11f70f6438257ac749469f","target":"graph","created_at":"2026-05-18T00:11:32Z","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"},"paper":{"abstract_excerpt":"Link prediction for knowledge graphs is the task of predicting missing relationships between entities. Previous work on link prediction has focused on shallow, fast models which can scale to large knowledge graphs. However, these models learn less expressive features than deep, multi-layer models -- which potentially limits performance. In this work, we introduce ConvE, a multi-layer convolutional network model for link prediction, and report state-of-the-art results for several established datasets. We also show that the model is highly parameter efficient, yielding the same performance as Di","authors_text":"Pasquale Minervini, Pontus Stenetorp, Sebastian Riedel, Tim Dettmers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-05T17:18:17Z","title":"Convolutional 2D Knowledge Graph Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01476","kind":"arxiv","version":6},"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:8e2cbf99e8147ac37ce617ac8341a9c5ac0dc412510dcd0220f6a540fa78f892","target":"record","created_at":"2026-05-18T00:11:32Z","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":"7b807f5a6fa1e884f117b40c8b92cf80b8516551a357fbd6ea36892ef53e43cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-05T17:18:17Z","title_canon_sha256":"24e6d8ee80b0b760b73d0deb15b0e42a612bdf0d1eafaa5d4730d42486ac313d"},"schema_version":"1.0","source":{"id":"1707.01476","kind":"arxiv","version":6}},"canonical_sha256":"5580eac0198d70eb53cafaa9fa1ec4961c694add783c52e2a57a37e754d8ec53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5580eac0198d70eb53cafaa9fa1ec4961c694add783c52e2a57a37e754d8ec53","first_computed_at":"2026-05-18T00:11:32.512076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:32.512076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YyiugH0Qb22TWBDSWnkwD165G8ZhgeErBCU2kbvt4usZclmtQAT6Q5A+knpFmg11zxCiUgOZopCof4d2R85iAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:32.512701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01476","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e2cbf99e8147ac37ce617ac8341a9c5ac0dc412510dcd0220f6a540fa78f892","sha256:1b7e1a3d6a04b2b76372ab459600a2c6ce71e3b93c11f70f6438257ac749469f"],"state_sha256":"56d5d6c9a0e06c84b9f7204e9fb89c5569e2abdaea872a56492c46ff6931f927"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhW9b9jvvRmu/sEoUaBA2L2KDCO39pOkLhWLhKhE0jJeJnt2JFtZKiXJHFXoCPJ3PUnqaWH8/9+N2DySpQQIBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:02:49.690220Z","bundle_sha256":"f123bb1c663ad4ba55c43a7f8bcce4edd0c22041fa87ba505a610c2a45f8ae3a"}}