{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EZ2OTVHS4DY7H64U42FZUYADUM","short_pith_number":"pith:EZ2OTVHS","canonical_record":{"source":{"id":"1812.11619","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-12-30T22:19:09Z","cross_cats_sorted":[],"title_canon_sha256":"70978c742f34dbe5df530dd4f5f50904b45689d709c3da9e7d1a4e69af0ca71d","abstract_canon_sha256":"ca4e9597fb324511c917e927a77654cdd7930bf9ffda5bfcc33259db95eee0c0"},"schema_version":"1.0"},"canonical_sha256":"2674e9d4f2e0f1f3fb94e68b9a6003a3074ab1323819d160e5f4282639271d50","source":{"kind":"arxiv","id":"1812.11619","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11619","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11619v2","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11619","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"pith_short_12","alias_value":"EZ2OTVHS4DY7","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EZ2OTVHS4DY7H64U","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EZ2OTVHS","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EZ2OTVHS4DY7H64U42FZUYADUM","target":"record","payload":{"canonical_record":{"source":{"id":"1812.11619","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-12-30T22:19:09Z","cross_cats_sorted":[],"title_canon_sha256":"70978c742f34dbe5df530dd4f5f50904b45689d709c3da9e7d1a4e69af0ca71d","abstract_canon_sha256":"ca4e9597fb324511c917e927a77654cdd7930bf9ffda5bfcc33259db95eee0c0"},"schema_version":"1.0"},"canonical_sha256":"2674e9d4f2e0f1f3fb94e68b9a6003a3074ab1323819d160e5f4282639271d50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:26.936831Z","signature_b64":"rsqUsYGwFNRJbnNpdsWv6a0dfZG8pz+NVsnKW1WRZGYDXjL9dgZ8bquAWAs02fPWJgFg6QCcYvnMX+t9BdzaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2674e9d4f2e0f1f3fb94e68b9a6003a3074ab1323819d160e5f4282639271d50","last_reissued_at":"2026-05-17T23:55:26.936335Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:26.936335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.11619","source_version":2,"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-05-17T23:55:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Mk8qG+2l3kl+ywovpiTPslEWjuyxfNhgqddFQ2aRx58r6EwewxRqg8X/MhSVFPFyQ/Zo5PcqKIGDvQEoIMFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:59:06.146516Z"},"content_sha256":"01739384c35b79dfcd87eeb4613063667ed8ef1df125856d3ceca700558383b8","schema_version":"1.0","event_id":"sha256:01739384c35b79dfcd87eeb4613063667ed8ef1df125856d3ceca700558383b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EZ2OTVHS4DY7H64U42FZUYADUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Akash Sengupta, Steven Herbert","submitted_at":"2018-12-30T22:19:09Z","abstract_excerpt":"This paper addresses the problem of qubit routing in first-generation and other near-term quantum computers. In particular, it is asserted that the qubit routing problem can be formulated as a reinforcement learning (RL) problem, and that this is sufficient, in principle, to discover the optimal qubit routing policy for any given quantum computer architecture. In order to achieve this, it is necessary to alter the conventional RL framework to allow combinatorial action space, and this represents a second contribution of this paper, which is expected to find additional application, beyond the q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11619","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:55:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fpgOdKLmXvbC8wk+e+EiWZtT1lt88xm2Od9YvOW3woJak9bY8n+t0fwU0/hGP/YodOB6Nd8Kl2bjZpXiDgpsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:59:06.147266Z"},"content_sha256":"662d89af11b35c0b6824b754f9d20ca7ce3800975336acd32c226d93e849f785","schema_version":"1.0","event_id":"sha256:662d89af11b35c0b6824b754f9d20ca7ce3800975336acd32c226d93e849f785"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZ2OTVHS4DY7H64U42FZUYADUM/bundle.json","state_url":"https://pith.science/pith/EZ2OTVHS4DY7H64U42FZUYADUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZ2OTVHS4DY7H64U42FZUYADUM/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-10T10:59:06Z","links":{"resolver":"https://pith.science/pith/EZ2OTVHS4DY7H64U42FZUYADUM","bundle":"https://pith.science/pith/EZ2OTVHS4DY7H64U42FZUYADUM/bundle.json","state":"https://pith.science/pith/EZ2OTVHS4DY7H64U42FZUYADUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZ2OTVHS4DY7H64U42FZUYADUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EZ2OTVHS4DY7H64U42FZUYADUM","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":"ca4e9597fb324511c917e927a77654cdd7930bf9ffda5bfcc33259db95eee0c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-12-30T22:19:09Z","title_canon_sha256":"70978c742f34dbe5df530dd4f5f50904b45689d709c3da9e7d1a4e69af0ca71d"},"schema_version":"1.0","source":{"id":"1812.11619","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11619","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11619v2","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11619","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"pith_short_12","alias_value":"EZ2OTVHS4DY7","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EZ2OTVHS4DY7H64U","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EZ2OTVHS","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:662d89af11b35c0b6824b754f9d20ca7ce3800975336acd32c226d93e849f785","target":"graph","created_at":"2026-05-17T23:55:26Z","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"},"paper":{"abstract_excerpt":"This paper addresses the problem of qubit routing in first-generation and other near-term quantum computers. In particular, it is asserted that the qubit routing problem can be formulated as a reinforcement learning (RL) problem, and that this is sufficient, in principle, to discover the optimal qubit routing policy for any given quantum computer architecture. In order to achieve this, it is necessary to alter the conventional RL framework to allow combinatorial action space, and this represents a second contribution of this paper, which is expected to find additional application, beyond the q","authors_text":"Akash Sengupta, Steven Herbert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-12-30T22:19:09Z","title":"Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11619","kind":"arxiv","version":2},"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:01739384c35b79dfcd87eeb4613063667ed8ef1df125856d3ceca700558383b8","target":"record","created_at":"2026-05-17T23:55:26Z","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":"ca4e9597fb324511c917e927a77654cdd7930bf9ffda5bfcc33259db95eee0c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-12-30T22:19:09Z","title_canon_sha256":"70978c742f34dbe5df530dd4f5f50904b45689d709c3da9e7d1a4e69af0ca71d"},"schema_version":"1.0","source":{"id":"1812.11619","kind":"arxiv","version":2}},"canonical_sha256":"2674e9d4f2e0f1f3fb94e68b9a6003a3074ab1323819d160e5f4282639271d50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2674e9d4f2e0f1f3fb94e68b9a6003a3074ab1323819d160e5f4282639271d50","first_computed_at":"2026-05-17T23:55:26.936335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:26.936335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rsqUsYGwFNRJbnNpdsWv6a0dfZG8pz+NVsnKW1WRZGYDXjL9dgZ8bquAWAs02fPWJgFg6QCcYvnMX+t9BdzaDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:26.936831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.11619","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01739384c35b79dfcd87eeb4613063667ed8ef1df125856d3ceca700558383b8","sha256:662d89af11b35c0b6824b754f9d20ca7ce3800975336acd32c226d93e849f785"],"state_sha256":"a2b8947b7d942371b994f927ff05837e32c351da1fd87d19aa1cb9a1cfb2fce9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wtpTM6bZXaDdM0PXOFDLXdapAlptilBzsW6SiGgDdkQ0OT8etHu291GJ7xZTaMGb5/A5P0Yz6LRZK+lTi53CBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:59:06.152046Z","bundle_sha256":"d825bb89dbf9d0d5f1f01c1c4feece3f09a868b0c7b4a0913cbf21d10a49b9ff"}}