{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RHF34EYFUZ3KF265KNMZQYW3WG","short_pith_number":"pith:RHF34EYF","canonical_record":{"source":{"id":"1608.05368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-08-17T17:35:49Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"64d312772265432444242917157cc64fc4aebbefd209d3ce8121d577f941fd62","abstract_canon_sha256":"3816e0584849f59d0a53f8fe0a6c90e096d6f2df4091abbfc8b9e4177242cb88"},"schema_version":"1.0"},"canonical_sha256":"89cbbe1305a676a2ebdd53599862dbb1b71d295753b633e96859844197b7e303","source":{"kind":"arxiv","id":"1608.05368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05368","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05368v1","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05368","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"RHF34EYFUZ3K","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RHF34EYFUZ3KF265","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RHF34EYF","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RHF34EYFUZ3KF265KNMZQYW3WG","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-08-17T17:35:49Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"64d312772265432444242917157cc64fc4aebbefd209d3ce8121d577f941fd62","abstract_canon_sha256":"3816e0584849f59d0a53f8fe0a6c90e096d6f2df4091abbfc8b9e4177242cb88"},"schema_version":"1.0"},"canonical_sha256":"89cbbe1305a676a2ebdd53599862dbb1b71d295753b633e96859844197b7e303","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:28.380676Z","signature_b64":"An0yReL9/orJWeTA5VfNmKrzxguboZtX+yWKjq7vXs4WlaHeKlFJKNYPw7xHc0E6vddzsE5h6x+DgyrOjGm/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89cbbe1305a676a2ebdd53599862dbb1b71d295753b633e96859844197b7e303","last_reissued_at":"2026-05-18T01:08:28.380280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:28.380280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05368","source_version":1,"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:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Md5UuXqXy/x96zbzLO0kMKlClGcvYwzaUHZvNy6jXvUNoGxc4GPThxjy+s7w3t+UuLzBQFaTOdvc0M7TXXPFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:16:57.361638Z"},"content_sha256":"abe150417343863c3269ecd956552103ddbd40d1c34db66181b9250746a1871e","schema_version":"1.0","event_id":"sha256:abe150417343863c3269ecd956552103ddbd40d1c34db66181b9250746a1871e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RHF34EYFUZ3KF265KNMZQYW3WG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Bounded Model Checking By Transforming Programs With Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Advaita Datar, Anushri Jana, C Niyas, R Venkatesh, Uday P. Khedker","submitted_at":"2016-08-17T17:35:49Z","abstract_excerpt":"Bounded Model Checking is one the most successful techniques for finding bugs in program. However, for programs with loops iterating over large-sized arrays, bounded model checkers often exceed the limit of resources available to them. We present a transformation that enables bounded model checkers to verify a certain class of array properties. Our technique transforms an array-manipulating program in ANSI-C to an array-free and loop-free program. The transformed program can efficiently be verified by an off-the-shelf bounded model checker. Though the transformed program is, in general, an abs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05368","kind":"arxiv","version":1},"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:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"azXcoRZr/ZHKAf0jFU3LIo5RNzlzTJK089L+9mdq7RFKYlFJ4fYBUtqtNWw8IvpA8xaS/T6UPRVpihRhXdmvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:16:57.361989Z"},"content_sha256":"52be29f242ce65b22dd7586f7dccdb517ee96e8449f611c54380711ce6dfa235","schema_version":"1.0","event_id":"sha256:52be29f242ce65b22dd7586f7dccdb517ee96e8449f611c54380711ce6dfa235"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RHF34EYFUZ3KF265KNMZQYW3WG/bundle.json","state_url":"https://pith.science/pith/RHF34EYFUZ3KF265KNMZQYW3WG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RHF34EYFUZ3KF265KNMZQYW3WG/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-11T12:16:57Z","links":{"resolver":"https://pith.science/pith/RHF34EYFUZ3KF265KNMZQYW3WG","bundle":"https://pith.science/pith/RHF34EYFUZ3KF265KNMZQYW3WG/bundle.json","state":"https://pith.science/pith/RHF34EYFUZ3KF265KNMZQYW3WG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RHF34EYFUZ3KF265KNMZQYW3WG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RHF34EYFUZ3KF265KNMZQYW3WG","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":"3816e0584849f59d0a53f8fe0a6c90e096d6f2df4091abbfc8b9e4177242cb88","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-08-17T17:35:49Z","title_canon_sha256":"64d312772265432444242917157cc64fc4aebbefd209d3ce8121d577f941fd62"},"schema_version":"1.0","source":{"id":"1608.05368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05368","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05368v1","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05368","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"RHF34EYFUZ3K","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RHF34EYFUZ3KF265","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RHF34EYF","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:52be29f242ce65b22dd7586f7dccdb517ee96e8449f611c54380711ce6dfa235","target":"graph","created_at":"2026-05-18T01:08:28Z","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":"Bounded Model Checking is one the most successful techniques for finding bugs in program. However, for programs with loops iterating over large-sized arrays, bounded model checkers often exceed the limit of resources available to them. We present a transformation that enables bounded model checkers to verify a certain class of array properties. Our technique transforms an array-manipulating program in ANSI-C to an array-free and loop-free program. The transformed program can efficiently be verified by an off-the-shelf bounded model checker. Though the transformed program is, in general, an abs","authors_text":"Advaita Datar, Anushri Jana, C Niyas, R Venkatesh, Uday P. Khedker","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-08-17T17:35:49Z","title":"Scaling Bounded Model Checking By Transforming Programs With Arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05368","kind":"arxiv","version":1},"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:abe150417343863c3269ecd956552103ddbd40d1c34db66181b9250746a1871e","target":"record","created_at":"2026-05-18T01:08:28Z","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":"3816e0584849f59d0a53f8fe0a6c90e096d6f2df4091abbfc8b9e4177242cb88","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-08-17T17:35:49Z","title_canon_sha256":"64d312772265432444242917157cc64fc4aebbefd209d3ce8121d577f941fd62"},"schema_version":"1.0","source":{"id":"1608.05368","kind":"arxiv","version":1}},"canonical_sha256":"89cbbe1305a676a2ebdd53599862dbb1b71d295753b633e96859844197b7e303","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89cbbe1305a676a2ebdd53599862dbb1b71d295753b633e96859844197b7e303","first_computed_at":"2026-05-18T01:08:28.380280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:28.380280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"An0yReL9/orJWeTA5VfNmKrzxguboZtX+yWKjq7vXs4WlaHeKlFJKNYPw7xHc0E6vddzsE5h6x+DgyrOjGm/BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:28.380676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abe150417343863c3269ecd956552103ddbd40d1c34db66181b9250746a1871e","sha256:52be29f242ce65b22dd7586f7dccdb517ee96e8449f611c54380711ce6dfa235"],"state_sha256":"3eb6fcb0c70e05e2e0faa1ffcdba27340ab27b7ba8ea41a73ccc81d832849996"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BVnC2wCAg5OgtWmL6eLpKrN9dBGZroHkceGAH5nNuoSx0n8kDOgpqwbro/jSu9cWNvDDNrGW84GE74yMzQlJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:16:57.363919Z","bundle_sha256":"3615acfb7455536cfa457f4d9b1823c78c90ececaac9baa9f69d9a29868919ec"}}