{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6Z5D5WG3AHU3M2OLX6BSJ2WV5Y","short_pith_number":"pith:6Z5D5WG3","canonical_record":{"source":{"id":"1411.1879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-07T10:32:27Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"534ced88612075b359d90dde781cc4144e1ad49cce4798dd53d562360d76d5a0","abstract_canon_sha256":"e8607928dfc587cbc95a636ec4ea677569afe7518fc2b22c8e12ed5a148c2455"},"schema_version":"1.0"},"canonical_sha256":"f67a3ed8db01e9b669cbbf8324ead5ee30898d4f069694f6f061dfacece40856","source":{"kind":"arxiv","id":"1411.1879","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1879","created_at":"2026-05-18T02:23:26Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1879v1","created_at":"2026-05-18T02:23:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1879","created_at":"2026-05-18T02:23:26Z"},{"alias_kind":"pith_short_12","alias_value":"6Z5D5WG3AHU3","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6Z5D5WG3AHU3M2OL","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6Z5D5WG3","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6Z5D5WG3AHU3M2OLX6BSJ2WV5Y","target":"record","payload":{"canonical_record":{"source":{"id":"1411.1879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-07T10:32:27Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"534ced88612075b359d90dde781cc4144e1ad49cce4798dd53d562360d76d5a0","abstract_canon_sha256":"e8607928dfc587cbc95a636ec4ea677569afe7518fc2b22c8e12ed5a148c2455"},"schema_version":"1.0"},"canonical_sha256":"f67a3ed8db01e9b669cbbf8324ead5ee30898d4f069694f6f061dfacece40856","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:26.484593Z","signature_b64":"YteDGBFgBSrRVKNxyW49ejPzhKR7GAzBHf38/sSOW8tA1yd3cdXr7cYjjPWSca8vc+kLsmJt/saXon3Xdj4rAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f67a3ed8db01e9b669cbbf8324ead5ee30898d4f069694f6f061dfacece40856","last_reissued_at":"2026-05-18T02:23:26.483859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:26.483859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.1879","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:23:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UH7QHR77sS+O9TLMjveQjkaT0OGMnwiX9AP6yjX8FNOyiV3fqYki+mL0GpeLRSP4o6kqMwRHHXKAa4xAtOzFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:57:18.466055Z"},"content_sha256":"b890278134952f8cc2f717a8f225bad4f3d37889f530d12c1695447c1b08f7ff","schema_version":"1.0","event_id":"sha256:b890278134952f8cc2f717a8f225bad4f3d37889f530d12c1695447c1b08f7ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6Z5D5WG3AHU3M2OLX6BSJ2WV5Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Data Structures for Farthest-Point Queries in Cactus Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Anil Maheshwari, Carsten Grimm, Jean-Lou De Carufel, Michiel Smid, Prosenjit Bose","submitted_at":"2014-11-07T10:32:27Z","abstract_excerpt":"Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network distance. Within this metric space, we study farthest points and farthest distances. We introduce optimal data structures supporting queries for the farthest distance and the farthest points on trees, cycles, uni-cyclic networks, and cactus networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1879","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:23:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CeKScdklNfuyo7vVR6KIHilG+deUT/rR5ALguldNmX4C1k0r//WV6eHpQR4uZmbaE426DL/ASabnwCDna0rRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:57:18.466754Z"},"content_sha256":"4e0b56ec57dc47b796a204ebae9edbb3cacb649ffbdb3b76609acbed72943b41","schema_version":"1.0","event_id":"sha256:4e0b56ec57dc47b796a204ebae9edbb3cacb649ffbdb3b76609acbed72943b41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6Z5D5WG3AHU3M2OLX6BSJ2WV5Y/bundle.json","state_url":"https://pith.science/pith/6Z5D5WG3AHU3M2OLX6BSJ2WV5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6Z5D5WG3AHU3M2OLX6BSJ2WV5Y/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-27T04:57:18Z","links":{"resolver":"https://pith.science/pith/6Z5D5WG3AHU3M2OLX6BSJ2WV5Y","bundle":"https://pith.science/pith/6Z5D5WG3AHU3M2OLX6BSJ2WV5Y/bundle.json","state":"https://pith.science/pith/6Z5D5WG3AHU3M2OLX6BSJ2WV5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6Z5D5WG3AHU3M2OLX6BSJ2WV5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6Z5D5WG3AHU3M2OLX6BSJ2WV5Y","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":"e8607928dfc587cbc95a636ec4ea677569afe7518fc2b22c8e12ed5a148c2455","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-07T10:32:27Z","title_canon_sha256":"534ced88612075b359d90dde781cc4144e1ad49cce4798dd53d562360d76d5a0"},"schema_version":"1.0","source":{"id":"1411.1879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1879","created_at":"2026-05-18T02:23:26Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1879v1","created_at":"2026-05-18T02:23:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1879","created_at":"2026-05-18T02:23:26Z"},{"alias_kind":"pith_short_12","alias_value":"6Z5D5WG3AHU3","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6Z5D5WG3AHU3M2OL","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6Z5D5WG3","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:4e0b56ec57dc47b796a204ebae9edbb3cacb649ffbdb3b76609acbed72943b41","target":"graph","created_at":"2026-05-18T02:23:26Z","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 on the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network distance. Within this metric space, we study farthest points and farthest distances. We introduce optimal data structures supporting queries for the farthest distance and the farthest points on trees, cycles, uni-cyclic networks, and cactus networks.","authors_text":"Anil Maheshwari, Carsten Grimm, Jean-Lou De Carufel, Michiel Smid, Prosenjit Bose","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-07T10:32:27Z","title":"Optimal Data Structures for Farthest-Point Queries in Cactus Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1879","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:b890278134952f8cc2f717a8f225bad4f3d37889f530d12c1695447c1b08f7ff","target":"record","created_at":"2026-05-18T02:23:26Z","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":"e8607928dfc587cbc95a636ec4ea677569afe7518fc2b22c8e12ed5a148c2455","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-07T10:32:27Z","title_canon_sha256":"534ced88612075b359d90dde781cc4144e1ad49cce4798dd53d562360d76d5a0"},"schema_version":"1.0","source":{"id":"1411.1879","kind":"arxiv","version":1}},"canonical_sha256":"f67a3ed8db01e9b669cbbf8324ead5ee30898d4f069694f6f061dfacece40856","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f67a3ed8db01e9b669cbbf8324ead5ee30898d4f069694f6f061dfacece40856","first_computed_at":"2026-05-18T02:23:26.483859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:26.483859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YteDGBFgBSrRVKNxyW49ejPzhKR7GAzBHf38/sSOW8tA1yd3cdXr7cYjjPWSca8vc+kLsmJt/saXon3Xdj4rAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:26.484593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b890278134952f8cc2f717a8f225bad4f3d37889f530d12c1695447c1b08f7ff","sha256:4e0b56ec57dc47b796a204ebae9edbb3cacb649ffbdb3b76609acbed72943b41"],"state_sha256":"780ded6574c3a755c931f6dbac0974c92ef71840c0e39734fdaf9b3eb50073e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBuBTQAcf1Wdiau4nigjU8vGwDqscuKoMSD3FxIjwl7Mg7eadik2TR16DebYHV0om5+1rUishJqYHzPZO8G0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:57:18.469956Z","bundle_sha256":"bb06b1442ddcc3d2c933f537202b0e441240909aff15354df1520e16de1c916a"}}