{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VNAEWLQTTMOR5UX5KQMDP3GTLI","short_pith_number":"pith:VNAEWLQT","schema_version":"1.0","canonical_sha256":"ab404b2e139b1d1ed2fd541837ecd35a32cb422a08fd946dc4305e83112b6f76","source":{"kind":"arxiv","id":"2006.14093","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2006.14093","created_at":"2026-07-05T01:13:28.946615+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.14093v1","created_at":"2026-07-05T01:13:28.946615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14093","created_at":"2026-07-05T01:13:28.946615+00:00"},{"alias_kind":"pith_short_12","alias_value":"VNAEWLQTTMOR","created_at":"2026-07-05T01:13:28.946615+00:00"},{"alias_kind":"pith_short_16","alias_value":"VNAEWLQTTMOR5UX5","created_at":"2026-07-05T01:13:28.946615+00:00"},{"alias_kind":"pith_short_8","alias_value":"VNAEWLQT","created_at":"2026-07-05T01:13:28.946615+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI","json":"https://pith.science/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI.json","graph_json":"https://pith.science/api/pith-number/VNAEWLQTTMOR5UX5KQMDP3GTLI/graph.json","events_json":"https://pith.science/api/pith-number/VNAEWLQTTMOR5UX5KQMDP3GTLI/events.json","paper":"https://pith.science/paper/VNAEWLQT"},"agent_actions":{"view_html":"https://pith.science/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI","download_json":"https://pith.science/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI.json","view_paper":"https://pith.science/paper/VNAEWLQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.14093&json=true","fetch_graph":"https://pith.science/api/pith-number/VNAEWLQTTMOR5UX5KQMDP3GTLI/graph.json","fetch_events":"https://pith.science/api/pith-number/VNAEWLQTTMOR5UX5KQMDP3GTLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI/action/storage_attestation","attest_author":"https://pith.science/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI/action/author_attestation","sign_citation":"https://pith.science/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI/action/citation_signature","submit_replication":"https://pith.science/pith/VNAEWLQTTMOR5UX5KQMDP3GTLI/action/replication_record"}},"created_at":"2026-07-05T01:13:28.946615+00:00","updated_at":"2026-07-05T01:13:28.946615+00:00"}