{"as_of":"2026-08-10T20:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1198da0a32ba211d324d43325a9979ae0a354e0ae47a7266745b2f45f05ad64f","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:54:13.752771Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-13T04:52:17.285444Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1812.11619","last_updated":"2019-01-26T20:13:48Z","snapshot_observed_at":"2026-08-01T19:29:44.205371Z","submitted_at":"2018-12-30T22:19:09Z","title":"Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.11619","snapshot_observed_at":"2026-08-07T12:54:13.752771Z","title":"Using reinforcement learning to find efficient qubit routing policies for deployment in near- term quantum computers,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.23860","last_updated":"2025-06-30T12:33:19Z","snapshot_observed_at":"2026-08-07T22:29:53.792060Z","submitted_at":"2025-05-29T08:15:23Z","title":"Quantum computing and artificial intelligence: status and perspectives","version":3},"reference_index":133,"source":"pdf_text","source_observed_at":"2026-08-07T12:54:13.752771Z"},"links":{"cited_paper":"/paper/1812.11619","citing_paper":"/paper/2505.23860"},"observation_digest":"sha256:a745f79cfb74b4e59f8c2108c6bf8a9f2eb1bf20789e51f0fe32adeb426d4909","observation_id":"8e66238b-d624-4295-8fbf-255b45802f03","resolution":{"observed_at":"2026-08-07T12:54:13.752771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.11619","last_updated":"2019-01-26T20:13:48Z","snapshot_observed_at":"2026-08-01T19:29:44.205371Z","submitted_at":"2018-12-30T22:19:09Z","title":"Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.11619","snapshot_observed_at":"2026-08-06T18:01:59.191610Z","title":"Using reinforcement learning to find effi- cient qubit routing policies for deployment in near-term quantum computers","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.09781","last_updated":"2026-07-27T19:52:26Z","snapshot_observed_at":"2026-08-06T17:45:06.642517Z","submitted_at":"2025-07-13T20:33:48Z","title":"Decomposition of multi-qutrit gates generated by Weyl-Heisenberg strings","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T18:01:59.191610Z"},"links":{"cited_paper":"/paper/1812.11619","citing_paper":"/paper/2507.09781"},"observation_digest":"sha256:9edced46e73141c6e1c6f0f213be932e5c3c39ba833ad360fb55301b81e27f10","observation_id":"cc1c0b25-a36d-4807-a4f9-95629bb4ebe3","resolution":{"observed_at":"2026-08-06T18:01:59.191610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.11619","last_updated":"2019-01-26T20:13:48Z","snapshot_observed_at":"2026-08-01T19:29:44.205371Z","submitted_at":"2018-12-30T22:19:09Z","title":"Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers","version":2},"cited_work":{"arxiv_id":"1812.11619","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1812.11619","snapshot_observed_at":"2026-07-04T23:21:02.817441Z","title":"Using reinforcement learning to find efficient qubit routing policies for deployment in near-term quantum computers","venue":null,"work_id":"5c84de2c-8f6d-41c9-8aad-cf8756ab4c6a","year":2018},"citing_paper":{"arxiv_id":"2605.12365","last_updated":"2026-05-12T16:34:01Z","snapshot_observed_at":"2026-07-06T23:24:03.984179Z","submitted_at":"2026-05-12T16:34:01Z","title":"QAP-Router: Tackling Qubit Routing as Dynamic Quadratic Assignment with Reinforcement Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-13T04:45:38.590809Z"},"links":{"cited_paper":"/paper/1812.11619","citing_paper":"/paper/2605.12365"},"observation_digest":"sha256:6605604a0b034c81ad9eebe6df1cde41487c34a9e6e037ae088f544417aeb96d","observation_id":"8dbd9247-859f-427c-938c-d343888f548c","resolution":{"observed_at":"2026-07-04T23:21:02.817441Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1812.11619/citation-record","integrity":"/paper/1812.11619/integrity","json":"/paper/1812.11619/citation-record.json","paper":"/paper/1812.11619"},"outbound":[],"paper":{"arxiv_id":"1812.11619","last_updated":"2019-01-26T20:13:48Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-01T19:29:44.205371Z","submitted_at":"2018-12-30T22:19:09Z","title":"Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1812.11619."}