{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:O2VKPD6QDY5DZPHIMFTDJQSYDK","short_pith_number":"pith:O2VKPD6Q","schema_version":"1.0","canonical_sha256":"76aaa78fd01e3a3cbce8616634c2581a941a7f752fb93fd681442eacdb0499e2","source":{"kind":"arxiv","id":"1112.2275","version":3},"attestation_state":"computed","paper":{"title":"On Problems as Hard as CNFSAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Daniel Marx, Holger Dell, Jesper Nederlof, Magnus Wahlstrom, Marek Cygan, Ramamohan Paturi, Saket Saurabh, Yoshio Okamoto","submitted_at":"2011-12-10T13:19:33Z","abstract_excerpt":"The field of exact exponential time algorithms for NP-hard problems has thrived over the last decade. While exhaustive search remains asymptotically the fastest known algorithm for some basic problems, difficult and non-trivial exponential time algorithms have been found for a myriad of problems, including Graph Coloring, Hamiltonian Path, Dominating Set and 3-CNF-Sat. In some instances, improving these algorithms further seems to be out of reach. The CNF-Sat problem is the canonical example of a problem for which the trivial exhaustive search algorithm runs in time O(2^n), where n is the numb"},"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":"1112.2275","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-10T13:19:33Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"b8dd404e50cf7eed1c82bcecb47e62fbfcdc5b50f09662047ef59cbf54138642","abstract_canon_sha256":"2b9c0be820c63a551cbf2767a93d9e341ffab1d9d2122ca3b46386ac9c645df6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:55.801959Z","signature_b64":"BlD8FYq9le8kEoehQMLuGF77JKrd4GZZRfrrt0gPXLYNj6Ub59vlDGhUuJ4on4CVigsUzA9xPnz1+14XEITgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76aaa78fd01e3a3cbce8616634c2581a941a7f752fb93fd681442eacdb0499e2","last_reissued_at":"2026-05-18T00:17:55.801324Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:55.801324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Problems as Hard as CNFSAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Daniel Marx, Holger Dell, Jesper Nederlof, Magnus Wahlstrom, Marek Cygan, Ramamohan Paturi, Saket Saurabh, Yoshio Okamoto","submitted_at":"2011-12-10T13:19:33Z","abstract_excerpt":"The field of exact exponential time algorithms for NP-hard problems has thrived over the last decade. While exhaustive search remains asymptotically the fastest known algorithm for some basic problems, difficult and non-trivial exponential time algorithms have been found for a myriad of problems, including Graph Coloring, Hamiltonian Path, Dominating Set and 3-CNF-Sat. In some instances, improving these algorithms further seems to be out of reach. The CNF-Sat problem is the canonical example of a problem for which the trivial exhaustive search algorithm runs in time O(2^n), where n is the numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2275","kind":"arxiv","version":3},"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":"1112.2275","created_at":"2026-05-18T00:17:55.801419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.2275v3","created_at":"2026-05-18T00:17:55.801419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2275","created_at":"2026-05-18T00:17:55.801419+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2VKPD6QDY5D","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2VKPD6QDY5DZPHI","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2VKPD6Q","created_at":"2026-05-18T12:26:37.096874+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/O2VKPD6QDY5DZPHIMFTDJQSYDK","json":"https://pith.science/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK.json","graph_json":"https://pith.science/api/pith-number/O2VKPD6QDY5DZPHIMFTDJQSYDK/graph.json","events_json":"https://pith.science/api/pith-number/O2VKPD6QDY5DZPHIMFTDJQSYDK/events.json","paper":"https://pith.science/paper/O2VKPD6Q"},"agent_actions":{"view_html":"https://pith.science/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK","download_json":"https://pith.science/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK.json","view_paper":"https://pith.science/paper/O2VKPD6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.2275&json=true","fetch_graph":"https://pith.science/api/pith-number/O2VKPD6QDY5DZPHIMFTDJQSYDK/graph.json","fetch_events":"https://pith.science/api/pith-number/O2VKPD6QDY5DZPHIMFTDJQSYDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK/action/storage_attestation","attest_author":"https://pith.science/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK/action/author_attestation","sign_citation":"https://pith.science/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK/action/citation_signature","submit_replication":"https://pith.science/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK/action/replication_record"}},"created_at":"2026-05-18T00:17:55.801419+00:00","updated_at":"2026-05-18T00:17:55.801419+00:00"}