{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CBVGBBZDZG23LCO2C55RRR7TWW","short_pith_number":"pith:CBVGBBZD","schema_version":"1.0","canonical_sha256":"106a608723c9b5b589da177b18c7f3b586e03f475d1720f8645451a10fba5905","source":{"kind":"arxiv","id":"2409.14771","version":1},"attestation_state":"computed","paper":{"title":"OMPar: Automatic Parallelization with AI-Driven Source-to-Source Compilation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Gal Oren, Mihai Capota, Nesreen Ahmed, Niranjan Hasabnis, Prema Soundararajan, Tal Kadosh, Vy A. Vo, Yuval Pinter","submitted_at":"2024-09-23T07:39:01Z","abstract_excerpt":"Manual parallelization of code remains a significant challenge due to the complexities of modern software systems and the widespread adoption of multi-core architectures. This paper introduces OMPar, an AI-driven tool designed to automate the parallelization of C/C++ code using OpenMP pragmas. OMPar integrates Large Language Models (LLMs) through two key components: OMPify, which assesses loop parallelization potential, and MonoCoder-OMP, a new fine-tuned model which generates precise OpenMP pragmas. The evaluation of OMPar follows the same rigorous process applied to traditional tools like so"},"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":"2409.14771","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-09-23T07:39:01Z","cross_cats_sorted":[],"title_canon_sha256":"d277af7ae0d5161af38a298027633a8fbf6ceee4e21173a9155c62b5a8b1c470","abstract_canon_sha256":"661e728c55984226d114c522201f87ebec3afe306c449031684b34a1ad65258c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:10:21.255626Z","signature_b64":"5EycDOPy6RB+ub+WqGT0GtM4xdtED/4L5hxYQHgmDzX+k7DHVUbxitNe3OdW2UFva8jshlhiUj00UwoQrLbaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"106a608723c9b5b589da177b18c7f3b586e03f475d1720f8645451a10fba5905","last_reissued_at":"2026-07-05T09:10:21.255186Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:10:21.255186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OMPar: Automatic Parallelization with AI-Driven Source-to-Source Compilation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Gal Oren, Mihai Capota, Nesreen Ahmed, Niranjan Hasabnis, Prema Soundararajan, Tal Kadosh, Vy A. Vo, Yuval Pinter","submitted_at":"2024-09-23T07:39:01Z","abstract_excerpt":"Manual parallelization of code remains a significant challenge due to the complexities of modern software systems and the widespread adoption of multi-core architectures. This paper introduces OMPar, an AI-driven tool designed to automate the parallelization of C/C++ code using OpenMP pragmas. OMPar integrates Large Language Models (LLMs) through two key components: OMPify, which assesses loop parallelization potential, and MonoCoder-OMP, a new fine-tuned model which generates precise OpenMP pragmas. The evaluation of OMPar follows the same rigorous process applied to traditional tools like so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.14771","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/2409.14771/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":"2409.14771","created_at":"2026-07-05T09:10:21.255254+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.14771v1","created_at":"2026-07-05T09:10:21.255254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.14771","created_at":"2026-07-05T09:10:21.255254+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBVGBBZDZG23","created_at":"2026-07-05T09:10:21.255254+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBVGBBZDZG23LCO2","created_at":"2026-07-05T09:10:21.255254+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBVGBBZD","created_at":"2026-07-05T09:10:21.255254+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00883","citing_title":"Accelerating Latency-Critical Applications with AI-Powered Semi-Automatic Fine-Grained Parallelization on SMT Processors","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CBVGBBZDZG23LCO2C55RRR7TWW","json":"https://pith.science/pith/CBVGBBZDZG23LCO2C55RRR7TWW.json","graph_json":"https://pith.science/api/pith-number/CBVGBBZDZG23LCO2C55RRR7TWW/graph.json","events_json":"https://pith.science/api/pith-number/CBVGBBZDZG23LCO2C55RRR7TWW/events.json","paper":"https://pith.science/paper/CBVGBBZD"},"agent_actions":{"view_html":"https://pith.science/pith/CBVGBBZDZG23LCO2C55RRR7TWW","download_json":"https://pith.science/pith/CBVGBBZDZG23LCO2C55RRR7TWW.json","view_paper":"https://pith.science/paper/CBVGBBZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.14771&json=true","fetch_graph":"https://pith.science/api/pith-number/CBVGBBZDZG23LCO2C55RRR7TWW/graph.json","fetch_events":"https://pith.science/api/pith-number/CBVGBBZDZG23LCO2C55RRR7TWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBVGBBZDZG23LCO2C55RRR7TWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBVGBBZDZG23LCO2C55RRR7TWW/action/storage_attestation","attest_author":"https://pith.science/pith/CBVGBBZDZG23LCO2C55RRR7TWW/action/author_attestation","sign_citation":"https://pith.science/pith/CBVGBBZDZG23LCO2C55RRR7TWW/action/citation_signature","submit_replication":"https://pith.science/pith/CBVGBBZDZG23LCO2C55RRR7TWW/action/replication_record"}},"created_at":"2026-07-05T09:10:21.255254+00:00","updated_at":"2026-07-05T09:10:21.255254+00:00"}