{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2QR4CM6OA5MQIJC2L2Y4TX35LG","short_pith_number":"pith:2QR4CM6O","schema_version":"1.0","canonical_sha256":"d423c133ce075904245a5eb1c9df7d59b091c3ca48f3ab95baf673a0e4817103","source":{"kind":"arxiv","id":"1612.01370","version":4},"attestation_state":"computed","paper":{"title":"Minimizing the Continuous Diameter when Augmenting a Geometric Tree with a Shortcut","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, Stefan Schirra","submitted_at":"2016-12-05T14:29:01Z","abstract_excerpt":"We augment a tree $T$ with a shortcut $pq$ to minimize the largest distance between any two points along the resulting augmented tree $T+pq$. We study this problem in a continuous and geometric setting where $T$ is a geometric tree in the Euclidean plane, where a shortcut is a line segment connecting any two points along the edges of $T$, and we consider all points on $T+pq$ (i.e., vertices and points along edges) when determining the largest distance along $T+pq$. We refer to the largest distance between any two points along edges as the continuous diameter to distinguish it from the discrete"},"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":"1612.01370","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-05T14:29:01Z","cross_cats_sorted":[],"title_canon_sha256":"cdcdca7865181731ae7c3e6bbc835e2ac40bc98c745074a53207785226d97aa4","abstract_canon_sha256":"b6be8327ca15817d5830f0bb8a2188cf7b0129424f5592b5da966e4d704b3003"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:25.986304Z","signature_b64":"98TCBQkN3ibSFY2vfTumOYb/dY7XJwqC/Ld0efU8U9OzfLHrMAu2Bs6MEgFgPMIcq9XunDgVVECLopRZBDtpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d423c133ce075904245a5eb1c9df7d59b091c3ca48f3ab95baf673a0e4817103","last_reissued_at":"2026-05-18T00:32:25.985653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:25.985653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing the Continuous Diameter when Augmenting a Geometric Tree with a Shortcut","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, Stefan Schirra","submitted_at":"2016-12-05T14:29:01Z","abstract_excerpt":"We augment a tree $T$ with a shortcut $pq$ to minimize the largest distance between any two points along the resulting augmented tree $T+pq$. We study this problem in a continuous and geometric setting where $T$ is a geometric tree in the Euclidean plane, where a shortcut is a line segment connecting any two points along the edges of $T$, and we consider all points on $T+pq$ (i.e., vertices and points along edges) when determining the largest distance along $T+pq$. We refer to the largest distance between any two points along edges as the continuous diameter to distinguish it from the discrete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01370","kind":"arxiv","version":4},"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":"1612.01370","created_at":"2026-05-18T00:32:25.985768+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.01370v4","created_at":"2026-05-18T00:32:25.985768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01370","created_at":"2026-05-18T00:32:25.985768+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QR4CM6OA5MQ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QR4CM6OA5MQIJC2","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QR4CM6O","created_at":"2026-05-18T12:29:55.572404+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/2QR4CM6OA5MQIJC2L2Y4TX35LG","json":"https://pith.science/pith/2QR4CM6OA5MQIJC2L2Y4TX35LG.json","graph_json":"https://pith.science/api/pith-number/2QR4CM6OA5MQIJC2L2Y4TX35LG/graph.json","events_json":"https://pith.science/api/pith-number/2QR4CM6OA5MQIJC2L2Y4TX35LG/events.json","paper":"https://pith.science/paper/2QR4CM6O"},"agent_actions":{"view_html":"https://pith.science/pith/2QR4CM6OA5MQIJC2L2Y4TX35LG","download_json":"https://pith.science/pith/2QR4CM6OA5MQIJC2L2Y4TX35LG.json","view_paper":"https://pith.science/paper/2QR4CM6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.01370&json=true","fetch_graph":"https://pith.science/api/pith-number/2QR4CM6OA5MQIJC2L2Y4TX35LG/graph.json","fetch_events":"https://pith.science/api/pith-number/2QR4CM6OA5MQIJC2L2Y4TX35LG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QR4CM6OA5MQIJC2L2Y4TX35LG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QR4CM6OA5MQIJC2L2Y4TX35LG/action/storage_attestation","attest_author":"https://pith.science/pith/2QR4CM6OA5MQIJC2L2Y4TX35LG/action/author_attestation","sign_citation":"https://pith.science/pith/2QR4CM6OA5MQIJC2L2Y4TX35LG/action/citation_signature","submit_replication":"https://pith.science/pith/2QR4CM6OA5MQIJC2L2Y4TX35LG/action/replication_record"}},"created_at":"2026-05-18T00:32:25.985768+00:00","updated_at":"2026-05-18T00:32:25.985768+00:00"}