{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YDKBLIBBHJDYLXPMG6LQCGHPKB","short_pith_number":"pith:YDKBLIBB","canonical_record":{"source":{"id":"1905.09137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-22T13:43:28Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"c743afefdc4adba91f1dd5815a6709c4b193ccf7f538a599e41f4326f3c77ebb","abstract_canon_sha256":"557bc9905d2724280be9e6e3de41fa8209b17cdc3143bcd2137630c2b012f42c"},"schema_version":"1.0"},"canonical_sha256":"c0d415a0213a4785ddec37970118ef5063d062079601064418d4a21625353371","source":{"kind":"arxiv","id":"1905.09137","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09137","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09137v1","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09137","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"YDKBLIBBHJDY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YDKBLIBBHJDYLXPM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YDKBLIBB","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YDKBLIBBHJDYLXPMG6LQCGHPKB","target":"record","payload":{"canonical_record":{"source":{"id":"1905.09137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-22T13:43:28Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"c743afefdc4adba91f1dd5815a6709c4b193ccf7f538a599e41f4326f3c77ebb","abstract_canon_sha256":"557bc9905d2724280be9e6e3de41fa8209b17cdc3143bcd2137630c2b012f42c"},"schema_version":"1.0"},"canonical_sha256":"c0d415a0213a4785ddec37970118ef5063d062079601064418d4a21625353371","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:21.894983Z","signature_b64":"4cMQVbsashXictoseiyit2AMUkuFxWOuEbXLfQ+uqrR0zHKAiBQ3dADEhMjpq+8NnJeEctPa1qNW3pwcfZUXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0d415a0213a4785ddec37970118ef5063d062079601064418d4a21625353371","last_reissued_at":"2026-05-17T23:45:21.894449Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:21.894449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.09137","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-17T23:45:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QFpwAV6e9tcyJbVSD0obIYhyx6b+UfXHt9QpCR5D/eeBflmNtiXZXWiWj9Do7er6GJB7qniUEUZCUZjjg/BUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:41:04.727423Z"},"content_sha256":"86417ca71c665c794514e835a61a848228ef7ae659384606ee05be5ef6b1303b","schema_version":"1.0","event_id":"sha256:86417ca71c665c794514e835a61a848228ef7ae659384606ee05be5ef6b1303b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YDKBLIBBHJDYLXPMG6LQCGHPKB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Quick Introduction to Functional Verification of Array-Intensive Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Chandan Karfa, Kunal Banerjee","submitted_at":"2019-05-22T13:43:28Z","abstract_excerpt":"Array-intensive programs are often amenable to parallelization across many cores on a single machine as well as scaling across multiple machines and hence are well explored, especially in the domain of high-performance computing. These programs typically undergo loop transformations and arithmetic transformations in addition to parallelizing transformations. Although a lot of effort has been invested in improving parallelizing compilers, experienced programmers still resort to hand-optimized transformations which is typically followed by careful tuning of the transformed program to finally obt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09137","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-17T23:45:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fBeST7kH5V85OGQNFqFpFLsJ4MSFApuqmD3X2bkvfzeuwe7c1mEeAxICDkHIwWPMQGlpmpsKfwZNWcmnMd+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:41:04.727774Z"},"content_sha256":"c4774e59c490d02e0e1b14a2ecb5dd4ad5c018b6504aeb7384c06b9c11d0cbbe","schema_version":"1.0","event_id":"sha256:c4774e59c490d02e0e1b14a2ecb5dd4ad5c018b6504aeb7384c06b9c11d0cbbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB/bundle.json","state_url":"https://pith.science/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB/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-07-09T05:41:04Z","links":{"resolver":"https://pith.science/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB","bundle":"https://pith.science/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB/bundle.json","state":"https://pith.science/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YDKBLIBBHJDYLXPMG6LQCGHPKB","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":"557bc9905d2724280be9e6e3de41fa8209b17cdc3143bcd2137630c2b012f42c","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-22T13:43:28Z","title_canon_sha256":"c743afefdc4adba91f1dd5815a6709c4b193ccf7f538a599e41f4326f3c77ebb"},"schema_version":"1.0","source":{"id":"1905.09137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09137","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09137v1","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09137","created_at":"2026-05-17T23:45:21Z"},{"alias_kind":"pith_short_12","alias_value":"YDKBLIBBHJDY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YDKBLIBBHJDYLXPM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YDKBLIBB","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:c4774e59c490d02e0e1b14a2ecb5dd4ad5c018b6504aeb7384c06b9c11d0cbbe","target":"graph","created_at":"2026-05-17T23:45:21Z","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":"Array-intensive programs are often amenable to parallelization across many cores on a single machine as well as scaling across multiple machines and hence are well explored, especially in the domain of high-performance computing. These programs typically undergo loop transformations and arithmetic transformations in addition to parallelizing transformations. Although a lot of effort has been invested in improving parallelizing compilers, experienced programmers still resort to hand-optimized transformations which is typically followed by careful tuning of the transformed program to finally obt","authors_text":"Chandan Karfa, Kunal Banerjee","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-22T13:43:28Z","title":"A Quick Introduction to Functional Verification of Array-Intensive Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09137","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:86417ca71c665c794514e835a61a848228ef7ae659384606ee05be5ef6b1303b","target":"record","created_at":"2026-05-17T23:45:21Z","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":"557bc9905d2724280be9e6e3de41fa8209b17cdc3143bcd2137630c2b012f42c","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-22T13:43:28Z","title_canon_sha256":"c743afefdc4adba91f1dd5815a6709c4b193ccf7f538a599e41f4326f3c77ebb"},"schema_version":"1.0","source":{"id":"1905.09137","kind":"arxiv","version":1}},"canonical_sha256":"c0d415a0213a4785ddec37970118ef5063d062079601064418d4a21625353371","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0d415a0213a4785ddec37970118ef5063d062079601064418d4a21625353371","first_computed_at":"2026-05-17T23:45:21.894449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:21.894449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4cMQVbsashXictoseiyit2AMUkuFxWOuEbXLfQ+uqrR0zHKAiBQ3dADEhMjpq+8NnJeEctPa1qNW3pwcfZUXAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:21.894983Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86417ca71c665c794514e835a61a848228ef7ae659384606ee05be5ef6b1303b","sha256:c4774e59c490d02e0e1b14a2ecb5dd4ad5c018b6504aeb7384c06b9c11d0cbbe"],"state_sha256":"31030f2552f67a6bb9ad4563ad6a3a24eff347600fe4b7ae1c70a94eb19be0e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxACPX1+EG8xhRpqndqMLsc2SwmvNl39G9OF1ialMXeJsbN/z88uRu1qSdbjmKRUO66sn4faUjHk2nuDVY86Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T05:41:04.730213Z","bundle_sha256":"f140b3212385fbd2393b328a32893959a8153ce0ddcdaa880fffcc31f1998d70"}}