{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UUGW64LJX2BDO63O43OCGNJI6F","short_pith_number":"pith:UUGW64LJ","canonical_record":{"source":{"id":"1506.00999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-02T19:34:19Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"1abba0013e97c20fb8f48eb342065c1b332fdc0423f9fbf77f6f4153354b1021","abstract_canon_sha256":"68ead207636f1aa29b2373d6a3efd951c133f97b1282f93b28b540954f66cbf9"},"schema_version":"1.0"},"canonical_sha256":"a50d6f7169be82377b6ee6dc233528f165bfa004e1d8fca761a4ba6cce5660aa","source":{"kind":"arxiv","id":"1506.00999","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00999","created_at":"2026-05-18T01:58:38Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00999v1","created_at":"2026-05-18T01:58:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00999","created_at":"2026-05-18T01:58:38Z"},{"alias_kind":"pith_short_12","alias_value":"UUGW64LJX2BD","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UUGW64LJX2BDO63O","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UUGW64LJ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UUGW64LJX2BDO63O43OCGNJI6F","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-02T19:34:19Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"1abba0013e97c20fb8f48eb342065c1b332fdc0423f9fbf77f6f4153354b1021","abstract_canon_sha256":"68ead207636f1aa29b2373d6a3efd951c133f97b1282f93b28b540954f66cbf9"},"schema_version":"1.0"},"canonical_sha256":"a50d6f7169be82377b6ee6dc233528f165bfa004e1d8fca761a4ba6cce5660aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:38.645808Z","signature_b64":"MFnDwuof6/ovzugbhGAUmvSlw8v6c0vSv5LDbH46tjmfeaGtdBxCVlIjgDDnpDVQkNxAz3yAH9ufwlgEkY4gBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a50d6f7169be82377b6ee6dc233528f165bfa004e1d8fca761a4ba6cce5660aa","last_reissued_at":"2026-05-18T01:58:38.645223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:38.645223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00999","source_version":1,"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-18T01:58:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h41OnVWtvAsgYO5FlUc5IOTt4PGwNkuVcCfH1Mq23q1xzY4LMZB9PW4HkmHXajiDvzf1nfrfVal1fl/9E9DNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:26:16.301595Z"},"content_sha256":"9dfa62df40d4c5358d237566bff067da67e4fc98c79d904ab8ca1c2d700a1302","schema_version":"1.0","event_id":"sha256:9dfa62df40d4c5358d237566bff067da67e4fc98c79d904ab8ca1c2d700a1302"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UUGW64LJX2BDO63O43OCGNJI6F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combining Two And Three-Way Embeddings Models for Link Prediction in Knowledge Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Alberto Garcia-Duran, Antoine Bordes, Nicolas Usunier, Yves Grandvalet","submitted_at":"2015-06-02T19:34:19Z","abstract_excerpt":"This paper tackles the problem of endogenous link prediction for Knowledge Base completion. Knowledge Bases can be represented as directed graphs whose nodes correspond to entities and edges to relationships. Previous attempts either consist of powerful systems with high capacity to model complex connectivity patterns, which unfortunately usually end up overfitting on rare relationships, or in approaches that trade capacity for simplicity in order to fairly model all relationships, frequent or not. In this paper, we propose Tatec a happy medium obtained by complementing a high-capacity model w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00999","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":""},"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-18T01:58:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"06T+VgGvWeG/uV2sWa2jX5OhJoV22ppkR+qu/4o8jB+M5qNiJxah3eiqRhY9Lo34LHFP2YiNF7xiaaNDmbdCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:26:16.301943Z"},"content_sha256":"8cac20503eb623831b08508a9d4b49b59f4b46bd0ea451ed3aed2404d0886b1c","schema_version":"1.0","event_id":"sha256:8cac20503eb623831b08508a9d4b49b59f4b46bd0ea451ed3aed2404d0886b1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UUGW64LJX2BDO63O43OCGNJI6F/bundle.json","state_url":"https://pith.science/pith/UUGW64LJX2BDO63O43OCGNJI6F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UUGW64LJX2BDO63O43OCGNJI6F/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-06-05T16:26:16Z","links":{"resolver":"https://pith.science/pith/UUGW64LJX2BDO63O43OCGNJI6F","bundle":"https://pith.science/pith/UUGW64LJX2BDO63O43OCGNJI6F/bundle.json","state":"https://pith.science/pith/UUGW64LJX2BDO63O43OCGNJI6F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UUGW64LJX2BDO63O43OCGNJI6F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UUGW64LJX2BDO63O43OCGNJI6F","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":"68ead207636f1aa29b2373d6a3efd951c133f97b1282f93b28b540954f66cbf9","cross_cats_sorted":["cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-02T19:34:19Z","title_canon_sha256":"1abba0013e97c20fb8f48eb342065c1b332fdc0423f9fbf77f6f4153354b1021"},"schema_version":"1.0","source":{"id":"1506.00999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00999","created_at":"2026-05-18T01:58:38Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00999v1","created_at":"2026-05-18T01:58:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00999","created_at":"2026-05-18T01:58:38Z"},{"alias_kind":"pith_short_12","alias_value":"UUGW64LJX2BD","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UUGW64LJX2BDO63O","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UUGW64LJ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:8cac20503eb623831b08508a9d4b49b59f4b46bd0ea451ed3aed2404d0886b1c","target":"graph","created_at":"2026-05-18T01:58:38Z","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":"This paper tackles the problem of endogenous link prediction for Knowledge Base completion. Knowledge Bases can be represented as directed graphs whose nodes correspond to entities and edges to relationships. Previous attempts either consist of powerful systems with high capacity to model complex connectivity patterns, which unfortunately usually end up overfitting on rare relationships, or in approaches that trade capacity for simplicity in order to fairly model all relationships, frequent or not. In this paper, we propose Tatec a happy medium obtained by complementing a high-capacity model w","authors_text":"Alberto Garcia-Duran, Antoine Bordes, Nicolas Usunier, Yves Grandvalet","cross_cats":["cs.CL","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-02T19:34:19Z","title":"Combining Two And Three-Way Embeddings Models for Link Prediction in Knowledge Bases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00999","kind":"arxiv","version":1},"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:9dfa62df40d4c5358d237566bff067da67e4fc98c79d904ab8ca1c2d700a1302","target":"record","created_at":"2026-05-18T01:58:38Z","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":"68ead207636f1aa29b2373d6a3efd951c133f97b1282f93b28b540954f66cbf9","cross_cats_sorted":["cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-02T19:34:19Z","title_canon_sha256":"1abba0013e97c20fb8f48eb342065c1b332fdc0423f9fbf77f6f4153354b1021"},"schema_version":"1.0","source":{"id":"1506.00999","kind":"arxiv","version":1}},"canonical_sha256":"a50d6f7169be82377b6ee6dc233528f165bfa004e1d8fca761a4ba6cce5660aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a50d6f7169be82377b6ee6dc233528f165bfa004e1d8fca761a4ba6cce5660aa","first_computed_at":"2026-05-18T01:58:38.645223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:38.645223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MFnDwuof6/ovzugbhGAUmvSlw8v6c0vSv5LDbH46tjmfeaGtdBxCVlIjgDDnpDVQkNxAz3yAH9ufwlgEkY4gBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:38.645808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9dfa62df40d4c5358d237566bff067da67e4fc98c79d904ab8ca1c2d700a1302","sha256:8cac20503eb623831b08508a9d4b49b59f4b46bd0ea451ed3aed2404d0886b1c"],"state_sha256":"b45be5ae903be66e09751182683751b7cfb144a464d0ed85913f2d695a4bc74c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"16d42jgy8cnuPT/dsIrZqENMGx1ecnhlBVpH2lJ9I8UEtugxP5NJsljH2PnAe73vZBzlhjUg7+nwuDLUO9kvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:26:16.303927Z","bundle_sha256":"0bd7d5dcbfc92d3d26a49bc557b6f88a6dbd88aeef628a10d319cd572b76b83c"}}