{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:B4PACQNPFP5ZBSU2GLHNTFZOEW","short_pith_number":"pith:B4PACQNP","canonical_record":{"source":{"id":"1711.05401","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-15T04:12:27Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"1f7c8e6b810c9787c93d40fd2b187f6bd8dcfa88ffba2a1c9199de2f8ccfe040","abstract_canon_sha256":"8403e83231d5b3563b306316349caf43d97091499b9888c8e4ec99fd00830d89"},"schema_version":"1.0"},"canonical_sha256":"0f1e0141af2bfb90ca9a32ced9972e258e99f5824acd6e15945f224df1684ae3","source":{"kind":"arxiv","id":"1711.05401","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05401","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05401v3","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05401","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"pith_short_12","alias_value":"B4PACQNPFP5Z","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B4PACQNPFP5ZBSU2","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B4PACQNP","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:B4PACQNPFP5ZBSU2GLHNTFZOEW","target":"record","payload":{"canonical_record":{"source":{"id":"1711.05401","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-15T04:12:27Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"1f7c8e6b810c9787c93d40fd2b187f6bd8dcfa88ffba2a1c9199de2f8ccfe040","abstract_canon_sha256":"8403e83231d5b3563b306316349caf43d97091499b9888c8e4ec99fd00830d89"},"schema_version":"1.0"},"canonical_sha256":"0f1e0141af2bfb90ca9a32ced9972e258e99f5824acd6e15945f224df1684ae3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:35.986687Z","signature_b64":"43WX+r5ymJv2fYNW20OepTcSmH39gDdYRcJIwHZsceVJPnMOxUHMmRddXCfVoDFt1w/MzCG3TigG7s1KOMKeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f1e0141af2bfb90ca9a32ced9972e258e99f5824acd6e15945f224df1684ae3","last_reissued_at":"2026-05-18T00:26:35.985974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:35.985974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.05401","source_version":3,"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:26:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"az7wG3B2MIevMYINob6fXM5liPWWhQFOT5BD5IM+USsSUUI3bhVovl01+JGAArAKwdYskAWHc32LuxBXP9HxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:17:14.589549Z"},"content_sha256":"6de7708303a0240df0b99bed220d62ff3eacb479fb3f8f3d2ab1f2b1a45e81cc","schema_version":"1.0","event_id":"sha256:6de7708303a0240df0b99bed220d62ff3eacb479fb3f8f3d2ab1f2b1a45e81cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:B4PACQNPFP5ZBSU2GLHNTFZOEW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting Simple Neural Networks for Learning Representations of Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Chandrahas, Partha Pratim Talukdar, Srinivas Ravishankar","submitted_at":"2017-11-15T04:12:27Z","abstract_excerpt":"We address the problem of learning vector representations for entities and relations in Knowledge Graphs (KGs) for Knowledge Base Completion (KBC). This problem has received significant attention in the past few years and multiple methods have been proposed. Most of the existing methods in the literature use a predefined characteristic scoring function for evaluating the correctness of KG triples. These scoring functions distinguish correct triples (high score) from incorrect ones (low score). However, their performance vary across different datasets. In this work, we demonstrate that a simple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05401","kind":"arxiv","version":3},"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:26:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UHKeIFd3M7uzPpgQKn5RO8nvGyf/lfbO387e8yHSwqdw2Yxe5ApkupmObyQUvPEwh/xatcy1hPJ2YS0r6IVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:17:14.589895Z"},"content_sha256":"d7c7200e56e2a0c4d68f9b3daa7ee4641ff008fe29f5ebe28cdaacdce7d25804","schema_version":"1.0","event_id":"sha256:d7c7200e56e2a0c4d68f9b3daa7ee4641ff008fe29f5ebe28cdaacdce7d25804"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4PACQNPFP5ZBSU2GLHNTFZOEW/bundle.json","state_url":"https://pith.science/pith/B4PACQNPFP5ZBSU2GLHNTFZOEW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4PACQNPFP5ZBSU2GLHNTFZOEW/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-20T14:17:14Z","links":{"resolver":"https://pith.science/pith/B4PACQNPFP5ZBSU2GLHNTFZOEW","bundle":"https://pith.science/pith/B4PACQNPFP5ZBSU2GLHNTFZOEW/bundle.json","state":"https://pith.science/pith/B4PACQNPFP5ZBSU2GLHNTFZOEW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4PACQNPFP5ZBSU2GLHNTFZOEW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B4PACQNPFP5ZBSU2GLHNTFZOEW","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":"8403e83231d5b3563b306316349caf43d97091499b9888c8e4ec99fd00830d89","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-15T04:12:27Z","title_canon_sha256":"1f7c8e6b810c9787c93d40fd2b187f6bd8dcfa88ffba2a1c9199de2f8ccfe040"},"schema_version":"1.0","source":{"id":"1711.05401","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05401","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05401v3","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05401","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"pith_short_12","alias_value":"B4PACQNPFP5Z","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B4PACQNPFP5ZBSU2","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B4PACQNP","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:d7c7200e56e2a0c4d68f9b3daa7ee4641ff008fe29f5ebe28cdaacdce7d25804","target":"graph","created_at":"2026-05-18T00:26:35Z","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":"We address the problem of learning vector representations for entities and relations in Knowledge Graphs (KGs) for Knowledge Base Completion (KBC). This problem has received significant attention in the past few years and multiple methods have been proposed. Most of the existing methods in the literature use a predefined characteristic scoring function for evaluating the correctness of KG triples. These scoring functions distinguish correct triples (high score) from incorrect ones (low score). However, their performance vary across different datasets. In this work, we demonstrate that a simple","authors_text":"Chandrahas, Partha Pratim Talukdar, Srinivas Ravishankar","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-15T04:12:27Z","title":"Revisiting Simple Neural Networks for Learning Representations of Knowledge Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05401","kind":"arxiv","version":3},"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:6de7708303a0240df0b99bed220d62ff3eacb479fb3f8f3d2ab1f2b1a45e81cc","target":"record","created_at":"2026-05-18T00:26:35Z","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":"8403e83231d5b3563b306316349caf43d97091499b9888c8e4ec99fd00830d89","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-15T04:12:27Z","title_canon_sha256":"1f7c8e6b810c9787c93d40fd2b187f6bd8dcfa88ffba2a1c9199de2f8ccfe040"},"schema_version":"1.0","source":{"id":"1711.05401","kind":"arxiv","version":3}},"canonical_sha256":"0f1e0141af2bfb90ca9a32ced9972e258e99f5824acd6e15945f224df1684ae3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f1e0141af2bfb90ca9a32ced9972e258e99f5824acd6e15945f224df1684ae3","first_computed_at":"2026-05-18T00:26:35.985974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:35.985974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"43WX+r5ymJv2fYNW20OepTcSmH39gDdYRcJIwHZsceVJPnMOxUHMmRddXCfVoDFt1w/MzCG3TigG7s1KOMKeBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:35.986687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.05401","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6de7708303a0240df0b99bed220d62ff3eacb479fb3f8f3d2ab1f2b1a45e81cc","sha256:d7c7200e56e2a0c4d68f9b3daa7ee4641ff008fe29f5ebe28cdaacdce7d25804"],"state_sha256":"9cbdf7a3178823280e05a98613989b2a2d1beeb569a0fc454b5d1b89d87b2062"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IEKmWUH60UqxA9Pkl5ZZd6ih0RKIKSrGJtaiCxtv9g7ukWYU6vhMF78D+dTr5Gsb5E3IM30/sYFBSXbUbu6lDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T14:17:14.591815Z","bundle_sha256":"c79ea9e63de9284288d1f647ce5a86d430972cd82dd7ebe8f236e5e8144e99f3"}}