{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OEUGSQKAY6SX2X2NSJ4XG64Z6U","short_pith_number":"pith:OEUGSQKA","schema_version":"1.0","canonical_sha256":"7128694140c7a57d5f4d9279737b99f5384e5e8d7e823d18939ee61efff6979e","source":{"kind":"arxiv","id":"1804.07901","version":7},"attestation_state":"computed","paper":{"title":"Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"S. Cliff Liu","submitted_at":"2018-04-21T06:31:00Z","abstract_excerpt":"We present the current fastest deterministic algorithm for $k$-SAT, improving the upper bound $(2-2/k)^{n + o(n)}$ dues to Moser and Scheder [STOC'11]. The algorithm combines a branching algorithm with the derandomized local search, whose analysis relies on a special sequence of clauses called chain, and a generalization of covering code based on linear programming. We also provide a more ingenious branching algorithm for $3$-SAT to establish the upper bound $1.32793^n$, improved from $1.3303^n$."},"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":"1804.07901","kind":"arxiv","version":7},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T06:31:00Z","cross_cats_sorted":[],"title_canon_sha256":"fcfdb9efbdb334fb316d837e0bb256da208630eb21abed6dd528d5771629e232","abstract_canon_sha256":"d8549cccdaba3a4c20100e46bb7ca493194602468bee216067b5d18f052ba0ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:48:58.060725Z","signature_b64":"qo3qSJ0Ji/2X/fHvkP/pjCoNeVejjY8yB9UwGRsy6BctzjKZtBrNYoRSNQQzyGMHviu+u2XyvOuAxOhhLSgBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7128694140c7a57d5f4d9279737b99f5384e5e8d7e823d18939ee61efff6979e","last_reissued_at":"2026-07-05T00:48:58.060278Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:48:58.060278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"S. Cliff Liu","submitted_at":"2018-04-21T06:31:00Z","abstract_excerpt":"We present the current fastest deterministic algorithm for $k$-SAT, improving the upper bound $(2-2/k)^{n + o(n)}$ dues to Moser and Scheder [STOC'11]. The algorithm combines a branching algorithm with the derandomized local search, whose analysis relies on a special sequence of clauses called chain, and a generalization of covering code based on linear programming. We also provide a more ingenious branching algorithm for $3$-SAT to establish the upper bound $1.32793^n$, improved from $1.3303^n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07901","kind":"arxiv","version":7},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1804.07901/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1804.07901","created_at":"2026-07-05T00:48:58.060345+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07901v7","created_at":"2026-07-05T00:48:58.060345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07901","created_at":"2026-07-05T00:48:58.060345+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEUGSQKAY6SX","created_at":"2026-07-05T00:48:58.060345+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEUGSQKAY6SX2X2N","created_at":"2026-07-05T00:48:58.060345+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEUGSQKA","created_at":"2026-07-05T00:48:58.060345+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/OEUGSQKAY6SX2X2NSJ4XG64Z6U","json":"https://pith.science/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U.json","graph_json":"https://pith.science/api/pith-number/OEUGSQKAY6SX2X2NSJ4XG64Z6U/graph.json","events_json":"https://pith.science/api/pith-number/OEUGSQKAY6SX2X2NSJ4XG64Z6U/events.json","paper":"https://pith.science/paper/OEUGSQKA"},"agent_actions":{"view_html":"https://pith.science/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U","download_json":"https://pith.science/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U.json","view_paper":"https://pith.science/paper/OEUGSQKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07901&json=true","fetch_graph":"https://pith.science/api/pith-number/OEUGSQKAY6SX2X2NSJ4XG64Z6U/graph.json","fetch_events":"https://pith.science/api/pith-number/OEUGSQKAY6SX2X2NSJ4XG64Z6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U/action/storage_attestation","attest_author":"https://pith.science/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U/action/author_attestation","sign_citation":"https://pith.science/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U/action/citation_signature","submit_replication":"https://pith.science/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U/action/replication_record"}},"created_at":"2026-07-05T00:48:58.060345+00:00","updated_at":"2026-07-05T00:48:58.060345+00:00"}