{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NKPFJQIK5A4V6754UQN2WOCIBP","short_pith_number":"pith:NKPFJQIK","canonical_record":{"source":{"id":"1712.07745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-12-20T23:10:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0ae0634a20503f3911590b883258207563f7a5881134879715382b7dc04d5145","abstract_canon_sha256":"595ba5b37203bccaec046237b01a0e4b63e7bb1945853bd407906cd5c63d7796"},"schema_version":"1.0"},"canonical_sha256":"6a9e54c10ae8395f7fbca41bab38480bebe267f7b829354793ec966c3e3e1962","source":{"kind":"arxiv","id":"1712.07745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07745","created_at":"2026-05-18T00:27:24Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07745v1","created_at":"2026-05-18T00:27:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07745","created_at":"2026-05-18T00:27:24Z"},{"alias_kind":"pith_short_12","alias_value":"NKPFJQIK5A4V","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NKPFJQIK5A4V6754","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NKPFJQIK","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NKPFJQIK5A4V6754UQN2WOCIBP","target":"record","payload":{"canonical_record":{"source":{"id":"1712.07745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-12-20T23:10:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0ae0634a20503f3911590b883258207563f7a5881134879715382b7dc04d5145","abstract_canon_sha256":"595ba5b37203bccaec046237b01a0e4b63e7bb1945853bd407906cd5c63d7796"},"schema_version":"1.0"},"canonical_sha256":"6a9e54c10ae8395f7fbca41bab38480bebe267f7b829354793ec966c3e3e1962","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:24.306514Z","signature_b64":"dtt5Jmuo9p7HPS96OkvTQ1OmX6ziyzW9TWEc3WUt2TBoPqpMb/DLx/gQdefg2Pjhds6qMM7iVc4Slc37e3IICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a9e54c10ae8395f7fbca41bab38480bebe267f7b829354793ec966c3e3e1962","last_reissued_at":"2026-05-18T00:27:24.305862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:24.305862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.07745","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-18T00:27:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UzxwKTswhd3G8nG+fXlg0ituXSqRyPgFxRB533c5ee+O/r9hX5sQCit+iRPyaO/tT4duuimCXInmh0cu0XzTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:46:51.257704Z"},"content_sha256":"45bdbf9790008b507033f1834000d3b06f0f8d5aed145e2273dde361088c3bcc","schema_version":"1.0","event_id":"sha256:45bdbf9790008b507033f1834000d3b06f0f8d5aed145e2273dde361088c3bcc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NKPFJQIK5A4V6754UQN2WOCIBP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Context-aware Path Ranking for Knowledge Base Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Bing Liu, Sahisnu Mazumder","submitted_at":"2017-12-20T23:10:21Z","abstract_excerpt":"Knowledge base (KB) completion aims to infer missing facts from existing ones in a KB. Among various approaches, path ranking (PR) algorithms have received increasing attention in recent years. PR algorithms enumerate paths between entity pairs in a KB and use those paths as features to train a model for missing fact prediction. Due to their good performances and high model interpretability, several methods have been proposed. However, most existing methods suffer from scalability (high RAM consumption) and feature explosion (trains on an exponentially large number of features) problems. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07745","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-18T00:27:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YV72WeHaPzdEurhNN93jja1bcpY8I2+A53+zdS4GDoAGlAJ3nibmbwKqXs+zzluXDPtXo8cWHcgMI9xtoriFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:46:51.258046Z"},"content_sha256":"afbb66922270d91b9745e6d8db7379cf93d93ead09e43c14a0ceba65a46e108c","schema_version":"1.0","event_id":"sha256:afbb66922270d91b9745e6d8db7379cf93d93ead09e43c14a0ceba65a46e108c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NKPFJQIK5A4V6754UQN2WOCIBP/bundle.json","state_url":"https://pith.science/pith/NKPFJQIK5A4V6754UQN2WOCIBP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NKPFJQIK5A4V6754UQN2WOCIBP/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-30T23:46:51Z","links":{"resolver":"https://pith.science/pith/NKPFJQIK5A4V6754UQN2WOCIBP","bundle":"https://pith.science/pith/NKPFJQIK5A4V6754UQN2WOCIBP/bundle.json","state":"https://pith.science/pith/NKPFJQIK5A4V6754UQN2WOCIBP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NKPFJQIK5A4V6754UQN2WOCIBP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NKPFJQIK5A4V6754UQN2WOCIBP","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":"595ba5b37203bccaec046237b01a0e4b63e7bb1945853bd407906cd5c63d7796","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-12-20T23:10:21Z","title_canon_sha256":"0ae0634a20503f3911590b883258207563f7a5881134879715382b7dc04d5145"},"schema_version":"1.0","source":{"id":"1712.07745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07745","created_at":"2026-05-18T00:27:24Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07745v1","created_at":"2026-05-18T00:27:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07745","created_at":"2026-05-18T00:27:24Z"},{"alias_kind":"pith_short_12","alias_value":"NKPFJQIK5A4V","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NKPFJQIK5A4V6754","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NKPFJQIK","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:afbb66922270d91b9745e6d8db7379cf93d93ead09e43c14a0ceba65a46e108c","target":"graph","created_at":"2026-05-18T00:27:24Z","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":"Knowledge base (KB) completion aims to infer missing facts from existing ones in a KB. Among various approaches, path ranking (PR) algorithms have received increasing attention in recent years. PR algorithms enumerate paths between entity pairs in a KB and use those paths as features to train a model for missing fact prediction. Due to their good performances and high model interpretability, several methods have been proposed. However, most existing methods suffer from scalability (high RAM consumption) and feature explosion (trains on an exponentially large number of features) problems. This ","authors_text":"Bing Liu, Sahisnu Mazumder","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-12-20T23:10:21Z","title":"Context-aware Path Ranking for Knowledge Base Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07745","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:45bdbf9790008b507033f1834000d3b06f0f8d5aed145e2273dde361088c3bcc","target":"record","created_at":"2026-05-18T00:27:24Z","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":"595ba5b37203bccaec046237b01a0e4b63e7bb1945853bd407906cd5c63d7796","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-12-20T23:10:21Z","title_canon_sha256":"0ae0634a20503f3911590b883258207563f7a5881134879715382b7dc04d5145"},"schema_version":"1.0","source":{"id":"1712.07745","kind":"arxiv","version":1}},"canonical_sha256":"6a9e54c10ae8395f7fbca41bab38480bebe267f7b829354793ec966c3e3e1962","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a9e54c10ae8395f7fbca41bab38480bebe267f7b829354793ec966c3e3e1962","first_computed_at":"2026-05-18T00:27:24.305862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:24.305862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dtt5Jmuo9p7HPS96OkvTQ1OmX6ziyzW9TWEc3WUt2TBoPqpMb/DLx/gQdefg2Pjhds6qMM7iVc4Slc37e3IICg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:24.306514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45bdbf9790008b507033f1834000d3b06f0f8d5aed145e2273dde361088c3bcc","sha256:afbb66922270d91b9745e6d8db7379cf93d93ead09e43c14a0ceba65a46e108c"],"state_sha256":"42fdb4bceaca5f2316d1e2221c96a140c1737f65dca610eee9ac75a3554eaf7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8mZ83HWRUkYn0VQObNJ5fMGPocXUWkmWpd7juTA5kbz7ue1ogZa0H5LlOMcqJp55ycG7PAa8sxLvtZunVZ1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T23:46:51.259963Z","bundle_sha256":"724a9bf28c2646d48886b65d8302413ebe61ff7c3e24895b93023b6a8023b325"}}