{"as_of":"2026-08-22T03:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b6234749b06c83edbe65a23def5bb7fe878e7a40e4e0e5eb8e4c28588423fe86","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T07:52:54.830473Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T15:54:36.166197Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"cited_work":{"arxiv_id":"2601.19190","doi":"10.48550/arxiv.2601.19190","metadata_source":"pith","pith_arxiv_id":"2601.19190","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Analytical construction of (n, n 1) quan- tum random access codes saturating the conjectured bound","venue":"quant-ph","work_id":"768cd7be-fa7c-44ea-9f4b-61faf7239d39","year":2026},"citing_paper":{"arxiv_id":"2604.21274","last_updated":"2026-07-16T23:46:38Z","snapshot_observed_at":"2026-08-13T11:01:14.721752Z","submitted_at":"2026-04-23T04:36:05Z","title":"Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-09T22:30:25.232105Z"},"links":{"cited_paper":"/paper/2601.19190","citing_paper":"/paper/2604.21274"},"observation_digest":"sha256:d59c30d6c8957440fe42948be5f5ce3b47516d446dfa16676f9787106257aa4f","observation_id":"0754b5bc-507f-4d4a-91c6-7defc5895078","resolution":{"observed_at":"2026-06-26T02:16:20.321747Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"cited_work":{"arxiv_id":"2601.19190","doi":"10.48550/arxiv.2601.19190","metadata_source":"pith","pith_arxiv_id":"2601.19190","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Analytical construction of (n, n 1) quan- tum random access codes saturating the conjectured bound","venue":"quant-ph","work_id":"768cd7be-fa7c-44ea-9f4b-61faf7239d39","year":2026},"citing_paper":{"arxiv_id":"2604.21274","last_updated":"2026-07-16T23:46:38Z","snapshot_observed_at":"2026-08-13T11:01:14.721752Z","submitted_at":"2026-04-23T04:36:05Z","title":"Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-21T00:06:11.797865Z"},"links":{"cited_paper":"/paper/2601.19190","citing_paper":"/paper/2604.21274"},"observation_digest":"sha256:65ebd1f30a68a8f4d98f4969387b316b633e4459480830e2af2668093679fbc9","observation_id":"4b3c1c40-10bb-46ed-b25b-4dcf60ed75f1","resolution":{"observed_at":"2026-06-26T02:16:20.321747Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.19190","snapshot_observed_at":"2026-08-02T15:54:36.166197Z","title":"Analytical construction of (𝑛, 𝑛 − 1) quan- tum random access codes saturating the conjectured bound","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2604.21274","last_updated":"2026-07-16T23:46:38Z","snapshot_observed_at":"2026-08-13T11:01:14.721752Z","submitted_at":"2026-04-23T04:36:05Z","title":"Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T15:54:36.166197Z"},"links":{"cited_paper":"/paper/2601.19190","citing_paper":"/paper/2604.21274"},"observation_digest":"sha256:38a0a633622a82a50ec4beb346392b3eb7b5ad53a03d3a653114060a5f942453","observation_id":"65b2745c-3aae-4468-84ea-1140ac85e636","resolution":{"observed_at":"2026-08-02T15:54:36.166197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"cited_work":{"arxiv_id":"2601.19190","doi":"10.48550/arxiv.2601.19190","metadata_source":"pith","pith_arxiv_id":"2601.19190","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Analytical construction of (n, n 1) quan- tum random access codes saturating the conjectured bound","venue":"quant-ph","work_id":"768cd7be-fa7c-44ea-9f4b-61faf7239d39","year":2026},"citing_paper":{"arxiv_id":"2606.05604","last_updated":"2026-06-04T02:27:20Z","snapshot_observed_at":"2026-08-15T23:12:55.475743Z","submitted_at":"2026-06-04T02:27:20Z","title":"Decoder-Consistent Hamiltonians for POVM-Based Quantum Relaxations","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T01:37:45.528107Z"},"links":{"cited_paper":"/paper/2601.19190","citing_paper":"/paper/2606.05604"},"observation_digest":"sha256:81e141ed4f9df814bc37c0ba0990f8f1e051dba6e718f1e51befa8c7f6987204","observation_id":"fa350d8d-9f1b-490d-8d4b-3338bb14272c","resolution":{"observed_at":"2026-07-02T13:06:58.941561Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.19190","snapshot_observed_at":"2026-07-14T11:55:56.894226Z","title":"Suzuki, Analytical construction of(n, n− 1)-quantum random access codes saturating the conjectured bound (2026), accepted in Phys","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10414","last_updated":"2026-07-11T17:44:29Z","snapshot_observed_at":"2026-08-20T13:16:06.112699Z","submitted_at":"2026-07-11T17:44:29Z","title":"Optimal Average Success Probabilities of Binary $(n,n-1)$ and $(n,n-2)$ Quantum Random Access Codes via a Proof of the Corresponding Conjectured Bound","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T11:55:56.894226Z"},"links":{"cited_paper":"/paper/2601.19190","citing_paper":"/paper/2607.10414"},"observation_digest":"sha256:088c475bc9401ee4ec0f6052aea0ed366f95e6230fbb5b20d75181c2b9bd858e","observation_id":"2cdf8320-a37b-4cba-9d5d-4e75b58fe5cd","resolution":{"observed_at":"2026-07-14T11:55:56.894226Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2601.19190/citation-record","integrity":"/paper/2601.19190/integrity","json":"/paper/2601.19190/citation-record.json","paper":"/paper/2601.19190"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T07:52:54.644160Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.644160Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:8cd850490b3640ded01243554d28dbb71bf5079e5f37112877fb1c48d5e8372b","observation_id":"213b80b7-43e7-43c4-aea7-9d08b51696f6","resolution":{"observed_at":"2026-08-03T07:52:54.644160Z","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-03T07:52:54.648873Z","title":"That is, ( An)yx ∈ {0, 1, −1}","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.648873Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:4eda2bb07a82fa1eed67f4b222f9250483d2b3fc766a7fb0cd9054b728ad601d","observation_id":"37e18119-f335-4511-bac4-b0dc58ff44ff","resolution":{"observed_at":"2026-08-03T07:52:54.648873Z","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-03T07:52:54.652359Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.652359Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:e412b5678774f8ef736be75e0624273f92820683d47cd403c8ed957c9fa7aa0a","observation_id":"bc5973fc-2605-43dd-a901-57f7a8b50725","resolution":{"observed_at":"2026-08-03T07:52:54.652359Z","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-03T07:52:54.655784Z","title":"V alues: • Case y1 = x1: ( An)yx = ±(An−1)y′x′","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.655784Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:932fc800c9121c87541b8cf67b9e1d095badfa8a7b54771c146925f912cab095","observation_id":"5ad37622-431b-41fd-b159-0bf489d482dc","resolution":{"observed_at":"2026-08-03T07:52:54.655784Z","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-03T07:52:54.659410Z","title":"Therefore, the properties hold for any n","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.659410Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:49e826b9638a25e284c4d7a1e570c0516e26593c66331c96d66417cd26aa3844","observation_id":"97cfd0d6-d9de-4104-bf49-2b1762fbccbc","resolution":{"observed_at":"2026-08-03T07:52:54.659410Z","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-03T07:52:54.662646Z","title":"(B3), we have (λ − 1)2 =µ =⇒ λ = 1 ± √ µ","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.662646Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:e919b3a47997ee886a22355291f998d51e10b4c6de31a43bcf854d2e4fb6f927","observation_id":"6d9e7e8a-303b-4d4e-abd6-2e0b9464b093","resolution":{"observed_at":"2026-08-03T07:52:54.662646Z","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-03T07:52:54.666137Z","title":"Since Q is a projection opera- tor, it follows that λ ∈ {0, 1}","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.666137Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:5f3aaf786ec1e656bae70b5575f5064d1c8ba91edc844cab2f2059eb351709b5","observation_id":"bd8ee918-3e1e-418a-af16-eb79267144f2","resolution":{"observed_at":"2026-08-03T07:52:54.666137Z","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-03T07:52:54.669752Z","title":"In this subsection, we show that the matrix An possesses specific covariance proper- ties under the action of the Pauli group","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.669752Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:b69e9ad4ab200408635f5f2000b499db70138a3b7a7f93586a85bbe6cef62697","observation_id":"79ea0bce-88e3-44d5-9260-edc4344766dd","resolution":{"observed_at":"2026-08-03T07:52:54.669752Z","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-03T07:52:54.672750Z","title":"all 16 upper bits q1,...,q k−1 are |0⟩","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.672750Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:e319a95baec39fa8639b3ccb06eda448816d6352eaa4dca90363ac5838f95a39","observation_id":"408af734-ad5a-4c04-b136-5a032474eb2c","resolution":{"observed_at":"2026-08-03T07:52:54.672750Z","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-03T07:52:54.675714Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.675714Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:d709d2152e768631fe86fdedce8bea8bf97a735a142a07f36459fbe155382141","observation_id":"60ffb188-8dde-48cb-894e-b510fd384789","resolution":{"observed_at":"2026-08-03T07:52:54.675714Z","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-03T07:52:54.678681Z","title":"For the generation of the reference state, it is known from previous studies that Ck−1Ry(θk) can be implemented with a depth of O(k) even on a 1D chain architecture [20]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.678681Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:033467bd1cc13816d4eb7e50d3f44544a8a1a7ef84a1d9bcd129f20e180dc280","observation_id":"a450fd53-1c83-4aaf-8d37-7dc287dcbab7","resolution":{"observed_at":"2026-08-03T07:52:54.678681Z","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-03T07:52:54.681637Z","title":null,"venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.681637Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:9190b00502b2028d9c66c06bf3ba3599b8692cca00a77f4cddae45ad4d227462","observation_id":"4ebf7f4b-c67b-49b2-b1f3-91fba6212e14","resolution":{"observed_at":"2026-08-03T07:52:54.681637Z","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-03T07:52:54.684990Z","title":"Ambainis, A","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.684990Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:aa0a9da2a39568f5f3a030e42407c6df135fc85f41348f70660d3a0f7cf3d2d8","observation_id":"4d4cc8c6-7fc0-4427-99ed-b753650afcbf","resolution":{"observed_at":"2026-08-03T07:52:54.684990Z","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-03T07:52:54.688114Z","title":"Ambainis, A","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.688114Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:1ecb45d572e73b7464fa7f4f784f845a5bd19ab528c40b16929ebbd71c2ff87b","observation_id":"40020289-a04f-46d6-b217-9285dda36518","resolution":{"observed_at":"2026-08-03T07:52:54.688114Z","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-03T07:52:54.691165Z","title":"Klauck, On quantum and probabilistic communica- tion: Las Vegas and one-way protocols, in Proceedings of the 32nd Annual ACM Symposium on Theory of Com- puting (ACM, 2000) pp","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.691165Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:5ca1ea8f1c7ddbe661e65084f6bd716bcb2ee23e00d33ef49dfb7e77bbf574cc","observation_id":"59794d8a-29a8-4d8e-9042-10a11cdf89d0","resolution":{"observed_at":"2026-08-03T07:52:54.691165Z","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-03T07:52:54.694223Z","title":"Aaronson, Limitations of quantum advice and one-way communication, in Proceedings of the 19th IEEE Annual Conference on Computational Complexity (IEEE, 2004) pp","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.694223Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:8eb19efaabc6588d6c381448b63492f7e8cd8179bb92313374d3f73a2e27b89a","observation_id":"f5f31011-ebd8-43c9-b729-da5d9906eb2e","resolution":{"observed_at":"2026-08-03T07:52:54.694223Z","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-03T07:52:54.698068Z","title":"Kerenidis and R","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.698068Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:4e409dc2923f9f663c919b1840dd16db6ea27c15d660221c76036a472e38119f","observation_id":"30c3d303-128c-4031-af00-b47480c955aa","resolution":{"observed_at":"2026-08-03T07:52:54.698068Z","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-03T07:52:54.703011Z","title":"Paw/suppress lowski and N","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.703011Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:97cebeb244df125bac6936b6632e2b47e4aef785b315c28e93256ee5c43634d8","observation_id":"9e592967-8918-4049-aa83-5e74f3081910","resolution":{"observed_at":"2026-08-03T07:52:54.703011Z","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-03T07:52:54.709333Z","title":"Li, Z.-Q","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.709333Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:59bc67102f6d5dfd63d5b7a609a22313f0c15e1b7d75efed56d301674b174eed","observation_id":"5f67f985-1724-4374-a48e-0a415fd88680","resolution":{"observed_at":"2026-08-03T07:52:54.709333Z","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-03T07:52:54.717652Z","title":"Brunner, M","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.717652Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:c95361bb5c9176eb1c3117dfc2286d5a412d34060b00815ba7f7e3a8c7726db5","observation_id":"05844ef6-b6f6-440c-ac36-00f9fe106211","resolution":{"observed_at":"2026-08-03T07:52:54.717652Z","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-03T07:52:54.726170Z","title":"Tavakoli, J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.726170Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:f51824e1af675fcc2ff84871b1e18ca6f03b99e33f5d22586f9c4fed3ded1324","observation_id":"f1f6f3e4-db95-4d69-91ca-0ae025ed2887","resolution":{"observed_at":"2026-08-03T07:52:54.726170Z","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-03T07:52:54.735932Z","title":"Farkas and J","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.735932Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:0cb13aa2e139331350ed7a40e5fd20aef7d012632fd5657ddb6d7a8825421c44","observation_id":"2283f946-89aa-4589-8d15-82029e30391b","resolution":{"observed_at":"2026-08-03T07:52:54.735932Z","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-03T07:52:54.746646Z","title":"Miao, Z.-D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.746646Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:2236f9dd3def5910a238681c0a169faabe1498be11d78612af9e4deb05789c7c","observation_id":"00f93e4d-a62c-4461-8bae-26544ac1e3ff","resolution":{"observed_at":"2026-08-03T07:52:54.746646Z","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-03T07:52:54.757484Z","title":"Nayak, Optimal lower bounds for quantum automata and random access codes, in Proceedings of the 40th An- nual Symposium on Foundations of Computer Science (IEEE, 1999) pp","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.757484Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:6974a34f0643f5cedda048a946c15ec510a45037611dfc3a5e59590055b4d82c","observation_id":"8dd6b92d-30eb-485f-ae3c-8ca548722cb6","resolution":{"observed_at":"2026-08-03T07:52:54.757484Z","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-03T07:52:54.766900Z","title":"Farkas, N","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.766900Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:c8a520e07e00903f1f1fc745af5f798b7e68cdad6422beb866bcc70a9d7a96d9","observation_id":"99d341f5-94f5-44a1-8f1c-4fa895ee92ab","resolution":{"observed_at":"2026-08-03T07:52:54.766900Z","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-03T07:52:54.774606Z","title":"Tavakoli, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.774606Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:a8c9fedbd3c23a0846c118681a301e4dc772d56a1b5c8929dc651160146c46f1","observation_id":"4cee3849-0da8-4ffc-9223-f488baf8fec8","resolution":{"observed_at":"2026-08-03T07:52:54.774606Z","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-03T07:52:54.782748Z","title":"Navascu´ es, A","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.782748Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:f820a2077d227c1bb034edd8a183666d641c80acb162755bdf7f909a61225fa5","observation_id":"182370fb-0ea0-47b1-a610-2d71810ca45e","resolution":{"observed_at":"2026-08-03T07:52:54.782748Z","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-03T07:52:54.793158Z","title":"Imamichi and R","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.793158Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:d36ec58d583462b5d42f57cf85efb0f615b4f6c821065f24d7e580e8223dc268","observation_id":"e49df4ce-2776-433e-96ec-f5cbeb8872fa","resolution":{"observed_at":"2026-08-03T07:52:54.793158Z","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-03T07:52:54.805918Z","title":"Manˇ cinska and S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.805918Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:5cb015d535865d0942503dccb859f386202a7cc37d9a5b2465610f49636ebcec","observation_id":"2b96810e-d737-4123-b383-c34a6c883941","resolution":{"observed_at":"2026-08-03T07:52:54.805918Z","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-03T07:52:54.818269Z","title":"Kondo, Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.818269Z"},"links":{"citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:d8b75c58c7cf4aeeaafc894124de977db91c9975ec8bc564c28fa5c81e0926bc","observation_id":"fe32b1aa-1f7f-430a-99ff-02b4c50e99a2","resolution":{"observed_at":"2026-08-03T07:52:54.818269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.00695","last_updated":"2025-06-29T20:21:44Z","snapshot_observed_at":"2026-08-15T02:16:34.554214Z","submitted_at":"2025-05-31T20:01:21Z","title":"Multi-Controlled Quantum Gates in Linear Nearest Neighbor","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.00695","snapshot_observed_at":"2026-08-03T07:52:54.830473Z","title":"Zindorf and S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T07:52:54.830473Z"},"links":{"cited_paper":"/paper/2506.00695","citing_paper":"/paper/2601.19190"},"observation_digest":"sha256:0e89a0f78159d3745fc135ce4e5fb431dc1270cfb8c5fc3b4dae954797aec4bf","observation_id":"c46163fc-dd40-4388-bf24-8e12a8cca121","resolution":{"observed_at":"2026-08-03T07:52:54.830473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.19190","last_updated":"2026-01-27T04:43:43Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-19T22:41:16.187453Z","submitted_at":"2026-01-27T04:43:43Z","title":"Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":30,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":31},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 5 inbound Pith citation observations for arXiv:2601.19190."}