{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:G4H3NDUNNEOPWDCNGQBL2RCAS2","short_pith_number":"pith:G4H3NDUN","canonical_record":{"source":{"id":"1708.06816","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-22T20:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"c837f1e60d289f4bfca0f41afd97c466801f2de13562f41e5da57db98e5584f0","abstract_canon_sha256":"1ce5670dce869ed78fb3115c1cc158671d202405335f0ed7694712e9c77831c7"},"schema_version":"1.0"},"canonical_sha256":"370fb68e8d691cfb0c4d3402bd444096a4baffdc3521ab6c68a27be67f83519f","source":{"kind":"arxiv","id":"1708.06816","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06816","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06816v2","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06816","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"G4H3NDUNNEOP","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G4H3NDUNNEOPWDCN","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G4H3NDUN","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:G4H3NDUNNEOPWDCNGQBL2RCAS2","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06816","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-22T20:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"c837f1e60d289f4bfca0f41afd97c466801f2de13562f41e5da57db98e5584f0","abstract_canon_sha256":"1ce5670dce869ed78fb3115c1cc158671d202405335f0ed7694712e9c77831c7"},"schema_version":"1.0"},"canonical_sha256":"370fb68e8d691cfb0c4d3402bd444096a4baffdc3521ab6c68a27be67f83519f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:10.772855Z","signature_b64":"KBTvf10WdJSMWgJniijF1zt4doUKq0LDRvO5E1ajkb52kuwi58wjJpWpj3QboGnZaSMHPRCGdXtTOhfALXZTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"370fb68e8d691cfb0c4d3402bd444096a4baffdc3521ab6c68a27be67f83519f","last_reissued_at":"2026-05-18T00:22:10.772302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:10.772302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06816","source_version":2,"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:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v+Tp/qEQYIX4r5tDJwswKJ2+NqFnsl7qFGD/R7uBp+iI8VrxyM2sZwVWF3jmUQYWpKYezcHayHM3HY41xdQeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:38:29.027704Z"},"content_sha256":"52dcabd3bfa8876d5de847227fe0b989e9c285f6421933ea39e18a4fb923943a","schema_version":"1.0","event_id":"sha256:52dcabd3bfa8876d5de847227fe0b989e9c285f6421933ea39e18a4fb923943a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:G4H3NDUNNEOPWDCNGQBL2RCAS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of the Impact of Negative Sampling on Link Prediction in Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bhushan Kotnis, Vivi Nastase","submitted_at":"2017-08-22T20:53:29Z","abstract_excerpt":"Knowledge graphs are large, useful, but incomplete knowledge repositories. They encode knowledge through entities and relations which define each other through the connective structure of the graph. This has inspired methods for the joint embedding of entities and relations in continuous low-dimensional vector spaces, that can be used to induce new edges in the graph, i.e., link prediction in knowledge graphs. Learning these representations relies on contrasting positive instances with negative ones. Knowledge graphs include only positive relation instances, leaving the door open for a variety"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06816","kind":"arxiv","version":2},"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:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90tkXzFMzjH1m59VSpqXnV/KGfypzfEmVLUzOBXn1u1s2dB0cIyJrDZ2BocrHAnM44t25960G1iHzbQ9RJWYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:38:29.028361Z"},"content_sha256":"020e4d22660fa654459e6b836cdf84ff8d8a878d0ad91cfd6b7f9374bba24e13","schema_version":"1.0","event_id":"sha256:020e4d22660fa654459e6b836cdf84ff8d8a878d0ad91cfd6b7f9374bba24e13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4H3NDUNNEOPWDCNGQBL2RCAS2/bundle.json","state_url":"https://pith.science/pith/G4H3NDUNNEOPWDCNGQBL2RCAS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4H3NDUNNEOPWDCNGQBL2RCAS2/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-05-24T21:38:29Z","links":{"resolver":"https://pith.science/pith/G4H3NDUNNEOPWDCNGQBL2RCAS2","bundle":"https://pith.science/pith/G4H3NDUNNEOPWDCNGQBL2RCAS2/bundle.json","state":"https://pith.science/pith/G4H3NDUNNEOPWDCNGQBL2RCAS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4H3NDUNNEOPWDCNGQBL2RCAS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:G4H3NDUNNEOPWDCNGQBL2RCAS2","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":"1ce5670dce869ed78fb3115c1cc158671d202405335f0ed7694712e9c77831c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-22T20:53:29Z","title_canon_sha256":"c837f1e60d289f4bfca0f41afd97c466801f2de13562f41e5da57db98e5584f0"},"schema_version":"1.0","source":{"id":"1708.06816","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06816","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06816v2","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06816","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"G4H3NDUNNEOP","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G4H3NDUNNEOPWDCN","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G4H3NDUN","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:020e4d22660fa654459e6b836cdf84ff8d8a878d0ad91cfd6b7f9374bba24e13","target":"graph","created_at":"2026-05-18T00:22:10Z","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 graphs are large, useful, but incomplete knowledge repositories. They encode knowledge through entities and relations which define each other through the connective structure of the graph. This has inspired methods for the joint embedding of entities and relations in continuous low-dimensional vector spaces, that can be used to induce new edges in the graph, i.e., link prediction in knowledge graphs. Learning these representations relies on contrasting positive instances with negative ones. Knowledge graphs include only positive relation instances, leaving the door open for a variety","authors_text":"Bhushan Kotnis, Vivi Nastase","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-22T20:53:29Z","title":"Analysis of the Impact of Negative Sampling on Link Prediction in Knowledge Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06816","kind":"arxiv","version":2},"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:52dcabd3bfa8876d5de847227fe0b989e9c285f6421933ea39e18a4fb923943a","target":"record","created_at":"2026-05-18T00:22:10Z","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":"1ce5670dce869ed78fb3115c1cc158671d202405335f0ed7694712e9c77831c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-22T20:53:29Z","title_canon_sha256":"c837f1e60d289f4bfca0f41afd97c466801f2de13562f41e5da57db98e5584f0"},"schema_version":"1.0","source":{"id":"1708.06816","kind":"arxiv","version":2}},"canonical_sha256":"370fb68e8d691cfb0c4d3402bd444096a4baffdc3521ab6c68a27be67f83519f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"370fb68e8d691cfb0c4d3402bd444096a4baffdc3521ab6c68a27be67f83519f","first_computed_at":"2026-05-18T00:22:10.772302Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:10.772302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KBTvf10WdJSMWgJniijF1zt4doUKq0LDRvO5E1ajkb52kuwi58wjJpWpj3QboGnZaSMHPRCGdXtTOhfALXZTBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:10.772855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06816","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52dcabd3bfa8876d5de847227fe0b989e9c285f6421933ea39e18a4fb923943a","sha256:020e4d22660fa654459e6b836cdf84ff8d8a878d0ad91cfd6b7f9374bba24e13"],"state_sha256":"e0204ca18cad9b506438a6a0636747e78b09e9f12ff02f5a29ea5457462d3241"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VwwdMBe9Zd4BnwVJ/mzLo3ZztQuapvs/7f35dOqStdPoSMMa2+Gj3MWNw1rXmrYu5kH7s//NAhlg+E/u7T0YAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T21:38:29.032004Z","bundle_sha256":"34ee21228143e9950397e16c4dd2240777a50e2d274a674626894b4d5c62e23f"}}