{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:2PID7NDABYNS4RS5XASLVRLPXL","short_pith_number":"pith:2PID7NDA","canonical_record":{"source":{"id":"1012.1502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-07T13:37:15Z","cross_cats_sorted":[],"title_canon_sha256":"0127d1ed9a859025d56680924b171b7b22292c7c447adca7c1c04c4649a28198","abstract_canon_sha256":"44c34920ea3f80152299e07fbd09affc54082d8684ddf2616b69de77cfaac480"},"schema_version":"1.0"},"canonical_sha256":"d3d03fb4600e1b2e465db824bac56fbaf255e145f7a29d01b8c899cab5e17322","source":{"kind":"arxiv","id":"1012.1502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.1502","created_at":"2026-05-18T04:34:00Z"},{"alias_kind":"arxiv_version","alias_value":"1012.1502v1","created_at":"2026-05-18T04:34:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1502","created_at":"2026-05-18T04:34:00Z"},{"alias_kind":"pith_short_12","alias_value":"2PID7NDABYNS","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2PID7NDABYNS4RS5","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2PID7NDA","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:2PID7NDABYNS4RS5XASLVRLPXL","target":"record","payload":{"canonical_record":{"source":{"id":"1012.1502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-07T13:37:15Z","cross_cats_sorted":[],"title_canon_sha256":"0127d1ed9a859025d56680924b171b7b22292c7c447adca7c1c04c4649a28198","abstract_canon_sha256":"44c34920ea3f80152299e07fbd09affc54082d8684ddf2616b69de77cfaac480"},"schema_version":"1.0"},"canonical_sha256":"d3d03fb4600e1b2e465db824bac56fbaf255e145f7a29d01b8c899cab5e17322","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:00.997213Z","signature_b64":"5s6+saxxxap4nJrJYJ+vZhGvcBzRFwN2OCnnlAfJnBTMZenb8EzJlQQpv1H73sGRmyO0CIF7qeTGl732MVuMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3d03fb4600e1b2e465db824bac56fbaf255e145f7a29d01b8c899cab5e17322","last_reissued_at":"2026-05-18T04:34:00.996755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:00.996755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.1502","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-18T04:34:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xki+67vpEBPvL5j68dadi877ZXVWo3l+8dRriNuxcxr+Va9BsX/sPjVcXtXJ4/VClCs4aejMEo/n95+fdBYmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:56:01.413264Z"},"content_sha256":"ce76c75abd3af25b0a975eb1bdd0ef2921f3054756950e7bac0006e70e350adb","schema_version":"1.0","event_id":"sha256:ce76c75abd3af25b0a975eb1bdd0ef2921f3054756950e7bac0006e70e350adb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:2PID7NDABYNS4RS5XASLVRLPXL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"A. Karim Abu-Affash","submitted_at":"2010-12-07T13:37:15Z","abstract_excerpt":"Given two sets of points in the plane, $P$ of $n$ terminals and $S$ of $m$ Steiner points, a Steiner tree of $P$ is a tree spanning all points of $P$ and some (or none or all) points of $S$. A Steiner tree with length of longest edge minimized is called a bottleneck Steiner tree. In this paper, we study the Euclidean bottleneck Steiner tree problem: given two sets, $P$ and $S$, and a positive integer $k \\le m$, find a bottleneck Steiner tree of $P$ with at most $k$ Steiner points. The problem has application in the design of wireless communication networks.\n  We first show that the problem is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1502","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-18T04:34:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MszawEa5k5iCjo51rav7IegyCTVGok9SVqVZhuOw4IP3ThvX8XfnecVNMuWKwOe9W5ItiHRZyHy9b4/QqFTVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:56:01.414029Z"},"content_sha256":"8b3a130d79d1e573956c0643fdb73c3759c58177c2fb2e65eb70babd4ab4214d","schema_version":"1.0","event_id":"sha256:8b3a130d79d1e573956c0643fdb73c3759c58177c2fb2e65eb70babd4ab4214d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PID7NDABYNS4RS5XASLVRLPXL/bundle.json","state_url":"https://pith.science/pith/2PID7NDABYNS4RS5XASLVRLPXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PID7NDABYNS4RS5XASLVRLPXL/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-09T04:56:01Z","links":{"resolver":"https://pith.science/pith/2PID7NDABYNS4RS5XASLVRLPXL","bundle":"https://pith.science/pith/2PID7NDABYNS4RS5XASLVRLPXL/bundle.json","state":"https://pith.science/pith/2PID7NDABYNS4RS5XASLVRLPXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PID7NDABYNS4RS5XASLVRLPXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:2PID7NDABYNS4RS5XASLVRLPXL","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":"44c34920ea3f80152299e07fbd09affc54082d8684ddf2616b69de77cfaac480","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-07T13:37:15Z","title_canon_sha256":"0127d1ed9a859025d56680924b171b7b22292c7c447adca7c1c04c4649a28198"},"schema_version":"1.0","source":{"id":"1012.1502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.1502","created_at":"2026-05-18T04:34:00Z"},{"alias_kind":"arxiv_version","alias_value":"1012.1502v1","created_at":"2026-05-18T04:34:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1502","created_at":"2026-05-18T04:34:00Z"},{"alias_kind":"pith_short_12","alias_value":"2PID7NDABYNS","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2PID7NDABYNS4RS5","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2PID7NDA","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:8b3a130d79d1e573956c0643fdb73c3759c58177c2fb2e65eb70babd4ab4214d","target":"graph","created_at":"2026-05-18T04:34:00Z","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":"Given two sets of points in the plane, $P$ of $n$ terminals and $S$ of $m$ Steiner points, a Steiner tree of $P$ is a tree spanning all points of $P$ and some (or none or all) points of $S$. A Steiner tree with length of longest edge minimized is called a bottleneck Steiner tree. In this paper, we study the Euclidean bottleneck Steiner tree problem: given two sets, $P$ and $S$, and a positive integer $k \\le m$, find a bottleneck Steiner tree of $P$ with at most $k$ Steiner points. The problem has application in the design of wireless communication networks.\n  We first show that the problem is ","authors_text":"A. Karim Abu-Affash","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-07T13:37:15Z","title":"An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1502","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:ce76c75abd3af25b0a975eb1bdd0ef2921f3054756950e7bac0006e70e350adb","target":"record","created_at":"2026-05-18T04:34:00Z","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":"44c34920ea3f80152299e07fbd09affc54082d8684ddf2616b69de77cfaac480","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-12-07T13:37:15Z","title_canon_sha256":"0127d1ed9a859025d56680924b171b7b22292c7c447adca7c1c04c4649a28198"},"schema_version":"1.0","source":{"id":"1012.1502","kind":"arxiv","version":1}},"canonical_sha256":"d3d03fb4600e1b2e465db824bac56fbaf255e145f7a29d01b8c899cab5e17322","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3d03fb4600e1b2e465db824bac56fbaf255e145f7a29d01b8c899cab5e17322","first_computed_at":"2026-05-18T04:34:00.996755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:00.996755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5s6+saxxxap4nJrJYJ+vZhGvcBzRFwN2OCnnlAfJnBTMZenb8EzJlQQpv1H73sGRmyO0CIF7qeTGl732MVuMAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:00.997213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.1502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce76c75abd3af25b0a975eb1bdd0ef2921f3054756950e7bac0006e70e350adb","sha256:8b3a130d79d1e573956c0643fdb73c3759c58177c2fb2e65eb70babd4ab4214d"],"state_sha256":"7e27e2842676214255bf525097c550bb0e7fdc6435a9e0882ca017f39bb48fcd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gr5ddQaXOdPmcbkKAs5goq9Sb0iPo6NcVk3RLA1rD1c+z0anDkVlaoRx23BmCWhpnHNercLb0Z0Ed3ClFzvTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:56:01.417851Z","bundle_sha256":"bfc9e9b5ec85982862527de5d3194ed2752a3e213f149e5912022ce248b4de38"}}