{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AWRGLLBOG2SW5YZHQMFDHKGNED","short_pith_number":"pith:AWRGLLBO","schema_version":"1.0","canonical_sha256":"05a265ac2e36a56ee327830a33a8cd20cb834f50599f06933328d790c71491d6","source":{"kind":"arxiv","id":"1712.05581","version":2},"attestation_state":"computed","paper":{"title":"Invariant Synthesis for Incomplete Verification Engines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.PL","authors_text":"Daejun Park, Daniel Neider, P. Madhusudan, Pranav Garg, Shambwaditya Saha","submitted_at":"2017-12-15T08:38:15Z","abstract_excerpt":"We propose a framework for synthesizing inductive invariants for incomplete verification engines, which soundly reduce logical problems in undecidable theories to decidable theories. Our framework is based on the counter-example guided inductive synthesis principle (CEGIS) and allows verification engines to communicate non-provability information to guide invariant synthesis. We show precisely how the verification engine can compute such non-provability information and how to build effective learning algorithms when invariants are expressed as Boolean combinations of a fixed set of predicates."},"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":"1712.05581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-12-15T08:38:15Z","cross_cats_sorted":["cs.LG","cs.LO"],"title_canon_sha256":"21e0b93a652ab71a651fdf2c6e2d830883d66776e36e07be430fa3ddf6db0164","abstract_canon_sha256":"425022d4f5242b8e8219ba6f10fc9bc3328373740e7bfb3de1b681a5badfd543"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:12.454498Z","signature_b64":"bwwWM8SXg3syCdZIqN9DxFyVjjZMmLzr9IGV9pPzxN/1M1AEiyUje8yQUygWr9w6s8+BnwxLpKOKH9sCL6liBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05a265ac2e36a56ee327830a33a8cd20cb834f50599f06933328d790c71491d6","last_reissued_at":"2026-05-18T00:26:12.454086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:12.454086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Invariant Synthesis for Incomplete Verification Engines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.PL","authors_text":"Daejun Park, Daniel Neider, P. Madhusudan, Pranav Garg, Shambwaditya Saha","submitted_at":"2017-12-15T08:38:15Z","abstract_excerpt":"We propose a framework for synthesizing inductive invariants for incomplete verification engines, which soundly reduce logical problems in undecidable theories to decidable theories. Our framework is based on the counter-example guided inductive synthesis principle (CEGIS) and allows verification engines to communicate non-provability information to guide invariant synthesis. We show precisely how the verification engine can compute such non-provability information and how to build effective learning algorithms when invariants are expressed as Boolean combinations of a fixed set of predicates."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05581","kind":"arxiv","version":2},"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":"1712.05581","created_at":"2026-05-18T00:26:12.454146+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05581v2","created_at":"2026-05-18T00:26:12.454146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05581","created_at":"2026-05-18T00:26:12.454146+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWRGLLBOG2SW","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWRGLLBOG2SW5YZH","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWRGLLBO","created_at":"2026-05-18T12:31:08.081275+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/AWRGLLBOG2SW5YZHQMFDHKGNED","json":"https://pith.science/pith/AWRGLLBOG2SW5YZHQMFDHKGNED.json","graph_json":"https://pith.science/api/pith-number/AWRGLLBOG2SW5YZHQMFDHKGNED/graph.json","events_json":"https://pith.science/api/pith-number/AWRGLLBOG2SW5YZHQMFDHKGNED/events.json","paper":"https://pith.science/paper/AWRGLLBO"},"agent_actions":{"view_html":"https://pith.science/pith/AWRGLLBOG2SW5YZHQMFDHKGNED","download_json":"https://pith.science/pith/AWRGLLBOG2SW5YZHQMFDHKGNED.json","view_paper":"https://pith.science/paper/AWRGLLBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05581&json=true","fetch_graph":"https://pith.science/api/pith-number/AWRGLLBOG2SW5YZHQMFDHKGNED/graph.json","fetch_events":"https://pith.science/api/pith-number/AWRGLLBOG2SW5YZHQMFDHKGNED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWRGLLBOG2SW5YZHQMFDHKGNED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWRGLLBOG2SW5YZHQMFDHKGNED/action/storage_attestation","attest_author":"https://pith.science/pith/AWRGLLBOG2SW5YZHQMFDHKGNED/action/author_attestation","sign_citation":"https://pith.science/pith/AWRGLLBOG2SW5YZHQMFDHKGNED/action/citation_signature","submit_replication":"https://pith.science/pith/AWRGLLBOG2SW5YZHQMFDHKGNED/action/replication_record"}},"created_at":"2026-05-18T00:26:12.454146+00:00","updated_at":"2026-05-18T00:26:12.454146+00:00"}