{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:57IIDYZ4SKIV5WQUYPSL3VXRR6","short_pith_number":"pith:57IIDYZ4","schema_version":"1.0","canonical_sha256":"efd081e33c92915eda14c3e4bdd6f18fb62dcc7e97b26020953178b492e20b34","source":{"kind":"arxiv","id":"1811.03020","version":1},"attestation_state":"computed","paper":{"title":"$O(\\log^2k/\\log\\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Fabrizio Grandoni, Shi Li","submitted_at":"2018-11-07T17:12:46Z","abstract_excerpt":"In the Directed Steiner Tree (DST) problem we are given an $n$-vertex directed edge-weighted graph, a root $r$, and a collection of $k$ terminal nodes. Our goal is to find a minimum-cost arborescence that contains a directed path from $r$ to every terminal. We present an $O(\\log^2 k/\\log\\log{k})$-approximation algorithm for DST that runs in quasi-polynomial-time. By adjusting the parameters in the hardness result of Halperin and Krauthgamer, we show the matching lower bound of $\\Omega(\\log^2{k}/\\log\\log{k})$ for the class of quasi-polynomial-time algorithms. This is the first improvement on th"},"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":"1811.03020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T17:12:46Z","cross_cats_sorted":[],"title_canon_sha256":"ceb8afd0569bf6ff7ec41598897ff57fb6f5baab5e2f88a7309134160d900faf","abstract_canon_sha256":"9c957a0f1263f74fbd737ac734d6fe0af8e2e4120e88a5ed5789252d61f2a350"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:20.127930Z","signature_b64":"bBPF83oih0SZD2ARIMTMhKnk2q1FtJVLiUm5oe53CFcoXZ/T8hk9hihZZKInFILfnUOT80KJq5hVAClvKmWkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efd081e33c92915eda14c3e4bdd6f18fb62dcc7e97b26020953178b492e20b34","last_reissued_at":"2026-05-18T00:01:20.127328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:20.127328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$O(\\log^2k/\\log\\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Fabrizio Grandoni, Shi Li","submitted_at":"2018-11-07T17:12:46Z","abstract_excerpt":"In the Directed Steiner Tree (DST) problem we are given an $n$-vertex directed edge-weighted graph, a root $r$, and a collection of $k$ terminal nodes. Our goal is to find a minimum-cost arborescence that contains a directed path from $r$ to every terminal. We present an $O(\\log^2 k/\\log\\log{k})$-approximation algorithm for DST that runs in quasi-polynomial-time. By adjusting the parameters in the hardness result of Halperin and Krauthgamer, we show the matching lower bound of $\\Omega(\\log^2{k}/\\log\\log{k})$ for the class of quasi-polynomial-time algorithms. This is the first improvement on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03020","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":"1811.03020","created_at":"2026-05-18T00:01:20.127434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03020v1","created_at":"2026-05-18T00:01:20.127434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03020","created_at":"2026-05-18T00:01:20.127434+00:00"},{"alias_kind":"pith_short_12","alias_value":"57IIDYZ4SKIV","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"57IIDYZ4SKIV5WQU","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"57IIDYZ4","created_at":"2026-05-18T12:32:08.215937+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/57IIDYZ4SKIV5WQUYPSL3VXRR6","json":"https://pith.science/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6.json","graph_json":"https://pith.science/api/pith-number/57IIDYZ4SKIV5WQUYPSL3VXRR6/graph.json","events_json":"https://pith.science/api/pith-number/57IIDYZ4SKIV5WQUYPSL3VXRR6/events.json","paper":"https://pith.science/paper/57IIDYZ4"},"agent_actions":{"view_html":"https://pith.science/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6","download_json":"https://pith.science/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6.json","view_paper":"https://pith.science/paper/57IIDYZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03020&json=true","fetch_graph":"https://pith.science/api/pith-number/57IIDYZ4SKIV5WQUYPSL3VXRR6/graph.json","fetch_events":"https://pith.science/api/pith-number/57IIDYZ4SKIV5WQUYPSL3VXRR6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6/action/storage_attestation","attest_author":"https://pith.science/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6/action/author_attestation","sign_citation":"https://pith.science/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6/action/citation_signature","submit_replication":"https://pith.science/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6/action/replication_record"}},"created_at":"2026-05-18T00:01:20.127434+00:00","updated_at":"2026-05-18T00:01:20.127434+00:00"}