{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DWTRBDQ3UKUFAQDGIM3SXQ7FHY","short_pith_number":"pith:DWTRBDQ3","canonical_record":{"source":{"id":"1601.03778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-14T23:13:00Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"42d2088d92d28cb3460e359d886e204f9d34d203456b39b933f2e02cc1246dc2","abstract_canon_sha256":"31dc9ce4397c3abd27401b49e3d714cfd304bf1ed1235dc80c6de59ad132a6d9"},"schema_version":"1.0"},"canonical_sha256":"1da7108e1ba2a850406643372bc3e53e098d8878801c7b4eda5979f339c4fd64","source":{"kind":"arxiv","id":"1601.03778","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03778","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03778v2","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03778","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"DWTRBDQ3UKUF","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DWTRBDQ3UKUFAQDG","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DWTRBDQ3","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DWTRBDQ3UKUFAQDGIM3SXQ7FHY","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-14T23:13:00Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"42d2088d92d28cb3460e359d886e204f9d34d203456b39b933f2e02cc1246dc2","abstract_canon_sha256":"31dc9ce4397c3abd27401b49e3d714cfd304bf1ed1235dc80c6de59ad132a6d9"},"schema_version":"1.0"},"canonical_sha256":"1da7108e1ba2a850406643372bc3e53e098d8878801c7b4eda5979f339c4fd64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:50.041472Z","signature_b64":"VuZs8d9MyMdH9To9Z7q/jW6pGG3M47qKrLRSQh4UJx0H0p3mECxnALifQIM2YBwCZp8b4RNAJsE9Mk1PeKXyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1da7108e1ba2a850406643372bc3e53e098d8878801c7b4eda5979f339c4fd64","last_reissued_at":"2026-05-18T01:20:50.041019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:50.041019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03778","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-05-18T01:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R9FtuhA7D6GAlU/Vv0jUPvQxsBsqhn1wcxQV248dvHPnkwUc7xmzXRoxmdg0EMHEAr/mv7+GeHrPnVXoxayFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:22:17.972399Z"},"content_sha256":"1d5d800760fe85553b4ca238b07fca0c50c09af250313fe11dea11f7736d1076","schema_version":"1.0","event_id":"sha256:1d5d800760fe85553b4ca238b07fca0c50c09af250313fe11dea11f7736d1076"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DWTRBDQ3UKUFAQDGIM3SXQ7FHY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trust from the past: Bayesian Personalized Ranking based Link Prediction in Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.LG","authors_text":"Baichuan Zhang, Khushbu Agarwal, Mohammad Al Hasan, Paola Pesntez Cabrera, Sumit Purohit, Sutanay Choudhury, Xia Ning","submitted_at":"2016-01-14T23:13:00Z","abstract_excerpt":"Link prediction, or predicting the likelihood of a link in a knowledge graph based on its existing state is a key research task. It differs from a traditional link prediction task in that the links in a knowledge graph are categorized into different predicates and the link prediction performance of different predicates in a knowledge graph generally varies widely. In this work, we propose a latent feature embedding based link prediction model which considers the prediction task for each predicate disjointly. To learn the model parameters it utilizes a Bayesian personalized ranking based optimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03778","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":""},"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:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yl+eVudJcqH4i2LGiAAqp4FYCVkJ+zWLXlPjcwKTxMi9npzDcip5xSS8qHiHEWyg8a8pIdH4mUl48ow3wwxRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:22:17.973081Z"},"content_sha256":"851c6040f70c381edbffaabb32fa76c7d22d7b2344109d3242aa71c3d64fe1c8","schema_version":"1.0","event_id":"sha256:851c6040f70c381edbffaabb32fa76c7d22d7b2344109d3242aa71c3d64fe1c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DWTRBDQ3UKUFAQDGIM3SXQ7FHY/bundle.json","state_url":"https://pith.science/pith/DWTRBDQ3UKUFAQDGIM3SXQ7FHY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DWTRBDQ3UKUFAQDGIM3SXQ7FHY/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-26T14:22:17Z","links":{"resolver":"https://pith.science/pith/DWTRBDQ3UKUFAQDGIM3SXQ7FHY","bundle":"https://pith.science/pith/DWTRBDQ3UKUFAQDGIM3SXQ7FHY/bundle.json","state":"https://pith.science/pith/DWTRBDQ3UKUFAQDGIM3SXQ7FHY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DWTRBDQ3UKUFAQDGIM3SXQ7FHY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DWTRBDQ3UKUFAQDGIM3SXQ7FHY","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":"31dc9ce4397c3abd27401b49e3d714cfd304bf1ed1235dc80c6de59ad132a6d9","cross_cats_sorted":["cs.AI","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-14T23:13:00Z","title_canon_sha256":"42d2088d92d28cb3460e359d886e204f9d34d203456b39b933f2e02cc1246dc2"},"schema_version":"1.0","source":{"id":"1601.03778","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03778","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03778v2","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03778","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"DWTRBDQ3UKUF","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DWTRBDQ3UKUFAQDG","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DWTRBDQ3","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:851c6040f70c381edbffaabb32fa76c7d22d7b2344109d3242aa71c3d64fe1c8","target":"graph","created_at":"2026-05-18T01:20:50Z","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, or predicting the likelihood of a link in a knowledge graph based on its existing state is a key research task. It differs from a traditional link prediction task in that the links in a knowledge graph are categorized into different predicates and the link prediction performance of different predicates in a knowledge graph generally varies widely. In this work, we propose a latent feature embedding based link prediction model which considers the prediction task for each predicate disjointly. To learn the model parameters it utilizes a Bayesian personalized ranking based optimi","authors_text":"Baichuan Zhang, Khushbu Agarwal, Mohammad Al Hasan, Paola Pesntez Cabrera, Sumit Purohit, Sutanay Choudhury, Xia Ning","cross_cats":["cs.AI","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-14T23:13:00Z","title":"Trust from the past: Bayesian Personalized Ranking based Link Prediction in Knowledge Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03778","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:1d5d800760fe85553b4ca238b07fca0c50c09af250313fe11dea11f7736d1076","target":"record","created_at":"2026-05-18T01:20:50Z","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":"31dc9ce4397c3abd27401b49e3d714cfd304bf1ed1235dc80c6de59ad132a6d9","cross_cats_sorted":["cs.AI","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-01-14T23:13:00Z","title_canon_sha256":"42d2088d92d28cb3460e359d886e204f9d34d203456b39b933f2e02cc1246dc2"},"schema_version":"1.0","source":{"id":"1601.03778","kind":"arxiv","version":2}},"canonical_sha256":"1da7108e1ba2a850406643372bc3e53e098d8878801c7b4eda5979f339c4fd64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1da7108e1ba2a850406643372bc3e53e098d8878801c7b4eda5979f339c4fd64","first_computed_at":"2026-05-18T01:20:50.041019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:50.041019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VuZs8d9MyMdH9To9Z7q/jW6pGG3M47qKrLRSQh4UJx0H0p3mECxnALifQIM2YBwCZp8b4RNAJsE9Mk1PeKXyCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:50.041472Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03778","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d5d800760fe85553b4ca238b07fca0c50c09af250313fe11dea11f7736d1076","sha256:851c6040f70c381edbffaabb32fa76c7d22d7b2344109d3242aa71c3d64fe1c8"],"state_sha256":"59b3267e42691a1f737ed6854a981aa9d42f88dfa6d773f2e221ca8eb83cc5ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L8Vd47TxUYVD4BCeevvWCeYSIsbj6to9TbJzIQHA15Q0VusrJCachhKQHSK+0uPTM0G9YzfcCURzyTX0PPyRCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:22:17.976805Z","bundle_sha256":"a80a1f2b29babb697fa1f754e50e0a1ae55a9a1a52738291f7d8b0623bdc7553"}}