{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LRUIQJ5ZKMSLQOS5IQEYIQVFNT","short_pith_number":"pith:LRUIQJ5Z","schema_version":"1.0","canonical_sha256":"5c688827b95324b83a5d44098442a56ce190f6456f6250aca323aae190787c86","source":{"kind":"arxiv","id":"1609.09288","version":2},"attestation_state":"computed","paper":{"title":"Formula Slicing: Inductive Invariants from Preconditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David Monniaux, Egor George Karpenkov","submitted_at":"2016-09-29T10:27:15Z","abstract_excerpt":"We propose a \"formula slicing\" method for finding inductive invariants. It is based on the observation that many loops in the program affect only a small part of the memory, and many invariants which were valid before a loop are still valid after.\n  Given a precondition of the loop, obtained from the preceding program fragment, we weaken it until it becomes inductive. The weakening procedure is guided by counterexamples-to-induction given by an SMT solver. Our algorithm applies to programs with arbitrary loop structure, and it computes the strongest invariant in an abstract domain of weakening"},"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":"1609.09288","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-09-29T10:27:15Z","cross_cats_sorted":[],"title_canon_sha256":"9b979b634ef4a2ff0be056ce327e858191540623e458a0fcbfe2ff01a8c0a942","abstract_canon_sha256":"bc34fdebddac1fa29ade7ee2a675ebcb84afed159daa3bdd408ebefbe2ba0788"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:32.132582Z","signature_b64":"OgY5ijcA7KbDbhUsEASzMIU3uEo5hPDMe84GVwOqmSUAPzgCAC2bdR6tk+e/eTF5+mqsfQH897OweElT2FYlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c688827b95324b83a5d44098442a56ce190f6456f6250aca323aae190787c86","last_reissued_at":"2026-05-18T01:03:32.131937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:32.131937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formula Slicing: Inductive Invariants from Preconditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David Monniaux, Egor George Karpenkov","submitted_at":"2016-09-29T10:27:15Z","abstract_excerpt":"We propose a \"formula slicing\" method for finding inductive invariants. It is based on the observation that many loops in the program affect only a small part of the memory, and many invariants which were valid before a loop are still valid after.\n  Given a precondition of the loop, obtained from the preceding program fragment, we weaken it until it becomes inductive. The weakening procedure is guided by counterexamples-to-induction given by an SMT solver. Our algorithm applies to programs with arbitrary loop structure, and it computes the strongest invariant in an abstract domain of weakening"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09288","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":"1609.09288","created_at":"2026-05-18T01:03:32.132028+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.09288v2","created_at":"2026-05-18T01:03:32.132028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09288","created_at":"2026-05-18T01:03:32.132028+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRUIQJ5ZKMSL","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRUIQJ5ZKMSLQOS5","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRUIQJ5Z","created_at":"2026-05-18T12:30:29.479603+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/LRUIQJ5ZKMSLQOS5IQEYIQVFNT","json":"https://pith.science/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT.json","graph_json":"https://pith.science/api/pith-number/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/graph.json","events_json":"https://pith.science/api/pith-number/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/events.json","paper":"https://pith.science/paper/LRUIQJ5Z"},"agent_actions":{"view_html":"https://pith.science/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT","download_json":"https://pith.science/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT.json","view_paper":"https://pith.science/paper/LRUIQJ5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.09288&json=true","fetch_graph":"https://pith.science/api/pith-number/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/graph.json","fetch_events":"https://pith.science/api/pith-number/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/action/storage_attestation","attest_author":"https://pith.science/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/action/author_attestation","sign_citation":"https://pith.science/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/action/citation_signature","submit_replication":"https://pith.science/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/action/replication_record"}},"created_at":"2026-05-18T01:03:32.132028+00:00","updated_at":"2026-05-18T01:03:32.132028+00:00"}