{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VGSC54KHMIVDBDRJOYASCL3DCP","short_pith_number":"pith:VGSC54KH","schema_version":"1.0","canonical_sha256":"a9a42ef147622a308e297601212f6313dd794989cde5e544fd8514814788d95c","source":{"kind":"arxiv","id":"1209.5313","version":2},"attestation_state":"computed","paper":{"title":"Random k-SAT and the Power of Two Choices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Will Perkins","submitted_at":"2012-09-24T15:59:51Z","abstract_excerpt":"We study an Achlioptas-process version of the random k-SAT process: a bounded number of k-clauses are drawn uniformly at random at each step, and exactly one added to the growing formula according to a particular rule. We prove the existence of a rule that shifts the satisfiability threshold. This extends a well-studied area of probabilistic combinatorics (Achlioptas processes) to random CSP's. In particular, while a rule to delay the 2-SAT threshold was known previously, this is the first proof of a rule to shift the threshold of k-SAT for k >= 3.\n  We then propose a gap decision problem base"},"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":"1209.5313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-24T15:59:51Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"9c776356cd0b2e17e15c1305f71000f29bffe670d5b4ccca855da6217c356cee","abstract_canon_sha256":"0133b997bb38918ea9ad11b8f71de74c6bee50cae601f7195b0b1af66491c4af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:26.872471Z","signature_b64":"dgq16L01viuVDutVpXch1v8QdKuaIKxFHQb1QUZp9TChg0wo7PYlIK12HvS5uqDQU8BIXMkv9aRfCHy+UnYIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9a42ef147622a308e297601212f6313dd794989cde5e544fd8514814788d95c","last_reissued_at":"2026-05-18T03:10:26.871652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:26.871652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random k-SAT and the Power of Two Choices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Will Perkins","submitted_at":"2012-09-24T15:59:51Z","abstract_excerpt":"We study an Achlioptas-process version of the random k-SAT process: a bounded number of k-clauses are drawn uniformly at random at each step, and exactly one added to the growing formula according to a particular rule. We prove the existence of a rule that shifts the satisfiability threshold. This extends a well-studied area of probabilistic combinatorics (Achlioptas processes) to random CSP's. In particular, while a rule to delay the 2-SAT threshold was known previously, this is the first proof of a rule to shift the threshold of k-SAT for k >= 3.\n  We then propose a gap decision problem base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5313","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":"1209.5313","created_at":"2026-05-18T03:10:26.871782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.5313v2","created_at":"2026-05-18T03:10:26.871782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5313","created_at":"2026-05-18T03:10:26.871782+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGSC54KHMIVD","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGSC54KHMIVDBDRJ","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGSC54KH","created_at":"2026-05-18T12:27:25.539911+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/VGSC54KHMIVDBDRJOYASCL3DCP","json":"https://pith.science/pith/VGSC54KHMIVDBDRJOYASCL3DCP.json","graph_json":"https://pith.science/api/pith-number/VGSC54KHMIVDBDRJOYASCL3DCP/graph.json","events_json":"https://pith.science/api/pith-number/VGSC54KHMIVDBDRJOYASCL3DCP/events.json","paper":"https://pith.science/paper/VGSC54KH"},"agent_actions":{"view_html":"https://pith.science/pith/VGSC54KHMIVDBDRJOYASCL3DCP","download_json":"https://pith.science/pith/VGSC54KHMIVDBDRJOYASCL3DCP.json","view_paper":"https://pith.science/paper/VGSC54KH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.5313&json=true","fetch_graph":"https://pith.science/api/pith-number/VGSC54KHMIVDBDRJOYASCL3DCP/graph.json","fetch_events":"https://pith.science/api/pith-number/VGSC54KHMIVDBDRJOYASCL3DCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGSC54KHMIVDBDRJOYASCL3DCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGSC54KHMIVDBDRJOYASCL3DCP/action/storage_attestation","attest_author":"https://pith.science/pith/VGSC54KHMIVDBDRJOYASCL3DCP/action/author_attestation","sign_citation":"https://pith.science/pith/VGSC54KHMIVDBDRJOYASCL3DCP/action/citation_signature","submit_replication":"https://pith.science/pith/VGSC54KHMIVDBDRJOYASCL3DCP/action/replication_record"}},"created_at":"2026-05-18T03:10:26.871782+00:00","updated_at":"2026-05-18T03:10:26.871782+00:00"}