{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7I2XPU4GHJWDCTXBWLNXDOXGEX","short_pith_number":"pith:7I2XPU4G","canonical_record":{"source":{"id":"1706.02136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-06-07T11:23:58Z","cross_cats_sorted":[],"title_canon_sha256":"0baba8d6ba8cb31f5af2d024c0c70375a0f7306af72d680681b45446f254d6bb","abstract_canon_sha256":"1a84a854aecac588bf69303c348451b73b996906305386a10c7206119c483eb4"},"schema_version":"1.0"},"canonical_sha256":"fa3577d3863a6c314ee1b2db71bae625e1fa5175d71ed34db46063bf6a8eb8e3","source":{"kind":"arxiv","id":"1706.02136","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02136","created_at":"2026-05-18T00:25:29Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02136v2","created_at":"2026-05-18T00:25:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02136","created_at":"2026-05-18T00:25:29Z"},{"alias_kind":"pith_short_12","alias_value":"7I2XPU4GHJWD","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7I2XPU4GHJWDCTXB","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7I2XPU4G","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7I2XPU4GHJWDCTXBWLNXDOXGEX","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-06-07T11:23:58Z","cross_cats_sorted":[],"title_canon_sha256":"0baba8d6ba8cb31f5af2d024c0c70375a0f7306af72d680681b45446f254d6bb","abstract_canon_sha256":"1a84a854aecac588bf69303c348451b73b996906305386a10c7206119c483eb4"},"schema_version":"1.0"},"canonical_sha256":"fa3577d3863a6c314ee1b2db71bae625e1fa5175d71ed34db46063bf6a8eb8e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:29.025363Z","signature_b64":"UP1qro+YctIdQ5gcaN7tp4OPvytgM9NuZEj2kbIT/Xv84d5I4XLoeHKZoxMKAE2/vLcOVcTP60Ik3gvn66A/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa3577d3863a6c314ee1b2db71bae625e1fa5175d71ed34db46063bf6a8eb8e3","last_reissued_at":"2026-05-18T00:25:29.024721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:29.024721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02136","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-18T00:25:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UIRHfh/iBQQF+db8esdyjxcTS1cveMpo2wuSDrzfIPNAKi4LirsNsAyG5beIl+8kb86BTozQP8hEvQFSAAH1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:18:13.921941Z"},"content_sha256":"a2111f4f90e7eb80eedda664310912cbb82b47cf61deea935e42c761578a550e","schema_version":"1.0","event_id":"sha256:a2111f4f90e7eb80eedda664310912cbb82b47cf61deea935e42c761578a550e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7I2XPU4GHJWDCTXBWLNXDOXGEX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counterexample-Guided k-Induction Verification for Fast Bug Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Denis A. Nicole, Lucas C. Cordeiro, Mikhail Y. R. Gadelha","submitted_at":"2017-06-07T11:23:58Z","abstract_excerpt":"Recently, the k-induction algorithm has proven to be a successful approach for both finding bugs and proving correctness. However, since the algorithm is an incremental approach, it might waste resources trying to prove incorrect programs. In this paper, we propose to extend the k-induction algorithm in order to shorten the number of steps required to find a property violation. We convert the algorithm into a meet-in-the-middle bidirectional search algorithm, using the counterexample produced from over-approximating the program. The preliminary results show that the number of steps required to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02136","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-18T00:25:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rA1+r1pFmbbnWKyn6sbRiqgZxIxIq0Fgm303CkKDH3J5ITbIlztrXZk/unXD9nKL2pXkWTsZ9jpoHgg0mNDnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:18:13.922304Z"},"content_sha256":"eb215ea55294c1fd422a5876f5482523d49fd67a238cd8a9fd6e23562de038ad","schema_version":"1.0","event_id":"sha256:eb215ea55294c1fd422a5876f5482523d49fd67a238cd8a9fd6e23562de038ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7I2XPU4GHJWDCTXBWLNXDOXGEX/bundle.json","state_url":"https://pith.science/pith/7I2XPU4GHJWDCTXBWLNXDOXGEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7I2XPU4GHJWDCTXBWLNXDOXGEX/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-27T10:18:13Z","links":{"resolver":"https://pith.science/pith/7I2XPU4GHJWDCTXBWLNXDOXGEX","bundle":"https://pith.science/pith/7I2XPU4GHJWDCTXBWLNXDOXGEX/bundle.json","state":"https://pith.science/pith/7I2XPU4GHJWDCTXBWLNXDOXGEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7I2XPU4GHJWDCTXBWLNXDOXGEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7I2XPU4GHJWDCTXBWLNXDOXGEX","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":"1a84a854aecac588bf69303c348451b73b996906305386a10c7206119c483eb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-06-07T11:23:58Z","title_canon_sha256":"0baba8d6ba8cb31f5af2d024c0c70375a0f7306af72d680681b45446f254d6bb"},"schema_version":"1.0","source":{"id":"1706.02136","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02136","created_at":"2026-05-18T00:25:29Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02136v2","created_at":"2026-05-18T00:25:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02136","created_at":"2026-05-18T00:25:29Z"},{"alias_kind":"pith_short_12","alias_value":"7I2XPU4GHJWD","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7I2XPU4GHJWDCTXB","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7I2XPU4G","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:eb215ea55294c1fd422a5876f5482523d49fd67a238cd8a9fd6e23562de038ad","target":"graph","created_at":"2026-05-18T00:25:29Z","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":"Recently, the k-induction algorithm has proven to be a successful approach for both finding bugs and proving correctness. However, since the algorithm is an incremental approach, it might waste resources trying to prove incorrect programs. In this paper, we propose to extend the k-induction algorithm in order to shorten the number of steps required to find a property violation. We convert the algorithm into a meet-in-the-middle bidirectional search algorithm, using the counterexample produced from over-approximating the program. The preliminary results show that the number of steps required to","authors_text":"Denis A. Nicole, Lucas C. Cordeiro, Mikhail Y. R. Gadelha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-06-07T11:23:58Z","title":"Counterexample-Guided k-Induction Verification for Fast Bug Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02136","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:a2111f4f90e7eb80eedda664310912cbb82b47cf61deea935e42c761578a550e","target":"record","created_at":"2026-05-18T00:25:29Z","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":"1a84a854aecac588bf69303c348451b73b996906305386a10c7206119c483eb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-06-07T11:23:58Z","title_canon_sha256":"0baba8d6ba8cb31f5af2d024c0c70375a0f7306af72d680681b45446f254d6bb"},"schema_version":"1.0","source":{"id":"1706.02136","kind":"arxiv","version":2}},"canonical_sha256":"fa3577d3863a6c314ee1b2db71bae625e1fa5175d71ed34db46063bf6a8eb8e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa3577d3863a6c314ee1b2db71bae625e1fa5175d71ed34db46063bf6a8eb8e3","first_computed_at":"2026-05-18T00:25:29.024721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:29.024721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UP1qro+YctIdQ5gcaN7tp4OPvytgM9NuZEj2kbIT/Xv84d5I4XLoeHKZoxMKAE2/vLcOVcTP60Ik3gvn66A/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:29.025363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02136","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2111f4f90e7eb80eedda664310912cbb82b47cf61deea935e42c761578a550e","sha256:eb215ea55294c1fd422a5876f5482523d49fd67a238cd8a9fd6e23562de038ad"],"state_sha256":"a845ea51b6d51b898d3df0aa983c576511dbc452ffe6f875e5434cfba276bb04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDmP+AaCn7xEzvqxs0id2sH01dvsg6FB1up31m5Tfu0e3BziQZEJnElrq1gvhOsckZuWIatOtMV9Kez7JX3AAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T10:18:13.924167Z","bundle_sha256":"d21d894d82b11d291bcc9e8c0138438379d4a70944428210ae7c9ebb1c6c8089"}}