{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7RZUTTNJUEIQIRPN7VOFWJAQJI","short_pith_number":"pith:7RZUTTNJ","schema_version":"1.0","canonical_sha256":"fc7349cda9a1110445edfd5c5b24104a22cab9b23e3f2eac5c401004cc537de6","source":{"kind":"arxiv","id":"2506.23058","version":1},"attestation_state":"computed","paper":{"title":"Verifying Properties of Index Arrays in a Purely-Functional Data-Parallel Language","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Cosmin E. Oancea, Nikolaj Hey Hinnerskov, Robert Schenck","submitted_at":"2025-06-29T02:10:25Z","abstract_excerpt":"This paper presents a novel approach to automatically verify properties of pure data-parallel programs with non-linear indexing -- expressed as pre- and post-conditions on functions. Programs consist of nests of second-order array combinators (e.g., map, scan, and scatter) and loops. The key idea is to represent arrays as index functions: programs are index function transformations over which properties are propagated and inferred. Our framework proves properties on index functions by distilling them into algebraic (in)equalities and discharging them to a Fourier-Motzkin-based solver. The fram"},"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":"2506.23058","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2025-06-29T02:10:25Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"4ddbff87c240884b79fd3bd516b8178e0a6cf1f3164eead9cef4de8e219b0024","abstract_canon_sha256":"81d739ca4ed5317da378fc9075e4dfb11c5150914852ba8ae4ca4d1528ec4d37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:49.975607Z","signature_b64":"p8kAGUMXLkcgE7cNuQm8zqNV9nOT2eBx/lJnkcYeSV8OmqHe7RjVI5T3XdPTne2IZW8dBvSSYqLNum3UR7mpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc7349cda9a1110445edfd5c5b24104a22cab9b23e3f2eac5c401004cc537de6","last_reissued_at":"2026-07-05T11:28:49.974842Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:49.974842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verifying Properties of Index Arrays in a Purely-Functional Data-Parallel Language","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Cosmin E. Oancea, Nikolaj Hey Hinnerskov, Robert Schenck","submitted_at":"2025-06-29T02:10:25Z","abstract_excerpt":"This paper presents a novel approach to automatically verify properties of pure data-parallel programs with non-linear indexing -- expressed as pre- and post-conditions on functions. Programs consist of nests of second-order array combinators (e.g., map, scan, and scatter) and loops. The key idea is to represent arrays as index functions: programs are index function transformations over which properties are propagated and inferred. Our framework proves properties on index functions by distilling them into algebraic (in)equalities and discharging them to a Fourier-Motzkin-based solver. The fram"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23058","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.23058/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.23058","created_at":"2026-07-05T11:28:49.974948+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.23058v1","created_at":"2026-07-05T11:28:49.974948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23058","created_at":"2026-07-05T11:28:49.974948+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RZUTTNJUEIQ","created_at":"2026-07-05T11:28:49.974948+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RZUTTNJUEIQIRPN","created_at":"2026-07-05T11:28:49.974948+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RZUTTNJ","created_at":"2026-07-05T11:28:49.974948+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/7RZUTTNJUEIQIRPN7VOFWJAQJI","json":"https://pith.science/pith/7RZUTTNJUEIQIRPN7VOFWJAQJI.json","graph_json":"https://pith.science/api/pith-number/7RZUTTNJUEIQIRPN7VOFWJAQJI/graph.json","events_json":"https://pith.science/api/pith-number/7RZUTTNJUEIQIRPN7VOFWJAQJI/events.json","paper":"https://pith.science/paper/7RZUTTNJ"},"agent_actions":{"view_html":"https://pith.science/pith/7RZUTTNJUEIQIRPN7VOFWJAQJI","download_json":"https://pith.science/pith/7RZUTTNJUEIQIRPN7VOFWJAQJI.json","view_paper":"https://pith.science/paper/7RZUTTNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.23058&json=true","fetch_graph":"https://pith.science/api/pith-number/7RZUTTNJUEIQIRPN7VOFWJAQJI/graph.json","fetch_events":"https://pith.science/api/pith-number/7RZUTTNJUEIQIRPN7VOFWJAQJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RZUTTNJUEIQIRPN7VOFWJAQJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RZUTTNJUEIQIRPN7VOFWJAQJI/action/storage_attestation","attest_author":"https://pith.science/pith/7RZUTTNJUEIQIRPN7VOFWJAQJI/action/author_attestation","sign_citation":"https://pith.science/pith/7RZUTTNJUEIQIRPN7VOFWJAQJI/action/citation_signature","submit_replication":"https://pith.science/pith/7RZUTTNJUEIQIRPN7VOFWJAQJI/action/replication_record"}},"created_at":"2026-07-05T11:28:49.974948+00:00","updated_at":"2026-07-05T11:28:49.974948+00:00"}