{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2PID7NDABYNS4RS5XASLVRLPXL","short_pith_number":"pith:2PID7NDA","schema_version":"1.0","canonical_sha256":"d3d03fb4600e1b2e465db824bac56fbaf255e145f7a29d01b8c899cab5e17322","source":{"kind":"arxiv","id":"1012.1502","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.1502","created_at":"2026-05-18T04:34:00.996826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1502v1","created_at":"2026-05-18T04:34:00.996826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1502","created_at":"2026-05-18T04:34:00.996826+00:00"},{"alias_kind":"pith_short_12","alias_value":"2PID7NDABYNS","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2PID7NDABYNS4RS5","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2PID7NDA","created_at":"2026-05-18T12:26:03.138858+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/2PID7NDABYNS4RS5XASLVRLPXL","json":"https://pith.science/pith/2PID7NDABYNS4RS5XASLVRLPXL.json","graph_json":"https://pith.science/api/pith-number/2PID7NDABYNS4RS5XASLVRLPXL/graph.json","events_json":"https://pith.science/api/pith-number/2PID7NDABYNS4RS5XASLVRLPXL/events.json","paper":"https://pith.science/paper/2PID7NDA"},"agent_actions":{"view_html":"https://pith.science/pith/2PID7NDABYNS4RS5XASLVRLPXL","download_json":"https://pith.science/pith/2PID7NDABYNS4RS5XASLVRLPXL.json","view_paper":"https://pith.science/paper/2PID7NDA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1502&json=true","fetch_graph":"https://pith.science/api/pith-number/2PID7NDABYNS4RS5XASLVRLPXL/graph.json","fetch_events":"https://pith.science/api/pith-number/2PID7NDABYNS4RS5XASLVRLPXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2PID7NDABYNS4RS5XASLVRLPXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2PID7NDABYNS4RS5XASLVRLPXL/action/storage_attestation","attest_author":"https://pith.science/pith/2PID7NDABYNS4RS5XASLVRLPXL/action/author_attestation","sign_citation":"https://pith.science/pith/2PID7NDABYNS4RS5XASLVRLPXL/action/citation_signature","submit_replication":"https://pith.science/pith/2PID7NDABYNS4RS5XASLVRLPXL/action/replication_record"}},"created_at":"2026-05-18T04:34:00.996826+00:00","updated_at":"2026-05-18T04:34:00.996826+00:00"}