{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4YNF3U7EBGXEGBCAWKPBQ7B5W6","short_pith_number":"pith:4YNF3U7E","schema_version":"1.0","canonical_sha256":"e61a5dd3e409ae430440b29e187c3db7a3b412a9a87d56089375817aa6a2ca8c","source":{"kind":"arxiv","id":"1502.05828","version":1},"attestation_state":"computed","paper":{"title":"Time-Approximation Trade-offs for Inapproximable Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"\\'Edouard Bonnet, Michael Lampis, Vangelis Th. Paschos","submitted_at":"2015-02-20T11:07:52Z","abstract_excerpt":"In this paper we focus on problems which do not admit a constant-factor approximation in polynomial time and explore how quickly their approximability improves as the allowed running time is gradually increased from polynomial to (sub-)exponential.\n  We tackle a number of problems: For Min Independent Dominating Set, Max Induced Path, Forest and Tree, for any $r(n)$, a simple, known scheme gives an approximation ratio of $r$ in time roughly $r^{n/r}$. We show that, for most values of $r$, if this running time could be significantly improved the ETH would fail. For Max Minimal Vertex Cover we g"},"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":"1502.05828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-20T11:07:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"df4f9f9383d5873c8aa8a649befb36a1fe0c7d7edb53e0585b2963238f5545b9","abstract_canon_sha256":"6e6fa35da8ada59ae9f17282726eaa7dea373d845e2466d65d1d55f74a09231b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:44.681639Z","signature_b64":"IV4n2ba4UxIFzzdjJrZeAlo/2cbhUovGdHay91VdlVlIczKgT8I2/vDO7wSesDOinofs79Mii3FhdBbkmQm6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e61a5dd3e409ae430440b29e187c3db7a3b412a9a87d56089375817aa6a2ca8c","last_reissued_at":"2026-05-18T02:26:44.681082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:44.681082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-Approximation Trade-offs for Inapproximable Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"\\'Edouard Bonnet, Michael Lampis, Vangelis Th. Paschos","submitted_at":"2015-02-20T11:07:52Z","abstract_excerpt":"In this paper we focus on problems which do not admit a constant-factor approximation in polynomial time and explore how quickly their approximability improves as the allowed running time is gradually increased from polynomial to (sub-)exponential.\n  We tackle a number of problems: For Min Independent Dominating Set, Max Induced Path, Forest and Tree, for any $r(n)$, a simple, known scheme gives an approximation ratio of $r$ in time roughly $r^{n/r}$. We show that, for most values of $r$, if this running time could be significantly improved the ETH would fail. For Max Minimal Vertex Cover we g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05828","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":"1502.05828","created_at":"2026-05-18T02:26:44.681140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05828v1","created_at":"2026-05-18T02:26:44.681140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05828","created_at":"2026-05-18T02:26:44.681140+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YNF3U7EBGXE","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YNF3U7EBGXEGBCA","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YNF3U7E","created_at":"2026-05-18T12:29:05.191682+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/4YNF3U7EBGXEGBCAWKPBQ7B5W6","json":"https://pith.science/pith/4YNF3U7EBGXEGBCAWKPBQ7B5W6.json","graph_json":"https://pith.science/api/pith-number/4YNF3U7EBGXEGBCAWKPBQ7B5W6/graph.json","events_json":"https://pith.science/api/pith-number/4YNF3U7EBGXEGBCAWKPBQ7B5W6/events.json","paper":"https://pith.science/paper/4YNF3U7E"},"agent_actions":{"view_html":"https://pith.science/pith/4YNF3U7EBGXEGBCAWKPBQ7B5W6","download_json":"https://pith.science/pith/4YNF3U7EBGXEGBCAWKPBQ7B5W6.json","view_paper":"https://pith.science/paper/4YNF3U7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05828&json=true","fetch_graph":"https://pith.science/api/pith-number/4YNF3U7EBGXEGBCAWKPBQ7B5W6/graph.json","fetch_events":"https://pith.science/api/pith-number/4YNF3U7EBGXEGBCAWKPBQ7B5W6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YNF3U7EBGXEGBCAWKPBQ7B5W6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YNF3U7EBGXEGBCAWKPBQ7B5W6/action/storage_attestation","attest_author":"https://pith.science/pith/4YNF3U7EBGXEGBCAWKPBQ7B5W6/action/author_attestation","sign_citation":"https://pith.science/pith/4YNF3U7EBGXEGBCAWKPBQ7B5W6/action/citation_signature","submit_replication":"https://pith.science/pith/4YNF3U7EBGXEGBCAWKPBQ7B5W6/action/replication_record"}},"created_at":"2026-05-18T02:26:44.681140+00:00","updated_at":"2026-05-18T02:26:44.681140+00:00"}