{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FDUHBPIKTDVLRE6AXTGJ4BJG6C","short_pith_number":"pith:FDUHBPIK","schema_version":"1.0","canonical_sha256":"28e870bd0a98eab893c0bccc9e0526f0b9d3a76e6eb0c156b3324f02b79faac2","source":{"kind":"arxiv","id":"2503.23791","version":1},"attestation_state":"computed","paper":{"title":"LLMigrate: Transforming \"Lazy\" Large Language Models into Efficient Source Code Migrators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Ge Li, Junhao Hu, Tao Xie, Yanzhen Zou, Yihong Dong, Yingdi Shan, Yuchen Liu","submitted_at":"2025-03-31T07:09:07Z","abstract_excerpt":"Rewriting C code in Rust provides stronger memory safety, yet migrating large codebases such as the 32-million-line Linux kernel remains challenging. While rule-based translators (e.g., C2Rust) provide accurate yet largely unsafe Rust programs, recent Large Language Model (LLM) approaches produce more idiomatic, safe Rust programs but frequently exhibit \"laziness\", omitting significant portions of the target code. To address the issue, in this paper, we present LLMigrate, an LLM-based C-to-Rust translation tool that splits modules into discrete functions, translating them individually, and the"},"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":"2503.23791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-03-31T07:09:07Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"5775f9cd41c44cf1f41fa6f8bddc94415bb82de31165638ea1a47d7a3da395f5","abstract_canon_sha256":"d998bc4146d0dd4c946583c7cd1646af4d29c826085e12541f60dd9e80daaf15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:42:00.124898Z","signature_b64":"F3Sc46k4BM66cQ9ExqR1tqERaCHSYk2VXOh+TZrWXFcyzqvI4BrI1McHG/l3p+G12yOr8Jafsy4gSJz5PdyJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28e870bd0a98eab893c0bccc9e0526f0b9d3a76e6eb0c156b3324f02b79faac2","last_reissued_at":"2026-07-05T10:42:00.124424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:42:00.124424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLMigrate: Transforming \"Lazy\" Large Language Models into Efficient Source Code Migrators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Ge Li, Junhao Hu, Tao Xie, Yanzhen Zou, Yihong Dong, Yingdi Shan, Yuchen Liu","submitted_at":"2025-03-31T07:09:07Z","abstract_excerpt":"Rewriting C code in Rust provides stronger memory safety, yet migrating large codebases such as the 32-million-line Linux kernel remains challenging. While rule-based translators (e.g., C2Rust) provide accurate yet largely unsafe Rust programs, recent Large Language Model (LLM) approaches produce more idiomatic, safe Rust programs but frequently exhibit \"laziness\", omitting significant portions of the target code. To address the issue, in this paper, we present LLMigrate, an LLM-based C-to-Rust translation tool that splits modules into discrete functions, translating them individually, and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.23791","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/2503.23791/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":"2503.23791","created_at":"2026-07-05T10:42:00.124481+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.23791v1","created_at":"2026-07-05T10:42:00.124481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.23791","created_at":"2026-07-05T10:42:00.124481+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDUHBPIKTDVL","created_at":"2026-07-05T10:42:00.124481+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDUHBPIKTDVLRE6A","created_at":"2026-07-05T10:42:00.124481+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDUHBPIK","created_at":"2026-07-05T10:42:00.124481+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.15858","citing_title":"Search-Based Multi-Trajectory Refinement for Safe C-to-Rust Translation with Large Language Models","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04527","citing_title":"ENCRUST: Encapsulated Substitution and Agentic Refinement on a Live Scaffold for Safe C-to-Rust Translation","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FDUHBPIKTDVLRE6AXTGJ4BJG6C","json":"https://pith.science/pith/FDUHBPIKTDVLRE6AXTGJ4BJG6C.json","graph_json":"https://pith.science/api/pith-number/FDUHBPIKTDVLRE6AXTGJ4BJG6C/graph.json","events_json":"https://pith.science/api/pith-number/FDUHBPIKTDVLRE6AXTGJ4BJG6C/events.json","paper":"https://pith.science/paper/FDUHBPIK"},"agent_actions":{"view_html":"https://pith.science/pith/FDUHBPIKTDVLRE6AXTGJ4BJG6C","download_json":"https://pith.science/pith/FDUHBPIKTDVLRE6AXTGJ4BJG6C.json","view_paper":"https://pith.science/paper/FDUHBPIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.23791&json=true","fetch_graph":"https://pith.science/api/pith-number/FDUHBPIKTDVLRE6AXTGJ4BJG6C/graph.json","fetch_events":"https://pith.science/api/pith-number/FDUHBPIKTDVLRE6AXTGJ4BJG6C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDUHBPIKTDVLRE6AXTGJ4BJG6C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDUHBPIKTDVLRE6AXTGJ4BJG6C/action/storage_attestation","attest_author":"https://pith.science/pith/FDUHBPIKTDVLRE6AXTGJ4BJG6C/action/author_attestation","sign_citation":"https://pith.science/pith/FDUHBPIKTDVLRE6AXTGJ4BJG6C/action/citation_signature","submit_replication":"https://pith.science/pith/FDUHBPIKTDVLRE6AXTGJ4BJG6C/action/replication_record"}},"created_at":"2026-07-05T10:42:00.124481+00:00","updated_at":"2026-07-05T10:42:00.124481+00:00"}