{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OEUGSQKAY6SX2X2NSJ4XG64Z6U","short_pith_number":"pith:OEUGSQKA","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"},"canonical_sha256":"7128694140c7a57d5f4d9279737b99f5384e5e8d7e823d18939ee61efff6979e","source":{"kind":"arxiv","id":"1804.07901","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07901","created_at":"2026-07-05T00:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07901v7","created_at":"2026-07-05T00:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07901","created_at":"2026-07-05T00:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"OEUGSQKAY6SX","created_at":"2026-07-05T00:48:58Z"},{"alias_kind":"pith_short_16","alias_value":"OEUGSQKAY6SX2X2N","created_at":"2026-07-05T00:48:58Z"},{"alias_kind":"pith_short_8","alias_value":"OEUGSQKA","created_at":"2026-07-05T00:48:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OEUGSQKAY6SX2X2NSJ4XG64Z6U","target":"record","payload":{"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"},"canonical_sha256":"7128694140c7a57d5f4d9279737b99f5384e5e8d7e823d18939ee61efff6979e","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"},"source_kind":"arxiv","source_id":"1804.07901","source_version":7,"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-07-05T00:48:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TvHDDQ2Vlj8xcclGVyI14pHA4+U3QHLxxZAx4PVoTqUCMDYcTP3glIX+JgESZr86ElzRAaKjUTArG8uGhrcEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T16:55:03.754474Z"},"content_sha256":"2477682f4490acf90a9f4859b5e0077246fd2816f87bc5e7d9ee750fb222e912","schema_version":"1.0","event_id":"sha256:2477682f4490acf90a9f4859b5e0077246fd2816f87bc5e7d9ee750fb222e912"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OEUGSQKAY6SX2X2NSJ4XG64Z6U","target":"graph","payload":{"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"},"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-07-05T00:48:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZVsGocQltyPR5KX0UQxUTK/OdKjYTpq/R3mtaATy7YamQiqLPsnxgBOvKOnDmH1f1eppV0wGin+iO8TUcjkaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T16:55:03.755164Z"},"content_sha256":"9cb41021f598f3c20e45682f85125f004fbb3a8ac96a46edce432648c32fb1c9","schema_version":"1.0","event_id":"sha256:9cb41021f598f3c20e45682f85125f004fbb3a8ac96a46edce432648c32fb1c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U/bundle.json","state_url":"https://pith.science/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U/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-08-21T16:55:03Z","links":{"resolver":"https://pith.science/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U","bundle":"https://pith.science/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U/bundle.json","state":"https://pith.science/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OEUGSQKAY6SX2X2NSJ4XG64Z6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OEUGSQKAY6SX2X2NSJ4XG64Z6U","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":"d8549cccdaba3a4c20100e46bb7ca493194602468bee216067b5d18f052ba0ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T06:31:00Z","title_canon_sha256":"fcfdb9efbdb334fb316d837e0bb256da208630eb21abed6dd528d5771629e232"},"schema_version":"1.0","source":{"id":"1804.07901","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07901","created_at":"2026-07-05T00:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07901v7","created_at":"2026-07-05T00:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07901","created_at":"2026-07-05T00:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"OEUGSQKAY6SX","created_at":"2026-07-05T00:48:58Z"},{"alias_kind":"pith_short_16","alias_value":"OEUGSQKAY6SX2X2N","created_at":"2026-07-05T00:48:58Z"},{"alias_kind":"pith_short_8","alias_value":"OEUGSQKA","created_at":"2026-07-05T00:48:58Z"}],"graph_snapshots":[{"event_id":"sha256:9cb41021f598f3c20e45682f85125f004fbb3a8ac96a46edce432648c32fb1c9","target":"graph","created_at":"2026-07-05T00:48:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1804.07901/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$.","authors_text":"S. Cliff Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T06:31:00Z","title":"Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07901","kind":"arxiv","version":7},"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:2477682f4490acf90a9f4859b5e0077246fd2816f87bc5e7d9ee750fb222e912","target":"record","created_at":"2026-07-05T00:48:58Z","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":"d8549cccdaba3a4c20100e46bb7ca493194602468bee216067b5d18f052ba0ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T06:31:00Z","title_canon_sha256":"fcfdb9efbdb334fb316d837e0bb256da208630eb21abed6dd528d5771629e232"},"schema_version":"1.0","source":{"id":"1804.07901","kind":"arxiv","version":7}},"canonical_sha256":"7128694140c7a57d5f4d9279737b99f5384e5e8d7e823d18939ee61efff6979e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7128694140c7a57d5f4d9279737b99f5384e5e8d7e823d18939ee61efff6979e","first_computed_at":"2026-07-05T00:48:58.060278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:48:58.060278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qo3qSJ0Ji/2X/fHvkP/pjCoNeVejjY8yB9UwGRsy6BctzjKZtBrNYoRSNQQzyGMHviu+u2XyvOuAxOhhLSgBBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:48:58.060725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.07901","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2477682f4490acf90a9f4859b5e0077246fd2816f87bc5e7d9ee750fb222e912","sha256:9cb41021f598f3c20e45682f85125f004fbb3a8ac96a46edce432648c32fb1c9"],"state_sha256":"74e38623e70c62432abb9d7fcbbb91d05f25eb6a446a3f187962ea223404ca6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B57sMi41J8RfDpwBhT/uuKE+EwFppPGfUHWvq4Cz1pt0N1B8lnpXd3BtPWQv9LLt4J2QMsqvKM8VN3sUWkiEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T16:55:03.761989Z","bundle_sha256":"2ae789564e102d5757de3fb39ba7c8a559c0fd5ab793ba1aec4c968f6408ee9a"}}