{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OU4CJN24FSEIZR2RS6NANRS6HZ","short_pith_number":"pith:OU4CJN24","schema_version":"1.0","canonical_sha256":"753824b75c2c888cc751979a06c65e3e69706a380e6c633e03db50792f3998ec","source":{"kind":"arxiv","id":"2411.05061","version":1},"attestation_state":"computed","paper":{"title":"Optimal Routing Protocols for Reconfigurable Atom Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey V. Gorshkov, Ali Fahimniya, Andrew M. Childs, Dhruv Devulapalli, Dolev Bluvstein, J. V. Porto, Michael J. Gullans, Nathan Constantinides","submitted_at":"2024-11-07T18:51:34Z","abstract_excerpt":"Neutral atom arrays have emerged as a promising platform for both analog and digital quantum processing. Recently, devices capable of reconfiguring arrays during quantum processes have enabled new applications for these systems. Atom reconfiguration, or routing, is the core mechanism for programming circuits; optimizing this routing can increase processing speeds, reduce decoherence, and enable efficient implementations of highly non-local connections. In this work, we investigate routing models applicable to state-of-the-art neutral atom systems. With routing steps that can operate on multipl"},"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":"2411.05061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-07T18:51:34Z","cross_cats_sorted":[],"title_canon_sha256":"b3fb5e1185ad23d8116cc416f4373a156be9f17336291e7e624e08f865fddbc6","abstract_canon_sha256":"3aa7792ad698f9928f5458e31a2e9afcba417d14098186241ce9174ea3ea3cdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:52.584478Z","signature_b64":"7mWyU4Kob4dgSVV2LNrchMKz+6sINVEzWzlxoXs9rL9sL2IleP1rbY2F0js0RJVPtNplZBnCE8QbfWGs4y6oBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"753824b75c2c888cc751979a06c65e3e69706a380e6c633e03db50792f3998ec","last_reissued_at":"2026-07-05T09:32:52.582567Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:52.582567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Routing Protocols for Reconfigurable Atom Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey V. Gorshkov, Ali Fahimniya, Andrew M. Childs, Dhruv Devulapalli, Dolev Bluvstein, J. V. Porto, Michael J. Gullans, Nathan Constantinides","submitted_at":"2024-11-07T18:51:34Z","abstract_excerpt":"Neutral atom arrays have emerged as a promising platform for both analog and digital quantum processing. Recently, devices capable of reconfiguring arrays during quantum processes have enabled new applications for these systems. Atom reconfiguration, or routing, is the core mechanism for programming circuits; optimizing this routing can increase processing speeds, reduce decoherence, and enable efficient implementations of highly non-local connections. In this work, we investigate routing models applicable to state-of-the-art neutral atom systems. With routing steps that can operate on multipl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.05061","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/2411.05061/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":"2411.05061","created_at":"2026-07-05T09:32:52.582653+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.05061v1","created_at":"2026-07-05T09:32:52.582653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.05061","created_at":"2026-07-05T09:32:52.582653+00:00"},{"alias_kind":"pith_short_12","alias_value":"OU4CJN24FSEI","created_at":"2026-07-05T09:32:52.582653+00:00"},{"alias_kind":"pith_short_16","alias_value":"OU4CJN24FSEIZR2R","created_at":"2026-07-05T09:32:52.582653+00:00"},{"alias_kind":"pith_short_8","alias_value":"OU4CJN24","created_at":"2026-07-05T09:32:52.582653+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06177","citing_title":"Using Tanner Spectral Reduction to Improve Multi-Layer Optical Lattice Routing for Hypergraph-Product and Bivariate Bicycle qLDPC Codes","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2605.02498","citing_title":"Permutation Routing on Ramanujan Hypergraphs with Applications to Neutral Atom Quantum Architectures","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05036","citing_title":"Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05036","citing_title":"Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05317","citing_title":"Square-root Time Atom Reconfiguration Plan for Lattice-shaped Mobile Tweezers","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02498","citing_title":"Permutation Routing on Ramanujan Hypergraphs with Applications to Neutral Atom Quantum Architectures","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OU4CJN24FSEIZR2RS6NANRS6HZ","json":"https://pith.science/pith/OU4CJN24FSEIZR2RS6NANRS6HZ.json","graph_json":"https://pith.science/api/pith-number/OU4CJN24FSEIZR2RS6NANRS6HZ/graph.json","events_json":"https://pith.science/api/pith-number/OU4CJN24FSEIZR2RS6NANRS6HZ/events.json","paper":"https://pith.science/paper/OU4CJN24"},"agent_actions":{"view_html":"https://pith.science/pith/OU4CJN24FSEIZR2RS6NANRS6HZ","download_json":"https://pith.science/pith/OU4CJN24FSEIZR2RS6NANRS6HZ.json","view_paper":"https://pith.science/paper/OU4CJN24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.05061&json=true","fetch_graph":"https://pith.science/api/pith-number/OU4CJN24FSEIZR2RS6NANRS6HZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OU4CJN24FSEIZR2RS6NANRS6HZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OU4CJN24FSEIZR2RS6NANRS6HZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OU4CJN24FSEIZR2RS6NANRS6HZ/action/storage_attestation","attest_author":"https://pith.science/pith/OU4CJN24FSEIZR2RS6NANRS6HZ/action/author_attestation","sign_citation":"https://pith.science/pith/OU4CJN24FSEIZR2RS6NANRS6HZ/action/citation_signature","submit_replication":"https://pith.science/pith/OU4CJN24FSEIZR2RS6NANRS6HZ/action/replication_record"}},"created_at":"2026-07-05T09:32:52.582653+00:00","updated_at":"2026-07-05T09:32:52.582653+00:00"}