Richard Goodman of IAOM published this dataset on July 11, 2026. The data relates to generating and checking polynomial receipts for Boolean satisfiability (SAT) and unsatisfiability (UNSAT) problems. It appears to involve a proof kernel for verifying computational results in formal logic.
Use Cases
- Verifying SAT solver outputs based on polynomial receipt mechanisms described in the title.
- Benchmarking proof kernel performance for UNSAT certification.
- Researching interactive proof systems and computational trust for logic problems.
Strengths
- Author and organization (Richard Goodman, IAOM) are explicitly identified.
- Dataset has a specific last updated timestamp of 2026-07-11 22:58:12.
Limitations
- Description metadata is limited; actual data quality requires manual inspection after download.
- Column-level documentation is absent; field semantics must be inferred after download.
- Row count is unknown, which may limit suitability assessment.
Provenance
- Source
- IAOM
- Freshness
- Last updated 2026-07-11 22:58:12; freshness should be verified.