{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LRUIQJ5ZKMSLQOS5IQEYIQVFNT","short_pith_number":"pith:LRUIQJ5Z","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"},"canonical_sha256":"5c688827b95324b83a5d44098442a56ce190f6456f6250aca323aae190787c86","source":{"kind":"arxiv","id":"1609.09288","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09288","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09288v2","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09288","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"LRUIQJ5ZKMSL","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LRUIQJ5ZKMSLQOS5","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LRUIQJ5Z","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LRUIQJ5ZKMSLQOS5IQEYIQVFNT","target":"record","payload":{"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"},"canonical_sha256":"5c688827b95324b83a5d44098442a56ce190f6456f6250aca323aae190787c86","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"},"source_kind":"arxiv","source_id":"1609.09288","source_version":2,"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-05-18T01:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4CuQDro9SQYlhIYwKGyfoZVl0czvBpmmXl986ryP1k0J6b+0qv4dwSzAh/cIeLsvZdrPo0icme2JXX0O4bLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:33:36.922961Z"},"content_sha256":"8ddd8dab5ebaa76e825ba83a958e47a2d48978ecc82e38dda7bd584b9e796380","schema_version":"1.0","event_id":"sha256:8ddd8dab5ebaa76e825ba83a958e47a2d48978ecc82e38dda7bd584b9e796380"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LRUIQJ5ZKMSLQOS5IQEYIQVFNT","target":"graph","payload":{"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"},"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-05-18T01:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VUZGdFP7QP9oSifH9D0PSxtdj7PAt6s3lbwjFUHsuK6q2VZJ+CLmBv0vOgTAIvYhPcimKEX5YWqq0+vRmnYFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:33:36.923646Z"},"content_sha256":"fc0422059919d55c98872b2c1e88e9b743be8b31fd65a1862104293451e4269a","schema_version":"1.0","event_id":"sha256:fc0422059919d55c98872b2c1e88e9b743be8b31fd65a1862104293451e4269a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/bundle.json","state_url":"https://pith.science/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/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-06-08T01:33:36Z","links":{"resolver":"https://pith.science/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT","bundle":"https://pith.science/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/bundle.json","state":"https://pith.science/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LRUIQJ5ZKMSLQOS5IQEYIQVFNT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LRUIQJ5ZKMSLQOS5IQEYIQVFNT","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":"bc34fdebddac1fa29ade7ee2a675ebcb84afed159daa3bdd408ebefbe2ba0788","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-09-29T10:27:15Z","title_canon_sha256":"9b979b634ef4a2ff0be056ce327e858191540623e458a0fcbfe2ff01a8c0a942"},"schema_version":"1.0","source":{"id":"1609.09288","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09288","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09288v2","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09288","created_at":"2026-05-18T01:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"LRUIQJ5ZKMSL","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LRUIQJ5ZKMSLQOS5","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LRUIQJ5Z","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:fc0422059919d55c98872b2c1e88e9b743be8b31fd65a1862104293451e4269a","target":"graph","created_at":"2026-05-18T01:03:32Z","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"},"paper":{"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","authors_text":"David Monniaux, Egor George Karpenkov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-09-29T10:27:15Z","title":"Formula Slicing: Inductive Invariants from Preconditions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09288","kind":"arxiv","version":2},"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:8ddd8dab5ebaa76e825ba83a958e47a2d48978ecc82e38dda7bd584b9e796380","target":"record","created_at":"2026-05-18T01:03:32Z","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":"bc34fdebddac1fa29ade7ee2a675ebcb84afed159daa3bdd408ebefbe2ba0788","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-09-29T10:27:15Z","title_canon_sha256":"9b979b634ef4a2ff0be056ce327e858191540623e458a0fcbfe2ff01a8c0a942"},"schema_version":"1.0","source":{"id":"1609.09288","kind":"arxiv","version":2}},"canonical_sha256":"5c688827b95324b83a5d44098442a56ce190f6456f6250aca323aae190787c86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c688827b95324b83a5d44098442a56ce190f6456f6250aca323aae190787c86","first_computed_at":"2026-05-18T01:03:32.131937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:32.131937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OgY5ijcA7KbDbhUsEASzMIU3uEo5hPDMe84GVwOqmSUAPzgCAC2bdR6tk+e/eTF5+mqsfQH897OweElT2FYlBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:32.132582Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09288","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ddd8dab5ebaa76e825ba83a958e47a2d48978ecc82e38dda7bd584b9e796380","sha256:fc0422059919d55c98872b2c1e88e9b743be8b31fd65a1862104293451e4269a"],"state_sha256":"a66e14937286eaffd080b95c1c64f16e299d06f1cad77f7a4ab55b1c301e4888"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hNUMnvzx9Lj2W7jLcsEvt7modoSc1x8DgHjJVJd7NponUb4dvfPlrjXofGAWccQ6jekw07NCibxykP/lLnogCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:33:36.927377Z","bundle_sha256":"b8f5c8773a54af042d53b972b983eafeb826ebd59e51b12c4d78ff2a629a1cb2"}}