{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RFBWJDBBECNWR4R2CYONCI6DON","short_pith_number":"pith:RFBWJDBB","schema_version":"1.0","canonical_sha256":"8943648c21209b68f23a161cd123c3735b4a67bac94ce8cce094b1a9e29156d1","source":{"kind":"arxiv","id":"1211.6997","version":2},"attestation_state":"computed","paper":{"title":"The Power of Choice for Random Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Cristopher Moore, Josep Diaz, Thomas Hayes, Varsha Dani","submitted_at":"2012-11-29T17:30:38Z","abstract_excerpt":"We consider Achlioptas processes for k-SAT formulas. We create a semi-random formula with n variables and m clauses, where each clause is a choice, made on-line, between two or more uniformly random clauses. Our goal is to delay the satisfiability/unsatisfiability transition, keeping the formula satisfiable up to densities m/n beyond the satisfiability threshold alpha_k for random k-SAT. We show that three choices suffice to raise the threshold for any k >= 3, and that two choices suffice for all 3 <= k <= 25. We also show that two choices suffice to lower the threshold for all k >= 3, making "},"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":"1211.6997","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-29T17:30:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"db5899deb6c76fbc2b3b87deba2629a45b29ace115337d76d9667681e0723999","abstract_canon_sha256":"dcb882b0b64d161c144fd2f31b92b3f97850860bb05f591733e3c426a09f140c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:41.153927Z","signature_b64":"8aHDh9127WQcLDcpSeH1h1mzI9fiLCoZs6QLGfNDDKMeTcH1lk0YrQGRu2q0phxwomlvnlJJh0aRphtWhyMmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8943648c21209b68f23a161cd123c3735b4a67bac94ce8cce094b1a9e29156d1","last_reissued_at":"2026-05-18T03:39:41.153305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:41.153305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Power of Choice for Random Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Cristopher Moore, Josep Diaz, Thomas Hayes, Varsha Dani","submitted_at":"2012-11-29T17:30:38Z","abstract_excerpt":"We consider Achlioptas processes for k-SAT formulas. We create a semi-random formula with n variables and m clauses, where each clause is a choice, made on-line, between two or more uniformly random clauses. Our goal is to delay the satisfiability/unsatisfiability transition, keeping the formula satisfiable up to densities m/n beyond the satisfiability threshold alpha_k for random k-SAT. We show that three choices suffice to raise the threshold for any k >= 3, and that two choices suffice for all 3 <= k <= 25. We also show that two choices suffice to lower the threshold for all k >= 3, making "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6997","kind":"arxiv","version":2},"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":"1211.6997","created_at":"2026-05-18T03:39:41.153422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.6997v2","created_at":"2026-05-18T03:39:41.153422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6997","created_at":"2026-05-18T03:39:41.153422+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFBWJDBBECNW","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFBWJDBBECNWR4R2","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFBWJDBB","created_at":"2026-05-18T12:27:20.899486+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/RFBWJDBBECNWR4R2CYONCI6DON","json":"https://pith.science/pith/RFBWJDBBECNWR4R2CYONCI6DON.json","graph_json":"https://pith.science/api/pith-number/RFBWJDBBECNWR4R2CYONCI6DON/graph.json","events_json":"https://pith.science/api/pith-number/RFBWJDBBECNWR4R2CYONCI6DON/events.json","paper":"https://pith.science/paper/RFBWJDBB"},"agent_actions":{"view_html":"https://pith.science/pith/RFBWJDBBECNWR4R2CYONCI6DON","download_json":"https://pith.science/pith/RFBWJDBBECNWR4R2CYONCI6DON.json","view_paper":"https://pith.science/paper/RFBWJDBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.6997&json=true","fetch_graph":"https://pith.science/api/pith-number/RFBWJDBBECNWR4R2CYONCI6DON/graph.json","fetch_events":"https://pith.science/api/pith-number/RFBWJDBBECNWR4R2CYONCI6DON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFBWJDBBECNWR4R2CYONCI6DON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFBWJDBBECNWR4R2CYONCI6DON/action/storage_attestation","attest_author":"https://pith.science/pith/RFBWJDBBECNWR4R2CYONCI6DON/action/author_attestation","sign_citation":"https://pith.science/pith/RFBWJDBBECNWR4R2CYONCI6DON/action/citation_signature","submit_replication":"https://pith.science/pith/RFBWJDBBECNWR4R2CYONCI6DON/action/replication_record"}},"created_at":"2026-05-18T03:39:41.153422+00:00","updated_at":"2026-05-18T03:39:41.153422+00:00"}