{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OJXCDIZWNR5L4OYA7IZPCWPUD4","short_pith_number":"pith:OJXCDIZW","schema_version":"1.0","canonical_sha256":"726e21a3366c7abe3b00fa32f159f41f09a92009311f173059f49bf6847c9587","source":{"kind":"arxiv","id":"1811.00710","version":1},"attestation_state":"computed","paper":{"title":"On subexponential running times for approximating directed Steiner tree and related problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Guy Kortsarz, Marek Cygan","submitted_at":"2018-11-02T02:24:40Z","abstract_excerpt":"This paper concerns proving almost tight (super-polynomial) running times, for achieving desired approximation ratios for various problems. To illustrate, the question we study, let us consider the Set-Cover problem with n elements and m sets. Now we specify our goal to approximate Set-Cover to a factor of (1-d)ln n, for a given parameter 0<d<1. What is the best possible running time for achieving such approximation? This question was answered implicitly in the work of Moshkovitz [Theory of Computing, 2015]: Assuming both the Projection Games Conjecture (PGC) and the Exponential-Time Hypothesi"},"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.00710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T02:24:40Z","cross_cats_sorted":[],"title_canon_sha256":"3587ba005630a8078d7c392799d39cdf4fefc9b9377886936090ebe433f2c027","abstract_canon_sha256":"1b1086c5b0132530b96ecf9cc68362c4ce6d5abd82dc7e44fc050e7a5055fe10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:42.424618Z","signature_b64":"TRVipFK/kEgs7k7fu2ivmqvsPEtuyUnCBsbsDu3j+sD2lK/zTN9qGtmzrzGr/d60dngzr7E3VDUIz2G+qaw/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"726e21a3366c7abe3b00fa32f159f41f09a92009311f173059f49bf6847c9587","last_reissued_at":"2026-05-18T00:01:42.424063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:42.424063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On subexponential running times for approximating directed Steiner tree and related problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Guy Kortsarz, Marek Cygan","submitted_at":"2018-11-02T02:24:40Z","abstract_excerpt":"This paper concerns proving almost tight (super-polynomial) running times, for achieving desired approximation ratios for various problems. To illustrate, the question we study, let us consider the Set-Cover problem with n elements and m sets. Now we specify our goal to approximate Set-Cover to a factor of (1-d)ln n, for a given parameter 0<d<1. What is the best possible running time for achieving such approximation? This question was answered implicitly in the work of Moshkovitz [Theory of Computing, 2015]: Assuming both the Projection Games Conjecture (PGC) and the Exponential-Time Hypothesi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00710","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.00710","created_at":"2026-05-18T00:01:42.424152+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.00710v1","created_at":"2026-05-18T00:01:42.424152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00710","created_at":"2026-05-18T00:01:42.424152+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJXCDIZWNR5L","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJXCDIZWNR5L4OYA","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJXCDIZW","created_at":"2026-05-18T12:32:43.782077+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/OJXCDIZWNR5L4OYA7IZPCWPUD4","json":"https://pith.science/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4.json","graph_json":"https://pith.science/api/pith-number/OJXCDIZWNR5L4OYA7IZPCWPUD4/graph.json","events_json":"https://pith.science/api/pith-number/OJXCDIZWNR5L4OYA7IZPCWPUD4/events.json","paper":"https://pith.science/paper/OJXCDIZW"},"agent_actions":{"view_html":"https://pith.science/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4","download_json":"https://pith.science/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4.json","view_paper":"https://pith.science/paper/OJXCDIZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.00710&json=true","fetch_graph":"https://pith.science/api/pith-number/OJXCDIZWNR5L4OYA7IZPCWPUD4/graph.json","fetch_events":"https://pith.science/api/pith-number/OJXCDIZWNR5L4OYA7IZPCWPUD4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4/action/storage_attestation","attest_author":"https://pith.science/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4/action/author_attestation","sign_citation":"https://pith.science/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4/action/citation_signature","submit_replication":"https://pith.science/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4/action/replication_record"}},"created_at":"2026-05-18T00:01:42.424152+00:00","updated_at":"2026-05-18T00:01:42.424152+00:00"}