{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:25H7GE65YHVTODTUP2NQQ6BYTC","short_pith_number":"pith:25H7GE65","schema_version":"1.0","canonical_sha256":"d74ff313ddc1eb370e747e9b0878389896c9b48dbb390bbaf42d668369a176af","source":{"kind":"arxiv","id":"1604.08132","version":1},"attestation_state":"computed","paper":{"title":"A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jochen Koenemann, Mohammad Shadravan, Zachary Friggstad","submitted_at":"2016-04-27T16:30:43Z","abstract_excerpt":"We demonstrate that the integrality gap of the natural cut-based LP relaxation for the directed Steiner tree problem is $O(\\log k)$ in quasi-bipartite graphs with $k$ terminals. Such instances can be seen to generalize set cover, so the integrality gap analysis is tight up to a constant factor. A novel aspect of our approach is that we use the primal-dual method; a technique that is rarely used in designing approximation algorithms for network design problems in directed graphs."},"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":"1604.08132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-27T16:30:43Z","cross_cats_sorted":[],"title_canon_sha256":"d26d7524964ffea42fadaa70cae1882d8075494ce46f94cc3e3ff9b3f60bd0ad","abstract_canon_sha256":"b93faf63dd3914421f5e3851ba1540dc5427480e37e4e4fece61ce34901c10e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:08.011240Z","signature_b64":"/MC199selJLJXY5aicDpYgxYEVIxxCuanCqnuon2fQ48aYS80kY4daqgYjtwzY3hmxsJBfiiV2+01zoDvHIpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d74ff313ddc1eb370e747e9b0878389896c9b48dbb390bbaf42d668369a176af","last_reissued_at":"2026-05-18T01:16:08.010556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:08.010556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jochen Koenemann, Mohammad Shadravan, Zachary Friggstad","submitted_at":"2016-04-27T16:30:43Z","abstract_excerpt":"We demonstrate that the integrality gap of the natural cut-based LP relaxation for the directed Steiner tree problem is $O(\\log k)$ in quasi-bipartite graphs with $k$ terminals. Such instances can be seen to generalize set cover, so the integrality gap analysis is tight up to a constant factor. A novel aspect of our approach is that we use the primal-dual method; a technique that is rarely used in designing approximation algorithms for network design problems in directed graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08132","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":"1604.08132","created_at":"2026-05-18T01:16:08.010663+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08132v1","created_at":"2026-05-18T01:16:08.010663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08132","created_at":"2026-05-18T01:16:08.010663+00:00"},{"alias_kind":"pith_short_12","alias_value":"25H7GE65YHVT","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"25H7GE65YHVTODTU","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"25H7GE65","created_at":"2026-05-18T12:29:52.810259+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/25H7GE65YHVTODTUP2NQQ6BYTC","json":"https://pith.science/pith/25H7GE65YHVTODTUP2NQQ6BYTC.json","graph_json":"https://pith.science/api/pith-number/25H7GE65YHVTODTUP2NQQ6BYTC/graph.json","events_json":"https://pith.science/api/pith-number/25H7GE65YHVTODTUP2NQQ6BYTC/events.json","paper":"https://pith.science/paper/25H7GE65"},"agent_actions":{"view_html":"https://pith.science/pith/25H7GE65YHVTODTUP2NQQ6BYTC","download_json":"https://pith.science/pith/25H7GE65YHVTODTUP2NQQ6BYTC.json","view_paper":"https://pith.science/paper/25H7GE65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08132&json=true","fetch_graph":"https://pith.science/api/pith-number/25H7GE65YHVTODTUP2NQQ6BYTC/graph.json","fetch_events":"https://pith.science/api/pith-number/25H7GE65YHVTODTUP2NQQ6BYTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25H7GE65YHVTODTUP2NQQ6BYTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25H7GE65YHVTODTUP2NQQ6BYTC/action/storage_attestation","attest_author":"https://pith.science/pith/25H7GE65YHVTODTUP2NQQ6BYTC/action/author_attestation","sign_citation":"https://pith.science/pith/25H7GE65YHVTODTUP2NQQ6BYTC/action/citation_signature","submit_replication":"https://pith.science/pith/25H7GE65YHVTODTUP2NQQ6BYTC/action/replication_record"}},"created_at":"2026-05-18T01:16:08.010663+00:00","updated_at":"2026-05-18T01:16:08.010663+00:00"}