{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4DW235ARKGVCF5S7OKTO2FRHGM","short_pith_number":"pith:4DW235AR","schema_version":"1.0","canonical_sha256":"e0edadf41151aa22f65f72a6ed16273311152eb17b49a67aff200f24f35c6ff3","source":{"kind":"arxiv","id":"1907.11404","version":2},"attestation_state":"computed","paper":{"title":"On Approximating Degree-Bounded Network Design Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Daniel Vaz, Guy Kortsarz, Jiayi Xian, Shi Li, Xiangyu Guo","submitted_at":"2019-07-26T07:11:36Z","abstract_excerpt":"Directed Steiner Tree (DST) is a central problem in combinatorial optimization and theoretical computer science: Given a directed graph $G=(V, E)$ with edge costs $c \\in \\mathbb{R}_{\\geq 0}^E$, a root $r \\in V$ and $k$ terminals $K\\subseteq V$, we need to output the minimum-cost arborescence in $G$ that contains an $r$\\textrightarrow $t$ path for every $t \\in K$. Recently, Grandoni, Laekhanukit and Li, and independently Ghuge and Nagarajan, gave quasi-polynomial time $O(\\log^2k/\\log \\log k)$-approximation algorithms for the problem, which are tight under popular complexity assumptions.\n  In 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":"1907.11404","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-26T07:11:36Z","cross_cats_sorted":[],"title_canon_sha256":"316b12a9a3726b9453ea7202dd459c65c84ba699155ad9bd8ff889c19f5b7bd5","abstract_canon_sha256":"388febbecd3c89d925fd3d3a1b30c608bb2d8a29fd9587413ae1af7d737474b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:58:23.957170Z","signature_b64":"+H8eMQpmuM5BKzj182UkIxpw1xU2/F1S6y/0eqBYLGGgrcctUgU/cbYhyd1PhKBDl3p4o7z5lNoDe+w0a0hRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0edadf41151aa22f65f72a6ed16273311152eb17b49a67aff200f24f35c6ff3","last_reissued_at":"2026-07-05T00:58:23.956792Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:58:23.956792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Approximating Degree-Bounded Network Design Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Daniel Vaz, Guy Kortsarz, Jiayi Xian, Shi Li, Xiangyu Guo","submitted_at":"2019-07-26T07:11:36Z","abstract_excerpt":"Directed Steiner Tree (DST) is a central problem in combinatorial optimization and theoretical computer science: Given a directed graph $G=(V, E)$ with edge costs $c \\in \\mathbb{R}_{\\geq 0}^E$, a root $r \\in V$ and $k$ terminals $K\\subseteq V$, we need to output the minimum-cost arborescence in $G$ that contains an $r$\\textrightarrow $t$ path for every $t \\in K$. Recently, Grandoni, Laekhanukit and Li, and independently Ghuge and Nagarajan, gave quasi-polynomial time $O(\\log^2k/\\log \\log k)$-approximation algorithms for the problem, which are tight under popular complexity assumptions.\n  In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11404","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.11404/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1907.11404","created_at":"2026-07-05T00:58:23.956845+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.11404v2","created_at":"2026-07-05T00:58:23.956845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11404","created_at":"2026-07-05T00:58:23.956845+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DW235ARKGVC","created_at":"2026-07-05T00:58:23.956845+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DW235ARKGVCF5S7","created_at":"2026-07-05T00:58:23.956845+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DW235AR","created_at":"2026-07-05T00:58:23.956845+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/4DW235ARKGVCF5S7OKTO2FRHGM","json":"https://pith.science/pith/4DW235ARKGVCF5S7OKTO2FRHGM.json","graph_json":"https://pith.science/api/pith-number/4DW235ARKGVCF5S7OKTO2FRHGM/graph.json","events_json":"https://pith.science/api/pith-number/4DW235ARKGVCF5S7OKTO2FRHGM/events.json","paper":"https://pith.science/paper/4DW235AR"},"agent_actions":{"view_html":"https://pith.science/pith/4DW235ARKGVCF5S7OKTO2FRHGM","download_json":"https://pith.science/pith/4DW235ARKGVCF5S7OKTO2FRHGM.json","view_paper":"https://pith.science/paper/4DW235AR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.11404&json=true","fetch_graph":"https://pith.science/api/pith-number/4DW235ARKGVCF5S7OKTO2FRHGM/graph.json","fetch_events":"https://pith.science/api/pith-number/4DW235ARKGVCF5S7OKTO2FRHGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DW235ARKGVCF5S7OKTO2FRHGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DW235ARKGVCF5S7OKTO2FRHGM/action/storage_attestation","attest_author":"https://pith.science/pith/4DW235ARKGVCF5S7OKTO2FRHGM/action/author_attestation","sign_citation":"https://pith.science/pith/4DW235ARKGVCF5S7OKTO2FRHGM/action/citation_signature","submit_replication":"https://pith.science/pith/4DW235ARKGVCF5S7OKTO2FRHGM/action/replication_record"}},"created_at":"2026-07-05T00:58:23.956845+00:00","updated_at":"2026-07-05T00:58:23.956845+00:00"}