{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KSWINTL66J63ZFXMUEC4HU2C3E","short_pith_number":"pith:KSWINTL6","schema_version":"1.0","canonical_sha256":"54ac86cd7ef27dbc96eca105c3d342d9125f6746195d4531f8b2f6def50e30e9","source":{"kind":"arxiv","id":"1910.12256","version":3},"attestation_state":"computed","paper":{"title":"Complexity and Information in Invariant Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Mooly Sagiv, Neil Immerman, Sharon Shoham, Yotam M. Y. Feldman","submitted_at":"2019-10-27T12:59:48Z","abstract_excerpt":"This paper addresses the complexity of SAT-based invariant inference, a prominent approach to safety verification. We consider the problem of inferring an inductive invariant of polynomial length given a transition system and a safety property. We analyze the complexity of this problem in a black-box model, called the Hoare-query model, which is general enough to capture algorithms such as IC3/PDR and its variants. An algorithm in this model learns about the system's reachable states by querying the validity of Hoare triples.\n  We show that in general an algorithm in the Hoare-query model requ"},"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":"1910.12256","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-10-27T12:59:48Z","cross_cats_sorted":[],"title_canon_sha256":"c601c4f2fd4660d2b4b7cd5783fe83b172182e62adfe3bff0639e9a56b928eb1","abstract_canon_sha256":"0b9d806df2df325e67f9af3eb76c9a92973b199ace2b92a1f2307c4937e1f77f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:34:18.965449Z","signature_b64":"fThKcFSDVcqfWE4vu4yI3S/ZMAV4G1i97T+ncZeHIqKiyz+CzmNELFCZLPtKtl5k3ZV2BoVhmIK/rtyol9ZOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54ac86cd7ef27dbc96eca105c3d342d9125f6746195d4531f8b2f6def50e30e9","last_reissued_at":"2026-07-05T00:34:18.964990Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:34:18.964990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity and Information in Invariant Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Mooly Sagiv, Neil Immerman, Sharon Shoham, Yotam M. Y. Feldman","submitted_at":"2019-10-27T12:59:48Z","abstract_excerpt":"This paper addresses the complexity of SAT-based invariant inference, a prominent approach to safety verification. We consider the problem of inferring an inductive invariant of polynomial length given a transition system and a safety property. We analyze the complexity of this problem in a black-box model, called the Hoare-query model, which is general enough to capture algorithms such as IC3/PDR and its variants. An algorithm in this model learns about the system's reachable states by querying the validity of Hoare triples.\n  We show that in general an algorithm in the Hoare-query model requ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.12256","kind":"arxiv","version":3},"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/1910.12256/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":"1910.12256","created_at":"2026-07-05T00:34:18.965049+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.12256v3","created_at":"2026-07-05T00:34:18.965049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.12256","created_at":"2026-07-05T00:34:18.965049+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSWINTL66J63","created_at":"2026-07-05T00:34:18.965049+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSWINTL66J63ZFXM","created_at":"2026-07-05T00:34:18.965049+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSWINTL6","created_at":"2026-07-05T00:34:18.965049+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/KSWINTL66J63ZFXMUEC4HU2C3E","json":"https://pith.science/pith/KSWINTL66J63ZFXMUEC4HU2C3E.json","graph_json":"https://pith.science/api/pith-number/KSWINTL66J63ZFXMUEC4HU2C3E/graph.json","events_json":"https://pith.science/api/pith-number/KSWINTL66J63ZFXMUEC4HU2C3E/events.json","paper":"https://pith.science/paper/KSWINTL6"},"agent_actions":{"view_html":"https://pith.science/pith/KSWINTL66J63ZFXMUEC4HU2C3E","download_json":"https://pith.science/pith/KSWINTL66J63ZFXMUEC4HU2C3E.json","view_paper":"https://pith.science/paper/KSWINTL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.12256&json=true","fetch_graph":"https://pith.science/api/pith-number/KSWINTL66J63ZFXMUEC4HU2C3E/graph.json","fetch_events":"https://pith.science/api/pith-number/KSWINTL66J63ZFXMUEC4HU2C3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSWINTL66J63ZFXMUEC4HU2C3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSWINTL66J63ZFXMUEC4HU2C3E/action/storage_attestation","attest_author":"https://pith.science/pith/KSWINTL66J63ZFXMUEC4HU2C3E/action/author_attestation","sign_citation":"https://pith.science/pith/KSWINTL66J63ZFXMUEC4HU2C3E/action/citation_signature","submit_replication":"https://pith.science/pith/KSWINTL66J63ZFXMUEC4HU2C3E/action/replication_record"}},"created_at":"2026-07-05T00:34:18.965049+00:00","updated_at":"2026-07-05T00:34:18.965049+00:00"}