{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZBK44CKCBUXQOEJTV7SMVSCH5B","short_pith_number":"pith:ZBK44CKC","schema_version":"1.0","canonical_sha256":"c855ce09420d2f071133afe4cac847e84f524909bc950a35bc518227472f1940","source":{"kind":"arxiv","id":"2405.06183","version":1},"attestation_state":"computed","paper":{"title":"Arctic: A Field Programmable Quantum Array Scheduling Technique","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"quant-ph","authors_text":"Ethan Decker","submitted_at":"2024-05-10T01:56:01Z","abstract_excerpt":"Advancements in neutral atom quantum computers have positioned them as a valuable framework for quantum computing, largely due to their prolonged coherence times and capacity for high-fidelity gate operations. Recently, neutral atom computers have enabled coherent atom shuttling to facilitate long-range connectivity as a high-fidelity alternative to traditional gate-based methods. However, these inherent advantages are accompanied by novel constraints, making it challenging to create optimal movement schedules.\n  In this study I present, to the best of my knowledge, the first compiler pass des"},"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":"2405.06183","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-10T01:56:01Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"eb2908f9b6591e992924e49fbcf8eac4c2f0720bcc15f63c9a417cf5057af418","abstract_canon_sha256":"78adb36879c56ff82126c1a7924874aef969ce8e9719af5375e49cdfe90abc56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:17:36.938753Z","signature_b64":"DrlxEciZiAXh7HiR/TuVNe2pGNz4ohZX3wUe9MzNVAFlmPFD6mJgAjfE7gh1+h36jQt38F0zEMnYIaMC/ONGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c855ce09420d2f071133afe4cac847e84f524909bc950a35bc518227472f1940","last_reissued_at":"2026-07-05T08:17:36.938362Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:17:36.938362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arctic: A Field Programmable Quantum Array Scheduling Technique","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"quant-ph","authors_text":"Ethan Decker","submitted_at":"2024-05-10T01:56:01Z","abstract_excerpt":"Advancements in neutral atom quantum computers have positioned them as a valuable framework for quantum computing, largely due to their prolonged coherence times and capacity for high-fidelity gate operations. Recently, neutral atom computers have enabled coherent atom shuttling to facilitate long-range connectivity as a high-fidelity alternative to traditional gate-based methods. However, these inherent advantages are accompanied by novel constraints, making it challenging to create optimal movement schedules.\n  In this study I present, to the best of my knowledge, the first compiler pass des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.06183","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/2405.06183/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":"2405.06183","created_at":"2026-07-05T08:17:36.938415+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.06183v1","created_at":"2026-07-05T08:17:36.938415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.06183","created_at":"2026-07-05T08:17:36.938415+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBK44CKCBUXQ","created_at":"2026-07-05T08:17:36.938415+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBK44CKCBUXQOEJT","created_at":"2026-07-05T08:17:36.938415+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBK44CKC","created_at":"2026-07-05T08:17:36.938415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.14037","citing_title":"ZAP: Zoned Architecture and Performant Compiler for Field Programmable Atom Array","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11000","citing_title":"Compiler Framework for Directional Transport in Zoned Neutral Atom Systems with AOD Assistance: A Hybrid Remote CZ Approach","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZBK44CKCBUXQOEJTV7SMVSCH5B","json":"https://pith.science/pith/ZBK44CKCBUXQOEJTV7SMVSCH5B.json","graph_json":"https://pith.science/api/pith-number/ZBK44CKCBUXQOEJTV7SMVSCH5B/graph.json","events_json":"https://pith.science/api/pith-number/ZBK44CKCBUXQOEJTV7SMVSCH5B/events.json","paper":"https://pith.science/paper/ZBK44CKC"},"agent_actions":{"view_html":"https://pith.science/pith/ZBK44CKCBUXQOEJTV7SMVSCH5B","download_json":"https://pith.science/pith/ZBK44CKCBUXQOEJTV7SMVSCH5B.json","view_paper":"https://pith.science/paper/ZBK44CKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.06183&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBK44CKCBUXQOEJTV7SMVSCH5B/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBK44CKCBUXQOEJTV7SMVSCH5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBK44CKCBUXQOEJTV7SMVSCH5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBK44CKCBUXQOEJTV7SMVSCH5B/action/storage_attestation","attest_author":"https://pith.science/pith/ZBK44CKCBUXQOEJTV7SMVSCH5B/action/author_attestation","sign_citation":"https://pith.science/pith/ZBK44CKCBUXQOEJTV7SMVSCH5B/action/citation_signature","submit_replication":"https://pith.science/pith/ZBK44CKCBUXQOEJTV7SMVSCH5B/action/replication_record"}},"created_at":"2026-07-05T08:17:36.938415+00:00","updated_at":"2026-07-05T08:17:36.938415+00:00"}