{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IVP2LCNRPD6ODXSHILT6TEQQ26","short_pith_number":"pith:IVP2LCNR","canonical_record":{"source":{"id":"2605.13896","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-12T12:11:33Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"407a2f00cefb1db40d5e7feffe1987c375d0d1cf9fee498a6c14faf3a95089af","abstract_canon_sha256":"d983d5e5394c6ce4c425f0a3b284900758da43b01f9cfe07b765a4031e6c3b4c"},"schema_version":"1.0"},"canonical_sha256":"455fa589b178fce1de4742e7e99210d7a248e1c960b44d0e129b84ed2e2d1151","source":{"kind":"arxiv","id":"2605.13896","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13896","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13896v1","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13896","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"IVP2LCNRPD6O","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"IVP2LCNRPD6ODXSH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"IVP2LCNR","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IVP2LCNRPD6ODXSHILT6TEQQ26","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13896","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-12T12:11:33Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"407a2f00cefb1db40d5e7feffe1987c375d0d1cf9fee498a6c14faf3a95089af","abstract_canon_sha256":"d983d5e5394c6ce4c425f0a3b284900758da43b01f9cfe07b765a4031e6c3b4c"},"schema_version":"1.0"},"canonical_sha256":"455fa589b178fce1de4742e7e99210d7a248e1c960b44d0e129b84ed2e2d1151","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:18.997945Z","signature_b64":"gg3RvqEhMu4LqLegz5TYSSv2hPKXigACRZpl77SjE/8vdZ6h+iYZeK6OCIFMO5eky7YMPruxWm2e/5Jr1EOzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"455fa589b178fce1de4742e7e99210d7a248e1c960b44d0e129b84ed2e2d1151","last_reissued_at":"2026-05-17T23:39:18.997182Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:18.997182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13896","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JeYIX5tiIbaWpI2Sq9aBOHbt31LzlGvibYMRqjlqQQGgM5l8eYYKsSuxAGhzUOqX7NufKkOvDV5j/vPp+kK8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:58:09.409834Z"},"content_sha256":"223fcd7f6ccba5f9c41694c13dad9b96e222299a435c30827eb00c799df8d679","schema_version":"1.0","event_id":"sha256:223fcd7f6ccba5f9c41694c13dad9b96e222299a435c30827eb00c799df8d679"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IVP2LCNRPD6ODXSHILT6TEQQ26","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Code Translation of Legacy Code: APL to C#","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Guided large language models translate APL legacy code to functional C# across program complexities","cross_cats":["cs.PL"],"primary_cat":"cs.SE","authors_text":"Abdulrahman Ramadan, Allan Peter Engsig-Karup, Hanen Borchani, Iben Lilholm, Mikkel Almind","submitted_at":"2026-05-12T12:11:33Z","abstract_excerpt":"Automatic translation between programming languages remains a challenging problem, particularly when the source language is highly concise and specialized. This paper investigates the translation of APL into C# using large language models. The task is difficult due to APL's sparse syntax, the scarcity of large-scale parallel corpora, and the requirement for specialized knowledge to interpret APL programs. To address these challenges, we introduce a novel framework for APL-to-C# translation by comparing three guided strategies, namely natural language description-mediated, retrieval-augmented, "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our results demonstrate that neural code translation can successfully bridge the gap between APL and C# for a wide range of programs, and that incorporating additional context and guidance significantly improves model performance.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The constructed datasets of functionally equivalent APL-C# pairs are representative of real-world legacy code and that the automated pipeline of compilation plus execution testing reliably detects functional equivalence without false positives.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Guided LLM strategies with custom datasets and execution-based verification enable functional APL-to-C# translation across a range of program complexities.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Guided large language models translate APL legacy code to functional C# across program complexities","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"79f8f4b360caf3ab285b5c16e23ba97903d56e08165fa58e64b0b789babef962"},"source":{"id":"2605.13896","kind":"arxiv","version":1},"verdict":{"id":"97678042-8275-43a4-8b34-e3c965d8cb47","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T05:22:01.318670Z","strongest_claim":"Our results demonstrate that neural code translation can successfully bridge the gap between APL and C# for a wide range of programs, and that incorporating additional context and guidance significantly improves model performance.","one_line_summary":"Guided LLM strategies with custom datasets and execution-based verification enable functional APL-to-C# translation across a range of program complexities.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The constructed datasets of functionally equivalent APL-C# pairs are representative of real-world legacy code and that the automated pipeline of compilation plus execution testing reliably detects functional equivalence without false positives.","pith_extraction_headline":"Guided large language models translate APL legacy code to functional C# across program complexities"},"references":{"count":34,"sample":[{"doi":"","year":2023,"title":"Attention Is All You Need","work_id":"baafb5a2-5272-43bc-932f-09fa9ffe5316","ref_index":1,"cited_arxiv_id":"1706.03762","is_internal_anchor":true},{"doi":"","year":2016,"title":"Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation","work_id":"e294e5a1-5dd2-44a0-b348-adbd62fe1916","ref_index":2,"cited_arxiv_id":"1609.08144","is_internal_anchor":true},{"doi":"","year":2023,"title":"Harvard Business School, Working Paper 24-013 (2023)","work_id":"333c7066-3821-439d-ad67-ec07d87fe132","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1962,"title":"Wiley (1962)","work_id":"270242de-07ce-4585-b204-5dc36f15fc28","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"arXiv preprint arXiv:2307.07686 (2023)","work_id":"50778016-eb65-4dde-bca6-0905ac8c41ab","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":34,"snapshot_sha256":"9a33c11ae94c37ff2374e8a34ce4efebd3fca8c71b03ddd2919177a9f27ec0a3","internal_anchors":7},"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"},"verdict_id":"97678042-8275-43a4-8b34-e3c965d8cb47"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/qKxUWHODCXstxQ11umBSrAbxAFimSiRG5SRV9osCc4zGkUg1eKAouOiVxmNJrJ81VPsXhhsm//lNO0JJ4jiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:58:09.410796Z"},"content_sha256":"62e6806ce7c6f6cb3d675fb438b92d2977d7bd8db490aa622b028a3782f853f4","schema_version":"1.0","event_id":"sha256:62e6806ce7c6f6cb3d675fb438b92d2977d7bd8db490aa622b028a3782f853f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVP2LCNRPD6ODXSHILT6TEQQ26/bundle.json","state_url":"https://pith.science/pith/IVP2LCNRPD6ODXSHILT6TEQQ26/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVP2LCNRPD6ODXSHILT6TEQQ26/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T04:58:09Z","links":{"resolver":"https://pith.science/pith/IVP2LCNRPD6ODXSHILT6TEQQ26","bundle":"https://pith.science/pith/IVP2LCNRPD6ODXSHILT6TEQQ26/bundle.json","state":"https://pith.science/pith/IVP2LCNRPD6ODXSHILT6TEQQ26/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVP2LCNRPD6ODXSHILT6TEQQ26/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IVP2LCNRPD6ODXSHILT6TEQQ26","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d983d5e5394c6ce4c425f0a3b284900758da43b01f9cfe07b765a4031e6c3b4c","cross_cats_sorted":["cs.PL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-12T12:11:33Z","title_canon_sha256":"407a2f00cefb1db40d5e7feffe1987c375d0d1cf9fee498a6c14faf3a95089af"},"schema_version":"1.0","source":{"id":"2605.13896","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13896","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13896v1","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13896","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"IVP2LCNRPD6O","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"IVP2LCNRPD6ODXSH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"IVP2LCNR","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:62e6806ce7c6f6cb3d675fb438b92d2977d7bd8db490aa622b028a3782f853f4","target":"graph","created_at":"2026-05-17T23:39:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our results demonstrate that neural code translation can successfully bridge the gap between APL and C# for a wide range of programs, and that incorporating additional context and guidance significantly improves model performance."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The constructed datasets of functionally equivalent APL-C# pairs are representative of real-world legacy code and that the automated pipeline of compilation plus execution testing reliably detects functional equivalence without false positives."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Guided LLM strategies with custom datasets and execution-based verification enable functional APL-to-C# translation across a range of program complexities."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Guided large language models translate APL legacy code to functional C# across program complexities"}],"snapshot_sha256":"79f8f4b360caf3ab285b5c16e23ba97903d56e08165fa58e64b0b789babef962"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Automatic translation between programming languages remains a challenging problem, particularly when the source language is highly concise and specialized. This paper investigates the translation of APL into C# using large language models. The task is difficult due to APL's sparse syntax, the scarcity of large-scale parallel corpora, and the requirement for specialized knowledge to interpret APL programs. To address these challenges, we introduce a novel framework for APL-to-C# translation by comparing three guided strategies, namely natural language description-mediated, retrieval-augmented, ","authors_text":"Abdulrahman Ramadan, Allan Peter Engsig-Karup, Hanen Borchani, Iben Lilholm, Mikkel Almind","cross_cats":["cs.PL"],"headline":"Guided large language models translate APL legacy code to functional C# across program complexities","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-12T12:11:33Z","title":"Neural Code Translation of Legacy Code: APL to C#"},"references":{"count":34,"internal_anchors":7,"resolved_work":34,"sample":[{"cited_arxiv_id":"1706.03762","doi":"","is_internal_anchor":true,"ref_index":1,"title":"Attention Is All You Need","work_id":"baafb5a2-5272-43bc-932f-09fa9ffe5316","year":2023},{"cited_arxiv_id":"1609.08144","doi":"","is_internal_anchor":true,"ref_index":2,"title":"Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation","work_id":"e294e5a1-5dd2-44a0-b348-adbd62fe1916","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Harvard Business School, Working Paper 24-013 (2023)","work_id":"333c7066-3821-439d-ad67-ec07d87fe132","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Wiley (1962)","work_id":"270242de-07ce-4585-b204-5dc36f15fc28","year":1962},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"arXiv preprint arXiv:2307.07686 (2023)","work_id":"50778016-eb65-4dde-bca6-0905ac8c41ab","year":2023}],"snapshot_sha256":"9a33c11ae94c37ff2374e8a34ce4efebd3fca8c71b03ddd2919177a9f27ec0a3"},"source":{"id":"2605.13896","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T05:22:01.318670Z","id":"97678042-8275-43a4-8b34-e3c965d8cb47","model_set":{"reader":"grok-4.3"},"one_line_summary":"Guided LLM strategies with custom datasets and execution-based verification enable functional APL-to-C# translation across a range of program complexities.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Guided large language models translate APL legacy code to functional C# across program complexities","strongest_claim":"Our results demonstrate that neural code translation can successfully bridge the gap between APL and C# for a wide range of programs, and that incorporating additional context and guidance significantly improves model performance.","weakest_assumption":"The constructed datasets of functionally equivalent APL-C# pairs are representative of real-world legacy code and that the automated pipeline of compilation plus execution testing reliably detects functional equivalence without false positives."}},"verdict_id":"97678042-8275-43a4-8b34-e3c965d8cb47"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:223fcd7f6ccba5f9c41694c13dad9b96e222299a435c30827eb00c799df8d679","target":"record","created_at":"2026-05-17T23:39:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d983d5e5394c6ce4c425f0a3b284900758da43b01f9cfe07b765a4031e6c3b4c","cross_cats_sorted":["cs.PL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-12T12:11:33Z","title_canon_sha256":"407a2f00cefb1db40d5e7feffe1987c375d0d1cf9fee498a6c14faf3a95089af"},"schema_version":"1.0","source":{"id":"2605.13896","kind":"arxiv","version":1}},"canonical_sha256":"455fa589b178fce1de4742e7e99210d7a248e1c960b44d0e129b84ed2e2d1151","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"455fa589b178fce1de4742e7e99210d7a248e1c960b44d0e129b84ed2e2d1151","first_computed_at":"2026-05-17T23:39:18.997182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:18.997182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gg3RvqEhMu4LqLegz5TYSSv2hPKXigACRZpl77SjE/8vdZ6h+iYZeK6OCIFMO5eky7YMPruxWm2e/5Jr1EOzBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:18.997945Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13896","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:223fcd7f6ccba5f9c41694c13dad9b96e222299a435c30827eb00c799df8d679","sha256:62e6806ce7c6f6cb3d675fb438b92d2977d7bd8db490aa622b028a3782f853f4"],"state_sha256":"7173c69ef837d676a76714354add9599d3d3ba908f2bdc34d728bf38b5904023"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wB22RkcRULOM/vXKkHNmmg+Wba09JoZCn/uA5ClCbVxMiUK9dfoWd7tCiLh59pYFxKQxm4BttqFeAkdh2RQqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:58:09.415078Z","bundle_sha256":"05ac98de668c9683807114fd27dedfda0f57210900d85336fe8589b8bf44b2e8"}}