{"as_of":"2026-08-13T23:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d96ee76fd7d71a0dc7fa60e7b7f55aceafa7f8a5e2ccc6fedb3263cb087405c6","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T15:35:23.438847Z","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-10T15:35:24.161161Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"0902.3397","last_updated":"2009-09-08T11:22:52Z","snapshot_observed_at":"2026-07-06T01:54:40.076851Z","submitted_at":"2009-02-19T16:13:52Z","title":"On the complexity of approximating the diamond norm","version":3},"cited_work":{"arxiv_id":"0902.3397","doi":null,"metadata_source":"pith","pith_arxiv_id":"0902.3397","snapshot_observed_at":"2026-08-10T15:35:24.161161Z","title":"On the complexity of approximating the diamond norm","venue":"quant-ph","work_id":"285c393f-8ffc-4c8b-aea4-443e47ee0a45","year":2009},"citing_paper":{"arxiv_id":"2501.14080","last_updated":"2025-01-23T20:36:45Z","snapshot_observed_at":"2026-08-13T20:21:08.308380Z","submitted_at":"2025-01-23T20:36:45Z","title":"A Unified Blockwise Measurement Design for Learning Quantum Channels and Lindbladians via Low-Rank Matrix Sensing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T15:35:23.438847Z"},"links":{"cited_paper":"/paper/0902.3397","citing_paper":"/paper/2501.14080"},"observation_digest":"sha256:56a636798ff5b4470d941fa17313584e6fae2f25270c3d37b88e525a1a420d72","observation_id":"c2e7cade-8557-4eca-9145-2f2b38e9cca2","resolution":{"observed_at":"2026-08-10T15:35:24.166262Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/0902.3397/citation-record","integrity":"/paper/0902.3397/integrity","json":"/paper/0902.3397/citation-record.json","paper":"/paper/0902.3397"},"outbound":[],"paper":{"arxiv_id":"0902.3397","last_updated":"2009-09-08T11:22:52Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T01:54:40.076851Z","submitted_at":"2009-02-19T16:13:52Z","title":"On the complexity of approximating the diamond norm"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:0902.3397."}