{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7BB4L54VMXWV2QCRKOMF4NMWTR","short_pith_number":"pith:7BB4L54V","schema_version":"1.0","canonical_sha256":"f843c5f79565ed5d405153985e35969c4ac2eed10479b6802cfffda9d093f819","source":{"kind":"arxiv","id":"1809.00503","version":3},"attestation_state":"computed","paper":{"title":"Improving Convergence Rate Of IC3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Eugene Goldberg","submitted_at":"2018-09-03T08:50:36Z","abstract_excerpt":"IC3, a well-known model checker, proves a property of a transition system by building a sequence of formulas $F_0,\\dots,F_k$. Formula $F_i$, $0 \\leq i \\leq k$ over-approximates the set of states reachable in at most $i$ transitions. The basic algorithm of IC3 cannot guarantee that the value of $k$ never exceeds the reachability diameter of the system. We describe an algorithm called IC4 that gives such a guarantee. (IC4 stands for 'IC3 + Improved Convergence'). One can argue that the average convergence rate of IC4 is better than for IC3 as well. Improving convergence can facilitate some other"},"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":"1809.00503","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-03T08:50:36Z","cross_cats_sorted":[],"title_canon_sha256":"ac3f8d746be3be8c4cd4ef39eddc6ae9ed264a213190e2082ccbb79c2b74e101","abstract_canon_sha256":"8d1a1d9986b51ddfe22e521505f5916c3d0bc5f2671d18b226b59f1bd4b6b453"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:54.647820Z","signature_b64":"rap4HHyPEbtipRYLa1Yo2Dr/9W8sGD+tCjLRIHKmN0RdUc6E3UtsaTfqXN4+U12u5s1phf2JEbjxTRx26Eh1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f843c5f79565ed5d405153985e35969c4ac2eed10479b6802cfffda9d093f819","last_reissued_at":"2026-05-18T00:02:54.646968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:54.646968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Convergence Rate Of IC3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Eugene Goldberg","submitted_at":"2018-09-03T08:50:36Z","abstract_excerpt":"IC3, a well-known model checker, proves a property of a transition system by building a sequence of formulas $F_0,\\dots,F_k$. Formula $F_i$, $0 \\leq i \\leq k$ over-approximates the set of states reachable in at most $i$ transitions. The basic algorithm of IC3 cannot guarantee that the value of $k$ never exceeds the reachability diameter of the system. We describe an algorithm called IC4 that gives such a guarantee. (IC4 stands for 'IC3 + Improved Convergence'). One can argue that the average convergence rate of IC4 is better than for IC3 as well. Improving convergence can facilitate some other"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00503","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":""},"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":"1809.00503","created_at":"2026-05-18T00:02:54.647102+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00503v3","created_at":"2026-05-18T00:02:54.647102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00503","created_at":"2026-05-18T00:02:54.647102+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BB4L54VMXWV","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BB4L54VMXWV2QCR","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BB4L54V","created_at":"2026-05-18T12:32:11.075285+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/7BB4L54VMXWV2QCRKOMF4NMWTR","json":"https://pith.science/pith/7BB4L54VMXWV2QCRKOMF4NMWTR.json","graph_json":"https://pith.science/api/pith-number/7BB4L54VMXWV2QCRKOMF4NMWTR/graph.json","events_json":"https://pith.science/api/pith-number/7BB4L54VMXWV2QCRKOMF4NMWTR/events.json","paper":"https://pith.science/paper/7BB4L54V"},"agent_actions":{"view_html":"https://pith.science/pith/7BB4L54VMXWV2QCRKOMF4NMWTR","download_json":"https://pith.science/pith/7BB4L54VMXWV2QCRKOMF4NMWTR.json","view_paper":"https://pith.science/paper/7BB4L54V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00503&json=true","fetch_graph":"https://pith.science/api/pith-number/7BB4L54VMXWV2QCRKOMF4NMWTR/graph.json","fetch_events":"https://pith.science/api/pith-number/7BB4L54VMXWV2QCRKOMF4NMWTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BB4L54VMXWV2QCRKOMF4NMWTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BB4L54VMXWV2QCRKOMF4NMWTR/action/storage_attestation","attest_author":"https://pith.science/pith/7BB4L54VMXWV2QCRKOMF4NMWTR/action/author_attestation","sign_citation":"https://pith.science/pith/7BB4L54VMXWV2QCRKOMF4NMWTR/action/citation_signature","submit_replication":"https://pith.science/pith/7BB4L54VMXWV2QCRKOMF4NMWTR/action/replication_record"}},"created_at":"2026-05-18T00:02:54.647102+00:00","updated_at":"2026-05-18T00:02:54.647102+00:00"}