{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UVM5VTX4RDOBTA27KCDHABNOF5","short_pith_number":"pith:UVM5VTX4","canonical_record":{"source":{"id":"1709.05666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-17T14:20:05Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"b1a7ce23b3bf0798fd95066ee3aeeeac3ee286587d45d531c33eeec11b2bf9fa","abstract_canon_sha256":"7ab294e8c6e509ddc1cb43ac1827d7148efa1993c66e47d02891004e30cf8b8e"},"schema_version":"1.0"},"canonical_sha256":"a559dacefc88dc19835f50867005ae2f71b349473f9418f3ec1650cf89c6b29b","source":{"kind":"arxiv","id":"1709.05666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05666","created_at":"2026-05-18T00:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05666v1","created_at":"2026-05-18T00:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05666","created_at":"2026-05-18T00:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"UVM5VTX4RDOB","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UVM5VTX4RDOBTA27","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UVM5VTX4","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UVM5VTX4RDOBTA27KCDHABNOF5","target":"record","payload":{"canonical_record":{"source":{"id":"1709.05666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-17T14:20:05Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"b1a7ce23b3bf0798fd95066ee3aeeeac3ee286587d45d531c33eeec11b2bf9fa","abstract_canon_sha256":"7ab294e8c6e509ddc1cb43ac1827d7148efa1993c66e47d02891004e30cf8b8e"},"schema_version":"1.0"},"canonical_sha256":"a559dacefc88dc19835f50867005ae2f71b349473f9418f3ec1650cf89c6b29b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:59.893836Z","signature_b64":"jgn8ELLTAcsvl5Hb7E0EhP5H/JdFae3M4i5ZLyvT8JkTgyMaVEG4ed1maIwgGXrbQmmkvpFVqElKSFPZ8CvZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a559dacefc88dc19835f50867005ae2f71b349473f9418f3ec1650cf89c6b29b","last_reissued_at":"2026-05-18T00:34:59.893042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:59.893042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.05666","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:34:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/4BuOtVcHmiHCrkU24hNDbC6Yj6zCNT3PGNwJZVUIFq8koGo+9ZMS6e0KtPvcuCAxelTPS1dUoagSwLq3SR+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:35:00.541775Z"},"content_sha256":"d999a921866335938b5459c90175a83f0551237bf55fd49e38a533cc21a5cee9","schema_version":"1.0","event_id":"sha256:d999a921866335938b5459c90175a83f0551237bf55fd49e38a533cc21a5cee9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UVM5VTX4RDOBTA27KCDHABNOF5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Inductive Abilities of Latent Factor Models for Relational Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Christopher R. Dance, \\'Eric Gaussier, Guillaume Bouchard, Th\\'eo Trouillon","submitted_at":"2017-09-17T14:20:05Z","abstract_excerpt":"Latent factor models are increasingly popular for modeling multi-relational knowledge graphs. By their vectorial nature, it is not only hard to interpret why this class of models works so well, but also to understand where they fail and how they might be improved. We conduct an experimental survey of state-of-the-art models, not towards a purely comparative end, but as a means to get insight about their inductive abilities. To assess the strengths and weaknesses of each model, we create simple tasks that exhibit first, atomic properties of binary relations, and then, common inter-relational in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05666","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:34:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M4rtNaAn2W9GyJOoVl9lRe2G179++uCTX+pQLUTSWMC7zBN4OoPIkD+eYHGM5d/kfw2QtInblFbrlrTFJ9u4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:35:00.542138Z"},"content_sha256":"60d965c1611486999898fe25a601e43e0c0631b87bbf6322aa436ceb11dc2349","schema_version":"1.0","event_id":"sha256:60d965c1611486999898fe25a601e43e0c0631b87bbf6322aa436ceb11dc2349"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVM5VTX4RDOBTA27KCDHABNOF5/bundle.json","state_url":"https://pith.science/pith/UVM5VTX4RDOBTA27KCDHABNOF5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVM5VTX4RDOBTA27KCDHABNOF5/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-02T17:35:00Z","links":{"resolver":"https://pith.science/pith/UVM5VTX4RDOBTA27KCDHABNOF5","bundle":"https://pith.science/pith/UVM5VTX4RDOBTA27KCDHABNOF5/bundle.json","state":"https://pith.science/pith/UVM5VTX4RDOBTA27KCDHABNOF5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVM5VTX4RDOBTA27KCDHABNOF5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UVM5VTX4RDOBTA27KCDHABNOF5","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":"7ab294e8c6e509ddc1cb43ac1827d7148efa1993c66e47d02891004e30cf8b8e","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-17T14:20:05Z","title_canon_sha256":"b1a7ce23b3bf0798fd95066ee3aeeeac3ee286587d45d531c33eeec11b2bf9fa"},"schema_version":"1.0","source":{"id":"1709.05666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05666","created_at":"2026-05-18T00:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05666v1","created_at":"2026-05-18T00:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05666","created_at":"2026-05-18T00:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"UVM5VTX4RDOB","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UVM5VTX4RDOBTA27","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UVM5VTX4","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:60d965c1611486999898fe25a601e43e0c0631b87bbf6322aa436ceb11dc2349","target":"graph","created_at":"2026-05-18T00:34:59Z","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":"Latent factor models are increasingly popular for modeling multi-relational knowledge graphs. By their vectorial nature, it is not only hard to interpret why this class of models works so well, but also to understand where they fail and how they might be improved. We conduct an experimental survey of state-of-the-art models, not towards a purely comparative end, but as a means to get insight about their inductive abilities. To assess the strengths and weaknesses of each model, we create simple tasks that exhibit first, atomic properties of binary relations, and then, common inter-relational in","authors_text":"Christopher R. Dance, \\'Eric Gaussier, Guillaume Bouchard, Th\\'eo Trouillon","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-17T14:20:05Z","title":"On Inductive Abilities of Latent Factor Models for Relational Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05666","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:d999a921866335938b5459c90175a83f0551237bf55fd49e38a533cc21a5cee9","target":"record","created_at":"2026-05-18T00:34:59Z","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":"7ab294e8c6e509ddc1cb43ac1827d7148efa1993c66e47d02891004e30cf8b8e","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-17T14:20:05Z","title_canon_sha256":"b1a7ce23b3bf0798fd95066ee3aeeeac3ee286587d45d531c33eeec11b2bf9fa"},"schema_version":"1.0","source":{"id":"1709.05666","kind":"arxiv","version":1}},"canonical_sha256":"a559dacefc88dc19835f50867005ae2f71b349473f9418f3ec1650cf89c6b29b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a559dacefc88dc19835f50867005ae2f71b349473f9418f3ec1650cf89c6b29b","first_computed_at":"2026-05-18T00:34:59.893042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:59.893042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jgn8ELLTAcsvl5Hb7E0EhP5H/JdFae3M4i5ZLyvT8JkTgyMaVEG4ed1maIwgGXrbQmmkvpFVqElKSFPZ8CvZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:59.893836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d999a921866335938b5459c90175a83f0551237bf55fd49e38a533cc21a5cee9","sha256:60d965c1611486999898fe25a601e43e0c0631b87bbf6322aa436ceb11dc2349"],"state_sha256":"cffa97313239fbf0f3aa703effd3086102c410b5ac0d2d10166586816268a51d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0vFFWRiVzm3G9qTifN/6Zp/X4s2qcQslwiduFEiynBXf/MidTRpD/rpMUx6cqo8oD6zkY2zVqHK00I+c/IGGDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:35:00.544401Z","bundle_sha256":"1c3d6d9660a697e968448c4263888285885a527411602f8307866254c7981e1f"}}