{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CM2I6DDEABKRA24AWIU65IJPCP","short_pith_number":"pith:CM2I6DDE","schema_version":"1.0","canonical_sha256":"13348f0c640055106b80b229eea12f13c1294e1e037fd0c852e29e8617b3142b","source":{"kind":"arxiv","id":"1903.10618","version":1},"attestation_state":"computed","paper":{"title":"Faster Random $k$-CNF Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Adam Yedidia, Andrea Lincoln","submitted_at":"2019-03-25T22:19:46Z","abstract_excerpt":"We describe an algorithm to solve the problem of Boolean CNF-Satisfiability when the input formula is chosen randomly.\n  We build upon the algorithms of Sch{\\\"{o}}ning 1999 and Dantsin et al.~in 2002. The Sch{\\\"{o}}ning algorithm works by trying many possible random assignments, and for each one searching systematically in the neighborhood of that assignment for a satisfying solution. Previous algorithms for this problem run in time $O(2^{n (1- \\Omega(1)/k)})$.\n  Our improvement is simple: we count how many clauses are satisfied by each randomly sampled assignment, and only search in the neigh"},"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":"1903.10618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-25T22:19:46Z","cross_cats_sorted":[],"title_canon_sha256":"295bb95c775725a61e1626239892212253560d98792941fbccc0d9e06499fd38","abstract_canon_sha256":"587f999bdfb388360df321f55bff31caae76bad341a02dbfdf0436d9a9827fb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:18.328860Z","signature_b64":"TfIlGgL4I4Mp2iVOjcJExRWLjoTWpZ1+GF6ud57W60lu4Yrw9VZBdTaP4rXpovnuPGvKOnLtLKHhiikWgnGJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13348f0c640055106b80b229eea12f13c1294e1e037fd0c852e29e8617b3142b","last_reissued_at":"2026-05-17T23:50:18.328041Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:18.328041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Random $k$-CNF Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Adam Yedidia, Andrea Lincoln","submitted_at":"2019-03-25T22:19:46Z","abstract_excerpt":"We describe an algorithm to solve the problem of Boolean CNF-Satisfiability when the input formula is chosen randomly.\n  We build upon the algorithms of Sch{\\\"{o}}ning 1999 and Dantsin et al.~in 2002. The Sch{\\\"{o}}ning algorithm works by trying many possible random assignments, and for each one searching systematically in the neighborhood of that assignment for a satisfying solution. Previous algorithms for this problem run in time $O(2^{n (1- \\Omega(1)/k)})$.\n  Our improvement is simple: we count how many clauses are satisfied by each randomly sampled assignment, and only search in the neigh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10618","kind":"arxiv","version":1},"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":"1903.10618","created_at":"2026-05-17T23:50:18.328192+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.10618v1","created_at":"2026-05-17T23:50:18.328192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10618","created_at":"2026-05-17T23:50:18.328192+00:00"},{"alias_kind":"pith_short_12","alias_value":"CM2I6DDEABKR","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CM2I6DDEABKRA24A","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CM2I6DDE","created_at":"2026-05-18T12:33:15.570797+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/CM2I6DDEABKRA24AWIU65IJPCP","json":"https://pith.science/pith/CM2I6DDEABKRA24AWIU65IJPCP.json","graph_json":"https://pith.science/api/pith-number/CM2I6DDEABKRA24AWIU65IJPCP/graph.json","events_json":"https://pith.science/api/pith-number/CM2I6DDEABKRA24AWIU65IJPCP/events.json","paper":"https://pith.science/paper/CM2I6DDE"},"agent_actions":{"view_html":"https://pith.science/pith/CM2I6DDEABKRA24AWIU65IJPCP","download_json":"https://pith.science/pith/CM2I6DDEABKRA24AWIU65IJPCP.json","view_paper":"https://pith.science/paper/CM2I6DDE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.10618&json=true","fetch_graph":"https://pith.science/api/pith-number/CM2I6DDEABKRA24AWIU65IJPCP/graph.json","fetch_events":"https://pith.science/api/pith-number/CM2I6DDEABKRA24AWIU65IJPCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CM2I6DDEABKRA24AWIU65IJPCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CM2I6DDEABKRA24AWIU65IJPCP/action/storage_attestation","attest_author":"https://pith.science/pith/CM2I6DDEABKRA24AWIU65IJPCP/action/author_attestation","sign_citation":"https://pith.science/pith/CM2I6DDEABKRA24AWIU65IJPCP/action/citation_signature","submit_replication":"https://pith.science/pith/CM2I6DDEABKRA24AWIU65IJPCP/action/replication_record"}},"created_at":"2026-05-17T23:50:18.328192+00:00","updated_at":"2026-05-17T23:50:18.328192+00:00"}