{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:F4ODHAITWVJ5AVPZ5HD3NWPTQT","short_pith_number":"pith:F4ODHAIT","schema_version":"1.0","canonical_sha256":"2f1c338113b553d055f9e9c7b6d9f384d0432d7b8b2bea566bddbb142b4f1e50","source":{"kind":"arxiv","id":"2607.24714","version":1},"attestation_state":"computed","paper":{"title":"Efficient LLM-Generated Shuttling Compilers for Complex Trapped-Ion Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.ET"],"primary_cat":"quant-ph","authors_text":"Andr\\'e Brinkmann, Fabian Kreppel, Ferdinand Schmidt-Kaler, Reza Salkhordeh","submitted_at":"2026-07-27T17:51:18Z","abstract_excerpt":"Trapped-ion quantum computers rely on shuttling compilers, which cast an input algorithm into a sequence of ion-qubit movements within a given architecture. We present the first study in which a single frontier large language model (LLM), Claude Opus 4.7, generates and iteratively refines the full Python code of shuttling compilers from written specifications. We start with a compiler for (i) a linear segmented trap, extend it to (ii) a trap with junctions, and finally achieve efficient compilation for (iii) a broad class of connected trap graphs. The compilers for the more general cases are s"},"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":"2607.24714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-27T17:51:18Z","cross_cats_sorted":["cs.AI","cs.ET"],"title_canon_sha256":"6cb7d898346387b512413f273432aa9a806f4ede88c584cbac81f9a24ce7c087","abstract_canon_sha256":"c37d9e06c92d0c1dec53bbee315429e0053bfff591dc1a4d3310f0815ac4111a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T02:24:23.804035Z","signature_b64":"4XMHzmAXxrbom4U71cNNyv7Dv19k49DmtJK2tTR8jcLcCZeTPj+6nQxCQkLOTr0JRfn7ogOhFKK+S1grkAw1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f1c338113b553d055f9e9c7b6d9f384d0432d7b8b2bea566bddbb142b4f1e50","last_reissued_at":"2026-07-28T02:24:23.803118Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T02:24:23.803118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient LLM-Generated Shuttling Compilers for Complex Trapped-Ion Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.ET"],"primary_cat":"quant-ph","authors_text":"Andr\\'e Brinkmann, Fabian Kreppel, Ferdinand Schmidt-Kaler, Reza Salkhordeh","submitted_at":"2026-07-27T17:51:18Z","abstract_excerpt":"Trapped-ion quantum computers rely on shuttling compilers, which cast an input algorithm into a sequence of ion-qubit movements within a given architecture. We present the first study in which a single frontier large language model (LLM), Claude Opus 4.7, generates and iteratively refines the full Python code of shuttling compilers from written specifications. We start with a compiler for (i) a linear segmented trap, extend it to (ii) a trap with junctions, and finally achieve efficient compilation for (iii) a broad class of connected trap graphs. The compilers for the more general cases are s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24714","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/2607.24714/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":"2607.24714","created_at":"2026-07-28T02:24:23.803591+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.24714v1","created_at":"2026-07-28T02:24:23.803591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24714","created_at":"2026-07-28T02:24:23.803591+00:00"},{"alias_kind":"pith_short_12","alias_value":"F4ODHAITWVJ5","created_at":"2026-07-28T02:24:23.803591+00:00"},{"alias_kind":"pith_short_16","alias_value":"F4ODHAITWVJ5AVPZ","created_at":"2026-07-28T02:24:23.803591+00:00"},{"alias_kind":"pith_short_8","alias_value":"F4ODHAIT","created_at":"2026-07-28T02:24:23.803591+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F4ODHAITWVJ5AVPZ5HD3NWPTQT","json":"https://pith.science/pith/F4ODHAITWVJ5AVPZ5HD3NWPTQT.json","graph_json":"https://pith.science/api/pith-number/F4ODHAITWVJ5AVPZ5HD3NWPTQT/graph.json","events_json":"https://pith.science/api/pith-number/F4ODHAITWVJ5AVPZ5HD3NWPTQT/events.json","paper":"https://pith.science/paper/F4ODHAIT"},"agent_actions":{"view_html":"https://pith.science/pith/F4ODHAITWVJ5AVPZ5HD3NWPTQT","download_json":"https://pith.science/pith/F4ODHAITWVJ5AVPZ5HD3NWPTQT.json","view_paper":"https://pith.science/paper/F4ODHAIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.24714&json=true","fetch_graph":"https://pith.science/api/pith-number/F4ODHAITWVJ5AVPZ5HD3NWPTQT/graph.json","fetch_events":"https://pith.science/api/pith-number/F4ODHAITWVJ5AVPZ5HD3NWPTQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F4ODHAITWVJ5AVPZ5HD3NWPTQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F4ODHAITWVJ5AVPZ5HD3NWPTQT/action/storage_attestation","attest_author":"https://pith.science/pith/F4ODHAITWVJ5AVPZ5HD3NWPTQT/action/author_attestation","sign_citation":"https://pith.science/pith/F4ODHAITWVJ5AVPZ5HD3NWPTQT/action/citation_signature","submit_replication":"https://pith.science/pith/F4ODHAITWVJ5AVPZ5HD3NWPTQT/action/replication_record"}},"created_at":"2026-07-28T02:24:23.803591+00:00","updated_at":"2026-07-28T02:24:23.803591+00:00"}