{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2Z6ZARBXG7VNKMVSVU3IEM2KCC","short_pith_number":"pith:2Z6ZARBX","schema_version":"1.0","canonical_sha256":"d67d90443737ead532b2ad3682334a10995e8816aa1892bdae0483c1094a50d3","source":{"kind":"arxiv","id":"2607.25866","version":1},"attestation_state":"computed","paper":{"title":"Massively parallel numerical simulations with Julia","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.MS","cs.NA","cs.PF"],"primary_cat":"math.NA","authors_text":"Andr\\'es Rueda-Ram\\'irez, Benedict Geihe, Gregor J. Gassner, Hendrik Ranocha, Lars Christmann, Marco Artiano, Michael Schlottke-Lakemper, Simon Candelaresi, Valentin Churavy","submitted_at":"2026-07-28T15:33:41Z","abstract_excerpt":"The Julia programming language aims to provide a modern approach to develop high-performance computing (HPC) applications. It tries to achieve this by combining a high-level, dynamic interface with just-in-time compilation to native machine code, thereby facilitating high developer productivity and native code performance at the same time. While this approach has already been shown to work well for serial applications, it is not clear if it readily translates to traditional, massively parallel HPC work loads. In this paper, we fill this gap by analyzing the parallel performance of the numerica"},"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":"2607.25866","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-07-28T15:33:41Z","cross_cats_sorted":["cs.DC","cs.MS","cs.NA","cs.PF"],"title_canon_sha256":"9692f959fd21994fc50ac3504ac6d6ae6e37939dc4a18cb672f1f0e5a9ed0213","abstract_canon_sha256":"3dfb5717d0c5d29ecc13314c1b0cabb664b4f22a64082ffc8474fce173319315"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T01:26:07.658101Z","signature_b64":"EdEYJfJ0mQusBY00E/PFByK8CMmWneF2hUjHeatEcBLAIEEX5fgz3PKJz1SmvD05+1K40CudyygBZrCHk9z2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d67d90443737ead532b2ad3682334a10995e8816aa1892bdae0483c1094a50d3","last_reissued_at":"2026-07-29T01:26:07.657247Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T01:26:07.657247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Massively parallel numerical simulations with Julia","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.MS","cs.NA","cs.PF"],"primary_cat":"math.NA","authors_text":"Andr\\'es Rueda-Ram\\'irez, Benedict Geihe, Gregor J. Gassner, Hendrik Ranocha, Lars Christmann, Marco Artiano, Michael Schlottke-Lakemper, Simon Candelaresi, Valentin Churavy","submitted_at":"2026-07-28T15:33:41Z","abstract_excerpt":"The Julia programming language aims to provide a modern approach to develop high-performance computing (HPC) applications. It tries to achieve this by combining a high-level, dynamic interface with just-in-time compilation to native machine code, thereby facilitating high developer productivity and native code performance at the same time. While this approach has already been shown to work well for serial applications, it is not clear if it readily translates to traditional, massively parallel HPC work loads. In this paper, we fill this gap by analyzing the parallel performance of the numerica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25866","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/2607.25866/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":"2607.25866","created_at":"2026-07-29T01:26:07.657696+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.25866v1","created_at":"2026-07-29T01:26:07.657696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25866","created_at":"2026-07-29T01:26:07.657696+00:00"},{"alias_kind":"pith_short_12","alias_value":"2Z6ZARBXG7VN","created_at":"2026-07-29T01:26:07.657696+00:00"},{"alias_kind":"pith_short_16","alias_value":"2Z6ZARBXG7VNKMVS","created_at":"2026-07-29T01:26:07.657696+00:00"},{"alias_kind":"pith_short_8","alias_value":"2Z6ZARBX","created_at":"2026-07-29T01:26:07.657696+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/2Z6ZARBXG7VNKMVSVU3IEM2KCC","json":"https://pith.science/pith/2Z6ZARBXG7VNKMVSVU3IEM2KCC.json","graph_json":"https://pith.science/api/pith-number/2Z6ZARBXG7VNKMVSVU3IEM2KCC/graph.json","events_json":"https://pith.science/api/pith-number/2Z6ZARBXG7VNKMVSVU3IEM2KCC/events.json","paper":"https://pith.science/paper/2Z6ZARBX"},"agent_actions":{"view_html":"https://pith.science/pith/2Z6ZARBXG7VNKMVSVU3IEM2KCC","download_json":"https://pith.science/pith/2Z6ZARBXG7VNKMVSVU3IEM2KCC.json","view_paper":"https://pith.science/paper/2Z6ZARBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.25866&json=true","fetch_graph":"https://pith.science/api/pith-number/2Z6ZARBXG7VNKMVSVU3IEM2KCC/graph.json","fetch_events":"https://pith.science/api/pith-number/2Z6ZARBXG7VNKMVSVU3IEM2KCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2Z6ZARBXG7VNKMVSVU3IEM2KCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2Z6ZARBXG7VNKMVSVU3IEM2KCC/action/storage_attestation","attest_author":"https://pith.science/pith/2Z6ZARBXG7VNKMVSVU3IEM2KCC/action/author_attestation","sign_citation":"https://pith.science/pith/2Z6ZARBXG7VNKMVSVU3IEM2KCC/action/citation_signature","submit_replication":"https://pith.science/pith/2Z6ZARBXG7VNKMVSVU3IEM2KCC/action/replication_record"}},"created_at":"2026-07-29T01:26:07.657696+00:00","updated_at":"2026-07-29T01:26:07.657696+00:00"}