{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:U34RG5SLA7RCMFYG62VHX2NAFC","short_pith_number":"pith:U34RG5SL","schema_version":"1.0","canonical_sha256":"a6f913764b07e2261706f6aa7be9a028b5aacb885300b9bda6e4da200ae1626a","source":{"kind":"arxiv","id":"1612.04780","version":1},"attestation_state":"computed","paper":{"title":"Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Charles R. Winston, Csaba D. T\\'oth, Diane L. Souvaine, Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols","submitted_at":"2016-12-14T19:33:00Z","abstract_excerpt":"We consider edge insertion and deletion operations that increase the connectivity of a given planar straight-line graph (PSLG), while minimizing the total edge length of the output. We show that every connected PSLG $G=(V,E)$ in general position can be augmented to a 2-connected PSLG $(V,E\\cup E^+)$ by adding new edges of total Euclidean length $\\|E^+\\|\\leq 2\\|E\\|$, and this bound is the best possible. An optimal edge set $E^+$ can be computed in $O(|V|^4)$ time; however the problem becomes NP-hard when $G$ is disconnected. Further, there is a sequence of edge insertions and deletions that tra"},"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.04780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-14T19:33:00Z","cross_cats_sorted":[],"title_canon_sha256":"25f29be107a4f871a1ff7fb2a8e63810cb72958508de70c29d1c443996e8b76e","abstract_canon_sha256":"676b8d887b9faf31dd685cce6d47cd952ea885419e5a83b8ead3e0c69332a40b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:58.631489Z","signature_b64":"bHh8eOu9ioF7QjG5F5gm0Cs/Ui+LSg6POsXygZC8ZLZpc8w0LvangxKZhf6ERR72+RMU9GzzwwQcKtxPAABoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6f913764b07e2261706f6aa7be9a028b5aacb885300b9bda6e4da200ae1626a","last_reissued_at":"2026-05-18T00:54:58.630889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:58.630889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Charles R. Winston, Csaba D. T\\'oth, Diane L. Souvaine, Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols","submitted_at":"2016-12-14T19:33:00Z","abstract_excerpt":"We consider edge insertion and deletion operations that increase the connectivity of a given planar straight-line graph (PSLG), while minimizing the total edge length of the output. We show that every connected PSLG $G=(V,E)$ in general position can be augmented to a 2-connected PSLG $(V,E\\cup E^+)$ by adding new edges of total Euclidean length $\\|E^+\\|\\leq 2\\|E\\|$, and this bound is the best possible. An optimal edge set $E^+$ can be computed in $O(|V|^4)$ time; however the problem becomes NP-hard when $G$ is disconnected. Further, there is a sequence of edge insertions and deletions that tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04780","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":"1612.04780","created_at":"2026-05-18T00:54:58.630967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.04780v1","created_at":"2026-05-18T00:54:58.630967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04780","created_at":"2026-05-18T00:54:58.630967+00:00"},{"alias_kind":"pith_short_12","alias_value":"U34RG5SLA7RC","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"U34RG5SLA7RCMFYG","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"U34RG5SL","created_at":"2026-05-18T12:30:46.583412+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/U34RG5SLA7RCMFYG62VHX2NAFC","json":"https://pith.science/pith/U34RG5SLA7RCMFYG62VHX2NAFC.json","graph_json":"https://pith.science/api/pith-number/U34RG5SLA7RCMFYG62VHX2NAFC/graph.json","events_json":"https://pith.science/api/pith-number/U34RG5SLA7RCMFYG62VHX2NAFC/events.json","paper":"https://pith.science/paper/U34RG5SL"},"agent_actions":{"view_html":"https://pith.science/pith/U34RG5SLA7RCMFYG62VHX2NAFC","download_json":"https://pith.science/pith/U34RG5SLA7RCMFYG62VHX2NAFC.json","view_paper":"https://pith.science/paper/U34RG5SL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.04780&json=true","fetch_graph":"https://pith.science/api/pith-number/U34RG5SLA7RCMFYG62VHX2NAFC/graph.json","fetch_events":"https://pith.science/api/pith-number/U34RG5SLA7RCMFYG62VHX2NAFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U34RG5SLA7RCMFYG62VHX2NAFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U34RG5SLA7RCMFYG62VHX2NAFC/action/storage_attestation","attest_author":"https://pith.science/pith/U34RG5SLA7RCMFYG62VHX2NAFC/action/author_attestation","sign_citation":"https://pith.science/pith/U34RG5SLA7RCMFYG62VHX2NAFC/action/citation_signature","submit_replication":"https://pith.science/pith/U34RG5SLA7RCMFYG62VHX2NAFC/action/replication_record"}},"created_at":"2026-05-18T00:54:58.630967+00:00","updated_at":"2026-05-18T00:54:58.630967+00:00"}