{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RIKQNC5NOFEU2R4YULOXMHPXS7","short_pith_number":"pith:RIKQNC5N","schema_version":"1.0","canonical_sha256":"8a15068bad71494d4798a2dd761df797e453d91f6607fe243fe410eb613dddd9","source":{"kind":"arxiv","id":"1611.04642","version":5},"attestation_state":"computed","paper":{"title":"Link Prediction using Embedded Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Jianfeng Gao, Ming-Wei Chang, Po-Sen Huang, Yelong Shen","submitted_at":"2016-11-14T22:54:45Z","abstract_excerpt":"Since large knowledge bases are typically incomplete, missing facts need to be inferred from observed facts in a task called knowledge base completion. The most successful approaches to this task have typically explored explicit paths through sequences of triples. These approaches have usually resorted to human-designed sampling procedures, since large knowledge graphs produce prohibitively large numbers of possible paths, most of which are uninformative. As an alternative approach, we propose performing a single, short sequence of interactive lookup operations on an embedded knowledge graph w"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1611.04642","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-11-14T22:54:45Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"db96bc44671a793602fa1aaf794b5b77726676a80e0acc6380bcefe2781ab4ca","abstract_canon_sha256":"bcb462f53b6e3de249619b49f6e661c05aa32d7aa96ba41a5c30b19f88d130b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:55.112164Z","signature_b64":"A6c5MY9qbPLE1vVkJd5bd+ndwAGssTPyzmc1KTDeIUWkrAdTG7KzPjdWpQtOW9co5w52bFow7t8ZLUE1yJQzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a15068bad71494d4798a2dd761df797e453d91f6607fe243fe410eb613dddd9","last_reissued_at":"2026-05-18T00:17:55.111394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:55.111394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Link Prediction using Embedded Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Jianfeng Gao, Ming-Wei Chang, Po-Sen Huang, Yelong Shen","submitted_at":"2016-11-14T22:54:45Z","abstract_excerpt":"Since large knowledge bases are typically incomplete, missing facts need to be inferred from observed facts in a task called knowledge base completion. The most successful approaches to this task have typically explored explicit paths through sequences of triples. These approaches have usually resorted to human-designed sampling procedures, since large knowledge graphs produce prohibitively large numbers of possible paths, most of which are uninformative. As an alternative approach, we propose performing a single, short sequence of interactive lookup operations on an embedded knowledge graph w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04642","kind":"arxiv","version":5},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.04642","created_at":"2026-05-18T00:17:55.111528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.04642v5","created_at":"2026-05-18T00:17:55.111528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04642","created_at":"2026-05-18T00:17:55.111528+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIKQNC5NOFEU","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIKQNC5NOFEU2R4Y","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIKQNC5N","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RIKQNC5NOFEU2R4YULOXMHPXS7","json":"https://pith.science/pith/RIKQNC5NOFEU2R4YULOXMHPXS7.json","graph_json":"https://pith.science/api/pith-number/RIKQNC5NOFEU2R4YULOXMHPXS7/graph.json","events_json":"https://pith.science/api/pith-number/RIKQNC5NOFEU2R4YULOXMHPXS7/events.json","paper":"https://pith.science/paper/RIKQNC5N"},"agent_actions":{"view_html":"https://pith.science/pith/RIKQNC5NOFEU2R4YULOXMHPXS7","download_json":"https://pith.science/pith/RIKQNC5NOFEU2R4YULOXMHPXS7.json","view_paper":"https://pith.science/paper/RIKQNC5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.04642&json=true","fetch_graph":"https://pith.science/api/pith-number/RIKQNC5NOFEU2R4YULOXMHPXS7/graph.json","fetch_events":"https://pith.science/api/pith-number/RIKQNC5NOFEU2R4YULOXMHPXS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIKQNC5NOFEU2R4YULOXMHPXS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIKQNC5NOFEU2R4YULOXMHPXS7/action/storage_attestation","attest_author":"https://pith.science/pith/RIKQNC5NOFEU2R4YULOXMHPXS7/action/author_attestation","sign_citation":"https://pith.science/pith/RIKQNC5NOFEU2R4YULOXMHPXS7/action/citation_signature","submit_replication":"https://pith.science/pith/RIKQNC5NOFEU2R4YULOXMHPXS7/action/replication_record"}},"created_at":"2026-05-18T00:17:55.111528+00:00","updated_at":"2026-05-18T00:17:55.111528+00:00"}