{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:A4JQC7V557EPAJXIS2YP5TDATD","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":"9f0e298348246a59d0618c25b17b02ecee44674a3e9734ccb5d73d93e74b8f97","cross_cats_sorted":["cs.DS","math-ph","math.MP","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-06-03T21:01:02Z","title_canon_sha256":"65f79d395d24a8245e7cd0abb362a7a41225734ea5a6b835ffffa80f7db8e723"},"schema_version":"1.0","source":{"id":"2106.02129","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.02129","created_at":"2026-07-05T03:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"2106.02129v3","created_at":"2026-07-05T03:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.02129","created_at":"2026-07-05T03:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"A4JQC7V557EP","created_at":"2026-07-05T03:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"A4JQC7V557EPAJXI","created_at":"2026-07-05T03:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"A4JQC7V5","created_at":"2026-07-05T03:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:f4feb646da061c7019eab1d221969fd37043486bdd05c86b1f465d2c5c9e6021","target":"graph","created_at":"2026-07-05T03:27:32Z","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/2106.02129/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\Phi$ be a uniformly random $k$-SAT formula with $n$ variables and $m$ clauses. We study the algorithmic task of finding a satisfying assignment of $\\Phi$. It is known that satisfying assignments exist with high probability up to clause density $m/n = 2^k \\log 2 - \\frac12 (\\log 2 + 1) + o_k(1)$, while the best polynomial-time algorithm known, the Fix algorithm of Coja-Oghlan, finds a satisfying assignment at the much lower clause density $(1 - o_k(1)) 2^k \\log k / k$. This prompts the question: is it possible to efficiently find a satisfying assignment at higher clause densities?\n  We pro","authors_text":"Brice Huang, Guy Bresler","cross_cats":["cs.DS","math-ph","math.MP","math.PR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-06-03T21:01:02Z","title":"The Algorithmic Phase Transition of Random $k$-SAT for Low Degree Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.02129","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:ed702b46545fbe28d0d337d8fa393d5d44b5fdc60483b66f98221e53f20f4c09","target":"record","created_at":"2026-07-05T03:27:32Z","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":"9f0e298348246a59d0618c25b17b02ecee44674a3e9734ccb5d73d93e74b8f97","cross_cats_sorted":["cs.DS","math-ph","math.MP","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-06-03T21:01:02Z","title_canon_sha256":"65f79d395d24a8245e7cd0abb362a7a41225734ea5a6b835ffffa80f7db8e723"},"schema_version":"1.0","source":{"id":"2106.02129","kind":"arxiv","version":3}},"canonical_sha256":"0713017ebdefc8f026e896b0fecc6098d8103f3d2a9843c76cad325e86954500","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0713017ebdefc8f026e896b0fecc6098d8103f3d2a9843c76cad325e86954500","first_computed_at":"2026-07-05T03:27:32.070578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:27:32.070578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5drFSMIOZ9Al36TiQj2v4bxGgtcvPLQApnIjZKB8Pax4hhP8mbCHM6xDgU2wyt2WRtr5cemA35miS8DOLZ5MBA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:27:32.071060Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.02129","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed702b46545fbe28d0d337d8fa393d5d44b5fdc60483b66f98221e53f20f4c09","sha256:f4feb646da061c7019eab1d221969fd37043486bdd05c86b1f465d2c5c9e6021"],"state_sha256":"3e6c49630c51ea1dded3196f5893d4e15d2ffd4ba6c94d2981f8ecaed54b3520"}