{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VNAEWLQTTMOR5UX5KQMDP3GTLI","short_pith_number":"pith:VNAEWLQT","canonical_record":{"source":{"id":"2006.14093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-24T22:57:20Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"48907fd8ac682c138a3b06db4eacd67753a6d9fe8a4bbf31813f8cafbeb96042","abstract_canon_sha256":"059a432b002b80c2356e36f8d69dd249a8bd37d4495838133163c0c98bd2d412"},"schema_version":"1.0"},"canonical_sha256":"ab404b2e139b1d1ed2fd541837ecd35a32cb422a08fd946dc4305e83112b6f76","source":{"kind":"arxiv","id":"2006.14093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.14093","created_at":"2026-07-05T01:13:28Z"},{"alias_kind":"arxiv_version","alias_value":"2006.14093v1","created_at":"2026-07-05T01:13:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14093","created_at":"2026-07-05T01:13:28Z"},{"alias_kind":"pith_short_12","alias_value":"VNAEWLQTTMOR","created_at":"2026-07-05T01:13:28Z"},{"alias_kind":"pith_short_16","alias_value":"VNAEWLQTTMOR5UX5","created_at":"2026-07-05T01:13:28Z"},{"alias_kind":"pith_short_8","alias_value":"VNAEWLQT","created_at":"2026-07-05T01:13:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VNAEWLQTTMOR5UX5KQMDP3GTLI","target":"record","payload":{"canonical_record":{"source":{"id":"2006.14093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-24T22:57:20Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"48907fd8ac682c138a3b06db4eacd67753a6d9fe8a4bbf31813f8cafbeb96042","abstract_canon_sha256":"059a432b002b80c2356e36f8d69dd249a8bd37d4495838133163c0c98bd2d412"},"schema_version":"1.0"},"canonical_sha256":"ab404b2e139b1d1ed2fd541837ecd35a32cb422a08fd946dc4305e83112b6f76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:13:28.947003Z","signature_b64":"6SOJ5OdjikBl7YnnD2cJc7L/fSEhorvXj3aI94qkrnxxaf0daEzXqp1vUz6KxiBAT3u8opS8EuzFRDZvG7QYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab404b2e139b1d1ed2fd541837ecd35a32cb422a08fd946dc4305e83112b6f76","last_reissued_at":"2026-07-05T01:13:28.946560Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:13:28.946560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.14093","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-07-05T01:13:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kC+TDjQ2fc4/qBpP2Fys3A0rXAJajSdt1wG9y6zpN//dZn9o6PUl/xVkBG/M1+m4JBFo3z/6cQWTQtWEuogNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T13:49:04.996009Z"},"content_sha256":"9c0a73dd14d907131740ac4d3550efd960523b7cad7904df4f489da771bd23a2","schema_version":"1.0","event_id":"sha256:9c0a73dd14d907131740ac4d3550efd960523b7cad7904df4f489da771bd23a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VNAEWLQTTMOR5UX5KQMDP3GTLI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Haitao Wang, Yiming Zhao","submitted_at":"2020-06-24T22:57:20Z","abstract_excerpt":"Let $P$ be a path graph of $n$ vertices embedded in a metric space. We consider the problem of adding a new edge to $P$ so that the radius of the resulting graph is minimized, where any center is constrained to be one of the vertices of $P$. Previously, the \"continuous\" version of the problem where a center may be a point in the interior of an edge of the graph was studied and a linear-time algorithm was known. Our \"discrete\" version of the problem has not been studied before. We present a linear-time algorithm for the problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.14093","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.14093/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:13:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BXJkPwtvEPYtVshABFmEAIo4rOBJDUs9XbVOUSijkkY2wNdHsOt+vI458kBn+JRVC8ITWjZu/DeiDKnA1uAACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T13:49:04.996396Z"},"content_sha256":"eeab58cce8b89d4569ddb23db5084b22abb24aec75ec6b3c578efb21552ece2b","schema_version":"1.0","event_id":"sha256:eeab58cce8b89d4569ddb23db5084b22abb24aec75ec6b3c578efb21552ece2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI/bundle.json","state_url":"https://pith.science/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI/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-08-13T13:49:04Z","links":{"resolver":"https://pith.science/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI","bundle":"https://pith.science/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI/bundle.json","state":"https://pith.science/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VNAEWLQTTMOR5UX5KQMDP3GTLI","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":"059a432b002b80c2356e36f8d69dd249a8bd37d4495838133163c0c98bd2d412","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-24T22:57:20Z","title_canon_sha256":"48907fd8ac682c138a3b06db4eacd67753a6d9fe8a4bbf31813f8cafbeb96042"},"schema_version":"1.0","source":{"id":"2006.14093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.14093","created_at":"2026-07-05T01:13:28Z"},{"alias_kind":"arxiv_version","alias_value":"2006.14093v1","created_at":"2026-07-05T01:13:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14093","created_at":"2026-07-05T01:13:28Z"},{"alias_kind":"pith_short_12","alias_value":"VNAEWLQTTMOR","created_at":"2026-07-05T01:13:28Z"},{"alias_kind":"pith_short_16","alias_value":"VNAEWLQTTMOR5UX5","created_at":"2026-07-05T01:13:28Z"},{"alias_kind":"pith_short_8","alias_value":"VNAEWLQT","created_at":"2026-07-05T01:13:28Z"}],"graph_snapshots":[{"event_id":"sha256:eeab58cce8b89d4569ddb23db5084b22abb24aec75ec6b3c578efb21552ece2b","target":"graph","created_at":"2026-07-05T01:13:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.14093/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $P$ be a path graph of $n$ vertices embedded in a metric space. We consider the problem of adding a new edge to $P$ so that the radius of the resulting graph is minimized, where any center is constrained to be one of the vertices of $P$. Previously, the \"continuous\" version of the problem where a center may be a point in the interior of an edge of the graph was studied and a linear-time algorithm was known. Our \"discrete\" version of the problem has not been studied before. We present a linear-time algorithm for the problem.","authors_text":"Haitao Wang, Yiming Zhao","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-24T22:57:20Z","title":"A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.14093","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:9c0a73dd14d907131740ac4d3550efd960523b7cad7904df4f489da771bd23a2","target":"record","created_at":"2026-07-05T01:13:28Z","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":"059a432b002b80c2356e36f8d69dd249a8bd37d4495838133163c0c98bd2d412","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-24T22:57:20Z","title_canon_sha256":"48907fd8ac682c138a3b06db4eacd67753a6d9fe8a4bbf31813f8cafbeb96042"},"schema_version":"1.0","source":{"id":"2006.14093","kind":"arxiv","version":1}},"canonical_sha256":"ab404b2e139b1d1ed2fd541837ecd35a32cb422a08fd946dc4305e83112b6f76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab404b2e139b1d1ed2fd541837ecd35a32cb422a08fd946dc4305e83112b6f76","first_computed_at":"2026-07-05T01:13:28.946560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:13:28.946560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6SOJ5OdjikBl7YnnD2cJc7L/fSEhorvXj3aI94qkrnxxaf0daEzXqp1vUz6KxiBAT3u8opS8EuzFRDZvG7QYBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:13:28.947003Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.14093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c0a73dd14d907131740ac4d3550efd960523b7cad7904df4f489da771bd23a2","sha256:eeab58cce8b89d4569ddb23db5084b22abb24aec75ec6b3c578efb21552ece2b"],"state_sha256":"e3ed949b7f12cbefaaed988c7c2c9653b1f45fb9b06d7505df4a2429563fed31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O7krjy+m1cHCsa67BjF2Y/SYMpQCY403XdJcUZ5/mPh6VmBOGIhGgu0r7Ic6KA+fCs/k8oWgRGEG0etMCkHlBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T13:49:04.999398Z","bundle_sha256":"86d4949756db372e553e6e97b7b5302a3635bce204bb84a8e9948ce2bc5ecb3f"}}