{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YCD7UUPNBA4ADG2G4ELPTOW35S","short_pith_number":"pith:YCD7UUPN","schema_version":"1.0","canonical_sha256":"c087fa51ed0838019b46e116f9badbec98fb14734ad593758b323b1f05997caa","source":{"kind":"arxiv","id":"1708.03515","version":1},"attestation_state":"computed","paper":{"title":"New Tools and Connections for Exponential-time Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof, Nikhil Bansal, Parinya Chalermsook","submitted_at":"2017-08-11T12:16:47Z","abstract_excerpt":"In this paper, we develop new tools and connections for exponential time approximation. In this setting, we are given a problem instance and a parameter $\\alpha>1$, and the goal is to design an $\\alpha$-approximation algorithm with the fastest possible running time. We show the following results:\n  - An $r$-approximation for maximum independent set in $O^*(\\exp(\\tilde O(n/r \\log^2 r+r\\log^2r)))$ time,\n  - An $r$-approximation for chromatic number in $O^*(\\exp(\\tilde{O}(n/r \\log r+r\\log^2r)))$ time,\n  - A $(2-1/r)$-approximation for minimum vertex cover in $O^*(\\exp(n/r^{\\Omega(r)}))$ time, and"},"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":"1708.03515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-11T12:16:47Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"db4389e414728849ce450e75207a60f44bdfe140cc1dde7d66c919d46a6bb1bc","abstract_canon_sha256":"8740b89c620bfddadd2d2548bb5dd54130a12f250b8b399c06d4756bd5211fd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:12.481324Z","signature_b64":"rtLbGR3wM5q5zDzQ5vmj3IbYaCsVrhPFGPscNQYu/JF88SlNVsWBh4pSTQ5XGesW8fvL2pZ/uGlvTDfQSBghDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c087fa51ed0838019b46e116f9badbec98fb14734ad593758b323b1f05997caa","last_reissued_at":"2026-05-18T00:38:12.480718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:12.480718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Tools and Connections for Exponential-time Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof, Nikhil Bansal, Parinya Chalermsook","submitted_at":"2017-08-11T12:16:47Z","abstract_excerpt":"In this paper, we develop new tools and connections for exponential time approximation. In this setting, we are given a problem instance and a parameter $\\alpha>1$, and the goal is to design an $\\alpha$-approximation algorithm with the fastest possible running time. We show the following results:\n  - An $r$-approximation for maximum independent set in $O^*(\\exp(\\tilde O(n/r \\log^2 r+r\\log^2r)))$ time,\n  - An $r$-approximation for chromatic number in $O^*(\\exp(\\tilde{O}(n/r \\log r+r\\log^2r)))$ time,\n  - A $(2-1/r)$-approximation for minimum vertex cover in $O^*(\\exp(n/r^{\\Omega(r)}))$ time, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03515","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":"1708.03515","created_at":"2026-05-18T00:38:12.480821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.03515v1","created_at":"2026-05-18T00:38:12.480821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03515","created_at":"2026-05-18T00:38:12.480821+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCD7UUPNBA4A","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCD7UUPNBA4ADG2G","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCD7UUPN","created_at":"2026-05-18T12:31:56.362134+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/YCD7UUPNBA4ADG2G4ELPTOW35S","json":"https://pith.science/pith/YCD7UUPNBA4ADG2G4ELPTOW35S.json","graph_json":"https://pith.science/api/pith-number/YCD7UUPNBA4ADG2G4ELPTOW35S/graph.json","events_json":"https://pith.science/api/pith-number/YCD7UUPNBA4ADG2G4ELPTOW35S/events.json","paper":"https://pith.science/paper/YCD7UUPN"},"agent_actions":{"view_html":"https://pith.science/pith/YCD7UUPNBA4ADG2G4ELPTOW35S","download_json":"https://pith.science/pith/YCD7UUPNBA4ADG2G4ELPTOW35S.json","view_paper":"https://pith.science/paper/YCD7UUPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.03515&json=true","fetch_graph":"https://pith.science/api/pith-number/YCD7UUPNBA4ADG2G4ELPTOW35S/graph.json","fetch_events":"https://pith.science/api/pith-number/YCD7UUPNBA4ADG2G4ELPTOW35S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCD7UUPNBA4ADG2G4ELPTOW35S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCD7UUPNBA4ADG2G4ELPTOW35S/action/storage_attestation","attest_author":"https://pith.science/pith/YCD7UUPNBA4ADG2G4ELPTOW35S/action/author_attestation","sign_citation":"https://pith.science/pith/YCD7UUPNBA4ADG2G4ELPTOW35S/action/citation_signature","submit_replication":"https://pith.science/pith/YCD7UUPNBA4ADG2G4ELPTOW35S/action/replication_record"}},"created_at":"2026-05-18T00:38:12.480821+00:00","updated_at":"2026-05-18T00:38:12.480821+00:00"}