{"as_of":"2026-08-12T19:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0bb3c318b6ba728076d0b2ec02d1f53700faf4ed3c7180c1551174ba8efdb8fd","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:57:46.026727Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T19:57:58.260516Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.11470","last_updated":"2023-05-19T06:44:59Z","snapshot_observed_at":"2026-08-11T18:31:04.886514Z","submitted_at":"2023-05-19T06:44:59Z","title":"Optimization of Tensor Network Codes with Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.11470","snapshot_observed_at":"2026-08-11T12:57:46.026727Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.13739","last_updated":"2024-12-18T11:17:09Z","snapshot_observed_at":"2026-08-11T18:36:42.610445Z","submitted_at":"2024-12-18T11:17:09Z","title":"Tensor-network decoders for process tensor descriptions of non-Markovian noise","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T12:57:46.026727Z"},"links":{"cited_paper":"/paper/2305.11470","citing_paper":"/paper/2412.13739"},"observation_digest":"sha256:57326f4e79402329ef6b4dd21d41ea6f38bef1c7d849d29be07c71688b4575f0","observation_id":"6eb2d1ba-fc1a-4724-9e1f-c5f6b5e1aed7","resolution":{"observed_at":"2026-08-11T12:57:46.026727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.11470","last_updated":"2023-05-19T06:44:59Z","snapshot_observed_at":"2026-08-11T18:31:04.886514Z","submitted_at":"2023-05-19T06:44:59Z","title":"Optimization of Tensor Network Codes with Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2305.11470","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.11470","snapshot_observed_at":"2026-08-10T19:57:58.260516Z","title":"Optimization of Tensor Network Codes with Reinforcement Learning","venue":"quant-ph","work_id":"c6085724-4572-4af3-84ef-10c31b39c616","year":2023},"citing_paper":{"arxiv_id":"2501.09622","last_updated":"2025-06-05T14:30:00Z","snapshot_observed_at":"2026-08-11T18:32:04.397576Z","submitted_at":"2025-01-16T16:01:02Z","title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T19:57:57.821923Z"},"links":{"cited_paper":"/paper/2305.11470","citing_paper":"/paper/2501.09622"},"observation_digest":"sha256:215dd251929e1a9e67a9911df496b4a1e053e01928efc01a129b7bb0bdf27100","observation_id":"9d006b45-8714-4779-8c66-6886f4b69827","resolution":{"observed_at":"2026-08-10T19:57:58.265443Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.11470/citation-record","integrity":"/paper/2305.11470/integrity","json":"/paper/2305.11470/citation-record.json","paper":"/paper/2305.11470"},"outbound":[],"paper":{"arxiv_id":"2305.11470","last_updated":"2023-05-19T06:44:59Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-11T18:31:04.886514Z","submitted_at":"2023-05-19T06:44:59Z","title":"Optimization of Tensor Network Codes with Reinforcement Learning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2305.11470."}