{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ARWX4LZ7J35GQRNBNSINEHA2JC","short_pith_number":"pith:ARWX4LZ7","schema_version":"1.0","canonical_sha256":"046d7e2f3f4efa6845a16c90d21c1a48bc3d31c2beca4320b308d25476b0d7cd","source":{"kind":"arxiv","id":"2505.08906","version":1},"attestation_state":"computed","paper":{"title":"Comparing Parallel Functional Array Languages: Programming and Performance","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DC","cs.PF"],"primary_cat":"cs.PL","authors_text":"Aaron W. Hsu, Alexandros Nikolaos Ziogas, Artjoms Sinkarovs, Clemens Grelck, Cosmin Oancea, David van Balen, Gabriele K. Keller, Ivo Gabe de Wolff, Phil Trinder, Sven-Bodo Scholz, Thomas Koopman, Tiziano De Matteis, Tom Smeding, Trevor L. McDonell, Troels Henriksen","submitted_at":"2025-05-13T18:54:36Z","abstract_excerpt":"Parallel functional array languages are an emerging class of programming languages that promise to combine low-effort parallel programming with good performance and performance portability. We systematically compare the designs and implementations of five different functional array languages: Accelerate, APL, DaCe, Futhark, and SaC. We demonstrate the expressiveness of functional array programming by means of four challenging benchmarks, namely N-body simulation, MultiGrid, Quickhull, and Flash Attention. These benchmarks represent a range of application domains and parallel computational mode"},"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":"2505.08906","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2025-05-13T18:54:36Z","cross_cats_sorted":["cs.DC","cs.PF"],"title_canon_sha256":"b00e1f4aafa62f172dec9a11b1d3df68be82dca2ed154569bfeeadd75b02093f","abstract_canon_sha256":"376e8138cd323f384be63c39cd8ad52aaf1345ffa27cf629409f0eefc8bc8cd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:47.022703Z","signature_b64":"N12rG506z4oluW2uNuKQLwIJ0F2KQFdmak1hQbtE6oUlzxCH01NlydhpB+O70bywYPfxOrr9iy4rqMjGqmGHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"046d7e2f3f4efa6845a16c90d21c1a48bc3d31c2beca4320b308d25476b0d7cd","last_reissued_at":"2026-07-05T11:02:47.022215Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:47.022215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparing Parallel Functional Array Languages: Programming and Performance","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DC","cs.PF"],"primary_cat":"cs.PL","authors_text":"Aaron W. Hsu, Alexandros Nikolaos Ziogas, Artjoms Sinkarovs, Clemens Grelck, Cosmin Oancea, David van Balen, Gabriele K. Keller, Ivo Gabe de Wolff, Phil Trinder, Sven-Bodo Scholz, Thomas Koopman, Tiziano De Matteis, Tom Smeding, Trevor L. McDonell, Troels Henriksen","submitted_at":"2025-05-13T18:54:36Z","abstract_excerpt":"Parallel functional array languages are an emerging class of programming languages that promise to combine low-effort parallel programming with good performance and performance portability. We systematically compare the designs and implementations of five different functional array languages: Accelerate, APL, DaCe, Futhark, and SaC. We demonstrate the expressiveness of functional array programming by means of four challenging benchmarks, namely N-body simulation, MultiGrid, Quickhull, and Flash Attention. These benchmarks represent a range of application domains and parallel computational mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08906","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/2505.08906/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":"2505.08906","created_at":"2026-07-05T11:02:47.022281+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.08906v1","created_at":"2026-07-05T11:02:47.022281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08906","created_at":"2026-07-05T11:02:47.022281+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARWX4LZ7J35G","created_at":"2026-07-05T11:02:47.022281+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARWX4LZ7J35GQRNB","created_at":"2026-07-05T11:02:47.022281+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARWX4LZ7","created_at":"2026-07-05T11:02:47.022281+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/ARWX4LZ7J35GQRNBNSINEHA2JC","json":"https://pith.science/pith/ARWX4LZ7J35GQRNBNSINEHA2JC.json","graph_json":"https://pith.science/api/pith-number/ARWX4LZ7J35GQRNBNSINEHA2JC/graph.json","events_json":"https://pith.science/api/pith-number/ARWX4LZ7J35GQRNBNSINEHA2JC/events.json","paper":"https://pith.science/paper/ARWX4LZ7"},"agent_actions":{"view_html":"https://pith.science/pith/ARWX4LZ7J35GQRNBNSINEHA2JC","download_json":"https://pith.science/pith/ARWX4LZ7J35GQRNBNSINEHA2JC.json","view_paper":"https://pith.science/paper/ARWX4LZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.08906&json=true","fetch_graph":"https://pith.science/api/pith-number/ARWX4LZ7J35GQRNBNSINEHA2JC/graph.json","fetch_events":"https://pith.science/api/pith-number/ARWX4LZ7J35GQRNBNSINEHA2JC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARWX4LZ7J35GQRNBNSINEHA2JC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARWX4LZ7J35GQRNBNSINEHA2JC/action/storage_attestation","attest_author":"https://pith.science/pith/ARWX4LZ7J35GQRNBNSINEHA2JC/action/author_attestation","sign_citation":"https://pith.science/pith/ARWX4LZ7J35GQRNBNSINEHA2JC/action/citation_signature","submit_replication":"https://pith.science/pith/ARWX4LZ7J35GQRNBNSINEHA2JC/action/replication_record"}},"created_at":"2026-07-05T11:02:47.022281+00:00","updated_at":"2026-07-05T11:02:47.022281+00:00"}