{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6ZBOZQMLJKEPNIJKDCOKHTFPSC","short_pith_number":"pith:6ZBOZQML","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"},"canonical_sha256":"f642ecc18b4a88f6a12a189ca3ccaf90bdc45ee2555c132ae489aa0cda9ff20f","source":{"kind":"arxiv","id":"1511.02591","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02591","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02591v4","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02591","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"6ZBOZQMLJKEP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6ZBOZQMLJKEPNIJK","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6ZBOZQML","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6ZBOZQMLJKEPNIJKDCOKHTFPSC","target":"record","payload":{"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"},"canonical_sha256":"f642ecc18b4a88f6a12a189ca3ccaf90bdc45ee2555c132ae489aa0cda9ff20f","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"},"source_kind":"arxiv","source_id":"1511.02591","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DRi6StIV8BshIQIhRdIeq+46thrTAC9wRDtqnNRV2IMrbFRM+xSP7+oC0eqc59+diNJRTQIu5qvhQcHH12d/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T01:37:10.807852Z"},"content_sha256":"9da44515bf4d452184f12421dc579f05e0d87c9aca8caabb156c60f16fb1e15d","schema_version":"1.0","event_id":"sha256:9da44515bf4d452184f12421dc579f05e0d87c9aca8caabb156c60f16fb1e15d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6ZBOZQMLJKEPNIJKDCOKHTFPSC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QF4Vx730LK1hd5lsHyYPC7SW49yhugBnFXM14HuVW1ap8AeOpUjzhqhO+bWkQu4cQNz8TIzT0kNC5T4VYUhsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T01:37:10.808222Z"},"content_sha256":"2a95c7c7885734c035b998f27e44b47c4b008b7aacf7b264189044bd57d4df63","schema_version":"1.0","event_id":"sha256:2a95c7c7885734c035b998f27e44b47c4b008b7aacf7b264189044bd57d4df63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC/bundle.json","state_url":"https://pith.science/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T01:37:10Z","links":{"resolver":"https://pith.science/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC","bundle":"https://pith.science/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC/bundle.json","state":"https://pith.science/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ZBOZQMLJKEPNIJKDCOKHTFPSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6ZBOZQMLJKEPNIJKDCOKHTFPSC","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":"35247e7091e3255599e8da766062a970ff596a086cc4aa61f445d2874bd4d3e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T07:45:16Z","title_canon_sha256":"8c0e19a8825555ce0679adcb3146ccda76961544be9184e068334532ac2e1767"},"schema_version":"1.0","source":{"id":"1511.02591","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02591","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02591v4","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02591","created_at":"2026-05-18T01:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"6ZBOZQMLJKEP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6ZBOZQMLJKEPNIJK","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6ZBOZQML","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:2a95c7c7885734c035b998f27e44b47c4b008b7aacf7b264189044bd57d4df63","target":"graph","created_at":"2026-05-18T01:19:33Z","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"},"paper":{"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 ","authors_text":"N. S. Narayanaswamy, R. Krithika","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T07:45:16Z","title":"Faster Randomized Branching Algorithms for $r$-SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02591","kind":"arxiv","version":4},"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:9da44515bf4d452184f12421dc579f05e0d87c9aca8caabb156c60f16fb1e15d","target":"record","created_at":"2026-05-18T01:19:33Z","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":"35247e7091e3255599e8da766062a970ff596a086cc4aa61f445d2874bd4d3e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T07:45:16Z","title_canon_sha256":"8c0e19a8825555ce0679adcb3146ccda76961544be9184e068334532ac2e1767"},"schema_version":"1.0","source":{"id":"1511.02591","kind":"arxiv","version":4}},"canonical_sha256":"f642ecc18b4a88f6a12a189ca3ccaf90bdc45ee2555c132ae489aa0cda9ff20f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f642ecc18b4a88f6a12a189ca3ccaf90bdc45ee2555c132ae489aa0cda9ff20f","first_computed_at":"2026-05-18T01:19:33.985694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:33.985694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GUpCMxuE/0aSwRMfbmrXB1HudU1FmxlZifal2m7H1Sk292ir1amwHLYPXWKk1Y6PXrKFfodyrOSmVF7IRHwmCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:33.986092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02591","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9da44515bf4d452184f12421dc579f05e0d87c9aca8caabb156c60f16fb1e15d","sha256:2a95c7c7885734c035b998f27e44b47c4b008b7aacf7b264189044bd57d4df63"],"state_sha256":"85b2b85f18b0bb92641fe1fe16a13b8271cdea1ebd75ff7129682ad60d6edfac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0TcAPmmo0zvLM9kKky5HzZgQoEJH/yYj4Mkbeyw8YPsSeDB+aZYam8KnOY8KdH7TVbC2Q/YngfmmN9+WkZeuDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T01:37:10.811341Z","bundle_sha256":"2d9643cfd831ac224d9064948004861adad8fc177f1b2545ea820e416d9d23bc"}}