{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZTYIOBMS5L526X6UOZRYNBFNL7","short_pith_number":"pith:ZTYIOBMS","schema_version":"1.0","canonical_sha256":"ccf0870592eafbaf5fd476638684ad5ffa289f9b2d1d3870dbf4b1615b2b049e","source":{"kind":"arxiv","id":"2605.16421","version":1},"attestation_state":"computed","paper":{"title":"Orthologic for SAT Solving","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Simon Guilloud, Viktor Kun\\v{c}ak, Vladislas de Haldat","submitted_at":"2026-05-14T13:05:57Z","abstract_excerpt":"We present a new algorithm for deciding formula entailment in orthologic (a sound approximation of classical logic) that avoids the costly preprocessing phase of prior implementations while retaining the same $\\mathcal{O}(n^2(1+|A|))$ worst-case complexity. We then introduce a family of synthetic SAT benchmarks based on the observation that, for any formula $\\phi$, the equivalence $\\phi \\leftrightarrow \\mathrm{NF}_{\\mathrm{OL}}(\\phi)$ is a tautology whose Tseitin encoding yields unsatisfiable instances that are hard for state-of-the-art SAT solvers yet have short orthologic proofs. Applied to "},"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":"2605.16421","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-14T13:05:57Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1eb48428b2f83ae24f99252f6fca79ace699330cb9fabf13483d04c360be6879","abstract_canon_sha256":"d92e6ef503ff09fd5f615de90ce0e0c24881719294b2b88ea0cbd457e77ad343"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:21.463379Z","signature_b64":"W78jTuWxj+SXWukToxPgMznYMThngg8FebGLRbbT5sNDCTNIE9A0BjWGWf0u6PRyLUXU3shqkHO9pGltiEcQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccf0870592eafbaf5fd476638684ad5ffa289f9b2d1d3870dbf4b1615b2b049e","last_reissued_at":"2026-05-20T00:02:21.462647Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:21.462647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Orthologic for SAT Solving","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Simon Guilloud, Viktor Kun\\v{c}ak, Vladislas de Haldat","submitted_at":"2026-05-14T13:05:57Z","abstract_excerpt":"We present a new algorithm for deciding formula entailment in orthologic (a sound approximation of classical logic) that avoids the costly preprocessing phase of prior implementations while retaining the same $\\mathcal{O}(n^2(1+|A|))$ worst-case complexity. We then introduce a family of synthetic SAT benchmarks based on the observation that, for any formula $\\phi$, the equivalence $\\phi \\leftrightarrow \\mathrm{NF}_{\\mathrm{OL}}(\\phi)$ is a tautology whose Tseitin encoding yields unsatisfiable instances that are hard for state-of-the-art SAT solvers yet have short orthologic proofs. Applied to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16421","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16421/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-19T19:41:56.556473Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T19:34:36.588868Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"8319aafb5f65eb18381d6d59b7938844ce6498cd68219afee35784587b0247ab"},"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":"2605.16421","created_at":"2026-05-20T00:02:21.462764+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16421v1","created_at":"2026-05-20T00:02:21.462764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16421","created_at":"2026-05-20T00:02:21.462764+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTYIOBMS5L52","created_at":"2026-05-20T00:02:21.462764+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTYIOBMS5L526X6U","created_at":"2026-05-20T00:02:21.462764+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTYIOBMS","created_at":"2026-05-20T00:02:21.462764+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/ZTYIOBMS5L526X6UOZRYNBFNL7","json":"https://pith.science/pith/ZTYIOBMS5L526X6UOZRYNBFNL7.json","graph_json":"https://pith.science/api/pith-number/ZTYIOBMS5L526X6UOZRYNBFNL7/graph.json","events_json":"https://pith.science/api/pith-number/ZTYIOBMS5L526X6UOZRYNBFNL7/events.json","paper":"https://pith.science/paper/ZTYIOBMS"},"agent_actions":{"view_html":"https://pith.science/pith/ZTYIOBMS5L526X6UOZRYNBFNL7","download_json":"https://pith.science/pith/ZTYIOBMS5L526X6UOZRYNBFNL7.json","view_paper":"https://pith.science/paper/ZTYIOBMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16421&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTYIOBMS5L526X6UOZRYNBFNL7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTYIOBMS5L526X6UOZRYNBFNL7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTYIOBMS5L526X6UOZRYNBFNL7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTYIOBMS5L526X6UOZRYNBFNL7/action/storage_attestation","attest_author":"https://pith.science/pith/ZTYIOBMS5L526X6UOZRYNBFNL7/action/author_attestation","sign_citation":"https://pith.science/pith/ZTYIOBMS5L526X6UOZRYNBFNL7/action/citation_signature","submit_replication":"https://pith.science/pith/ZTYIOBMS5L526X6UOZRYNBFNL7/action/replication_record"}},"created_at":"2026-05-20T00:02:21.462764+00:00","updated_at":"2026-05-20T00:02:21.462764+00:00"}