{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VPA6HLZKMRPMQHH6VDN76XYW7S","short_pith_number":"pith:VPA6HLZK","canonical_record":{"source":{"id":"1304.1909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-06T16:18:08Z","cross_cats_sorted":[],"title_canon_sha256":"49d679628db35a312d5924ab2e1757ed715f94b91c1eb5501b2b18b9b39519af","abstract_canon_sha256":"8f4bbc0b0d90036ddc54db1638833dc787e764e80531724f0d426c85b488f6fb"},"schema_version":"1.0"},"canonical_sha256":"abc1e3af2a645ec81cfea8dbff5f16fca10103a66b03e359e1499a09129ed01f","source":{"kind":"arxiv","id":"1304.1909","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1909","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1909v1","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1909","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"pith_short_12","alias_value":"VPA6HLZKMRPM","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VPA6HLZKMRPMQHH6","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VPA6HLZK","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VPA6HLZKMRPMQHH6VDN76XYW7S","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-06T16:18:08Z","cross_cats_sorted":[],"title_canon_sha256":"49d679628db35a312d5924ab2e1757ed715f94b91c1eb5501b2b18b9b39519af","abstract_canon_sha256":"8f4bbc0b0d90036ddc54db1638833dc787e764e80531724f0d426c85b488f6fb"},"schema_version":"1.0"},"canonical_sha256":"abc1e3af2a645ec81cfea8dbff5f16fca10103a66b03e359e1499a09129ed01f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:29.956972Z","signature_b64":"bgHpmEE+pTbJM0fVrMM8ozTD94qtwM3ulJfA+UaElqkcLB5dgfE8Ot9pOx+SMUM0CSDBKt/E4kZ60onqxjrnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abc1e3af2a645ec81cfea8dbff5f16fca10103a66b03e359e1499a09129ed01f","last_reissued_at":"2026-05-18T02:38:29.956529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:29.956529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1909","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:38:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cJuSiU4Wr8DC8VaobixAmMqbNFdNd3zw64toCVJJPoSeZLeLMR3P1xE2tf1qtBaoq7RIWl8xV7KnKU7c62VyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:09:10.052863Z"},"content_sha256":"9286fb0f810e49ca38cb0452e63db8f98cc7c0e0285718787c66d9da1ec15115","schema_version":"1.0","event_id":"sha256:9286fb0f810e49ca38cb0452e63db8f98cc7c0e0285718787c66d9da1ec15115"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VPA6HLZKMRPMQHH6VDN76XYW7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Farthest-Point Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Carsten Grimm, Christoph Doell, Jean-Lou De Carufel, Kai Dannies, Michiel Smid, Prosenjit Bose, Stefan Schirra","submitted_at":"2013-04-06T16:18:08Z","abstract_excerpt":"Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shortest path distance along the network, known as the network distance. Within this metric space, we study farthest points.\n  We introduce network farthest-point diagrams, which capture how the farthest points---and the distance to them---change as we traverse the network. We preprocess a network G such that, when given a query point q on G, we can quickly determine the farthest point(s) from q in G as well as the farthes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1909","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:38:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O3ryGz74mRr9mQYaR4s1a7hb8tWhu7SPWAZEtaeTbOp757OlQl2TKkyVz40vKh8jNBmE/SvBvbDnCYRtwH3+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:09:10.053340Z"},"content_sha256":"d8e496830e0cb85d3a4aeb07193d355ccda876a0db161ba71f40d215c05a5cf3","schema_version":"1.0","event_id":"sha256:d8e496830e0cb85d3a4aeb07193d355ccda876a0db161ba71f40d215c05a5cf3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPA6HLZKMRPMQHH6VDN76XYW7S/bundle.json","state_url":"https://pith.science/pith/VPA6HLZKMRPMQHH6VDN76XYW7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPA6HLZKMRPMQHH6VDN76XYW7S/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-27T00:09:10Z","links":{"resolver":"https://pith.science/pith/VPA6HLZKMRPMQHH6VDN76XYW7S","bundle":"https://pith.science/pith/VPA6HLZKMRPMQHH6VDN76XYW7S/bundle.json","state":"https://pith.science/pith/VPA6HLZKMRPMQHH6VDN76XYW7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPA6HLZKMRPMQHH6VDN76XYW7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VPA6HLZKMRPMQHH6VDN76XYW7S","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":"8f4bbc0b0d90036ddc54db1638833dc787e764e80531724f0d426c85b488f6fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-06T16:18:08Z","title_canon_sha256":"49d679628db35a312d5924ab2e1757ed715f94b91c1eb5501b2b18b9b39519af"},"schema_version":"1.0","source":{"id":"1304.1909","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1909","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1909v1","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1909","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"pith_short_12","alias_value":"VPA6HLZKMRPM","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VPA6HLZKMRPMQHH6","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VPA6HLZK","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:d8e496830e0cb85d3a4aeb07193d355ccda876a0db161ba71f40d215c05a5cf3","target":"graph","created_at":"2026-05-18T02:38:29Z","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":"Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shortest path distance along the network, known as the network distance. Within this metric space, we study farthest points.\n  We introduce network farthest-point diagrams, which capture how the farthest points---and the distance to them---change as we traverse the network. We preprocess a network G such that, when given a query point q on G, we can quickly determine the farthest point(s) from q in G as well as the farthes","authors_text":"Anil Maheshwari, Carsten Grimm, Christoph Doell, Jean-Lou De Carufel, Kai Dannies, Michiel Smid, Prosenjit Bose, Stefan Schirra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-06T16:18:08Z","title":"Network Farthest-Point Diagrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1909","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:9286fb0f810e49ca38cb0452e63db8f98cc7c0e0285718787c66d9da1ec15115","target":"record","created_at":"2026-05-18T02:38:29Z","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":"8f4bbc0b0d90036ddc54db1638833dc787e764e80531724f0d426c85b488f6fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-04-06T16:18:08Z","title_canon_sha256":"49d679628db35a312d5924ab2e1757ed715f94b91c1eb5501b2b18b9b39519af"},"schema_version":"1.0","source":{"id":"1304.1909","kind":"arxiv","version":1}},"canonical_sha256":"abc1e3af2a645ec81cfea8dbff5f16fca10103a66b03e359e1499a09129ed01f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abc1e3af2a645ec81cfea8dbff5f16fca10103a66b03e359e1499a09129ed01f","first_computed_at":"2026-05-18T02:38:29.956529Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:29.956529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bgHpmEE+pTbJM0fVrMM8ozTD94qtwM3ulJfA+UaElqkcLB5dgfE8Ot9pOx+SMUM0CSDBKt/E4kZ60onqxjrnCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:29.956972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1909","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9286fb0f810e49ca38cb0452e63db8f98cc7c0e0285718787c66d9da1ec15115","sha256:d8e496830e0cb85d3a4aeb07193d355ccda876a0db161ba71f40d215c05a5cf3"],"state_sha256":"29fc2e5946cc5c0d93400116966acb7c878067e11dcac95999ede5aaf62c3900"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6mbfn1DiBt8SvbnbA3aYJULhM3TSusioOEnb7cyrtCzD1MKIX90HhqBCiu+Xkfs1hhFxyFChmu4VLLIJN2XsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:09:10.060782Z","bundle_sha256":"cb3cebb2d552859af1a4e1a0637d18d0efedb14a8514cfcaf1a81d24471cc90d"}}