{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OIORXHNPEZRVZLS4RPSVSK4DSS","short_pith_number":"pith:OIORXHNP","schema_version":"1.0","canonical_sha256":"721d1b9daf26635cae5c8be5592b8394a656e2ab6a1094cebce862284362181c","source":{"kind":"arxiv","id":"1111.5473","version":2},"attestation_state":"computed","paper":{"title":"Directed Steiner Tree and the Lasserre Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Thomas Rothvo{\\ss}","submitted_at":"2011-11-23T12:21:33Z","abstract_excerpt":"The goal for the Directed Steiner Tree problem is to find a minimum cost tree in a directed graph G=(V,E) that connects all terminals X to a given root r. It is well known that modulo a logarithmic factor it suffices to consider acyclic graphs where the nodes are arranged in L <= log |X| levels. Unfortunately the natural LP formulation has a |X|^(1/2) integrality gap already for 5 levels. We show that for every L, the O(L)-round Lasserre Strengthening of this LP has integrality gap O(L log |X|). This provides a polynomial time |X|^{epsilon}-approximation and a O(log^3 |X|) approximation in O(n"},"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":"1111.5473","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-23T12:21:33Z","cross_cats_sorted":[],"title_canon_sha256":"576bbe43271a296e94a9ba5f32253d0c844633308d2c7ea785c28d938d8e8917","abstract_canon_sha256":"4e4b8c720f535f240827ee2fa8519ed1b0827804dba72291a19f1d80af499630"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:44.971503Z","signature_b64":"rBaQ/+xoTEHklUO8ybqSzWk0horHF65rckHhdif/uBz98Ta9SrDHr/E+ZsedgzMiWpiu7o+cmP2R3Q4CQIZyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"721d1b9daf26635cae5c8be5592b8394a656e2ab6a1094cebce862284362181c","last_reissued_at":"2026-05-18T03:53:44.970789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:44.970789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Directed Steiner Tree and the Lasserre Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Thomas Rothvo{\\ss}","submitted_at":"2011-11-23T12:21:33Z","abstract_excerpt":"The goal for the Directed Steiner Tree problem is to find a minimum cost tree in a directed graph G=(V,E) that connects all terminals X to a given root r. It is well known that modulo a logarithmic factor it suffices to consider acyclic graphs where the nodes are arranged in L <= log |X| levels. Unfortunately the natural LP formulation has a |X|^(1/2) integrality gap already for 5 levels. We show that for every L, the O(L)-round Lasserre Strengthening of this LP has integrality gap O(L log |X|). This provides a polynomial time |X|^{epsilon}-approximation and a O(log^3 |X|) approximation in O(n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5473","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":""},"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":"1111.5473","created_at":"2026-05-18T03:53:44.970908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.5473v2","created_at":"2026-05-18T03:53:44.970908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5473","created_at":"2026-05-18T03:53:44.970908+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIORXHNPEZRV","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIORXHNPEZRVZLS4","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIORXHNP","created_at":"2026-05-18T12:26:37.096874+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/OIORXHNPEZRVZLS4RPSVSK4DSS","json":"https://pith.science/pith/OIORXHNPEZRVZLS4RPSVSK4DSS.json","graph_json":"https://pith.science/api/pith-number/OIORXHNPEZRVZLS4RPSVSK4DSS/graph.json","events_json":"https://pith.science/api/pith-number/OIORXHNPEZRVZLS4RPSVSK4DSS/events.json","paper":"https://pith.science/paper/OIORXHNP"},"agent_actions":{"view_html":"https://pith.science/pith/OIORXHNPEZRVZLS4RPSVSK4DSS","download_json":"https://pith.science/pith/OIORXHNPEZRVZLS4RPSVSK4DSS.json","view_paper":"https://pith.science/paper/OIORXHNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.5473&json=true","fetch_graph":"https://pith.science/api/pith-number/OIORXHNPEZRVZLS4RPSVSK4DSS/graph.json","fetch_events":"https://pith.science/api/pith-number/OIORXHNPEZRVZLS4RPSVSK4DSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIORXHNPEZRVZLS4RPSVSK4DSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIORXHNPEZRVZLS4RPSVSK4DSS/action/storage_attestation","attest_author":"https://pith.science/pith/OIORXHNPEZRVZLS4RPSVSK4DSS/action/author_attestation","sign_citation":"https://pith.science/pith/OIORXHNPEZRVZLS4RPSVSK4DSS/action/citation_signature","submit_replication":"https://pith.science/pith/OIORXHNPEZRVZLS4RPSVSK4DSS/action/replication_record"}},"created_at":"2026-05-18T03:53:44.970908+00:00","updated_at":"2026-05-18T03:53:44.970908+00:00"}