{"as_of":"2026-08-09T21:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4f9e980985d16032899008787e4b4f9068a4e038f29ae3cfded7ade154ad2603","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T05:31:40.766777Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.15307/citation-record","integrity":"/paper/2607.15307/integrity","json":"/paper/2607.15307/citation-record.json","paper":"/paper/2607.15307"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-02T05:31:40.708401Z","title":"A quantum approximate optimization algorithm,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.708401Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:0c23adc698ed57b918f8ae7a19e8c088be2202c973b53dd1c6f111655a09f3d4","observation_id":"ba83abb2-be4d-43e0-936e-c9596a47bfd9","resolution":{"observed_at":"2026-08-02T05:31:40.708401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:31:40.712519Z","title":"Safe reinforcement learning via shielding,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.712519Z"},"links":{"citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:232b09ed78d8e1a187666991fe924fe3da613765a42726ab4bb96e87beaf8611","observation_id":"e7c76226-9b36-41c7-80fe-49c7982a9f64","resolution":{"observed_at":"2026-08-02T05:31:40.712519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:31:40.716173Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.716173Z"},"links":{"citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:53db229384a50e6848cd2b2be1dc2090a0fe78b6b1859a8f72edc19288693d94","observation_id":"842cdd35-87cd-4e02-aaab-13d923539af3","resolution":{"observed_at":"2026-08-02T05:31:40.716173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:31:40.719885Z","title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.719885Z"},"links":{"citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:2db89b911374476f2a8a4c6fcf6f95408442ac81d39273d4a64eeb5215a5b559","observation_id":"6e495a9c-36aa-403f-8e81-6fc8a33cafbc","resolution":{"observed_at":"2026-08-02T05:31:40.719885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:31:40.723313Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.723313Z"},"links":{"citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:153e272e54e21a8d6802a911a0622b0b3c7c46f65aaab2c0468d0f3e7a3cf662","observation_id":"49568211-7bd5-487d-a6ec-1f731c3549f1","resolution":{"observed_at":"2026-08-02T05:31:40.723313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:31:40.728188Z","title":"Quantum computing with Qiskit,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.728188Z"},"links":{"citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:b5b0c15463d4746293bc51bce405e2fa6eecca63238eb2d47407fc1da7ff1ead","observation_id":"b86176e4-ed39-49ab-8f02-867a72b157d6","resolution":{"observed_at":"2026-08-02T05:31:40.728188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:31:40.734715Z","title":"Using reinforcement learning to perform qubit routing in quantum compilers,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.734715Z"},"links":{"citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:1f39588d8c633cd87d7dcb277fc7ad62f40de5d6e9b0eb32f14de614b79412e2","observation_id":"ae9ccfe6-ec8d-4ffe-a511-646c4de76078","resolution":{"observed_at":"2026-08-02T05:31:40.734715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:31:40.738536Z","title":"Noise-adaptive compiler mappings for noisy intermediate-scale quantum computers,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.738536Z"},"links":{"citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:c914445f0121377bd970ae05bde458a31aec3447ed7dc3b1f08736b1dab4f25f","observation_id":"1d5965bf-116f-46fa-bb40-1c511cb44100","resolution":{"observed_at":"2026-08-02T05:31:40.738536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.07585","last_updated":"2021-03-13T00:49:51Z","snapshot_observed_at":"2026-08-09T09:41:08.515997Z","submitted_at":"2021-03-13T00:49:51Z","title":"Quantum circuit optimization with deep reinforcement learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.07585","snapshot_observed_at":"2026-08-02T05:31:40.743070Z","title":"Quantum circuit optimization with deep reinforcement learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.743070Z"},"links":{"cited_paper":"/paper/2103.07585","citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:29fa5a7b3c440e587f35f3cab30b63708e33de22aa263ad08681066feeae6d99","observation_id":"23e30609-28c3-47fd-99a5-e08e9e7095b9","resolution":{"observed_at":"2026-08-02T05:31:40.743070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:31:40.747796Z","title":"Compiler optimization for quantum computing using reinforcement learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.747796Z"},"links":{"citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:a3f20461de370a24290a556b016bdb57ba7d8c15cbbe6faa799451068ffa74b9","observation_id":"6d200e4b-729e-4273-b99a-c2078e7fcc41","resolution":{"observed_at":"2026-08-02T05:31:40.747796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:31:40.751568Z","title":"Reinforcement learning for adaptive composition of quantum circuit optimisation passes,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.751568Z"},"links":{"citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:695fea747495ab5af70e538e942e4cf3e6365b772d079389e4c657ba83d0ffdd","observation_id":"e76ca2a3-04a3-478d-94f9-2784acb5dd7b","resolution":{"observed_at":"2026-08-02T05:31:40.751568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.05115","last_updated":"2024-10-07T15:10:54Z","snapshot_observed_at":"2026-08-09T13:21:13.454499Z","submitted_at":"2024-10-07T15:10:54Z","title":"AlphaRouter: Quantum Circuit Routing with Reinforcement Learning and Tree Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.05115","snapshot_observed_at":"2026-08-02T05:31:40.754648Z","title":"AlphaRouter: Quantum circuit routing with reinforcement learning and tree search,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.754648Z"},"links":{"cited_paper":"/paper/2410.05115","citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:2e270bdfb46685b16f658d154263cecd51de7f12026652cfd2bdbf10b8a452a0","observation_id":"f7f45f23-5576-4e9c-a21e-781271eaea6d","resolution":{"observed_at":"2026-08-02T05:31:40.754648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13196","last_updated":"2025-02-26T15:38:25Z","snapshot_observed_at":"2026-08-06T14:14:40.195625Z","submitted_at":"2024-05-21T20:59:12Z","title":"Practical and efficient quantum circuit synthesis and transpiling with Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13196","snapshot_observed_at":"2026-08-02T05:31:40.758924Z","title":"Practical and efficient quantum circuit syn- thesis and transpiling with reinforcement learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.758924Z"},"links":{"cited_paper":"/paper/2405.13196","citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:7c3f3312f39b2a4eeee1d620683e990fe9fe5fd1890a9d6df53700d06b492f97","observation_id":"43451cd6-aad8-41b7-9736-0484154a05e5","resolution":{"observed_at":"2026-08-02T05:31:40.758924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T05:31:40.762839Z","title":"Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.762839Z"},"links":{"citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:cd1209f7e065a6ba0b53ba90afea5d7a55ad12a7db6bcde877de6a76ded72440","observation_id":"96d0017f-5897-48df-b30a-798396378cde","resolution":{"observed_at":"2026-08-02T05:31:40.762839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.12816","last_updated":"2026-07-23T02:14:40Z","snapshot_observed_at":"2026-08-02T11:45:31.277014Z","submitted_at":"2026-06-11T02:21:49Z","title":"Graph Reinforcement Learning for Calibration-Aware Quantum Circuit Routing","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.12816","snapshot_observed_at":"2026-08-02T05:31:40.766777Z","title":"Graph reinforcement learning for calibration-aware quantum circuit routing,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T05:31:40.766777Z"},"links":{"cited_paper":"/paper/2606.12816","citing_paper":"/paper/2607.15307"},"observation_digest":"sha256:628e1c800eb1ee7bc0eba33d19e23131ff95f4babddf1bfce6885e7901c35ddb","observation_id":"690cb58c-5be9-4d91-82bb-98f2e95929fe","resolution":{"observed_at":"2026-08-02T05:31:40.766777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.15307","last_updated":"2026-07-15T00:08:45Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-09T13:20:57.826136Z","submitted_at":"2026-07-15T00:08:45Z","title":"Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":15},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2607.15307."}