{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EMYRGVRCMIB4EUSIRME5NTWPHP","short_pith_number":"pith:EMYRGVRC","schema_version":"1.0","canonical_sha256":"23311356226203c252488b09d6cecf3bc73e9b66752d13a4a9945e1e67beea29","source":{"kind":"arxiv","id":"1512.02257","version":1},"attestation_state":"computed","paper":{"title":"Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Carsten Grimm, Jean-Lou De Carufel, Michiel Smid","submitted_at":"2015-12-07T21:44:54Z","abstract_excerpt":"We seek to augment a geometric network in the Euclidean plane with shortcuts to minimize its continuous diameter, i.e., the largest network distance between any two points on the augmented network. Unlike in the discrete setting where a shortcut connects two vertices and the diameter is measured between vertices, we take all points along the edges of the network into account when placing a shortcut and when measuring distances in the augmented network.\n  We study this network augmentation problem for paths and cycles. For paths, we determine an optimal shortcut in linear time. For cycles, we s"},"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":"1512.02257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-07T21:44:54Z","cross_cats_sorted":[],"title_canon_sha256":"0048e7475d1d9c8ea3398d7abf12e55c5f440e21ceef1f0514cfcda31146d245","abstract_canon_sha256":"68ece8e3789dfa8168cee2bace79d45ade1ea4b851bd148c61f35bb139e0067a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:45.153597Z","signature_b64":"UCUBkxAJSMwQnt/ovHd1WokL6DAiKUaptmiGrt7g7ek7LNi5TOpO9AxFZsvXbvp4nPxsyO4Ixd3fQpinyE4pDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23311356226203c252488b09d6cecf3bc73e9b66752d13a4a9945e1e67beea29","last_reissued_at":"2026-05-18T01:24:45.152887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:45.152887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Carsten Grimm, Jean-Lou De Carufel, Michiel Smid","submitted_at":"2015-12-07T21:44:54Z","abstract_excerpt":"We seek to augment a geometric network in the Euclidean plane with shortcuts to minimize its continuous diameter, i.e., the largest network distance between any two points on the augmented network. Unlike in the discrete setting where a shortcut connects two vertices and the diameter is measured between vertices, we take all points along the edges of the network into account when placing a shortcut and when measuring distances in the augmented network.\n  We study this network augmentation problem for paths and cycles. For paths, we determine an optimal shortcut in linear time. For cycles, we s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02257","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.02257","created_at":"2026-05-18T01:24:45.153003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02257v1","created_at":"2026-05-18T01:24:45.153003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02257","created_at":"2026-05-18T01:24:45.153003+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMYRGVRCMIB4","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMYRGVRCMIB4EUSI","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMYRGVRC","created_at":"2026-05-18T12:29:19.899920+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/EMYRGVRCMIB4EUSIRME5NTWPHP","json":"https://pith.science/pith/EMYRGVRCMIB4EUSIRME5NTWPHP.json","graph_json":"https://pith.science/api/pith-number/EMYRGVRCMIB4EUSIRME5NTWPHP/graph.json","events_json":"https://pith.science/api/pith-number/EMYRGVRCMIB4EUSIRME5NTWPHP/events.json","paper":"https://pith.science/paper/EMYRGVRC"},"agent_actions":{"view_html":"https://pith.science/pith/EMYRGVRCMIB4EUSIRME5NTWPHP","download_json":"https://pith.science/pith/EMYRGVRCMIB4EUSIRME5NTWPHP.json","view_paper":"https://pith.science/paper/EMYRGVRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02257&json=true","fetch_graph":"https://pith.science/api/pith-number/EMYRGVRCMIB4EUSIRME5NTWPHP/graph.json","fetch_events":"https://pith.science/api/pith-number/EMYRGVRCMIB4EUSIRME5NTWPHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMYRGVRCMIB4EUSIRME5NTWPHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMYRGVRCMIB4EUSIRME5NTWPHP/action/storage_attestation","attest_author":"https://pith.science/pith/EMYRGVRCMIB4EUSIRME5NTWPHP/action/author_attestation","sign_citation":"https://pith.science/pith/EMYRGVRCMIB4EUSIRME5NTWPHP/action/citation_signature","submit_replication":"https://pith.science/pith/EMYRGVRCMIB4EUSIRME5NTWPHP/action/replication_record"}},"created_at":"2026-05-18T01:24:45.153003+00:00","updated_at":"2026-05-18T01:24:45.153003+00:00"}