{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OJXCDIZWNR5L4OYA7IZPCWPUD4","short_pith_number":"pith:OJXCDIZW","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"},"canonical_sha256":"726e21a3366c7abe3b00fa32f159f41f09a92009311f173059f49bf6847c9587","source":{"kind":"arxiv","id":"1811.00710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00710","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00710v1","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00710","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"OJXCDIZWNR5L","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OJXCDIZWNR5L4OYA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OJXCDIZW","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OJXCDIZWNR5L4OYA7IZPCWPUD4","target":"record","payload":{"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"},"canonical_sha256":"726e21a3366c7abe3b00fa32f159f41f09a92009311f173059f49bf6847c9587","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"},"source_kind":"arxiv","source_id":"1811.00710","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q5eH+jRCoDn6swbpVF+QN2A3hCsUGW2GIJlLyjyySkqD2wgiF7Fj6gjs572LAPaednDByNWZ3F/v3NxkNrxZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:09:13.191697Z"},"content_sha256":"b7f0fdecc2a47584dee665460465fa40fe404090da8b234ad4f728a5fad61c28","schema_version":"1.0","event_id":"sha256:b7f0fdecc2a47584dee665460465fa40fe404090da8b234ad4f728a5fad61c28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OJXCDIZWNR5L4OYA7IZPCWPUD4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t21o/7ZEO6zRx51HWBTUegugadDsQNkPB9MWoc9o9+OXewD5+tzj+FK6hf/vW5WLq07Qu6w5x+p1GizcdXrBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:09:13.192441Z"},"content_sha256":"abb00fa60bb568e090f24922af34a83106c8e88a926f71f91b32cbec04640e0d","schema_version":"1.0","event_id":"sha256:abb00fa60bb568e090f24922af34a83106c8e88a926f71f91b32cbec04640e0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4/bundle.json","state_url":"https://pith.science/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T00:09:13Z","links":{"resolver":"https://pith.science/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4","bundle":"https://pith.science/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4/bundle.json","state":"https://pith.science/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJXCDIZWNR5L4OYA7IZPCWPUD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OJXCDIZWNR5L4OYA7IZPCWPUD4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1b1086c5b0132530b96ecf9cc68362c4ce6d5abd82dc7e44fc050e7a5055fe10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T02:24:40Z","title_canon_sha256":"3587ba005630a8078d7c392799d39cdf4fefc9b9377886936090ebe433f2c027"},"schema_version":"1.0","source":{"id":"1811.00710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00710","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00710v1","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00710","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"OJXCDIZWNR5L","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OJXCDIZWNR5L4OYA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OJXCDIZW","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:abb00fa60bb568e090f24922af34a83106c8e88a926f71f91b32cbec04640e0d","target":"graph","created_at":"2026-05-18T00:01:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bundit Laekhanukit, Guy Kortsarz, Marek Cygan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T02:24:40Z","title":"On subexponential running times for approximating directed Steiner tree and related problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00710","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b7f0fdecc2a47584dee665460465fa40fe404090da8b234ad4f728a5fad61c28","target":"record","created_at":"2026-05-18T00:01:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1b1086c5b0132530b96ecf9cc68362c4ce6d5abd82dc7e44fc050e7a5055fe10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T02:24:40Z","title_canon_sha256":"3587ba005630a8078d7c392799d39cdf4fefc9b9377886936090ebe433f2c027"},"schema_version":"1.0","source":{"id":"1811.00710","kind":"arxiv","version":1}},"canonical_sha256":"726e21a3366c7abe3b00fa32f159f41f09a92009311f173059f49bf6847c9587","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"726e21a3366c7abe3b00fa32f159f41f09a92009311f173059f49bf6847c9587","first_computed_at":"2026-05-18T00:01:42.424063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:42.424063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TRVipFK/kEgs7k7fu2ivmqvsPEtuyUnCBsbsDu3j+sD2lK/zTN9qGtmzrzGr/d60dngzr7E3VDUIz2G+qaw/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:42.424618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7f0fdecc2a47584dee665460465fa40fe404090da8b234ad4f728a5fad61c28","sha256:abb00fa60bb568e090f24922af34a83106c8e88a926f71f91b32cbec04640e0d"],"state_sha256":"b33a5e8826351343c51cee9d768f4f8a1f47a5199afa416ff56b2daf070b7a6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KGsIPIK1NImqey+epm1iIxXGd8WnsOm/piR+bFIGjKD9OKbQJN4G1qSyJ1UqsowH8Jq31u9WgVeLRlKlL9qgAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:09:13.197338Z","bundle_sha256":"ab5a660d4eb6253a99e6fddae748f38bac717e3fec7a20a982b955c76c83c64c"}}