{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TLZ47XXOCGKYTNBLMMULLCBUVS","short_pith_number":"pith:TLZ47XXO","canonical_record":{"source":{"id":"1810.07180","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-17T14:09:10Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"eb720ac2d528d52819e878334a5657769f48d91592a640524a0dac55c9abf80b","abstract_canon_sha256":"8caf64c5d001cadccbb60719fc67e074f44ff8bf5486443cf9da7f588696f901"},"schema_version":"1.0"},"canonical_sha256":"9af3cfdeee119589b42b6328b58834ac96f1d6a8834d48cab87b6250406ef97e","source":{"kind":"arxiv","id":"1810.07180","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07180","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07180v4","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07180","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"TLZ47XXOCGKY","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TLZ47XXOCGKYTNBL","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TLZ47XXO","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TLZ47XXOCGKYTNBLMMULLCBUVS","target":"record","payload":{"canonical_record":{"source":{"id":"1810.07180","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-17T14:09:10Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"eb720ac2d528d52819e878334a5657769f48d91592a640524a0dac55c9abf80b","abstract_canon_sha256":"8caf64c5d001cadccbb60719fc67e074f44ff8bf5486443cf9da7f588696f901"},"schema_version":"1.0"},"canonical_sha256":"9af3cfdeee119589b42b6328b58834ac96f1d6a8834d48cab87b6250406ef97e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:58.863131Z","signature_b64":"uczoaqzXttC9fVayxkZo83Cmnpq/pM1NlkVZOjoMLp4omojxN6szaA+vipZ5hc19xx7E9nFsKnB4J003IhXxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9af3cfdeee119589b42b6328b58834ac96f1d6a8834d48cab87b6250406ef97e","last_reissued_at":"2026-05-17T23:54:58.862604Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:58.862604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.07180","source_version":4,"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-17T23:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yyz24Q1/DZ+TiKYxpDHZRqy3QIOfjw/R9hnLTBqYMnEfeP9a0SEMV9dmg3hdXwpLKZnXicCK85SokHZWejwRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:32:31.842046Z"},"content_sha256":"9748c1918614bf0919df846844f38e78ec22841cf8c2f948b383bf5c2f6030ce","schema_version":"1.0","event_id":"sha256:9748c1918614bf0919df846844f38e78ec22841cf8c2f948b383bf5c2f6030ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TLZ47XXOCGKYTNBLMMULLCBUVS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Evaluating Embedding Models for Knowledge Base Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Christian Meilicke, Daniel Ruffinelli, Rainer Gemulla, Samuel Broscheit, Yanjie Wang","submitted_at":"2018-10-17T14:09:10Z","abstract_excerpt":"Knowledge bases contribute to many web search and mining tasks, yet they are often incomplete. To add missing facts to a given knowledge base, various embedding models have been proposed in the recent literature. Perhaps surprisingly, relatively simple models with limited expressiveness often performed remarkably well under today's most commonly used evaluation protocols. In this paper, we explore whether recent models work well for knowledge base completion and argue that the current evaluation protocols are more suited for question answering rather than knowledge base completion. We show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07180","kind":"arxiv","version":4},"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-17T23:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5mqqH2tFJFvn62w/47NPPbMKxjE7nKjti20qYBeL99cJrUrIdfwdaFPpR2nNmpt5h4CxSaHSAktoK9bnbp6cCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:32:31.842726Z"},"content_sha256":"92a24a760dd752d6fd231ed3c05a50043165aba4ca12a4a25d36e29e73602ad7","schema_version":"1.0","event_id":"sha256:92a24a760dd752d6fd231ed3c05a50043165aba4ca12a4a25d36e29e73602ad7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLZ47XXOCGKYTNBLMMULLCBUVS/bundle.json","state_url":"https://pith.science/pith/TLZ47XXOCGKYTNBLMMULLCBUVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLZ47XXOCGKYTNBLMMULLCBUVS/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-07T17:32:31Z","links":{"resolver":"https://pith.science/pith/TLZ47XXOCGKYTNBLMMULLCBUVS","bundle":"https://pith.science/pith/TLZ47XXOCGKYTNBLMMULLCBUVS/bundle.json","state":"https://pith.science/pith/TLZ47XXOCGKYTNBLMMULLCBUVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLZ47XXOCGKYTNBLMMULLCBUVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TLZ47XXOCGKYTNBLMMULLCBUVS","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":"8caf64c5d001cadccbb60719fc67e074f44ff8bf5486443cf9da7f588696f901","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-17T14:09:10Z","title_canon_sha256":"eb720ac2d528d52819e878334a5657769f48d91592a640524a0dac55c9abf80b"},"schema_version":"1.0","source":{"id":"1810.07180","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07180","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07180v4","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07180","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"TLZ47XXOCGKY","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TLZ47XXOCGKYTNBL","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TLZ47XXO","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:92a24a760dd752d6fd231ed3c05a50043165aba4ca12a4a25d36e29e73602ad7","target":"graph","created_at":"2026-05-17T23:54:58Z","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 bases contribute to many web search and mining tasks, yet they are often incomplete. To add missing facts to a given knowledge base, various embedding models have been proposed in the recent literature. Perhaps surprisingly, relatively simple models with limited expressiveness often performed remarkably well under today's most commonly used evaluation protocols. In this paper, we explore whether recent models work well for knowledge base completion and argue that the current evaluation protocols are more suited for question answering rather than knowledge base completion. We show tha","authors_text":"Christian Meilicke, Daniel Ruffinelli, Rainer Gemulla, Samuel Broscheit, Yanjie Wang","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-17T14:09:10Z","title":"On Evaluating Embedding Models for Knowledge Base Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07180","kind":"arxiv","version":4},"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:9748c1918614bf0919df846844f38e78ec22841cf8c2f948b383bf5c2f6030ce","target":"record","created_at":"2026-05-17T23:54:58Z","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":"8caf64c5d001cadccbb60719fc67e074f44ff8bf5486443cf9da7f588696f901","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-17T14:09:10Z","title_canon_sha256":"eb720ac2d528d52819e878334a5657769f48d91592a640524a0dac55c9abf80b"},"schema_version":"1.0","source":{"id":"1810.07180","kind":"arxiv","version":4}},"canonical_sha256":"9af3cfdeee119589b42b6328b58834ac96f1d6a8834d48cab87b6250406ef97e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9af3cfdeee119589b42b6328b58834ac96f1d6a8834d48cab87b6250406ef97e","first_computed_at":"2026-05-17T23:54:58.862604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:58.862604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uczoaqzXttC9fVayxkZo83Cmnpq/pM1NlkVZOjoMLp4omojxN6szaA+vipZ5hc19xx7E9nFsKnB4J003IhXxAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:58.863131Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07180","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9748c1918614bf0919df846844f38e78ec22841cf8c2f948b383bf5c2f6030ce","sha256:92a24a760dd752d6fd231ed3c05a50043165aba4ca12a4a25d36e29e73602ad7"],"state_sha256":"ba182c55d57698dd2a60320e66c403cfd74541a242bd123188dd670a6724acb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UUac9Ebh6u0Ax4bsL/i/vHRSPRyCFCyxd757cmbiY3XiJwnpprsoV10rskJmB/tEvGllKohZYnt33LcHSp66Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:32:31.846533Z","bundle_sha256":"3682897d846317d96b82bf067da55dd57d1236ed973bf9ece2445ff5de98f2c3"}}