{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ESWHCDOAJIV34YRH5QS6PMCZC7","short_pith_number":"pith:ESWHCDOA","canonical_record":{"source":{"id":"1111.2105","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2011-11-09T05:25:04Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"d1aa175bd5c6c287e62f0fd6470d09512828d60c4b380bdc94e2b5f4676f7193","abstract_canon_sha256":"897d585cc590f0ae3e41ab0c7e7ce88d07be7f67b7c7f6b29bf76d12e8798f4c"},"schema_version":"1.0"},"canonical_sha256":"24ac710dc04a2bbe6227ec25e7b05917d8bc008a11cb69e645faf06c829489b9","source":{"kind":"arxiv","id":"1111.2105","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.2105","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"arxiv_version","alias_value":"1111.2105v3","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2105","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"pith_short_12","alias_value":"ESWHCDOAJIV3","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"ESWHCDOAJIV34YRH","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"ESWHCDOA","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ESWHCDOAJIV34YRH5QS6PMCZC7","target":"record","payload":{"canonical_record":{"source":{"id":"1111.2105","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2011-11-09T05:25:04Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"d1aa175bd5c6c287e62f0fd6470d09512828d60c4b380bdc94e2b5f4676f7193","abstract_canon_sha256":"897d585cc590f0ae3e41ab0c7e7ce88d07be7f67b7c7f6b29bf76d12e8798f4c"},"schema_version":"1.0"},"canonical_sha256":"24ac710dc04a2bbe6227ec25e7b05917d8bc008a11cb69e645faf06c829489b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:34.300403Z","signature_b64":"xm3UlJO91XzD2fL6yqmOboEC/RypH8upgc/REFsMDGp8U+v2aBcpy+SjyRizi0sUZK2NOdEVoOHzgde4WtDBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24ac710dc04a2bbe6227ec25e7b05917d8bc008a11cb69e645faf06c829489b9","last_reissued_at":"2026-05-18T03:09:34.299745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:34.299745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.2105","source_version":3,"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-18T03:09:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FG+nRNRqVRaQKjuoAxgeBAUM8hf0vgeiZQZm/doeERu6NgjaL/FGj842N5wUonQAg7fC2qt4nLpCEESqE/6dCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:09:00.344467Z"},"content_sha256":"539edce96ba4ea83685a29f353150d3a554c545443ed7e5d0cb98f890ecf2e68","schema_version":"1.0","event_id":"sha256:539edce96ba4ea83685a29f353150d3a554c545443ed7e5d0cb98f890ecf2e68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ESWHCDOAJIV34YRH5QS6PMCZC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An exact algorithm for the bottleneck 2-connected $k$-Steiner network problem in $L_p$ planes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"math.MG","authors_text":"Charl Ras, Doreen Thomas, Marcus Brazil","submitted_at":"2011-11-09T05:25:04Z","abstract_excerpt":"We present the first exact polynomial time algorithm for constructing optimal geometric bottleneck 2-connected Steiner networks containing at most $k$ Steiner points, where $k>2$ is a constant. Given a set of $n$ vertices embedded in an $L_p$ plane, the objective of the problem is to find a 2-connected network, spanning the given vertices and at most $k$ additional vertices, such that the length of the longest edge is minimised. In contrast to the discrete version of this problem the additional vertices may be located anywhere in the plane. The problem is motivated by the modelling of relay-au"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2105","kind":"arxiv","version":3},"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-18T03:09:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P51eCdm4mYiF0eM3MjAknYxKmBd2rg+DaCwTB/UtTGVe9QOetr1PKvEvIotf8qolP9MTdsMgoxt0XRDN8veMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:09:00.344812Z"},"content_sha256":"e26439046512f2fd7f9615e5248fafc82f99fb679572329da27c18f3eca6a1ec","schema_version":"1.0","event_id":"sha256:e26439046512f2fd7f9615e5248fafc82f99fb679572329da27c18f3eca6a1ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ESWHCDOAJIV34YRH5QS6PMCZC7/bundle.json","state_url":"https://pith.science/pith/ESWHCDOAJIV34YRH5QS6PMCZC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ESWHCDOAJIV34YRH5QS6PMCZC7/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-06-20T07:09:00Z","links":{"resolver":"https://pith.science/pith/ESWHCDOAJIV34YRH5QS6PMCZC7","bundle":"https://pith.science/pith/ESWHCDOAJIV34YRH5QS6PMCZC7/bundle.json","state":"https://pith.science/pith/ESWHCDOAJIV34YRH5QS6PMCZC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ESWHCDOAJIV34YRH5QS6PMCZC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ESWHCDOAJIV34YRH5QS6PMCZC7","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":"897d585cc590f0ae3e41ab0c7e7ce88d07be7f67b7c7f6b29bf76d12e8798f4c","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2011-11-09T05:25:04Z","title_canon_sha256":"d1aa175bd5c6c287e62f0fd6470d09512828d60c4b380bdc94e2b5f4676f7193"},"schema_version":"1.0","source":{"id":"1111.2105","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.2105","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"arxiv_version","alias_value":"1111.2105v3","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2105","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"pith_short_12","alias_value":"ESWHCDOAJIV3","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"ESWHCDOAJIV34YRH","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"ESWHCDOA","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:e26439046512f2fd7f9615e5248fafc82f99fb679572329da27c18f3eca6a1ec","target":"graph","created_at":"2026-05-18T03:09:34Z","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 present the first exact polynomial time algorithm for constructing optimal geometric bottleneck 2-connected Steiner networks containing at most $k$ Steiner points, where $k>2$ is a constant. Given a set of $n$ vertices embedded in an $L_p$ plane, the objective of the problem is to find a 2-connected network, spanning the given vertices and at most $k$ additional vertices, such that the length of the longest edge is minimised. In contrast to the discrete version of this problem the additional vertices may be located anywhere in the plane. The problem is motivated by the modelling of relay-au","authors_text":"Charl Ras, Doreen Thomas, Marcus Brazil","cross_cats":["cs.DS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2011-11-09T05:25:04Z","title":"An exact algorithm for the bottleneck 2-connected $k$-Steiner network problem in $L_p$ planes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2105","kind":"arxiv","version":3},"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:539edce96ba4ea83685a29f353150d3a554c545443ed7e5d0cb98f890ecf2e68","target":"record","created_at":"2026-05-18T03:09:34Z","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":"897d585cc590f0ae3e41ab0c7e7ce88d07be7f67b7c7f6b29bf76d12e8798f4c","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2011-11-09T05:25:04Z","title_canon_sha256":"d1aa175bd5c6c287e62f0fd6470d09512828d60c4b380bdc94e2b5f4676f7193"},"schema_version":"1.0","source":{"id":"1111.2105","kind":"arxiv","version":3}},"canonical_sha256":"24ac710dc04a2bbe6227ec25e7b05917d8bc008a11cb69e645faf06c829489b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24ac710dc04a2bbe6227ec25e7b05917d8bc008a11cb69e645faf06c829489b9","first_computed_at":"2026-05-18T03:09:34.299745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:34.299745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xm3UlJO91XzD2fL6yqmOboEC/RypH8upgc/REFsMDGp8U+v2aBcpy+SjyRizi0sUZK2NOdEVoOHzgde4WtDBCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:34.300403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.2105","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:539edce96ba4ea83685a29f353150d3a554c545443ed7e5d0cb98f890ecf2e68","sha256:e26439046512f2fd7f9615e5248fafc82f99fb679572329da27c18f3eca6a1ec"],"state_sha256":"1bc4371dcd59ced2a57969f79bb427bd288e613834cc7983cfcdd7556112bcae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yjNPnmSLLQe7IqmkpP+x4vpZsThVZUsH7c1PhzR+mHoO7JKH7cFVw5VKvcYdkBJzhUz2af8J4icXqyuVIqzYCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:09:00.346702Z","bundle_sha256":"f6c755759649e1799ca82395b6a46842ff14780a6efb4b02ccbd4d6d08b4a804"}}