{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LS56IK4SFCZEJI3W34YZB7JQK3","short_pith_number":"pith:LS56IK4S","schema_version":"1.0","canonical_sha256":"5cbbe42b9228b244a376df3190fd3056f2af5f3f49363b4a41c183f6cbc5f878","source":{"kind":"arxiv","id":"1708.01122","version":1},"attestation_state":"computed","paper":{"title":"Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Emo Welzl, Jean Cardinal, Jerri Nummenpalo","submitted_at":"2017-08-03T13:12:03Z","abstract_excerpt":"We investigate parameterizing hard combinatorial problems by the size of the solution set compared to all solution candidates. Our main result is a uniform sampling algorithm for satisfying assignments of 2-CNF formulas that runs in expected time $O^*(\\varepsilon^{-0.617})$ where $\\varepsilon$ is the fraction of assignments that are satisfying. This improves significantly over the trivial sampling bound of expected $\\Theta^*(\\varepsilon^{-1})$, and on all previous algorithms whenever $\\varepsilon = \\Omega(0.708^n)$. We also consider algorithms for 3-SAT with an $\\varepsilon$ fraction of satisf"},"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":"1708.01122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-03T13:12:03Z","cross_cats_sorted":[],"title_canon_sha256":"a9d3f1c101441cf04d86980f81905f488161645bf55666b11cfc432b81e0df8d","abstract_canon_sha256":"f6e480aa5e8d062e7990d195ee6a7ebcc4f2678dece28639ee227b85e1f1b4b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:40.588959Z","signature_b64":"en7Kv4w88memQiH8Jm3eu2gfA96ARtbtHEVTd3GTlBrblVKfgfWEuEU4/fjWygHWJKYMIimeGYbomCYLHzgoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cbbe42b9228b244a376df3190fd3056f2af5f3f49363b4a41c183f6cbc5f878","last_reissued_at":"2026-05-18T00:38:40.588384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:40.588384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Emo Welzl, Jean Cardinal, Jerri Nummenpalo","submitted_at":"2017-08-03T13:12:03Z","abstract_excerpt":"We investigate parameterizing hard combinatorial problems by the size of the solution set compared to all solution candidates. Our main result is a uniform sampling algorithm for satisfying assignments of 2-CNF formulas that runs in expected time $O^*(\\varepsilon^{-0.617})$ where $\\varepsilon$ is the fraction of assignments that are satisfying. This improves significantly over the trivial sampling bound of expected $\\Theta^*(\\varepsilon^{-1})$, and on all previous algorithms whenever $\\varepsilon = \\Omega(0.708^n)$. We also consider algorithms for 3-SAT with an $\\varepsilon$ fraction of satisf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01122","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":"1708.01122","created_at":"2026-05-18T00:38:40.588460+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01122v1","created_at":"2026-05-18T00:38:40.588460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01122","created_at":"2026-05-18T00:38:40.588460+00:00"},{"alias_kind":"pith_short_12","alias_value":"LS56IK4SFCZE","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LS56IK4SFCZEJI3W","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LS56IK4S","created_at":"2026-05-18T12:31:28.150371+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/LS56IK4SFCZEJI3W34YZB7JQK3","json":"https://pith.science/pith/LS56IK4SFCZEJI3W34YZB7JQK3.json","graph_json":"https://pith.science/api/pith-number/LS56IK4SFCZEJI3W34YZB7JQK3/graph.json","events_json":"https://pith.science/api/pith-number/LS56IK4SFCZEJI3W34YZB7JQK3/events.json","paper":"https://pith.science/paper/LS56IK4S"},"agent_actions":{"view_html":"https://pith.science/pith/LS56IK4SFCZEJI3W34YZB7JQK3","download_json":"https://pith.science/pith/LS56IK4SFCZEJI3W34YZB7JQK3.json","view_paper":"https://pith.science/paper/LS56IK4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01122&json=true","fetch_graph":"https://pith.science/api/pith-number/LS56IK4SFCZEJI3W34YZB7JQK3/graph.json","fetch_events":"https://pith.science/api/pith-number/LS56IK4SFCZEJI3W34YZB7JQK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LS56IK4SFCZEJI3W34YZB7JQK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LS56IK4SFCZEJI3W34YZB7JQK3/action/storage_attestation","attest_author":"https://pith.science/pith/LS56IK4SFCZEJI3W34YZB7JQK3/action/author_attestation","sign_citation":"https://pith.science/pith/LS56IK4SFCZEJI3W34YZB7JQK3/action/citation_signature","submit_replication":"https://pith.science/pith/LS56IK4SFCZEJI3W34YZB7JQK3/action/replication_record"}},"created_at":"2026-05-18T00:38:40.588460+00:00","updated_at":"2026-05-18T00:38:40.588460+00:00"}