{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OSTJQN7SPZRJHPHGJ4RQA3XLFX","short_pith_number":"pith:OSTJQN7S","schema_version":"1.0","canonical_sha256":"74a69837f27e6293bce64f23006eeb2dcc7b367a5e74a3272520ade95109bbcf","source":{"kind":"arxiv","id":"2208.07451","version":1},"attestation_state":"computed","paper":{"title":"Invariant Inference With Provable Complexity From the Monotone Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Sharon Shoham, Yotam M. Y. Feldman","submitted_at":"2022-08-15T22:06:41Z","abstract_excerpt":"Invariant inference algorithms such as interpolation-based inference and IC3/PDR show that it is feasible, in practice, to find inductive invariants for many interesting systems, but non-trivial upper bounds on the computational complexity of such algorithms are scarce, and limited to simple syntactic forms of invariants. In this paper we achieve invariant inference algorithms, in the domain of propositional transition systems, with provable upper bounds on the number of SAT calls. We do this by building on the monotone theory, developed by Bshouty for exact learning Boolean formulas. We prove"},"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":"2208.07451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2022-08-15T22:06:41Z","cross_cats_sorted":[],"title_canon_sha256":"e30dae0fcaa08f815d0cc4476fa88e90051b7f6cf206d92354e4da62d6fb643d","abstract_canon_sha256":"99a5a32f8ba21f91faca9eb04565afb6b7e2bbe1f35f2bd940c72311330b9ee7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:49:04.679571Z","signature_b64":"3LvKOowUNUyEg+Ynr46Hs36arvmFkMnyv5EWdsT1s+MPcIAkMjvaOrMjrBz6KXX0wpjZOfRkb+e7GdR+LvCfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74a69837f27e6293bce64f23006eeb2dcc7b367a5e74a3272520ade95109bbcf","last_reissued_at":"2026-07-05T04:49:04.679102Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:49:04.679102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Invariant Inference With Provable Complexity From the Monotone Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Sharon Shoham, Yotam M. Y. Feldman","submitted_at":"2022-08-15T22:06:41Z","abstract_excerpt":"Invariant inference algorithms such as interpolation-based inference and IC3/PDR show that it is feasible, in practice, to find inductive invariants for many interesting systems, but non-trivial upper bounds on the computational complexity of such algorithms are scarce, and limited to simple syntactic forms of invariants. In this paper we achieve invariant inference algorithms, in the domain of propositional transition systems, with provable upper bounds on the number of SAT calls. We do this by building on the monotone theory, developed by Bshouty for exact learning Boolean formulas. We prove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.07451","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/2208.07451/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":"2208.07451","created_at":"2026-07-05T04:49:04.679161+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.07451v1","created_at":"2026-07-05T04:49:04.679161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.07451","created_at":"2026-07-05T04:49:04.679161+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSTJQN7SPZRJ","created_at":"2026-07-05T04:49:04.679161+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSTJQN7SPZRJHPHG","created_at":"2026-07-05T04:49:04.679161+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSTJQN7S","created_at":"2026-07-05T04:49:04.679161+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/OSTJQN7SPZRJHPHGJ4RQA3XLFX","json":"https://pith.science/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX.json","graph_json":"https://pith.science/api/pith-number/OSTJQN7SPZRJHPHGJ4RQA3XLFX/graph.json","events_json":"https://pith.science/api/pith-number/OSTJQN7SPZRJHPHGJ4RQA3XLFX/events.json","paper":"https://pith.science/paper/OSTJQN7S"},"agent_actions":{"view_html":"https://pith.science/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX","download_json":"https://pith.science/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX.json","view_paper":"https://pith.science/paper/OSTJQN7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.07451&json=true","fetch_graph":"https://pith.science/api/pith-number/OSTJQN7SPZRJHPHGJ4RQA3XLFX/graph.json","fetch_events":"https://pith.science/api/pith-number/OSTJQN7SPZRJHPHGJ4RQA3XLFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX/action/storage_attestation","attest_author":"https://pith.science/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX/action/author_attestation","sign_citation":"https://pith.science/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX/action/citation_signature","submit_replication":"https://pith.science/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX/action/replication_record"}},"created_at":"2026-07-05T04:49:04.679161+00:00","updated_at":"2026-07-05T04:49:04.679161+00:00"}