{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2L5ZTHFTINUYWC352QZ4WVWLI6","short_pith_number":"pith:2L5ZTHFT","schema_version":"1.0","canonical_sha256":"d2fb999cb343698b0b7dd433cb56cb47a984a4903b08d72e92c338f62d5d0957","source":{"kind":"arxiv","id":"2401.14996","version":8},"attestation_state":"computed","paper":{"title":"A Resolution-Based Interactive Proof System for UNSAT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Adrian Krauss, Javier Esparza, Philipp Czerner, Valentin Krasotin","submitted_at":"2024-01-26T16:52:08Z","abstract_excerpt":"Modern SAT or QBF solvers are expected to produce correctness certificates. However, certificates have worst-case exponential size (unless NP=coNP), and at recent SAT competitions the largest certificates of unsatisfiability are starting to reach terabyte size. This puts limits to the development of SAT-solving services in which a client with limited computational power sends a formula to a solver running on a powerful server, which returns a certificate to be checked by the client.\n  Recently, Couillard et al. have suggested to replace certificates with interactive proof systems based on the "},"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":"2401.14996","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-01-26T16:52:08Z","cross_cats_sorted":[],"title_canon_sha256":"e9d8df43e92957d94cdaa24a29eb595a32e74ff1a7a1647e7c0b27085fa25e9e","abstract_canon_sha256":"6862edec9db302f20e45d65b61b5d923c80dcfa576697e0a7125f74cadb76201"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:39.158357Z","signature_b64":"klqsttMQ4mCMjjVOtvKQcRa7qlGJcI1p4WHdwr1kCpxwu42ceM3M2igbK/RBlZDCbHEeQpuhUYeqFs7k8jtCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2fb999cb343698b0b7dd433cb56cb47a984a4903b08d72e92c338f62d5d0957","last_reissued_at":"2026-05-22T01:03:39.157669Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:39.157669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Resolution-Based Interactive Proof System for UNSAT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Adrian Krauss, Javier Esparza, Philipp Czerner, Valentin Krasotin","submitted_at":"2024-01-26T16:52:08Z","abstract_excerpt":"Modern SAT or QBF solvers are expected to produce correctness certificates. However, certificates have worst-case exponential size (unless NP=coNP), and at recent SAT competitions the largest certificates of unsatisfiability are starting to reach terabyte size. This puts limits to the development of SAT-solving services in which a client with limited computational power sends a formula to a solver running on a powerful server, which returns a certificate to be checked by the client.\n  Recently, Couillard et al. have suggested to replace certificates with interactive proof systems based on the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14996","kind":"arxiv","version":8},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.14996/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2401.14996","created_at":"2026-05-22T01:03:39.157802+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.14996v8","created_at":"2026-05-22T01:03:39.157802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14996","created_at":"2026-05-22T01:03:39.157802+00:00"},{"alias_kind":"pith_short_12","alias_value":"2L5ZTHFTINUY","created_at":"2026-05-22T01:03:39.157802+00:00"},{"alias_kind":"pith_short_16","alias_value":"2L5ZTHFTINUYWC35","created_at":"2026-05-22T01:03:39.157802+00:00"},{"alias_kind":"pith_short_8","alias_value":"2L5ZTHFT","created_at":"2026-05-22T01:03:39.157802+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/2L5ZTHFTINUYWC352QZ4WVWLI6","json":"https://pith.science/pith/2L5ZTHFTINUYWC352QZ4WVWLI6.json","graph_json":"https://pith.science/api/pith-number/2L5ZTHFTINUYWC352QZ4WVWLI6/graph.json","events_json":"https://pith.science/api/pith-number/2L5ZTHFTINUYWC352QZ4WVWLI6/events.json","paper":"https://pith.science/paper/2L5ZTHFT"},"agent_actions":{"view_html":"https://pith.science/pith/2L5ZTHFTINUYWC352QZ4WVWLI6","download_json":"https://pith.science/pith/2L5ZTHFTINUYWC352QZ4WVWLI6.json","view_paper":"https://pith.science/paper/2L5ZTHFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.14996&json=true","fetch_graph":"https://pith.science/api/pith-number/2L5ZTHFTINUYWC352QZ4WVWLI6/graph.json","fetch_events":"https://pith.science/api/pith-number/2L5ZTHFTINUYWC352QZ4WVWLI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2L5ZTHFTINUYWC352QZ4WVWLI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2L5ZTHFTINUYWC352QZ4WVWLI6/action/storage_attestation","attest_author":"https://pith.science/pith/2L5ZTHFTINUYWC352QZ4WVWLI6/action/author_attestation","sign_citation":"https://pith.science/pith/2L5ZTHFTINUYWC352QZ4WVWLI6/action/citation_signature","submit_replication":"https://pith.science/pith/2L5ZTHFTINUYWC352QZ4WVWLI6/action/replication_record"}},"created_at":"2026-05-22T01:03:39.157802+00:00","updated_at":"2026-05-22T01:03:39.157802+00:00"}