{"as_of":"2026-08-11T17:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bd4c7eee3ed487ff8c667d21fb063ef68d1637059ed7be54c2978cbbad0cf4d9","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:40:30.733525Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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-05T21:11:47.686369Z","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-07-10T12:15:01.137692Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.03035","snapshot_observed_at":"2026-08-05T21:11:47.686369Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.09380","last_updated":"2025-08-12T22:35:01Z","snapshot_observed_at":"2026-08-09T23:20:18.644834Z","submitted_at":"2025-08-12T22:35:01Z","title":"Parallel repetition of expanded, and multiplayer, Quantum games: anchoring, optimal values, generalized error bounds, dependency-breaking as symmetry-breaking","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T21:11:47.686369Z"},"links":{"cited_paper":"/paper/2507.03035","citing_paper":"/paper/2508.09380"},"observation_digest":"sha256:5f20f64fa78070dd4c8467b37f34e1a419910342998a0a831867332872b5fe21","observation_id":"2b3b4f47-ff9f-49e2-b283-2a6c9bd94e9c","resolution":{"observed_at":"2026-08-05T21:11:47.686369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.03035","snapshot_observed_at":"2026-08-04T13:00:00.605101Z","title":"arXiv: 2507.03035 (submitted) (2025) https://doi.org/10","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.02402","last_updated":"2026-06-30T21:44:34Z","snapshot_observed_at":"2026-08-08T06:09:59.409594Z","submitted_at":"2025-10-01T21:52:00Z","title":"Probability distributions over CSS codes: two-universality, QKD hashing, collision bounds, security","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T13:00:00.605101Z"},"links":{"cited_paper":"/paper/2507.03035","citing_paper":"/paper/2510.02402"},"observation_digest":"sha256:92d74badab4779214c4b100626e9db0f8d46853740de7952f0f142ff26eb2a7c","observation_id":"a3c85f27-5022-45f5-a276-e25e7325cc10","resolution":{"observed_at":"2026-08-04T13:00:00.605101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"cited_work":{"arxiv_id":"2507.03035","doi":"10.48550/arxiv.2507.03035","metadata_source":"arxiv_reference","pith_arxiv_id":"2507.03035","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Error correction, authentication, and false acceptance, probabilities for commu- nication over noisy quantum channels: converse upper bounds on the bit transmission rate","venue":null,"work_id":"569ad4a4-a8d2-43d0-bbd6-31c00b62deae","year":2025},"citing_paper":{"arxiv_id":"2605.08259","last_updated":"2026-05-07T21:57:54Z","snapshot_observed_at":"2026-07-06T23:20:28.875586Z","submitted_at":"2026-05-07T21:57:54Z","title":"Multiplayer parallel repetition without dependency-breaking and anchoring variables: monotonic, concave amplification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-12T01:22:22.422949Z"},"links":{"cited_paper":"/paper/2507.03035","citing_paper":"/paper/2605.08259"},"observation_digest":"sha256:e05993663e8868332165fa07537a78d3dc6cdb985b42c774bf4fd784999a5ad0","observation_id":"9f453dff-20dd-44ca-9717-c5f46c1c1b68","resolution":{"observed_at":"2026-05-12T01:31:16.313860Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.03035/citation-record","integrity":"/paper/2507.03035/integrity","json":"/paper/2507.03035/citation-record.json","paper":"/paper/2507.03035"},"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-06T20:40:34.650728Z","title":"classical two way communication in xor games","venue":null,"work_id":"9b461810-fa13-4f99-bb1d-0597ad3ffe4f","year":2021},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:25.293141Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:bfb78c72c7d4d0b4210cf44d3cbb311c4eb71d2ac040a91084c89b9173732424","observation_id":"228f7e0d-368b-4e02-bdfc-1dc92922f1e0","resolution":{"observed_at":"2026-08-06T20:40:34.725661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:40:25.360298Z","title":"STACS 12, 1–12 (2019) https://doi.org/10.4230/LIPIcs.STACS.2019.12","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:25.360298Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:a952fe68850ee154f26eb429c6f2b8639332ebf816624dbae64ff9cf8bc73062","observation_id":"e3aed751-96eb-4bda-a65a-bca207c3a46a","resolution":{"observed_at":"2026-08-06T20:40:25.360298Z","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-06T20:40:25.422222Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:25.422222Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:26619bdc4f1fb38e398c28d5429b8d0fc0e28272edc262cf29c26c0c4b636249","observation_id":"228dfa53-1c34-49ce-b23b-39eaca5bdd63","resolution":{"observed_at":"2026-08-06T20:40:25.422222Z","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-06T20:40:25.517882Z","title":"Theoretical Computer Science 358, 3–14 (2006) https://doi.org/10.1016/j.tcs.2005.08.035","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:25.517882Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:46d8ce4f1425306e6279080883d9050e8e370c1476f1ee5936aa67e35214c6fc","observation_id":"d8ad93e2-b24e-4612-a8d4-ae11a71f07ee","resolution":{"observed_at":"2026-08-06T20:40:25.517882Z","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-06T20:40:34.479715Z","title":null,"venue":null,"work_id":"2c711cca-f3e7-44fc-86d5-c0557ff33fde","year":2005},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:25.602120Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:2af35c847990919a1846572ca283465dfdc872ac56b6e0b7b401db87dbf86f73","observation_id":"7c9a432c-51b2-4819-86be-23d303783bec","resolution":{"observed_at":"2026-08-06T20:40:34.580732Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:40:25.644527Z","title":"Phys Rev Applied16(044057) (2021) https://doi.org/10.1103/PhysRevApplied.16.044057 80","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:25.644527Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:1507db27423ceb3270d5a3b3ab9495f354e57ebe012f80eeba34080d7d9fd89b","observation_id":"b6ca2598-9879-4093-9fa2-3551282c4014","resolution":{"observed_at":"2026-08-06T20:40:25.644527Z","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-06T20:40:25.729786Z","title":"Phys- ical Review Letters 127(120502) (2021) https://doi.org/10.1103/PhysRevLett","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:25.729786Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:5391d0acf08b45e5c9b1b417a6d97fda1ffa148baa291f21f8317bf5ab338716","observation_id":"b8a41c4c-b800-46c3-a8c7-6129523e02af","resolution":{"observed_at":"2026-08-06T20:40:25.729786Z","resolver_source":null,"status":"malformed_identifier"},"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-06T20:40:34.303102Z","title":null,"venue":null,"work_id":"01dd7f4b-1e0f-473d-9a48-a346e91de552","year":2024},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:25.821607Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:808f78954531eeab5df9216a253d6fafe3e20d2e4747b728c5e92147de74564a","observation_id":"b52cd610-5cae-4047-93f7-ddc888a3d96b","resolution":{"observed_at":"2026-08-06T20:40:34.386154Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:40:25.902661Z","title":"Physical Review Research 4(043119) (2022) https://doi","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:25.902661Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:1f63e15b689e924fdcc77a002303dd54019825198d8b78b21c7e38d9de2cda0d","observation_id":"8afb81fd-8de0-47f5-9207-4f8117ccea5c","resolution":{"observed_at":"2026-08-06T20:40:25.902661Z","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-06T20:40:34.131718Z","title":"New Journal of Physics 18(073011) (2016) https://doi.org/10","venue":null,"work_id":"71156803-9d1a-4a9f-a0ea-87258b644176","year":2016},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:26.023196Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:d08773fb2c37163c2e732d2d7126c52f000c13920652ddce880882f30264bdd1","observation_id":"0b595bca-a839-450e-b09f-79a4708317e1","resolution":{"observed_at":"2026-08-06T20:40:34.221858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.13138","last_updated":"2020-04-21T02:37:44Z","snapshot_observed_at":"2026-08-11T05:32:53.910830Z","submitted_at":"2020-04-21T02:37:44Z","title":"Investigating the Effectiveness of Representations Based on Pretrained Transformer-based Language Models in Active Learning for Labelling Text Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.13138","snapshot_observed_at":"2026-08-06T20:40:26.122601Z","title":"19th IEEE Annual Conference on Computational Complexity Proceedings, 236–249 (2004) https://doi.org/10.1109/CCC.2004.1313847","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:26.122601Z"},"links":{"cited_paper":"/paper/2004.13138","citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:bdf3517ddd728edcc3d9eeb6324be2b502197f49536af3c7333f9b9a0cc1b6d8","observation_id":"d9e96766-d37c-4e79-8f2e-d63e3e68f39c","resolution":{"observed_at":"2026-08-06T20:40:26.122601Z","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-06T20:40:26.229861Z","title":"IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 920–929 (2024) https://doi.org/10.1109/FOCS61266.2024.00061","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:26.229861Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:992b4afa2195cc7750bf45f84703bdea30c7bbf59d45c0b002f2c23a4162432f","observation_id":"6a2fd015-ac89-43cb-b298-4b96fc4fc5ef","resolution":{"observed_at":"2026-08-06T20:40:26.229861Z","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-06T20:40:26.304286Z","title":"arXiv: 2402.17301 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:26.304286Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:6ce2a751c8bb3cbfd698915c563f193f4d57763f2c35b6c2fd637a7cc63cbf52","observation_id":"6a8eb9d9-f310-48d7-8fb7-6e49d05b70df","resolution":{"observed_at":"2026-08-06T20:40:26.304286Z","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-06T20:40:33.917350Z","title":"23rd Annual IEEE Conference on Computational Complexity 8 (2018)","venue":null,"work_id":"93619f37-980d-4c31-9d32-87dc4262d890","year":2018},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:26.384273Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:ff6ccfdfe6a37e2966f71a00eae158ad2fac072ef23e8f1b527a50e0ffa562e0","observation_id":"f52b431f-dfa3-4aee-9e26-fa3c1e019c46","resolution":{"observed_at":"2026-08-06T20:40:34.024102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:40:33.578646Z","title":"Srinivas, Cabello, A., al.: Experimental quantum advantage in the odd- cycle game","venue":null,"work_id":"d8be0bca-052c-4d4d-8b5c-a91883e94d6c","year":2025},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:26.483558Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:63129e2a73db30e5d5a1597813c7979682ca77761b117aaa7efe2404aaa63bfc","observation_id":"c5baec30-31e9-4eab-bf4c-efe6ddcda8c0","resolution":{"observed_at":"2026-08-06T20:40:33.758744Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:40:26.555085Z","title":"IEEE Transactions on Microwave Theory and Techniques 70(5), 2517–2525 (2022) https://doi.org/10.1109/TMTT.2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:26.555085Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:e75000e4402acbf72395c96b285f7e0d34c9bb23050688f53bb9404820a74de4","observation_id":"da58cb5a-c154-4140-96ce-64a476fd6a5e","resolution":{"observed_at":"2026-08-06T20:40:26.555085Z","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-06T20:40:26.633424Z","title":"PRX Quantum 3(020307) (2022) https://doi.org/ 10.1103/PRXQuantum.3.02030","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:26.633424Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:27010a1d75c0e3167b7dd2e94e11ab2039cace6097fbef2cd5177eef16ab43cb","observation_id":"e66a9545-f0f2-497e-9c96-812cf8a62ea1","resolution":{"observed_at":"2026-08-06T20:40:26.633424Z","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-06T20:40:26.738528Z","title":"Quantum Inf 81 Process 19(229) (2020) https://doi.org/10.1007/s11128-020-02717-","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:26.738528Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:042e233ce02641a6e7e3d3c7ac3e5e30a7977a04d3ad02c86bd18cb29fc3c0c3","observation_id":"8ea46d05-4ac9-4e72-b4c3-a80fca22c3a0","resolution":{"observed_at":"2026-08-06T20:40:26.738528Z","resolver_source":null,"status":"malformed_identifier"},"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-06T20:40:33.315620Z","title":"Advance in Neural Information Processing Systems 32 (2019)","venue":null,"work_id":"d7c9c2f6-dbec-442b-9c88-c195245963db","year":2019},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:26.809767Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:a05c2c5d45adfc7255b8b55cc608be59fae9810cdeca4f5225e2f600b812f20e","observation_id":"ca473f60-28b9-4411-befe-ddc8d63908bd","resolution":{"observed_at":"2026-08-06T20:40:33.442473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:40:26.896806Z","title":"Jour- nal of Physics A: Mathematical and Theoretical 52(43) (2019) https://doi.org/ 10.1088/1751-8121/ab3fe0","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:26.896806Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:f9984a2240733123aae554d49f0da3941614c0a7345c6e5e82d8d85687a58870","observation_id":"42673b3e-c281-4146-9d88-4d6625f25be4","resolution":{"observed_at":"2026-08-06T20:40:26.896806Z","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-06T20:40:33.126537Z","title":"Phys.Rev.A 108(032409) (2023) https://doi.org/10.1103/ PhysRevA.108.032409","venue":null,"work_id":"a0830c9c-030b-4e05-a067-557a8151da65","year":2023},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:26.990509Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:cd95266d85dbc02184d034b8c81b15264267566863e195927424960342af97ba","observation_id":"1d562269-1fa8-4b85-8049-f7e8016bde6b","resolution":{"observed_at":"2026-08-06T20:40:33.200770Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:40:32.968598Z","title":"AIAA 58(8) (2020)","venue":null,"work_id":"871c6ecb-b463-439e-acd6-37ecd0149711","year":2020},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:27.082316Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:4b48e68d5812df22fc290de117e5bcc6f5321d99990c04a1e9825a2fea614ac8","observation_id":"5cbe425d-c6d3-450a-a216-d5ac3eaccfff","resolution":{"observed_at":"2026-08-06T20:40:33.034645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:40:32.769339Z","title":null,"venue":null,"work_id":"d3c5c1cd-eae3-4339-9de0-c012ca3a9cc4","year":2024},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:27.171568Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:6e1df23d60839987c59e48b0830b55c59d3bd32d401778af845dd023203dead0","observation_id":"f143ec4c-3ae5-413b-8eed-535e41ada39a","resolution":{"observed_at":"2026-08-06T20:40:32.855384Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:40:27.261964Z","title":"IEEE Transactions on Information Theory 70(3), 1876– 1896 (2024) https://doi.org/10.1109/TIT.2023.3324527","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:27.261964Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:b68d9a1cb8e43124e987abf21ef1a5b1330fd9269c9c8c91df16c4be637eddba","observation_id":"12ffb873-1bf8-4877-b689-67a799a177bf","resolution":{"observed_at":"2026-08-06T20:40:27.261964Z","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-06T20:40:27.352533Z","title":"Quantum Machine Intelligence 4(3) (2022) https://doi.org/ 10.1007/s42484-021-00061-x","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:27.352533Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:cf1a82825572084ff4c4de794b0b3cbb6dbcdc7915b0fbedd4fed79dbd520494","observation_id":"4a31d913-eb48-4c00-ba1b-6e71df33d906","resolution":{"observed_at":"2026-08-06T20:40:27.352533Z","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-06T20:40:27.411171Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:27.411171Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:2b8396c118e70f628ca03937558a046360b95657a8782c154392c1db2475ca44","observation_id":"376c9778-c23a-4786-92c4-264ca2c002eb","resolution":{"observed_at":"2026-08-06T20:40:27.411171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.00738","last_updated":"2022-04-02T01:55:28Z","snapshot_observed_at":"2026-07-06T12:55:57.209283Z","submitted_at":"2022-04-02T01:55:28Z","title":"Data-Driven Quantum Approximate Optimization Algorithm for Cyber-Physical Power Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.00738","snapshot_observed_at":"2026-08-06T20:40:27.459506Z","title":"arXiv: 2204.00738 (2022) https: //doi.org/10.48550/arXiv.2204.00738","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:27.459506Z"},"links":{"cited_paper":"/paper/2204.00738","citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:c2187b835061151e820785865b484031c2ef698786a6ddf55d2ca42b2e76ee2e","observation_id":"64f53e7c-250d-4fed-b66a-ea4d989d44e5","resolution":{"observed_at":"2026-08-06T20:40:27.459506Z","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-06T20:40:32.557314Z","title":"Journal of the London Mathematical Society 110(5) (2024)","venue":null,"work_id":"6f31cc43-5e98-4ffa-93b3-07fb7c52ad0e","year":2024},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:27.518391Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:f11f7a8c50514d14cabaa7e55b001d9d60784b297f80ea62b67862f95c379df1","observation_id":"f6e4643e-4682-4053-abcf-c755a4babb50","resolution":{"observed_at":"2026-08-06T20:40:32.630726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:40:27.590171Z","title":"Physical Review A 103(052425) (2021) https://doi.org/10.1103/PhysRevA.103.052425","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:27.590171Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:df24c77c72324b9ce50ff7004d373bce59cbc6c69aaba73ac81864eb723d1c92","observation_id":"5bc0da63-0ef1-431b-8f5a-0ae957bc5adb","resolution":{"observed_at":"2026-08-06T20:40:27.590171Z","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-06T20:40:27.673782Z","title":"Linear Algebra and its Applications 400, 147–167 (2005) https://doi.org/10.48550/arXiv.math/ 0404553 82","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:27.673782Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:7ac0a9285d329ea4b2ab48fc4218d88508583353130549049dc44516380dcd86","observation_id":"6c501672-a93d-4dda-b1a1-862ef37ae28f","resolution":{"observed_at":"2026-08-06T20:40:27.673782Z","resolver_source":null,"status":"malformed_identifier"},"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-06T20:40:27.758709Z","title":"npj Quantum Information 4(14) (2008) https://doi.org/10.1038/s41534-018-0060-8","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:27.758709Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:4b996e616e85b078cfa0def98dde7f1b0c6567d98e0938306536232ae564f543","observation_id":"bcdf6bc9-4a93-4803-afa5-7bf9196deec8","resolution":{"observed_at":"2026-08-06T20:40:27.758709Z","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-06T20:40:27.829923Z","title":"Quantum Information Processing 20(393) (2021) https://doi.org/10.1007/s11128-021-03331-6","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:27.829923Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:5efa6ce9fc4b17a47c947415ba56073dae123e32579ed57d3dbbac89d40d90ad","observation_id":"d78233db-6c69-410d-89a2-fec4d60ad788","resolution":{"observed_at":"2026-08-06T20:40:27.829923Z","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-06T20:40:27.881976Z","title":"Scientific Reports 12(6379) (2022) https://doi.org/10.1038/s41598-022-10339-0","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:27.881976Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:af19b229e42839f83616636e0e08f7d3f63512be83b932760eaf229d85026a1d","observation_id":"a466c0b8-7a58-4841-9929-ab236cf34817","resolution":{"observed_at":"2026-08-06T20:40:27.881976Z","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-06T20:40:27.941388Z","title":"Journal of Chemical Theory and Computation 8(8), 2564–2568 (2012) https://doi.org/10.1021/ct300544e","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:27.941388Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:d9e794d94f238abc5859a09cfde649a41b9432ba211160b28dfc980a8974fe9f","observation_id":"092b2e7b-56d6-445b-ab6c-5318198ba90e","resolution":{"observed_at":"2026-08-06T20:40:27.941388Z","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-06T20:40:27.993596Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:27.993596Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:0441b7c3f3c14310ae5e14280cf68176ad4c490657e9c0bc434b96c4aa963fb4","observation_id":"22075fda-6bf1-4907-a4d4-a0adcb8c4dbc","resolution":{"observed_at":"2026-08-06T20:40:27.993596Z","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-06T20:40:28.051256Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:28.051256Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:4c05a0beb0e7156c20571f245f39fdfc528a437bf0d4ec26e3bf6ba5b840ab32","observation_id":"a4f62d37-0976-4b30-9a7b-9d0503f3a8b0","resolution":{"observed_at":"2026-08-06T20:40:28.051256Z","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-06T20:40:28.104052Z","title":"Quantum Information and Computation 16(13-14), 1191–1211 (2016) https://doi.org/10.26421/QIC16.13-14-6","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:28.104052Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:43254abc7f87d8f48fa7b7948313a9d48c85c5dd815f9246a48cd2ca0cce4671","observation_id":"63d5e47c-ce73-4dde-9f06-7626e9719a49","resolution":{"observed_at":"2026-08-06T20:40:28.104052Z","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-06T20:40:28.202938Z","title":"IEEE International Symposium on Information Theory 10(1109), 622–626 (2019) https://doi.org/10.1109/ISIT.2019.8849510","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:28.202938Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:f164fe5ae1f4199a35cf4d61e3ed8024f10571dc921d75c89849d63414cb7835","observation_id":"f1dbc44f-4361-4cbe-bedf-b12d458dcc20","resolution":{"observed_at":"2026-08-06T20:40:28.202938Z","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-06T20:40:32.249805Z","title":"Physical Review A 107(032428) (2023) https://doi.org/10","venue":null,"work_id":"0af22c87-65fb-4d8e-80c4-133d09facccc","year":2023},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:28.312479Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:d9129af5fb89dec453ce21d927b7d9039513c1f29d7fbefa470a9767367c389a","observation_id":"97b4f264-5ae2-467e-ad78-d76659f09648","resolution":{"observed_at":"2026-08-06T20:40:32.408637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:40:28.562413Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:28.562413Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:e456fb9ecd75b39ab7026cdd4040977959b31eedb178ad166fde9388c3231cc2","observation_id":"5f0b8342-1877-4fc6-ad55-241efdc3d472","resolution":{"observed_at":"2026-08-06T20:40:28.562413Z","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-06T20:40:28.997342Z","title":"Journal of Physics A: Mathematical and Theoretical 55(085301) (2022) https://doi.org/10.1088/1751-8121/ac4b15 83","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:28.997342Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:312331bbb3f20d5ecdbc2b5f47f7d8d8638b868cc9c2fb8af58797e699a3996e","observation_id":"b8efe306-9118-4329-9edb-4b03af8706b3","resolution":{"observed_at":"2026-08-06T20:40:28.997342Z","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-06T20:40:31.979518Z","title":"Physics Reports 687, 1– 51 (2017) https://doi.org/https://papers.ssrn.com/sol3/papers.cfm?abstract id= 2972841","venue":null,"work_id":"336ca528-6a7d-406f-aaa5-9335e90561f0","year":2017},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:29.429643Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:c4a61771cf85ccd5e52ef1b2033d8ee315a967d2d70a109dd8fe02a309f6898d","observation_id":"e679400f-3240-4c4c-aa6e-0e3ddf3005fa","resolution":{"observed_at":"2026-08-06T20:40:32.099097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:40:29.588359Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:29.588359Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:1abe427ff8cfe39fdefdcccf0f536dba4bc2edad6a15bebff52a18f5768b0222","observation_id":"a37782ac-a2e0-4950-83a6-ea6c21441dff","resolution":{"observed_at":"2026-08-06T20:40:29.588359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12887","last_updated":"2024-08-07T12:52:41Z","snapshot_observed_at":"2026-08-09T09:34:29.355008Z","submitted_at":"2023-11-21T04:03:26Z","title":"Optimal, and approximately optimal, quantum strategies for $\\mathrm{XOR}^{*}$ and $\\mathrm{FFL}$ games","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12887","snapshot_observed_at":"2026-08-06T20:40:29.836660Z","title":"arXiv: 2311.12887 (submitted) (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:29.836660Z"},"links":{"cited_paper":"/paper/2311.12887","citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:08a095a730b1fa2f046f5fb07835141fae661ef83d228e2fa7deae0f0d04ffca","observation_id":"9d6cb0b3-ad49-4f7d-9d2d-84231dcdc9e7","resolution":{"observed_at":"2026-08-06T20:40:29.836660Z","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-06T20:40:30.205441Z","title":"arXiv: 2209.07714 (2025) https://doi.org/10.48550/arXiv","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:30.205441Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:e8d9231149e70304ea218569e4358d0057a63bc54cd55ecb896f2d1d4e3e151f","observation_id":"e2840f05-3237-4a18-8e1d-4db7e9105705","resolution":{"observed_at":"2026-08-06T20:40:30.205441Z","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-06T20:40:30.376555Z","title":"Journal of Phys A: Math","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:30.376555Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:da14c14ea13596829303b60fc3a79378d4e977085e6045b94ea1adc275402375","observation_id":"77888513-1a67-48f6-aaa7-804e791ae4b2","resolution":{"observed_at":"2026-08-06T20:40:30.376555Z","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-06T20:40:30.458646Z","title":"Journal of Mathematical Physics 52(10), 102202 (2011) https://doi.org/ 10.1063/1.3652924","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:30.458646Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:5db5fb48bfa3dd7af6e7545fe60a47fbe1ecf0ddc4e3b666c0684fe39a7a465e","observation_id":"410ee975-ab86-4832-bb21-84ebd7dbd6c9","resolution":{"observed_at":"2026-08-06T20:40:30.458646Z","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-06T20:40:30.523040Z","title":"Diversities in Quantum Computation and Quantum Information, 79–105 (2012) https://doi.org/10.1142/9789814425988 0003","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:30.523040Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:2ed629005eefe91b6db112f4cf7855b9001802f9e73acf58c712cacb485f13fe","observation_id":"086055a1-b485-4623-a65a-0c3e4e01dcde","resolution":{"observed_at":"2026-08-06T20:40:30.523040Z","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-06T20:40:31.763795Z","title":null,"venue":null,"work_id":"cdedc9b3-fbcb-4cd4-a402-f0afd9132591","year":2023},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:30.624821Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:f69d2602a54e10940234dca4bcf65e6b2ab6a5dab95a21f7377d2b21d278b3a3","observation_id":"39863a25-300b-4a4a-9d5c-70bd55ca5841","resolution":{"observed_at":"2026-08-06T20:40:31.874615Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:40:30.733525Z","title":"Quantum Machine Intelligence 3(21) (2021) https://doi.org/10.1007/s42484-021-00048-8 84","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T20:40:30.733525Z"},"links":{"citing_paper":"/paper/2507.03035"},"observation_digest":"sha256:0d0a0b8d3576ddb688709ac0ee90828c4f2e80071f3fe16dc6519bb56ce426ec","observation_id":"4d00c72f-0e54-4423-8e6d-dba97aa3f3c4","resolution":{"observed_at":"2026-08-06T20:40:30.733525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.03035","last_updated":"2025-07-03T02:59:12Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-11T13:56:16.251307Z","submitted_at":"2025-07-03T02:59:12Z","title":"Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":7,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":0,"verified_fuzzy":8},"total_outbound_references":50},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 3 inbound Pith citation observations for arXiv:2507.03035."}