{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:OSTJQN7SPZRJHPHGJ4RQA3XLFX","short_pith_number":"pith:OSTJQN7S","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"},"canonical_sha256":"74a69837f27e6293bce64f23006eeb2dcc7b367a5e74a3272520ade95109bbcf","source":{"kind":"arxiv","id":"2208.07451","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.07451","created_at":"2026-07-05T04:49:04Z"},{"alias_kind":"arxiv_version","alias_value":"2208.07451v1","created_at":"2026-07-05T04:49:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.07451","created_at":"2026-07-05T04:49:04Z"},{"alias_kind":"pith_short_12","alias_value":"OSTJQN7SPZRJ","created_at":"2026-07-05T04:49:04Z"},{"alias_kind":"pith_short_16","alias_value":"OSTJQN7SPZRJHPHG","created_at":"2026-07-05T04:49:04Z"},{"alias_kind":"pith_short_8","alias_value":"OSTJQN7S","created_at":"2026-07-05T04:49:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:OSTJQN7SPZRJHPHGJ4RQA3XLFX","target":"record","payload":{"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"},"canonical_sha256":"74a69837f27e6293bce64f23006eeb2dcc7b367a5e74a3272520ade95109bbcf","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"},"source_kind":"arxiv","source_id":"2208.07451","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:49:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Pn+HSlcFC2j5qxBuFsMQGFhh7uK3O2Um0zKYzgbXRoYjhNFsm2Wpjd0gZA+77MzpxMDmNl36CziJ2yIH5J6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T20:25:03.878967Z"},"content_sha256":"81611d51440fbc07631220f9a12654cd8f3a5cae1572c21d4ab56efa974cf4c1","schema_version":"1.0","event_id":"sha256:81611d51440fbc07631220f9a12654cd8f3a5cae1572c21d4ab56efa974cf4c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:OSTJQN7SPZRJHPHGJ4RQA3XLFX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:49:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"crT7YexBXsKcLy5/QZmWAKyYPrHPzQG/S/jO1VlZ2sR6n3V+ekp457YZOkG3HPsA/OSbChAaT7FDo3Hyw2ntBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T20:25:03.879515Z"},"content_sha256":"546f0dc9a5a195b978caec7e8650d9521f850e85b018bfba00e63cb542d66198","schema_version":"1.0","event_id":"sha256:546f0dc9a5a195b978caec7e8650d9521f850e85b018bfba00e63cb542d66198"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX/bundle.json","state_url":"https://pith.science/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T20:25:03Z","links":{"resolver":"https://pith.science/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX","bundle":"https://pith.science/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX/bundle.json","state":"https://pith.science/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OSTJQN7SPZRJHPHGJ4RQA3XLFX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:OSTJQN7SPZRJHPHGJ4RQA3XLFX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"99a5a32f8ba21f91faca9eb04565afb6b7e2bbe1f35f2bd940c72311330b9ee7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2022-08-15T22:06:41Z","title_canon_sha256":"e30dae0fcaa08f815d0cc4476fa88e90051b7f6cf206d92354e4da62d6fb643d"},"schema_version":"1.0","source":{"id":"2208.07451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.07451","created_at":"2026-07-05T04:49:04Z"},{"alias_kind":"arxiv_version","alias_value":"2208.07451v1","created_at":"2026-07-05T04:49:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.07451","created_at":"2026-07-05T04:49:04Z"},{"alias_kind":"pith_short_12","alias_value":"OSTJQN7SPZRJ","created_at":"2026-07-05T04:49:04Z"},{"alias_kind":"pith_short_16","alias_value":"OSTJQN7SPZRJHPHG","created_at":"2026-07-05T04:49:04Z"},{"alias_kind":"pith_short_8","alias_value":"OSTJQN7S","created_at":"2026-07-05T04:49:04Z"}],"graph_snapshots":[{"event_id":"sha256:546f0dc9a5a195b978caec7e8650d9521f850e85b018bfba00e63cb542d66198","target":"graph","created_at":"2026-07-05T04:49:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2208.07451/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Sharon Shoham, Yotam M. Y. Feldman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2022-08-15T22:06:41Z","title":"Invariant Inference With Provable Complexity From the Monotone Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.07451","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:81611d51440fbc07631220f9a12654cd8f3a5cae1572c21d4ab56efa974cf4c1","target":"record","created_at":"2026-07-05T04:49:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"99a5a32f8ba21f91faca9eb04565afb6b7e2bbe1f35f2bd940c72311330b9ee7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2022-08-15T22:06:41Z","title_canon_sha256":"e30dae0fcaa08f815d0cc4476fa88e90051b7f6cf206d92354e4da62d6fb643d"},"schema_version":"1.0","source":{"id":"2208.07451","kind":"arxiv","version":1}},"canonical_sha256":"74a69837f27e6293bce64f23006eeb2dcc7b367a5e74a3272520ade95109bbcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74a69837f27e6293bce64f23006eeb2dcc7b367a5e74a3272520ade95109bbcf","first_computed_at":"2026-07-05T04:49:04.679102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:49:04.679102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3LvKOowUNUyEg+Ynr46Hs36arvmFkMnyv5EWdsT1s+MPcIAkMjvaOrMjrBz6KXX0wpjZOfRkb+e7GdR+LvCfDw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:49:04.679571Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.07451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81611d51440fbc07631220f9a12654cd8f3a5cae1572c21d4ab56efa974cf4c1","sha256:546f0dc9a5a195b978caec7e8650d9521f850e85b018bfba00e63cb542d66198"],"state_sha256":"783b274dfe0ef89cc1d1a46a5f8fb2816b7c521d79288c7bc936ec1f68463844"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oEHxUnffJGyxBCqxC6U/0PKDBD4IlyM7QhgRoL5SopBMNfGK0MKFa9Sn465pvmWPPc8wQyXk6Dfozsz5odS8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T20:25:03.884285Z","bundle_sha256":"f03a3c800ab3c24c8b20de3136e7cbd3ffa2e3712b51fe25382e81f340cf5771"}}