{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ELFFDXHUXYRKO5RL6L4664U6BS","short_pith_number":"pith:ELFFDXHU","schema_version":"1.0","canonical_sha256":"22ca51dcf4be22a7762bf2f9ef729e0c86d7a33b6412cd4d02521fa44448923e","source":{"kind":"arxiv","id":"1710.02198","version":1},"attestation_state":"computed","paper":{"title":"QFUN: Towards Machine Learning in QBF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mikol\\'a\\v{s} Janota","submitted_at":"2017-10-05T20:10:50Z","abstract_excerpt":"This paper reports on the QBF solver QFUN that has won the non-CNF track in the recent QBF evaluation. The solver is motivated by the fact that it is easy to construct Quantified Boolean Formulas (QBFs) with short winning strategies (Skolem/Herbrand functions) but are hard to solve by nowadays solvers. This paper argues that a solver benefits from generalizing a set of individual wins into a strategy. This idea is realized on top of the competitive RAReQS algorithm by utilizing machine learning. The results of the implemented prototype are highly encouraging."},"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":"1710.02198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-05T20:10:50Z","cross_cats_sorted":[],"title_canon_sha256":"5af3a8454e17e14adb79ce62dec3e2d9a0a8590c15b95b5b79e059a422d66e76","abstract_canon_sha256":"50535183d3cc9ba3c9c7d3e42fc36475474575ff19d12d5b3c1478be1113befe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:34.196435Z","signature_b64":"M+TzdWIN4GG/QppmS441A3OaoNxU5OhludjJIKSsboreg+sUh/Rvnd8buYckO/sG0EfMDrsOMPYxzX/0ZtupDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22ca51dcf4be22a7762bf2f9ef729e0c86d7a33b6412cd4d02521fa44448923e","last_reissued_at":"2026-05-18T00:33:34.195670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:34.195670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QFUN: Towards Machine Learning in QBF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mikol\\'a\\v{s} Janota","submitted_at":"2017-10-05T20:10:50Z","abstract_excerpt":"This paper reports on the QBF solver QFUN that has won the non-CNF track in the recent QBF evaluation. The solver is motivated by the fact that it is easy to construct Quantified Boolean Formulas (QBFs) with short winning strategies (Skolem/Herbrand functions) but are hard to solve by nowadays solvers. This paper argues that a solver benefits from generalizing a set of individual wins into a strategy. This idea is realized on top of the competitive RAReQS algorithm by utilizing machine learning. The results of the implemented prototype are highly encouraging."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02198","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":"1710.02198","created_at":"2026-05-18T00:33:34.195766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02198v1","created_at":"2026-05-18T00:33:34.195766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02198","created_at":"2026-05-18T00:33:34.195766+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELFFDXHUXYRK","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELFFDXHUXYRKO5RL","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELFFDXHU","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.16153","citing_title":"The QBF Gallery 2023","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ELFFDXHUXYRKO5RL6L4664U6BS","json":"https://pith.science/pith/ELFFDXHUXYRKO5RL6L4664U6BS.json","graph_json":"https://pith.science/api/pith-number/ELFFDXHUXYRKO5RL6L4664U6BS/graph.json","events_json":"https://pith.science/api/pith-number/ELFFDXHUXYRKO5RL6L4664U6BS/events.json","paper":"https://pith.science/paper/ELFFDXHU"},"agent_actions":{"view_html":"https://pith.science/pith/ELFFDXHUXYRKO5RL6L4664U6BS","download_json":"https://pith.science/pith/ELFFDXHUXYRKO5RL6L4664U6BS.json","view_paper":"https://pith.science/paper/ELFFDXHU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02198&json=true","fetch_graph":"https://pith.science/api/pith-number/ELFFDXHUXYRKO5RL6L4664U6BS/graph.json","fetch_events":"https://pith.science/api/pith-number/ELFFDXHUXYRKO5RL6L4664U6BS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELFFDXHUXYRKO5RL6L4664U6BS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELFFDXHUXYRKO5RL6L4664U6BS/action/storage_attestation","attest_author":"https://pith.science/pith/ELFFDXHUXYRKO5RL6L4664U6BS/action/author_attestation","sign_citation":"https://pith.science/pith/ELFFDXHUXYRKO5RL6L4664U6BS/action/citation_signature","submit_replication":"https://pith.science/pith/ELFFDXHUXYRKO5RL6L4664U6BS/action/replication_record"}},"created_at":"2026-05-18T00:33:34.195766+00:00","updated_at":"2026-05-18T00:33:34.195766+00:00"}