{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UV3NNNOTETPLQUGXGAUJGRI7TX","short_pith_number":"pith:UV3NNNOT","canonical_record":{"source":{"id":"2606.20503","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-18T17:21:23Z","cross_cats_sorted":[],"title_canon_sha256":"072c02168776032a11402555fa10fd0977b45adde55344b25581246fc94fbd74","abstract_canon_sha256":"9db50f3ac3d3558aac1c3824e26cae4315a4c06ccbdc9175537a869d9866eaa8"},"schema_version":"1.0"},"canonical_sha256":"a576d6b5d324deb850d7302893451f9deca0b0310041dc4ed0ce0f24e39cee6d","source":{"kind":"arxiv","id":"2606.20503","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20503","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20503v1","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20503","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"UV3NNNOTETPL","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"UV3NNNOTETPLQUGX","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"UV3NNNOT","created_at":"2026-06-19T16:13:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UV3NNNOTETPLQUGXGAUJGRI7TX","target":"record","payload":{"canonical_record":{"source":{"id":"2606.20503","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-18T17:21:23Z","cross_cats_sorted":[],"title_canon_sha256":"072c02168776032a11402555fa10fd0977b45adde55344b25581246fc94fbd74","abstract_canon_sha256":"9db50f3ac3d3558aac1c3824e26cae4315a4c06ccbdc9175537a869d9866eaa8"},"schema_version":"1.0"},"canonical_sha256":"a576d6b5d324deb850d7302893451f9deca0b0310041dc4ed0ce0f24e39cee6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:13:13.891179Z","signature_b64":"qSPV1Wr6/YXrmBztwWOA7jZS24qyeX6dadT4DUX885OAH8yCx+6dtVVHJDKf7B9+m2/4PdD8eemsziI7q9hYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a576d6b5d324deb850d7302893451f9deca0b0310041dc4ed0ce0f24e39cee6d","last_reissued_at":"2026-06-19T16:13:13.890842Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:13:13.890842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.20503","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-06-19T16:13:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uq6qRIX9mhRHijN8rnchM5X8IT3bdwPooCS93fHYW5QUQ6gsgjWsChvHnHQmELRmeIvcha1LAc8ZswW9Ad8MBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:33:42.779134Z"},"content_sha256":"ccd5b3e5793abf4c71d8c7c24bb9cba544daa6fd966f75c2b2707cd37630dc59","schema_version":"1.0","event_id":"sha256:ccd5b3e5793abf4c71d8c7c24bb9cba544daa6fd966f75c2b2707cd37630dc59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UV3NNNOTETPLQUGXGAUJGRI7TX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"General circuit mapping algorithm for neutral atom quantum computers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aida Todri-Sanial, Lous S. Rianne, Neven Gentil","submitted_at":"2026-06-18T17:21:23Z","abstract_excerpt":"Neutral atom quantum computers (NAQC) are emerging as a promising, scalable quantum computing platform because of their long qubit coherence, flexible qubit arrangement, and multiqubit gate capabilities. However, circuit execution often requires physically moving qubits, making compilation a critical optimization challenge. We propose a circuit independent mathematical framework built on graph-theoretic combinatorial optimization that determines the minimal number of required qubit transfers. This model captures spatial constraints specific to NAQC platforms with zone-limited gate operations a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20503","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/2606.20503/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:13:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TFTRBlHilBYt82HNjGdz6vqgMxEybR/SohW/xvWMU1CQv/4YZc0d3hFmKQdddFlW4aS91Xq7FVMx6csgoHflDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:33:42.779511Z"},"content_sha256":"933bb3bfc6618af21af43951c4e002550d9a2eee741c03e6ef6d1dacb3fc7665","schema_version":"1.0","event_id":"sha256:933bb3bfc6618af21af43951c4e002550d9a2eee741c03e6ef6d1dacb3fc7665"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UV3NNNOTETPLQUGXGAUJGRI7TX/bundle.json","state_url":"https://pith.science/pith/UV3NNNOTETPLQUGXGAUJGRI7TX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UV3NNNOTETPLQUGXGAUJGRI7TX/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-06-28T10:33:42Z","links":{"resolver":"https://pith.science/pith/UV3NNNOTETPLQUGXGAUJGRI7TX","bundle":"https://pith.science/pith/UV3NNNOTETPLQUGXGAUJGRI7TX/bundle.json","state":"https://pith.science/pith/UV3NNNOTETPLQUGXGAUJGRI7TX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UV3NNNOTETPLQUGXGAUJGRI7TX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UV3NNNOTETPLQUGXGAUJGRI7TX","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":"9db50f3ac3d3558aac1c3824e26cae4315a4c06ccbdc9175537a869d9866eaa8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-18T17:21:23Z","title_canon_sha256":"072c02168776032a11402555fa10fd0977b45adde55344b25581246fc94fbd74"},"schema_version":"1.0","source":{"id":"2606.20503","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20503","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20503v1","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20503","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"UV3NNNOTETPL","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"UV3NNNOTETPLQUGX","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"UV3NNNOT","created_at":"2026-06-19T16:13:13Z"}],"graph_snapshots":[{"event_id":"sha256:933bb3bfc6618af21af43951c4e002550d9a2eee741c03e6ef6d1dacb3fc7665","target":"graph","created_at":"2026-06-19T16:13:13Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.20503/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neutral atom quantum computers (NAQC) are emerging as a promising, scalable quantum computing platform because of their long qubit coherence, flexible qubit arrangement, and multiqubit gate capabilities. However, circuit execution often requires physically moving qubits, making compilation a critical optimization challenge. We propose a circuit independent mathematical framework built on graph-theoretic combinatorial optimization that determines the minimal number of required qubit transfers. This model captures spatial constraints specific to NAQC platforms with zone-limited gate operations a","authors_text":"Aida Todri-Sanial, Lous S. Rianne, Neven Gentil","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-18T17:21:23Z","title":"General circuit mapping algorithm for neutral atom quantum computers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20503","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ccd5b3e5793abf4c71d8c7c24bb9cba544daa6fd966f75c2b2707cd37630dc59","target":"record","created_at":"2026-06-19T16:13:13Z","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":"9db50f3ac3d3558aac1c3824e26cae4315a4c06ccbdc9175537a869d9866eaa8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-18T17:21:23Z","title_canon_sha256":"072c02168776032a11402555fa10fd0977b45adde55344b25581246fc94fbd74"},"schema_version":"1.0","source":{"id":"2606.20503","kind":"arxiv","version":1}},"canonical_sha256":"a576d6b5d324deb850d7302893451f9deca0b0310041dc4ed0ce0f24e39cee6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a576d6b5d324deb850d7302893451f9deca0b0310041dc4ed0ce0f24e39cee6d","first_computed_at":"2026-06-19T16:13:13.890842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:13:13.890842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qSPV1Wr6/YXrmBztwWOA7jZS24qyeX6dadT4DUX885OAH8yCx+6dtVVHJDKf7B9+m2/4PdD8eemsziI7q9hYCw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:13:13.891179Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.20503","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccd5b3e5793abf4c71d8c7c24bb9cba544daa6fd966f75c2b2707cd37630dc59","sha256:933bb3bfc6618af21af43951c4e002550d9a2eee741c03e6ef6d1dacb3fc7665"],"state_sha256":"dc534b5328bb7e7db4876f0a888d9363274a12e184f19fbb28c815093f9bcdfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N8mgrDDY8PqVrgoMML0Rzv8sdoveqm2XTV215KSXzmdDTOVxMbi2/yeoAGOY7NWM2La20Ljo1UtNhp8MmFTvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T10:33:42.781398Z","bundle_sha256":"fa3fb63566b7396c6ed33404c5c635a70d3ce8eba9d254ae416779184162a845"}}