{"as_of":"2026-08-13T03:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:479e3c965b3937d11b679307d45149c150cde03b1d80980e0d05019fda01bf7e","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:58:52.854249Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2506.12462/citation-record","integrity":"/paper/2506.12462/integrity","json":"/paper/2506.12462/citation-record.json","paper":"/paper/2506.12462"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:58.600095Z","title":"Quantum inter- net: A vision for the road ahead,","venue":null,"work_id":"0cc9d1d6-335d-4a7c-9a7d-5d1b0e013ade","year":2018},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:49.731633Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:3578281cdd0f373937db1d8ba77a0e635dd01e037db6fbf89f65c2fd39a469c5","observation_id":"27963fec-fe94-4ac1-9214-b8765c82c1b9","resolution":{"observed_at":"2026-08-07T00:58:58.707486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:49.791050Z","title":"Quantum sensing,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:49.791050Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:98668dccc13f5bb3737327b77840d92347fad5f2c75427481d5f253bbab67ccf","observation_id":"ccdc6453-f53f-414f-8db0-f44ff53bb617","resolution":{"observed_at":"2026-08-07T00:58:49.791050Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:58.352765Z","title":"Quantum cryptography: Public key distribution and coin tossing,","venue":null,"work_id":"d53a37dc-b43c-4874-a8be-a582174b7bdd","year":1984},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:49.879297Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:aec8c557a57a253f6a2a50ed785ac32d15f23b0defb3f1fdaaab2b95804ccf43","observation_id":"066ba634-8faf-4f6e-b30e-7e3a1762a21c","resolution":{"observed_at":"2026-08-07T00:58:58.472973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:49.969540Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:49.969540Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:f728fa1b4b59ff97439bb2a44b2a41016ad125e74aff3b4cd65c88c351c2731f","observation_id":"e0c1ce51-6d6f-4708-8051-8c1268068c81","resolution":{"observed_at":"2026-08-07T00:58:49.969540Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:58.090862Z","title":"Quantum repeaters: the role of imperfect local operations in quan- tum communication,","venue":null,"work_id":"dda572ae-7b4e-46d0-b195-1ea54fd703df","year":1998},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:50.063476Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:79157ddbd0040a99a44eb93212875605af50263a8eb8e5b3efb48560bc5881c5","observation_id":"0fe9a19e-582d-4f51-bd64-cb9ba8d47cff","resolution":{"observed_at":"2026-08-07T00:58:58.232018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.04116","last_updated":"2023-05-22T03:13:08Z","snapshot_observed_at":"2026-08-09T08:54:44.166518Z","submitted_at":"2021-10-08T13:24:29Z","title":"Entanglement Swapping in Quantum Switches: Protocol Design and Stability Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.04116","snapshot_observed_at":"2026-08-07T00:58:50.156271Z","title":"Entanglement swapping in quantum switches: Protocol design and stability analysis,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:50.156271Z"},"links":{"cited_paper":"/paper/2110.04116","citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:9a1e90101f72132004357ff45985e82cf450a2f0f108faed353c58544fdb8e57","observation_id":"e8fec3f5-4f60-4c5f-8bf4-fe3e0e37b22d","resolution":{"observed_at":"2026-08-07T00:58:50.156271Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:57.856262Z","title":"A single quantum cannot be cloned,","venue":null,"work_id":"2affdc46-2989-4352-b673-bd47cd8982ee","year":1982},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:50.253445Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:ca9090823ebe213a8b36b5241fadf7ce501af617258b700165f2dab20b3b36c8","observation_id":"9542739e-ea55-4ecd-ac6d-876cc2364eca","resolution":{"observed_at":"2026-08-07T00:58:57.965874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:57.615670Z","title":"A benchmarking procedure for quantum networks,","venue":null,"work_id":"fa5be9c3-bcab-4407-ad1c-15885af2e190","year":2023},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:50.393416Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:87733f8b1f1979696830d204a5581c5c499d5614508c93abdd92823f134b5076","observation_id":"30651e27-f8e2-43c8-8c40-259534b03789","resolution":{"observed_at":"2026-08-07T00:58:57.736908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:57.366331Z","title":"Netsquid, a net- work simulator for quantum information using discrete events,","venue":null,"work_id":"8837f0a3-383b-48ef-940f-b9bbd7f74d03","year":2021},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:50.482364Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:544c19b7c707c971b58425bdef5eb66587a0f9632246dd0213637d5b05881977","observation_id":"6e9e0342-c6b2-4b79-beca-a3a27e3164af","resolution":{"observed_at":"2026-08-07T00:58:57.477262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:57.106832Z","title":"Optimal architectures for long dis- tance quantum communication,","venue":null,"work_id":"d7263a16-9db1-4c6a-967e-4d6c2612c033","year":2016},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:50.593729Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:e4d4c125c1208458eed623ddd81dc458d6fba40f63efe463db80303a4eb257a3","observation_id":"fcd3eca6-fff6-4dc2-acb7-10adfef33d86","resolution":{"observed_at":"2026-08-07T00:58:57.249716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:56.865478Z","title":"Quantum communication without the necessity of quantum memories,","venue":null,"work_id":"f8f8e4e1-5db6-4bb0-8688-9e6052472341","year":2012},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:50.678419Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:706d625aa80d243f283d9363e4000af9447d2d5389d4c472d0d5d3ecc80231c8","observation_id":"3707a253-382a-4e28-bd6a-883a2b25a1a6","resolution":{"observed_at":"2026-08-07T00:58:56.976517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:56.657220Z","title":"Charac- terizing quantum gates via randomized benchmarking,","venue":null,"work_id":"53186d04-f38e-4654-89a8-c992c16ad738","year":2012},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:50.779876Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:e951a03c1260b8772b3e254583a86b8a0fabf209b93baa8fd47fe3a52fc84d72","observation_id":"512b5ea8-70a1-4509-a15c-ad385398a725","resolution":{"observed_at":"2026-08-07T00:58:56.780917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9807006","last_updated":"1998-07-01T19:34:39Z","snapshot_observed_at":"2026-08-12T22:38:58.891332Z","submitted_at":"1998-07-01T19:34:39Z","title":"The Heisenberg Representation of Quantum Computers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9807006","snapshot_observed_at":"2026-08-07T00:58:50.877791Z","title":"The Heisenberg representation of quan- tum computers,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:50.877791Z"},"links":{"cited_paper":"/paper/quant-ph/9807006","citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:9241c89ce5691773ebabfa685e45123d3c496fcc539a7c080e4b844c772cd6a1","observation_id":"9511b8a6-afc3-4c09-b30b-81f683d4de2a","resolution":{"observed_at":"2026-08-07T00:58:50.877791Z","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-07T00:58:50.986204Z","title":"Quantum network utility maximization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:50.986204Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:0b780d1feabc57393393d292abc886676a6116f652fc600d309acae3918827bd","observation_id":"3ddabbe9-c817-4bd9-a149-6327f72cf8af","resolution":{"observed_at":"2026-08-07T00:58:50.986204Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:56.344962Z","title":"LinkSelFiE: Link Selection and Fidelity Estimation in Quantum Networks,","venue":null,"work_id":"d771b39a-4874-47d4-b624-a2e79bb2875b","year":2024},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:51.073829Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:4e2600e7e950315b2156a7b51e72b8c8ffabcc9c4785745047c641a5a68ea5c6","observation_id":"f8c0fde9-3c20-4d0d-b292-6443dafb7de0","resolution":{"observed_at":"2026-08-07T00:58:56.517186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:56.062015Z","title":"A note on two problems in connexion with graphs,","venue":null,"work_id":"087274e8-7f5a-4986-97f4-195a0661f090","year":1959},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:51.213297Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:7bfe7616278ef3e25d40feabecc98a56c9176fa55ef3a358b5888789f051b296","observation_id":"cfba6b2e-9c94-4da9-bdab-c115a70eb8b5","resolution":{"observed_at":"2026-08-07T00:58:56.214561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:55.792267Z","title":"Combinatorial pure exploration of multi-armed ban- dits,","venue":null,"work_id":"71531678-b34b-42f7-b6f5-ea200d9430f1","year":2014},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:51.328761Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:bda9ecdf89934365aab515bd64ee2343d7ccfb66d53d2aec5f53604317105db7","observation_id":"d3290fd6-4fe8-4972-b27d-d531aa0593c7","resolution":{"observed_at":"2026-08-07T00:58:55.916949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:55.532360Z","title":"Best arm identification in linear bandits with linear dimension dependency,","venue":null,"work_id":"737b1e9c-3779-4fd2-b41c-99d416dc28f9","year":2018},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:51.412349Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:e2a77c8560b80cf343f9d65c8b021d1056e698f621ac12bec64f7cd6bc25b78a","observation_id":"3b0bd72f-1472-4006-81dd-0f57bd622a40","resolution":{"observed_at":"2026-08-07T00:58:55.648219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:55.276219Z","title":"Quantum cryptography based on Bell’s theorem,","venue":null,"work_id":"83ee840e-3e47-4805-91bf-bf8ca5d0d90f","year":1991},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:51.506639Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:36d8f4ee28931c0a95369bb6f5a42bd554d4a626602b598db97bd3c1c091b7ac","observation_id":"1176ceeb-130c-4fe0-8ca9-57c17d90f312","resolution":{"observed_at":"2026-08-07T00:58:55.361011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:51.597831Z","title":"Quantum cryptography using any two nonorthogonal states,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:51.597831Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:84ed85d13629d9d86f966c11869a8dd155e5e6b3d533076a32aaf4cd48e1c43e","observation_id":"66a193c2-0979-45e8-bb9a-5017afb85e58","resolution":{"observed_at":"2026-08-07T00:58:51.597831Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:55.107392Z","title":"Simple proof of security of the BB84 quantum key distribution protocol,","venue":null,"work_id":"449f0922-2e9b-4043-84c9-e46853fee928","year":2000},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:51.688807Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:021e06be4263a2ec30ad23d8a5dd9f0b5bd13632d3ac97334d24d9be791dd991","observation_id":"e122a415-c185-4700-8a36-0c8f3237423e","resolution":{"observed_at":"2026-08-07T00:58:55.157857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:54.967453Z","title":"Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning prob- lems,","venue":null,"work_id":"c208471e-55d4-4613-a7e2-bfc466b264c5","year":2006},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:51.790565Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:d600c58ecb0c6a420902296e2ad1f2a108b5a214530ab822d6c218cfd85689bb","observation_id":"8bf73675-4c2b-42dd-9a93-1e921a94119f","resolution":{"observed_at":"2026-08-07T00:58:55.032336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:54.714793Z","title":"Randomized benchmarking of quantum gates,","venue":null,"work_id":"aa2dcaf6-568b-413f-95ab-05d65d8b66d5","year":2008},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:51.900850Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:4d1809e06e5c6be3f88a2f5237dab948b62bd7c484146d903c7bf5ba4cc50aaf","observation_id":"fd1781ac-1d6c-4fdd-85f9-e51d8b977aa4","resolution":{"observed_at":"2026-08-07T00:58:54.805281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:51.993395Z","title":"Path selection for quantum repeater networks,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:51.993395Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:73531491045a085f2595f1d9685e3708184bc52eb1a36b7284b37248a1602662","observation_id":"37ff14a3-7941-4440-83bc-8b217f62f05e","resolution":{"observed_at":"2026-08-07T00:58:51.993395Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:54.529358Z","title":"Quantum BGP with Online Path Selection via Network Benchmarking,","venue":null,"work_id":"3d4f5cc4-ff7b-45b6-9d13-405df8c25278","year":2024},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:52.121411Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:d8dbed6317b98457d657ddd2face737150131263fe4308704bf79fcdbcfc0cfb","observation_id":"59716fcf-0ebe-4f7f-80e0-05f35afc88e4","resolution":{"observed_at":"2026-08-07T00:58:54.607615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:54.319793Z","title":"E2E fidelity aware routing and purification for throughput maximization in quantum networks,","venue":null,"work_id":"17c886d2-c3ad-4aca-a830-48f1784c25c6","year":2022},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:52.224095Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:8ecfd48f5bcb7da3e4651b91e743a051fc8c120d0a60f658e4741e29df02d89d","observation_id":"daa93540-24c6-4ab8-9132-c81734f7668d","resolution":{"observed_at":"2026-08-07T00:58:54.424549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:54.103378Z","title":"Multi- entanglement routing design over quantum networks,","venue":null,"work_id":"6621e9bb-67d5-4051-a49b-405165ef8262","year":2022},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:52.264373Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:377db33d28c1e0bbdd1c19ee1c0de01efee836227d0162a88c11ef1a507446a9","observation_id":"d06bf1a1-ff94-4ed2-b33c-0ff22d2c4d88","resolution":{"observed_at":"2026-08-07T00:58:54.189954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:53.914114Z","title":"Quantum Networks with Multiple Service Providers: Transport Layer Protocols and Research Opportunities,","venue":null,"work_id":"a565ae73-0ae5-4535-9088-235242a09aa2","year":2022},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:52.353755Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:22d4cea628dc56ba78d31ecf374616e1e1afb860cb1877074c08553c56dfd41a","observation_id":"a94a4212-e745-4b65-a577-76aed615c8a5","resolution":{"observed_at":"2026-08-07T00:58:53.994838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:53.686521Z","title":"Combinatorial Pure Ex- ploration with Bottleneck Reward Function,","venue":null,"work_id":"21e0e84a-ffb2-4ca7-ad55-be5d76f4e326","year":2021},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:52.472525Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:faa2c7fdff719f798aa5e52a76fdc00d2092ae5ee45933de5bdca261b803ddbf","observation_id":"7ffd1737-0df2-4f18-b1f6-b53c3709fd95","resolution":{"observed_at":"2026-08-07T00:58:53.805073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:53.458019Z","title":"Therefore, we have P(∩ ∞ t=1Et)⩾1− ∞X t=1 P(¬Et) (a) ⩾1− ∞X t=1 δ 2t2 = 1− π2 12 δ⩾1−δ, where inequality (a) is due to (10)","venue":null,"work_id":"92b036cb-0052-469e-ac4f-c066931b8830","year":null},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:52.601273Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:5ed35460f9dfe53ec73666637fe023331fe756bd4d48139fe61ffa15909b6924","observation_id":"9b85e3ef-87eb-4dab-9e99-8b47ee88bce3","resolution":{"observed_at":"2026-08-07T00:58:53.539410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:53.233726Z","title":"That is, when the algorithm terminates at time slott, the output arm ˆkt is equal to the best pathk ∗","venue":null,"work_id":"8ad371d0-7e9c-498d-856f-9397b2829e90","year":null},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:52.719697Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:0861ef2da6649a36a21f2269d7750dac527c4b0abaf970ac17d8500a6cee7625","observation_id":"bde5bc47-f49c-4b12-8b45-714635e5a432","resolution":{"observed_at":"2026-08-07T00:58:53.372177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:58:53.053131Z","title":"To prove the above statement via contradiction, we assume thatℓ t =ℓ ′ andrad ℓ′,t ⩽ ∆ℓ′ 6Lmax","venue":null,"work_id":"aa51e232-8234-47e2-8ddd-567b9d8d7ab7","year":null},"citing_paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T00:58:52.854249Z"},"links":{"citing_paper":"/paper/2506.12462"},"observation_digest":"sha256:c3d3a11432b4c407ef4543945db2f9d08e500ac2d555237ca1c68b7af3fe33cc","observation_id":"09934f30-9c90-4ccd-9da2-7aac7dc0b302","resolution":{"observed_at":"2026-08-07T00:58:53.125216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.12462","last_updated":"2025-06-14T12:01:16Z","latest_version":1,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-09T11:17:17.539036Z","submitted_at":"2025-06-14T12:01:16Z","title":"Learning Best Paths in Quantum Networks"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":25},"total_outbound_references":32},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2506.12462."}