{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RH3MPEMJRF4HDC65SIEVTGYO7M","short_pith_number":"pith:RH3MPEMJ","schema_version":"1.0","canonical_sha256":"89f6c791898978718bdd9209599b0efb30fa4220207f3ebfdf59ae2048c325e6","source":{"kind":"arxiv","id":"2111.01861","version":1},"attestation_state":"computed","paper":{"title":"Source-to-Source Automatic Differentiation of OpenMP Parallel Loops","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.PF"],"primary_cat":"cs.MS","authors_text":"Jan H\\\"uckelheim, Laurent Hasco\\\"et","submitted_at":"2021-11-02T19:40:59Z","abstract_excerpt":"This paper presents our work toward correct and efficient automatic differentiation of OpenMP parallel worksharing loops in forward and reverse mode. Automatic differentiation is a method to obtain gradients of numerical programs, which are crucial in optimization, uncertainty quantification, and machine learning. The computational cost to compute gradients is a common bottleneck in practice. For applications that are parallelized for multicore CPUs or GPUs using OpenMP, one also wishes to compute the gradients in parallel. We propose a framework to reason about the correctness of the generate"},"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":"2111.01861","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MS","submitted_at":"2021-11-02T19:40:59Z","cross_cats_sorted":["cs.LG","cs.PF"],"title_canon_sha256":"08e0bfce77c723f18a276cfeff6cd5ae404ae2163916ea65751aa138347432da","abstract_canon_sha256":"b535d92d6f147daedc8f86d6ff67d9eacebe736085ef1639b6a3f690fdbf57e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:28:43.376229Z","signature_b64":"xOnpZanGG+K7yFEF2bDdWY4tAFR4P8tTBWWhe+vfzYSxk+mrEEZoCs5N58LX9WJ/n1tUzn17Mm2cz01CmUWwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89f6c791898978718bdd9209599b0efb30fa4220207f3ebfdf59ae2048c325e6","last_reissued_at":"2026-07-05T03:28:43.375805Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:28:43.375805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Source-to-Source Automatic Differentiation of OpenMP Parallel Loops","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.PF"],"primary_cat":"cs.MS","authors_text":"Jan H\\\"uckelheim, Laurent Hasco\\\"et","submitted_at":"2021-11-02T19:40:59Z","abstract_excerpt":"This paper presents our work toward correct and efficient automatic differentiation of OpenMP parallel worksharing loops in forward and reverse mode. Automatic differentiation is a method to obtain gradients of numerical programs, which are crucial in optimization, uncertainty quantification, and machine learning. The computational cost to compute gradients is a common bottleneck in practice. For applications that are parallelized for multicore CPUs or GPUs using OpenMP, one also wishes to compute the gradients in parallel. We propose a framework to reason about the correctness of the generate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.01861","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/2111.01861/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":"2111.01861","created_at":"2026-07-05T03:28:43.375875+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.01861v1","created_at":"2026-07-05T03:28:43.375875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.01861","created_at":"2026-07-05T03:28:43.375875+00:00"},{"alias_kind":"pith_short_12","alias_value":"RH3MPEMJRF4H","created_at":"2026-07-05T03:28:43.375875+00:00"},{"alias_kind":"pith_short_16","alias_value":"RH3MPEMJRF4HDC65","created_at":"2026-07-05T03:28:43.375875+00:00"},{"alias_kind":"pith_short_8","alias_value":"RH3MPEMJ","created_at":"2026-07-05T03:28:43.375875+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.02197","citing_title":"DaCe AD: Unifying High-Performance Automatic Differentiation for Machine Learning and Scientific Computing","ref_index":2021,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RH3MPEMJRF4HDC65SIEVTGYO7M","json":"https://pith.science/pith/RH3MPEMJRF4HDC65SIEVTGYO7M.json","graph_json":"https://pith.science/api/pith-number/RH3MPEMJRF4HDC65SIEVTGYO7M/graph.json","events_json":"https://pith.science/api/pith-number/RH3MPEMJRF4HDC65SIEVTGYO7M/events.json","paper":"https://pith.science/paper/RH3MPEMJ"},"agent_actions":{"view_html":"https://pith.science/pith/RH3MPEMJRF4HDC65SIEVTGYO7M","download_json":"https://pith.science/pith/RH3MPEMJRF4HDC65SIEVTGYO7M.json","view_paper":"https://pith.science/paper/RH3MPEMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.01861&json=true","fetch_graph":"https://pith.science/api/pith-number/RH3MPEMJRF4HDC65SIEVTGYO7M/graph.json","fetch_events":"https://pith.science/api/pith-number/RH3MPEMJRF4HDC65SIEVTGYO7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RH3MPEMJRF4HDC65SIEVTGYO7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RH3MPEMJRF4HDC65SIEVTGYO7M/action/storage_attestation","attest_author":"https://pith.science/pith/RH3MPEMJRF4HDC65SIEVTGYO7M/action/author_attestation","sign_citation":"https://pith.science/pith/RH3MPEMJRF4HDC65SIEVTGYO7M/action/citation_signature","submit_replication":"https://pith.science/pith/RH3MPEMJRF4HDC65SIEVTGYO7M/action/replication_record"}},"created_at":"2026-07-05T03:28:43.375875+00:00","updated_at":"2026-07-05T03:28:43.375875+00:00"}