{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LDCPNFHL7Z3QF6AR3RJIAPUMUC","short_pith_number":"pith:LDCPNFHL","canonical_record":{"source":{"id":"1407.7930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-30T03:22:51Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"e520da5b0fac9f265a81f0c39fa4b192a1d1d05f002e745c1bced7e02e1eaff0","abstract_canon_sha256":"c2d45c5b70ea4c24bb7e66d241209481483d1797310e9b75f97bda9438646062"},"schema_version":"1.0"},"canonical_sha256":"58c4f694ebfe7702f811dc52803e8ca092a4c58d7550c0eb27c2903bb6b45475","source":{"kind":"arxiv","id":"1407.7930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7930","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7930v1","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7930","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"LDCPNFHL7Z3Q","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"LDCPNFHL7Z3QF6AR","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"LDCPNFHL","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LDCPNFHL7Z3QF6AR3RJIAPUMUC","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-30T03:22:51Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"e520da5b0fac9f265a81f0c39fa4b192a1d1d05f002e745c1bced7e02e1eaff0","abstract_canon_sha256":"c2d45c5b70ea4c24bb7e66d241209481483d1797310e9b75f97bda9438646062"},"schema_version":"1.0"},"canonical_sha256":"58c4f694ebfe7702f811dc52803e8ca092a4c58d7550c0eb27c2903bb6b45475","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:14.123392Z","signature_b64":"WLPWn5QTQqR4M06pTTZlFlz4gSciaGj/WBI2J3hMuYj8miWeDZ1gFxSdwVvEmhPPES6JiLCJi8c9mqES+kKQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58c4f694ebfe7702f811dc52803e8ca092a4c58d7550c0eb27c2903bb6b45475","last_reissued_at":"2026-05-18T02:46:14.122744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:14.122744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7930","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-18T02:46:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TkxF7G2vdd95flkrBT/03v9h4l7QkQ5d1A8If2MOAsMpwiUOWH3qEhUG5pmmPMpEu07eCTjnl6MF4bbwts7zBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:52:41.396669Z"},"content_sha256":"c75184dd77bfc436d8d8d156bb148ff335dd36cd02ec30eedd5c926ef2d005e1","schema_version":"1.0","event_id":"sha256:c75184dd77bfc436d8d8d156bb148ff335dd36cd02ec30eedd5c926ef2d005e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LDCPNFHL7Z3QF6AR3RJIAPUMUC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entity-Linking via Graph-Distance Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Andrea Marino (Dipartimento di informatica, Paolo Boldi (Dipartimento di informatica, Roi Blanco (Yahoo! Research Barcelona, Spain), Universit\\`a degli Studi di Milano)","submitted_at":"2014-07-30T03:22:51Z","abstract_excerpt":"Entity-linking is a natural-language-processing task that consists in identifying the entities mentioned in a piece of text, linking each to an appropriate item in some knowledge base; when the knowledge base is Wikipedia, the problem comes to be known as wikification (in this case, items are wikipedia articles). One instance of entity-linking can be formalized as an optimization problem on the underlying concept graph, where the quantity to be optimized is the average distance between chosen items. Inspired by this application, we define a new graph problem which is a natural variant of the M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7930","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-18T02:46:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FOmMAPXF2z9QCnBP5VOtrX4fqlrDt8ix0QCOgrmxjOpUw6mgzEeFuGX556pWIJfuvTVWyxqiiE6KvhcYVqjXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:52:41.397027Z"},"content_sha256":"8ed748335a9760e78b91894818f5f646c4850154c47c131e274741717ba8eede","schema_version":"1.0","event_id":"sha256:8ed748335a9760e78b91894818f5f646c4850154c47c131e274741717ba8eede"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDCPNFHL7Z3QF6AR3RJIAPUMUC/bundle.json","state_url":"https://pith.science/pith/LDCPNFHL7Z3QF6AR3RJIAPUMUC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDCPNFHL7Z3QF6AR3RJIAPUMUC/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-03T05:52:41Z","links":{"resolver":"https://pith.science/pith/LDCPNFHL7Z3QF6AR3RJIAPUMUC","bundle":"https://pith.science/pith/LDCPNFHL7Z3QF6AR3RJIAPUMUC/bundle.json","state":"https://pith.science/pith/LDCPNFHL7Z3QF6AR3RJIAPUMUC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDCPNFHL7Z3QF6AR3RJIAPUMUC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LDCPNFHL7Z3QF6AR3RJIAPUMUC","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":"c2d45c5b70ea4c24bb7e66d241209481483d1797310e9b75f97bda9438646062","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-30T03:22:51Z","title_canon_sha256":"e520da5b0fac9f265a81f0c39fa4b192a1d1d05f002e745c1bced7e02e1eaff0"},"schema_version":"1.0","source":{"id":"1407.7930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7930","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7930v1","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7930","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"LDCPNFHL7Z3Q","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"LDCPNFHL7Z3QF6AR","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"LDCPNFHL","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:8ed748335a9760e78b91894818f5f646c4850154c47c131e274741717ba8eede","target":"graph","created_at":"2026-05-18T02:46:14Z","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":"Entity-linking is a natural-language-processing task that consists in identifying the entities mentioned in a piece of text, linking each to an appropriate item in some knowledge base; when the knowledge base is Wikipedia, the problem comes to be known as wikification (in this case, items are wikipedia articles). One instance of entity-linking can be formalized as an optimization problem on the underlying concept graph, where the quantity to be optimized is the average distance between chosen items. Inspired by this application, we define a new graph problem which is a natural variant of the M","authors_text":"Andrea Marino (Dipartimento di informatica, Paolo Boldi (Dipartimento di informatica, Roi Blanco (Yahoo! Research Barcelona, Spain), Universit\\`a degli Studi di Milano)","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-30T03:22:51Z","title":"Entity-Linking via Graph-Distance Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7930","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:c75184dd77bfc436d8d8d156bb148ff335dd36cd02ec30eedd5c926ef2d005e1","target":"record","created_at":"2026-05-18T02:46:14Z","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":"c2d45c5b70ea4c24bb7e66d241209481483d1797310e9b75f97bda9438646062","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-30T03:22:51Z","title_canon_sha256":"e520da5b0fac9f265a81f0c39fa4b192a1d1d05f002e745c1bced7e02e1eaff0"},"schema_version":"1.0","source":{"id":"1407.7930","kind":"arxiv","version":1}},"canonical_sha256":"58c4f694ebfe7702f811dc52803e8ca092a4c58d7550c0eb27c2903bb6b45475","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58c4f694ebfe7702f811dc52803e8ca092a4c58d7550c0eb27c2903bb6b45475","first_computed_at":"2026-05-18T02:46:14.122744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:14.122744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WLPWn5QTQqR4M06pTTZlFlz4gSciaGj/WBI2J3hMuYj8miWeDZ1gFxSdwVvEmhPPES6JiLCJi8c9mqES+kKQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:14.123392Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c75184dd77bfc436d8d8d156bb148ff335dd36cd02ec30eedd5c926ef2d005e1","sha256:8ed748335a9760e78b91894818f5f646c4850154c47c131e274741717ba8eede"],"state_sha256":"ed0b27d411c43986e7501787ac389927238fd49b8b81fbc847c730a24235b6fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uptyX2RsDVYihIE36hvi8TMO2bCAmp9DEmwfw4LUwsRGXmQE/lWrAcqe5W17psgU3JqIBke4JFm+eYa8Jq7dCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:52:41.399045Z","bundle_sha256":"22466c481a31730da392567c08551a1a1c92f179bde53e70b9c46e2193ff6d88"}}