{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6X3I34WI5T7JTB74TKJG5UREVG","short_pith_number":"pith:6X3I34WI","schema_version":"1.0","canonical_sha256":"f5f68df2c8ecfe9987fc9a926ed224a9ba182f35bf6e4f3f9ea03e51a8c1a50a","source":{"kind":"arxiv","id":"1904.03611","version":1},"attestation_state":"computed","paper":{"title":"Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Lee-Ad Gottlieb, Yair Bartal","submitted_at":"2019-04-07T09:17:30Z","abstract_excerpt":"We give an algorithm that computes a $(1+\\epsilon)$-approximate Steiner forest in near-linear time $n \\cdot 2^{(1/\\epsilon)^{O(ddim^2)} (\\log \\log n)^2}$. This is a dramatic improvement upon the best previous result due to Chan et al., who gave a runtime of $n^{2^{O(ddim)}} \\cdot 2^{(ddim/\\epsilon)^{O(ddim)} \\sqrt{\\log n}}$.\n  For Steiner tree our methods achieve an even better runtime $n (\\log n)^{(1/\\epsilon)^{O(ddim^2)}}$ in doubling spaces. For Euclidean space the runtime can be reduced to $2^{(1/\\epsilon)^{O(d^2)}} n \\log n$, improving upon the result of Arora in fixed dimension $d$."},"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":"1904.03611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-07T09:17:30Z","cross_cats_sorted":[],"title_canon_sha256":"e6240e3dbc32d03d7d8a2b8353bd49298235b853d414fcd1af0c82b82cd1afef","abstract_canon_sha256":"de37c21cec973a9fd9ab0362a3b9ad9adbdf7367824a216d42031c02039dc9c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:12.774387Z","signature_b64":"lOaXb16nlKsIsOu7mARyMTCijB7/0CpltS3sVLcYRazGewbpwEbZGrRtqL8cBCETilEHBNdtqFiMHVY3rdFNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5f68df2c8ecfe9987fc9a926ed224a9ba182f35bf6e4f3f9ea03e51a8c1a50a","last_reissued_at":"2026-05-17T23:49:12.773571Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:12.773571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Lee-Ad Gottlieb, Yair Bartal","submitted_at":"2019-04-07T09:17:30Z","abstract_excerpt":"We give an algorithm that computes a $(1+\\epsilon)$-approximate Steiner forest in near-linear time $n \\cdot 2^{(1/\\epsilon)^{O(ddim^2)} (\\log \\log n)^2}$. This is a dramatic improvement upon the best previous result due to Chan et al., who gave a runtime of $n^{2^{O(ddim)}} \\cdot 2^{(ddim/\\epsilon)^{O(ddim)} \\sqrt{\\log n}}$.\n  For Steiner tree our methods achieve an even better runtime $n (\\log n)^{(1/\\epsilon)^{O(ddim^2)}}$ in doubling spaces. For Euclidean space the runtime can be reduced to $2^{(1/\\epsilon)^{O(d^2)}} n \\log n$, improving upon the result of Arora in fixed dimension $d$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03611","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":"1904.03611","created_at":"2026-05-17T23:49:12.773728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.03611v1","created_at":"2026-05-17T23:49:12.773728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03611","created_at":"2026-05-17T23:49:12.773728+00:00"},{"alias_kind":"pith_short_12","alias_value":"6X3I34WI5T7J","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6X3I34WI5T7JTB74","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6X3I34WI","created_at":"2026-05-18T12:33:10.108867+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/6X3I34WI5T7JTB74TKJG5UREVG","json":"https://pith.science/pith/6X3I34WI5T7JTB74TKJG5UREVG.json","graph_json":"https://pith.science/api/pith-number/6X3I34WI5T7JTB74TKJG5UREVG/graph.json","events_json":"https://pith.science/api/pith-number/6X3I34WI5T7JTB74TKJG5UREVG/events.json","paper":"https://pith.science/paper/6X3I34WI"},"agent_actions":{"view_html":"https://pith.science/pith/6X3I34WI5T7JTB74TKJG5UREVG","download_json":"https://pith.science/pith/6X3I34WI5T7JTB74TKJG5UREVG.json","view_paper":"https://pith.science/paper/6X3I34WI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.03611&json=true","fetch_graph":"https://pith.science/api/pith-number/6X3I34WI5T7JTB74TKJG5UREVG/graph.json","fetch_events":"https://pith.science/api/pith-number/6X3I34WI5T7JTB74TKJG5UREVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6X3I34WI5T7JTB74TKJG5UREVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6X3I34WI5T7JTB74TKJG5UREVG/action/storage_attestation","attest_author":"https://pith.science/pith/6X3I34WI5T7JTB74TKJG5UREVG/action/author_attestation","sign_citation":"https://pith.science/pith/6X3I34WI5T7JTB74TKJG5UREVG/action/citation_signature","submit_replication":"https://pith.science/pith/6X3I34WI5T7JTB74TKJG5UREVG/action/replication_record"}},"created_at":"2026-05-17T23:49:12.773728+00:00","updated_at":"2026-05-17T23:49:12.773728+00:00"}