{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AIYQ4TQWDKZGIDMQ2NZDRT4BQ4","short_pith_number":"pith:AIYQ4TQW","canonical_record":{"source":{"id":"1108.3655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-18T06:15:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4bc3f749fa363a2887e441fe84d857c1c30589d09fdd1974ba89ee9b4acd1021","abstract_canon_sha256":"74464c86e8d83f2d2993bf4e2d633bea9924b3424088c47941fa79055ff7a7e5"},"schema_version":"1.0"},"canonical_sha256":"02310e4e161ab2640d90d37238cf818732f34f00f1a7fdf1d42993f814287bcc","source":{"kind":"arxiv","id":"1108.3655","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3655","created_at":"2026-05-18T03:36:04Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3655v1","created_at":"2026-05-18T03:36:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3655","created_at":"2026-05-18T03:36:04Z"},{"alias_kind":"pith_short_12","alias_value":"AIYQ4TQWDKZG","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AIYQ4TQWDKZGIDMQ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AIYQ4TQW","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AIYQ4TQWDKZGIDMQ2NZDRT4BQ4","target":"record","payload":{"canonical_record":{"source":{"id":"1108.3655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-18T06:15:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4bc3f749fa363a2887e441fe84d857c1c30589d09fdd1974ba89ee9b4acd1021","abstract_canon_sha256":"74464c86e8d83f2d2993bf4e2d633bea9924b3424088c47941fa79055ff7a7e5"},"schema_version":"1.0"},"canonical_sha256":"02310e4e161ab2640d90d37238cf818732f34f00f1a7fdf1d42993f814287bcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:04.934740Z","signature_b64":"fvcAZ8SFPSbLQ+c4JlaDj8irv6gdbqF3A9E/0xbWqcEc0q7GXElt4tdCdHl1BAjDlKHujvTMfaxvH6mk4FdoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02310e4e161ab2640d90d37238cf818732f34f00f1a7fdf1d42993f814287bcc","last_reissued_at":"2026-05-18T03:36:04.934113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:04.934113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.3655","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-18T03:36:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g0aYipEEoHdUnZ8y8vUkmHEWj+/Om6UEmiyuHbYMMlFIT5t31qVIxL3UmjFsz73iElpKTSIjs26XtISctTVXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T00:04:39.591332Z"},"content_sha256":"545badb249d32182b2e47256adddf52fa6316610820e800546b9cb6b46df269c","schema_version":"1.0","event_id":"sha256:545badb249d32182b2e47256adddf52fa6316610820e800546b9cb6b46df269c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AIYQ4TQWDKZGIDMQ2NZDRT4BQ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The bottleneck 2-connected $k$-Steiner network problem for $k\\leq 2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"C.J. Ras, D.A. Thomas, M. Brazil","submitted_at":"2011-08-18T06:15:35Z","abstract_excerpt":"The geometric bottleneck Steiner network problem on a set of vertices $X$ embedded in a normed plane requires one to construct a graph $G$ spanning $X$ and a variable set of $k\\geq 0$ additional points, such that the length of the longest edge is minimised. If no other constraints are placed on $G$ then a solution always exists which is a tree. In this paper we consider the Euclidean bottleneck Steiner network problem for $k\\leq 2$, where $G$ is constrained to be 2-connected. By taking advantage of relative neighbourhood graphs, Voronoi diagrams, and the tree structure of block cut-vertex deco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3655","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-18T03:36:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbsTaWT6Uaad2Xu7blMLQSOFy6iNayTBTL576C+mxXxSKZI0IuxGdgiLuVfcExyX/+3T/vyeZcpr550zjBxXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T00:04:39.591683Z"},"content_sha256":"1b9544be4a99935a4d45a8ead94bf7bb6d789a926abe84a5198aef4c1735af7c","schema_version":"1.0","event_id":"sha256:1b9544be4a99935a4d45a8ead94bf7bb6d789a926abe84a5198aef4c1735af7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIYQ4TQWDKZGIDMQ2NZDRT4BQ4/bundle.json","state_url":"https://pith.science/pith/AIYQ4TQWDKZGIDMQ2NZDRT4BQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIYQ4TQWDKZGIDMQ2NZDRT4BQ4/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-25T00:04:39Z","links":{"resolver":"https://pith.science/pith/AIYQ4TQWDKZGIDMQ2NZDRT4BQ4","bundle":"https://pith.science/pith/AIYQ4TQWDKZGIDMQ2NZDRT4BQ4/bundle.json","state":"https://pith.science/pith/AIYQ4TQWDKZGIDMQ2NZDRT4BQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIYQ4TQWDKZGIDMQ2NZDRT4BQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AIYQ4TQWDKZGIDMQ2NZDRT4BQ4","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":"74464c86e8d83f2d2993bf4e2d633bea9924b3424088c47941fa79055ff7a7e5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-18T06:15:35Z","title_canon_sha256":"4bc3f749fa363a2887e441fe84d857c1c30589d09fdd1974ba89ee9b4acd1021"},"schema_version":"1.0","source":{"id":"1108.3655","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3655","created_at":"2026-05-18T03:36:04Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3655v1","created_at":"2026-05-18T03:36:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3655","created_at":"2026-05-18T03:36:04Z"},{"alias_kind":"pith_short_12","alias_value":"AIYQ4TQWDKZG","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AIYQ4TQWDKZGIDMQ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AIYQ4TQW","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:1b9544be4a99935a4d45a8ead94bf7bb6d789a926abe84a5198aef4c1735af7c","target":"graph","created_at":"2026-05-18T03:36:04Z","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":"The geometric bottleneck Steiner network problem on a set of vertices $X$ embedded in a normed plane requires one to construct a graph $G$ spanning $X$ and a variable set of $k\\geq 0$ additional points, such that the length of the longest edge is minimised. If no other constraints are placed on $G$ then a solution always exists which is a tree. In this paper we consider the Euclidean bottleneck Steiner network problem for $k\\leq 2$, where $G$ is constrained to be 2-connected. By taking advantage of relative neighbourhood graphs, Voronoi diagrams, and the tree structure of block cut-vertex deco","authors_text":"C.J. Ras, D.A. Thomas, M. Brazil","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-18T06:15:35Z","title":"The bottleneck 2-connected $k$-Steiner network problem for $k\\leq 2$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3655","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:545badb249d32182b2e47256adddf52fa6316610820e800546b9cb6b46df269c","target":"record","created_at":"2026-05-18T03:36:04Z","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":"74464c86e8d83f2d2993bf4e2d633bea9924b3424088c47941fa79055ff7a7e5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-18T06:15:35Z","title_canon_sha256":"4bc3f749fa363a2887e441fe84d857c1c30589d09fdd1974ba89ee9b4acd1021"},"schema_version":"1.0","source":{"id":"1108.3655","kind":"arxiv","version":1}},"canonical_sha256":"02310e4e161ab2640d90d37238cf818732f34f00f1a7fdf1d42993f814287bcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02310e4e161ab2640d90d37238cf818732f34f00f1a7fdf1d42993f814287bcc","first_computed_at":"2026-05-18T03:36:04.934113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:04.934113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fvcAZ8SFPSbLQ+c4JlaDj8irv6gdbqF3A9E/0xbWqcEc0q7GXElt4tdCdHl1BAjDlKHujvTMfaxvH6mk4FdoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:04.934740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.3655","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:545badb249d32182b2e47256adddf52fa6316610820e800546b9cb6b46df269c","sha256:1b9544be4a99935a4d45a8ead94bf7bb6d789a926abe84a5198aef4c1735af7c"],"state_sha256":"8d2af25d80ee1d10fcd2429f52549cb737295681e837620efd9c99d124a00270"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fd+NUHM28Euv/x3T4pDIhN4Fqky57dSefWry++v7nPJGZVhjGrQrh0r5NMe59nkP7OxyTp5FmNlh7vgN1qYvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T00:04:39.593637Z","bundle_sha256":"b18a2783966dd30130daf26115da14b9056ee861566a0a6abece0e0325587faa"}}