{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YDKBLIBBHJDYLXPMG6LQCGHPKB","short_pith_number":"pith:YDKBLIBB","schema_version":"1.0","canonical_sha256":"c0d415a0213a4785ddec37970118ef5063d062079601064418d4a21625353371","source":{"kind":"arxiv","id":"1905.09137","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.09137","created_at":"2026-05-17T23:45:21.894538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.09137v1","created_at":"2026-05-17T23:45:21.894538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09137","created_at":"2026-05-17T23:45:21.894538+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDKBLIBBHJDY","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDKBLIBBHJDYLXPM","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDKBLIBB","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB","json":"https://pith.science/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB.json","graph_json":"https://pith.science/api/pith-number/YDKBLIBBHJDYLXPMG6LQCGHPKB/graph.json","events_json":"https://pith.science/api/pith-number/YDKBLIBBHJDYLXPMG6LQCGHPKB/events.json","paper":"https://pith.science/paper/YDKBLIBB"},"agent_actions":{"view_html":"https://pith.science/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB","download_json":"https://pith.science/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB.json","view_paper":"https://pith.science/paper/YDKBLIBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.09137&json=true","fetch_graph":"https://pith.science/api/pith-number/YDKBLIBBHJDYLXPMG6LQCGHPKB/graph.json","fetch_events":"https://pith.science/api/pith-number/YDKBLIBBHJDYLXPMG6LQCGHPKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB/action/storage_attestation","attest_author":"https://pith.science/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB/action/author_attestation","sign_citation":"https://pith.science/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB/action/citation_signature","submit_replication":"https://pith.science/pith/YDKBLIBBHJDYLXPMG6LQCGHPKB/action/replication_record"}},"created_at":"2026-05-17T23:45:21.894538+00:00","updated_at":"2026-05-17T23:45:21.894538+00:00"}