{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6ZBOZQMLJKEPNIJKDCOKHTFPSC","short_pith_number":"pith:6ZBOZQML","schema_version":"1.0","canonical_sha256":"f642ecc18b4a88f6a12a189ca3ccaf90bdc45ee2555c132ae489aa0cda9ff20f","source":{"kind":"arxiv","id":"1511.02591","version":4},"attestation_state":"computed","paper":{"title":"Faster Randomized Branching Algorithms for $r$-SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"N. S. Narayanaswamy, R. Krithika","submitted_at":"2015-11-09T07:45:16Z","abstract_excerpt":"The problem of determining if an $r$-CNF boolean formula $F$ over $n$ variables is satisifiable reduces to the problem of determining if $F$ has a satisfying assignment with a Hamming distance of at most $d$ from a fixed assignment $\\alpha$. This problem is also a very important subproblem in Schoning's local search algorithm for $r$-SAT. While Schoning described a randomized algorithm solves this subproblem in $O((r-1)^d)$ time, Dantsin et al. presented a deterministic branching algorithm with $O^*(r^d)$ running time. In this paper we present a simple randomized branching algorithm that runs "},"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":"1511.02591","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T07:45:16Z","cross_cats_sorted":[],"title_canon_sha256":"8c0e19a8825555ce0679adcb3146ccda76961544be9184e068334532ac2e1767","abstract_canon_sha256":"35247e7091e3255599e8da766062a970ff596a086cc4aa61f445d2874bd4d3e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:33.986092Z","signature_b64":"GUpCMxuE/0aSwRMfbmrXB1HudU1FmxlZifal2m7H1Sk292ir1amwHLYPXWKk1Y6PXrKFfodyrOSmVF7IRHwmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f642ecc18b4a88f6a12a189ca3ccaf90bdc45ee2555c132ae489aa0cda9ff20f","last_reissued_at":"2026-05-18T01:19:33.985694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:33.985694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Randomized Branching Algorithms for $r$-SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"N. S. Narayanaswamy, R. Krithika","submitted_at":"2015-11-09T07:45:16Z","abstract_excerpt":"The problem of determining if an $r$-CNF boolean formula $F$ over $n$ variables is satisifiable reduces to the problem of determining if $F$ has a satisfying assignment with a Hamming distance of at most $d$ from a fixed assignment $\\alpha$. This problem is also a very important subproblem in Schoning's local search algorithm for $r$-SAT. While Schoning described a randomized algorithm solves this subproblem in $O((r-1)^d)$ time, Dantsin et al. presented a deterministic branching algorithm with $O^*(r^d)$ running time. In this paper we present a simple randomized branching algorithm that runs "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02591","kind":"arxiv","version":4},"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":"1511.02591","created_at":"2026-05-18T01:19:33.985753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02591v4","created_at":"2026-05-18T01:19:33.985753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02591","created_at":"2026-05-18T01:19:33.985753+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZBOZQMLJKEP","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZBOZQMLJKEPNIJK","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZBOZQML","created_at":"2026-05-18T12:29:07.941421+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/6ZBOZQMLJKEPNIJKDCOKHTFPSC","json":"https://pith.science/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC.json","graph_json":"https://pith.science/api/pith-number/6ZBOZQMLJKEPNIJKDCOKHTFPSC/graph.json","events_json":"https://pith.science/api/pith-number/6ZBOZQMLJKEPNIJKDCOKHTFPSC/events.json","paper":"https://pith.science/paper/6ZBOZQML"},"agent_actions":{"view_html":"https://pith.science/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC","download_json":"https://pith.science/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC.json","view_paper":"https://pith.science/paper/6ZBOZQML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02591&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZBOZQMLJKEPNIJKDCOKHTFPSC/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZBOZQMLJKEPNIJKDCOKHTFPSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC/action/storage_attestation","attest_author":"https://pith.science/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC/action/author_attestation","sign_citation":"https://pith.science/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC/action/citation_signature","submit_replication":"https://pith.science/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC/action/replication_record"}},"created_at":"2026-05-18T01:19:33.985753+00:00","updated_at":"2026-05-18T01:19:33.985753+00:00"}