{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:U34RG5SLA7RCMFYG62VHX2NAFC","short_pith_number":"pith:U34RG5SL","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"},"canonical_sha256":"a6f913764b07e2261706f6aa7be9a028b5aacb885300b9bda6e4da200ae1626a","source":{"kind":"arxiv","id":"1612.04780","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04780","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04780v1","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04780","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"U34RG5SLA7RC","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U34RG5SLA7RCMFYG","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U34RG5SL","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:U34RG5SLA7RCMFYG62VHX2NAFC","target":"record","payload":{"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"},"canonical_sha256":"a6f913764b07e2261706f6aa7be9a028b5aacb885300b9bda6e4da200ae1626a","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"},"source_kind":"arxiv","source_id":"1612.04780","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-05-18T00:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8G5bz4TAQdg187nlCye8uESXHvyo5G35eweESD/jT0IDLDVU70uAfpW7y1qDElXudoBNegviy7t8qzLHSibIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:41:50.284971Z"},"content_sha256":"3502092ff003cb45d849b59bf71669a00149e456fb79db5432f8390c5eae1915","schema_version":"1.0","event_id":"sha256:3502092ff003cb45d849b59bf71669a00149e456fb79db5432f8390c5eae1915"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:U34RG5SLA7RCMFYG62VHX2NAFC","target":"graph","payload":{"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"},"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-05-18T00:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"58q+4uYDZ34FO/SuHPVLXDSEXDTQA0ux3i7hgKSucXpsZddeJOjCeCx1ox2zqA4yfokU5A+KLYwvP5q1kBhWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:41:50.285658Z"},"content_sha256":"a71f5ef8c54a8f77592c086adb45e16ad02f598172b11d4706999ea60294c074","schema_version":"1.0","event_id":"sha256:a71f5ef8c54a8f77592c086adb45e16ad02f598172b11d4706999ea60294c074"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U34RG5SLA7RCMFYG62VHX2NAFC/bundle.json","state_url":"https://pith.science/pith/U34RG5SLA7RCMFYG62VHX2NAFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U34RG5SLA7RCMFYG62VHX2NAFC/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-05-27T12:41:50Z","links":{"resolver":"https://pith.science/pith/U34RG5SLA7RCMFYG62VHX2NAFC","bundle":"https://pith.science/pith/U34RG5SLA7RCMFYG62VHX2NAFC/bundle.json","state":"https://pith.science/pith/U34RG5SLA7RCMFYG62VHX2NAFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U34RG5SLA7RCMFYG62VHX2NAFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:U34RG5SLA7RCMFYG62VHX2NAFC","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":"676b8d887b9faf31dd685cce6d47cd952ea885419e5a83b8ead3e0c69332a40b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-14T19:33:00Z","title_canon_sha256":"25f29be107a4f871a1ff7fb2a8e63810cb72958508de70c29d1c443996e8b76e"},"schema_version":"1.0","source":{"id":"1612.04780","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04780","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04780v1","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04780","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"U34RG5SLA7RC","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U34RG5SLA7RCMFYG","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U34RG5SL","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:a71f5ef8c54a8f77592c086adb45e16ad02f598172b11d4706999ea60294c074","target":"graph","created_at":"2026-05-18T00:54:58Z","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"},"paper":{"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","authors_text":"Charles R. Winston, Csaba D. T\\'oth, Diane L. Souvaine, Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-14T19:33:00Z","title":"Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04780","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:3502092ff003cb45d849b59bf71669a00149e456fb79db5432f8390c5eae1915","target":"record","created_at":"2026-05-18T00:54:58Z","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":"676b8d887b9faf31dd685cce6d47cd952ea885419e5a83b8ead3e0c69332a40b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-14T19:33:00Z","title_canon_sha256":"25f29be107a4f871a1ff7fb2a8e63810cb72958508de70c29d1c443996e8b76e"},"schema_version":"1.0","source":{"id":"1612.04780","kind":"arxiv","version":1}},"canonical_sha256":"a6f913764b07e2261706f6aa7be9a028b5aacb885300b9bda6e4da200ae1626a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6f913764b07e2261706f6aa7be9a028b5aacb885300b9bda6e4da200ae1626a","first_computed_at":"2026-05-18T00:54:58.630889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:58.630889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bHh8eOu9ioF7QjG5F5gm0Cs/Ui+LSg6POsXygZC8ZLZpc8w0LvangxKZhf6ERR72+RMU9GzzwwQcKtxPAABoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:58.631489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.04780","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3502092ff003cb45d849b59bf71669a00149e456fb79db5432f8390c5eae1915","sha256:a71f5ef8c54a8f77592c086adb45e16ad02f598172b11d4706999ea60294c074"],"state_sha256":"6c37d11c0e3b6e3b2820d278624a977f570df16da00ab920573aa825e828a12f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vnuHKNLO0c1RxNaw6hZ11FfymbMMDI6BusLY2bRTdhNV5qU7j7RK0Mdt09knQEIxBsB0EJDLFhlU2VxJwBnpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:41:50.289378Z","bundle_sha256":"4a44dfa089c0420bea8dc4684362fe7140fc7fedc827d94a2d7f6b3d7e0bf7ac"}}