{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KJN2EHRJ7TGFKV7BWYAWG5N7BW","short_pith_number":"pith:KJN2EHRJ","schema_version":"1.0","canonical_sha256":"525ba21e29fccc5557e1b6016375bf0d896db6b51e5cde345ce9c88a9dbd83ee","source":{"kind":"arxiv","id":"2410.20527","version":1},"attestation_state":"computed","paper":{"title":"CodeRosetta: Pushing the Boundaries of Unsupervised Code Translation for Parallel Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.PF","cs.PL","cs.SE"],"primary_cat":"cs.DC","authors_text":"Ali Jannesari, Ali TehraniJamsaz, Amir Yazdanbakhsh, Arijit Bhattacharjee, Le Chen, Nesreen K. Ahmed","submitted_at":"2024-10-27T17:34:07Z","abstract_excerpt":"Recent advancements in Large Language Models (LLMs) have renewed interest in automatic programming language translation. Encoder-decoder transformer models, in particular, have shown promise in translating between different programming languages. However, translating between a language and its high-performance computing (HPC) extensions remains underexplored due to challenges such as complex parallel semantics. In this paper, we introduce CodeRosetta, an encoder-decoder transformer model designed specifically for translating between programming languages and their HPC extensions. CodeRosetta i"},"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":"2410.20527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-10-27T17:34:07Z","cross_cats_sorted":["cs.AI","cs.LG","cs.PF","cs.PL","cs.SE"],"title_canon_sha256":"4da51d87ed34c73a067d9b2b3e36d6012be57097f5e612598098e7583b027fca","abstract_canon_sha256":"491297a7b8b0f58a2b305c6dc0750724b7ed115bc173018e89a6ea808bbe1ba7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:08.268597Z","signature_b64":"Z7yF90B9NFXpDTdWgChOMmrhTm0Z+ZtBj5CHB0HGbc6cDyxz7OkXUGEjUM+Zr2Kea785iXbAHPLOmRNpwKATAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"525ba21e29fccc5557e1b6016375bf0d896db6b51e5cde345ce9c88a9dbd83ee","last_reissued_at":"2026-07-05T09:27:08.268164Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:08.268164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CodeRosetta: Pushing the Boundaries of Unsupervised Code Translation for Parallel Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.PF","cs.PL","cs.SE"],"primary_cat":"cs.DC","authors_text":"Ali Jannesari, Ali TehraniJamsaz, Amir Yazdanbakhsh, Arijit Bhattacharjee, Le Chen, Nesreen K. Ahmed","submitted_at":"2024-10-27T17:34:07Z","abstract_excerpt":"Recent advancements in Large Language Models (LLMs) have renewed interest in automatic programming language translation. Encoder-decoder transformer models, in particular, have shown promise in translating between different programming languages. However, translating between a language and its high-performance computing (HPC) extensions remains underexplored due to challenges such as complex parallel semantics. In this paper, we introduce CodeRosetta, an encoder-decoder transformer model designed specifically for translating between programming languages and their HPC extensions. CodeRosetta i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.20527","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/2410.20527/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":"2410.20527","created_at":"2026-07-05T09:27:08.268219+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.20527v1","created_at":"2026-07-05T09:27:08.268219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.20527","created_at":"2026-07-05T09:27:08.268219+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJN2EHRJ7TGF","created_at":"2026-07-05T09:27:08.268219+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJN2EHRJ7TGFKV7B","created_at":"2026-07-05T09:27:08.268219+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJN2EHRJ","created_at":"2026-07-05T09:27:08.268219+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.16046","citing_title":"XSearch: Explainable Code Search via Concept-to-Code Alignment","ref_index":79,"is_internal_anchor":false},{"citing_arxiv_id":"2606.16534","citing_title":"Generated, Parallel, Scalable? A Study of Agentic AI-Generated Julia Code on Supercomputers","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16046","citing_title":"XSearch: Explainable Code Search via Concept-to-Code Alignment","ref_index":79,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KJN2EHRJ7TGFKV7BWYAWG5N7BW","json":"https://pith.science/pith/KJN2EHRJ7TGFKV7BWYAWG5N7BW.json","graph_json":"https://pith.science/api/pith-number/KJN2EHRJ7TGFKV7BWYAWG5N7BW/graph.json","events_json":"https://pith.science/api/pith-number/KJN2EHRJ7TGFKV7BWYAWG5N7BW/events.json","paper":"https://pith.science/paper/KJN2EHRJ"},"agent_actions":{"view_html":"https://pith.science/pith/KJN2EHRJ7TGFKV7BWYAWG5N7BW","download_json":"https://pith.science/pith/KJN2EHRJ7TGFKV7BWYAWG5N7BW.json","view_paper":"https://pith.science/paper/KJN2EHRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.20527&json=true","fetch_graph":"https://pith.science/api/pith-number/KJN2EHRJ7TGFKV7BWYAWG5N7BW/graph.json","fetch_events":"https://pith.science/api/pith-number/KJN2EHRJ7TGFKV7BWYAWG5N7BW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJN2EHRJ7TGFKV7BWYAWG5N7BW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJN2EHRJ7TGFKV7BWYAWG5N7BW/action/storage_attestation","attest_author":"https://pith.science/pith/KJN2EHRJ7TGFKV7BWYAWG5N7BW/action/author_attestation","sign_citation":"https://pith.science/pith/KJN2EHRJ7TGFKV7BWYAWG5N7BW/action/citation_signature","submit_replication":"https://pith.science/pith/KJN2EHRJ7TGFKV7BWYAWG5N7BW/action/replication_record"}},"created_at":"2026-07-05T09:27:08.268219+00:00","updated_at":"2026-07-05T09:27:08.268219+00:00"}