{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:O2VKPD6QDY5DZPHIMFTDJQSYDK","short_pith_number":"pith:O2VKPD6Q","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"},"canonical_sha256":"76aaa78fd01e3a3cbce8616634c2581a941a7f752fb93fd681442eacdb0499e2","source":{"kind":"arxiv","id":"1112.2275","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2275","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2275v3","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2275","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"O2VKPD6QDY5D","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O2VKPD6QDY5DZPHI","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O2VKPD6Q","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:O2VKPD6QDY5DZPHIMFTDJQSYDK","target":"record","payload":{"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"},"canonical_sha256":"76aaa78fd01e3a3cbce8616634c2581a941a7f752fb93fd681442eacdb0499e2","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"},"source_kind":"arxiv","source_id":"1112.2275","source_version":3,"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:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2oKxbo1Sla0TiAu+Gc0daDn3MgwaipXJ/jimOiUffdvgfNk0FoCJnUwgj+MtCoOp0v9OZQKN/fLKrpffvRIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:21:58.051782Z"},"content_sha256":"0feed0edf671a0aff6c904c1cda40aa7bb166962685adc5fcdff16d60ca153c2","schema_version":"1.0","event_id":"sha256:0feed0edf671a0aff6c904c1cda40aa7bb166962685adc5fcdff16d60ca153c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:O2VKPD6QDY5DZPHIMFTDJQSYDK","target":"graph","payload":{"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"},"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:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4a1/7RN3iTIn8thE3kO5OqA8IQ6o9rQBUilZXo4dfw4Eixxsi8aV/0Mgv1YpGu6YJ+Niotr3IA2nqlKJMu1nDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:21:58.052487Z"},"content_sha256":"ca134b2d2d8c680094345effb5201b789139402dbe51cf2aee24b0d4ba413d8e","schema_version":"1.0","event_id":"sha256:ca134b2d2d8c680094345effb5201b789139402dbe51cf2aee24b0d4ba413d8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK/bundle.json","state_url":"https://pith.science/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK/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-18T20:21:58Z","links":{"resolver":"https://pith.science/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK","bundle":"https://pith.science/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK/bundle.json","state":"https://pith.science/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2VKPD6QDY5DZPHIMFTDJQSYDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:O2VKPD6QDY5DZPHIMFTDJQSYDK","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":"2b9c0be820c63a551cbf2767a93d9e341ffab1d9d2122ca3b46386ac9c645df6","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-10T13:19:33Z","title_canon_sha256":"b8dd404e50cf7eed1c82bcecb47e62fbfcdc5b50f09662047ef59cbf54138642"},"schema_version":"1.0","source":{"id":"1112.2275","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2275","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2275v3","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2275","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"O2VKPD6QDY5D","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O2VKPD6QDY5DZPHI","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O2VKPD6Q","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:ca134b2d2d8c680094345effb5201b789139402dbe51cf2aee24b0d4ba413d8e","target":"graph","created_at":"2026-05-18T00:17:55Z","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":"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","authors_text":"Daniel Lokshtanov, Daniel Marx, Holger Dell, Jesper Nederlof, Magnus Wahlstrom, Marek Cygan, Ramamohan Paturi, Saket Saurabh, Yoshio Okamoto","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-10T13:19:33Z","title":"On Problems as Hard as CNFSAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2275","kind":"arxiv","version":3},"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:0feed0edf671a0aff6c904c1cda40aa7bb166962685adc5fcdff16d60ca153c2","target":"record","created_at":"2026-05-18T00:17:55Z","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":"2b9c0be820c63a551cbf2767a93d9e341ffab1d9d2122ca3b46386ac9c645df6","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-10T13:19:33Z","title_canon_sha256":"b8dd404e50cf7eed1c82bcecb47e62fbfcdc5b50f09662047ef59cbf54138642"},"schema_version":"1.0","source":{"id":"1112.2275","kind":"arxiv","version":3}},"canonical_sha256":"76aaa78fd01e3a3cbce8616634c2581a941a7f752fb93fd681442eacdb0499e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76aaa78fd01e3a3cbce8616634c2581a941a7f752fb93fd681442eacdb0499e2","first_computed_at":"2026-05-18T00:17:55.801324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:55.801324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BlD8FYq9le8kEoehQMLuGF77JKrd4GZZRfrrt0gPXLYNj6Ub59vlDGhUuJ4on4CVigsUzA9xPnz1+14XEITgDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:55.801959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2275","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0feed0edf671a0aff6c904c1cda40aa7bb166962685adc5fcdff16d60ca153c2","sha256:ca134b2d2d8c680094345effb5201b789139402dbe51cf2aee24b0d4ba413d8e"],"state_sha256":"faaf762b9c7576b47afc0d3aeff0cf39792c1dfa66a0ecc5344923902836650a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wgS6uRi7uzCaZnTDY95Na8N2gy27CTjvOX0eeEMMI9R+TvniIyevUlfwTX+LLTf7ediYqE77mW/TFraEE7oQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T20:21:58.054668Z","bundle_sha256":"1afe71125c534d170248989852d68906446b86f1898abd4bc77cf2772ca7b7e8"}}