{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7RVY5QXY6LN5PXUDVD646MH2QC","short_pith_number":"pith:7RVY5QXY","canonical_record":{"source":{"id":"1707.03555","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SE","submitted_at":"2017-07-12T06:06:34Z","cross_cats_sorted":["cs.LO","cs.PL"],"title_canon_sha256":"df782824b3ea700fa5bddfc04d5f9e15b2785392982777e0ac8a35b7527eba89","abstract_canon_sha256":"e889a83887fbeddf86c23d4f429ad1bb0adf5a7970d725b552506708af6a5555"},"schema_version":"1.0"},"canonical_sha256":"fc6b8ec2f8f2dbd7de83a8fdcf30fa8093e72bd951a6aa1c836edf1f5369db1e","source":{"kind":"arxiv","id":"1707.03555","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03555","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03555v2","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03555","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"pith_short_12","alias_value":"7RVY5QXY6LN5","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7RVY5QXY6LN5PXUD","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7RVY5QXY","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7RVY5QXY6LN5PXUDVD646MH2QC","target":"record","payload":{"canonical_record":{"source":{"id":"1707.03555","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SE","submitted_at":"2017-07-12T06:06:34Z","cross_cats_sorted":["cs.LO","cs.PL"],"title_canon_sha256":"df782824b3ea700fa5bddfc04d5f9e15b2785392982777e0ac8a35b7527eba89","abstract_canon_sha256":"e889a83887fbeddf86c23d4f429ad1bb0adf5a7970d725b552506708af6a5555"},"schema_version":"1.0"},"canonical_sha256":"fc6b8ec2f8f2dbd7de83a8fdcf30fa8093e72bd951a6aa1c836edf1f5369db1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:43.397455Z","signature_b64":"pKZVZGtqQoEMK1G+SWcYBe7GLpT324+x7lUUmE3rbaqCzHNuqZ6saURZx3//mTadm48cyb2Pd+x3rnxvfOWTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc6b8ec2f8f2dbd7de83a8fdcf30fa8093e72bd951a6aa1c836edf1f5369db1e","last_reissued_at":"2026-05-18T00:33:43.396782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:43.396782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.03555","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:33:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4tCHB+fm0EKCzqkkrTpe+aZnsgbB68sCAVKRe0XOYlcSUMSG63St/h45A0qlQK5Deod1IRvx31bWDkr92vrVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:46:39.634756Z"},"content_sha256":"252a84fc11530c0b7607accb026a10150233006d18adda7ce7561097f9a4fd04","schema_version":"1.0","event_id":"sha256:252a84fc11530c0b7607accb026a10150233006d18adda7ce7561097f9a4fd04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7RVY5QXY6LN5PXUDVD646MH2QC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verifying Array Manipulating Programs by Tiling","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LO","cs.PL"],"primary_cat":"cs.SE","authors_text":"Ashutosh Gupta, Divyesh Unadkat, Supratik Chakraborty","submitted_at":"2017-07-12T06:06:34Z","abstract_excerpt":"Formally verifying properties of programs that manipulate arrays in loops is computationally challenging. In this paper, we focus on a useful class of such programs, and present a novel property-driven verification method that first infers array access patterns in loops using simple heuristics, and then uses this information to compositionally prove universally quantified assertions about arrays. Specifically, we identify tiles of array accesses patterns in a loop, and use the tiling information to reduce the problem of checking a quantified assertion at the end of a loop to an inductive argum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03555","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:33:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BmCrL65abyR61cPeqUQstP8JhDyJCunB0YmWpQ8TqI26a+ssnMdfekqBF4oP1HO3Ixx6WQdvt5LB8HI+xa95Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:46:39.635105Z"},"content_sha256":"951417d8b07991f52288927a382a0595fd40e46107e3e4409007b7f0ace8a0f0","schema_version":"1.0","event_id":"sha256:951417d8b07991f52288927a382a0595fd40e46107e3e4409007b7f0ace8a0f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RVY5QXY6LN5PXUDVD646MH2QC/bundle.json","state_url":"https://pith.science/pith/7RVY5QXY6LN5PXUDVD646MH2QC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RVY5QXY6LN5PXUDVD646MH2QC/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-22T11:46:39Z","links":{"resolver":"https://pith.science/pith/7RVY5QXY6LN5PXUDVD646MH2QC","bundle":"https://pith.science/pith/7RVY5QXY6LN5PXUDVD646MH2QC/bundle.json","state":"https://pith.science/pith/7RVY5QXY6LN5PXUDVD646MH2QC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RVY5QXY6LN5PXUDVD646MH2QC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7RVY5QXY6LN5PXUDVD646MH2QC","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":"e889a83887fbeddf86c23d4f429ad1bb0adf5a7970d725b552506708af6a5555","cross_cats_sorted":["cs.LO","cs.PL"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SE","submitted_at":"2017-07-12T06:06:34Z","title_canon_sha256":"df782824b3ea700fa5bddfc04d5f9e15b2785392982777e0ac8a35b7527eba89"},"schema_version":"1.0","source":{"id":"1707.03555","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03555","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03555v2","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03555","created_at":"2026-05-18T00:33:43Z"},{"alias_kind":"pith_short_12","alias_value":"7RVY5QXY6LN5","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7RVY5QXY6LN5PXUD","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7RVY5QXY","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:951417d8b07991f52288927a382a0595fd40e46107e3e4409007b7f0ace8a0f0","target":"graph","created_at":"2026-05-18T00:33:43Z","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":"Formally verifying properties of programs that manipulate arrays in loops is computationally challenging. In this paper, we focus on a useful class of such programs, and present a novel property-driven verification method that first infers array access patterns in loops using simple heuristics, and then uses this information to compositionally prove universally quantified assertions about arrays. Specifically, we identify tiles of array accesses patterns in a loop, and use the tiling information to reduce the problem of checking a quantified assertion at the end of a loop to an inductive argum","authors_text":"Ashutosh Gupta, Divyesh Unadkat, Supratik Chakraborty","cross_cats":["cs.LO","cs.PL"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SE","submitted_at":"2017-07-12T06:06:34Z","title":"Verifying Array Manipulating Programs by Tiling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03555","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:252a84fc11530c0b7607accb026a10150233006d18adda7ce7561097f9a4fd04","target":"record","created_at":"2026-05-18T00:33:43Z","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":"e889a83887fbeddf86c23d4f429ad1bb0adf5a7970d725b552506708af6a5555","cross_cats_sorted":["cs.LO","cs.PL"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SE","submitted_at":"2017-07-12T06:06:34Z","title_canon_sha256":"df782824b3ea700fa5bddfc04d5f9e15b2785392982777e0ac8a35b7527eba89"},"schema_version":"1.0","source":{"id":"1707.03555","kind":"arxiv","version":2}},"canonical_sha256":"fc6b8ec2f8f2dbd7de83a8fdcf30fa8093e72bd951a6aa1c836edf1f5369db1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc6b8ec2f8f2dbd7de83a8fdcf30fa8093e72bd951a6aa1c836edf1f5369db1e","first_computed_at":"2026-05-18T00:33:43.396782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:43.396782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pKZVZGtqQoEMK1G+SWcYBe7GLpT324+x7lUUmE3rbaqCzHNuqZ6saURZx3//mTadm48cyb2Pd+x3rnxvfOWTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:43.397455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.03555","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:252a84fc11530c0b7607accb026a10150233006d18adda7ce7561097f9a4fd04","sha256:951417d8b07991f52288927a382a0595fd40e46107e3e4409007b7f0ace8a0f0"],"state_sha256":"013a5a6ef1d5eb05e134693bb9764c1148bf10d2643cad3d948922a9908975b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oU6odB2gRJyyNSffJDrG4pcdRmpAxkpRLkx0YtItsNbD1vtsmKmsBmSXlTsXvezd5vTb7233gI3rv9Mex4lwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:46:39.637150Z","bundle_sha256":"afc8fe4de0d5ebfaa8528958927a72120204121a06703b945f111af6eff8bf24"}}