{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TPK7BOUW7WLIRGTKHB6RJOY3CC","short_pith_number":"pith:TPK7BOUW","schema_version":"1.0","canonical_sha256":"9bd5f0ba96fd96889a6a387d14bb1b10a097faf54a8c64c421a8dd870f445229","source":{"kind":"arxiv","id":"1404.3801","version":2},"attestation_state":"computed","paper":{"title":"Shortest reconfiguration paths in the solution space of Boolean formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Vinayak Pathak","submitted_at":"2014-04-15T02:35:44Z","abstract_excerpt":"Given a Boolean formula and a satisfying assignment, a flip is an operation that changes the value of a variable in the assignment so that the resulting assignment remains satisfying. We study the problem of computing the shortest sequence of flips (if one exists) that transforms a given satisfying assignment $s$ to another satisfying assignment $t$ of a Boolean formula. Earlier work characterized the complexity of finding any (not necessarily the shortest) sequence of flips from one satisfying assignment to another using Schaefer's framework for classification of Boolean formulas. We build on"},"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":"1404.3801","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-15T02:35:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"19dc97432d78bfda123bb45100fe6c5048790ca66833cf991cbed92a77593b9b","abstract_canon_sha256":"4b7de325583b3c13aa15ca78332630b0442e3dc922e5ea1c75f1b7cb57d7f3af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:00.623974Z","signature_b64":"i0OrCLsx4+tzj8I3dthG2MT/hR/TAWMYKlDQewUIY9G90vby7zfHw6XmNNxk4tAy5I4D2cfKTkw+Nxqnz9tqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bd5f0ba96fd96889a6a387d14bb1b10a097faf54a8c64c421a8dd870f445229","last_reissued_at":"2026-05-18T02:51:00.623504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:00.623504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest reconfiguration paths in the solution space of Boolean formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Vinayak Pathak","submitted_at":"2014-04-15T02:35:44Z","abstract_excerpt":"Given a Boolean formula and a satisfying assignment, a flip is an operation that changes the value of a variable in the assignment so that the resulting assignment remains satisfying. We study the problem of computing the shortest sequence of flips (if one exists) that transforms a given satisfying assignment $s$ to another satisfying assignment $t$ of a Boolean formula. Earlier work characterized the complexity of finding any (not necessarily the shortest) sequence of flips from one satisfying assignment to another using Schaefer's framework for classification of Boolean formulas. We build on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3801","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":"1404.3801","created_at":"2026-05-18T02:51:00.623575+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3801v2","created_at":"2026-05-18T02:51:00.623575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3801","created_at":"2026-05-18T02:51:00.623575+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPK7BOUW7WLI","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPK7BOUW7WLIRGTK","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPK7BOUW","created_at":"2026-05-18T12:28:49.207871+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/TPK7BOUW7WLIRGTKHB6RJOY3CC","json":"https://pith.science/pith/TPK7BOUW7WLIRGTKHB6RJOY3CC.json","graph_json":"https://pith.science/api/pith-number/TPK7BOUW7WLIRGTKHB6RJOY3CC/graph.json","events_json":"https://pith.science/api/pith-number/TPK7BOUW7WLIRGTKHB6RJOY3CC/events.json","paper":"https://pith.science/paper/TPK7BOUW"},"agent_actions":{"view_html":"https://pith.science/pith/TPK7BOUW7WLIRGTKHB6RJOY3CC","download_json":"https://pith.science/pith/TPK7BOUW7WLIRGTKHB6RJOY3CC.json","view_paper":"https://pith.science/paper/TPK7BOUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3801&json=true","fetch_graph":"https://pith.science/api/pith-number/TPK7BOUW7WLIRGTKHB6RJOY3CC/graph.json","fetch_events":"https://pith.science/api/pith-number/TPK7BOUW7WLIRGTKHB6RJOY3CC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPK7BOUW7WLIRGTKHB6RJOY3CC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPK7BOUW7WLIRGTKHB6RJOY3CC/action/storage_attestation","attest_author":"https://pith.science/pith/TPK7BOUW7WLIRGTKHB6RJOY3CC/action/author_attestation","sign_citation":"https://pith.science/pith/TPK7BOUW7WLIRGTKHB6RJOY3CC/action/citation_signature","submit_replication":"https://pith.science/pith/TPK7BOUW7WLIRGTKHB6RJOY3CC/action/replication_record"}},"created_at":"2026-05-18T02:51:00.623575+00:00","updated_at":"2026-05-18T02:51:00.623575+00:00"}