{"as_of":"2026-08-22T17:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:69fe0020ed897dd0a15dbd84e31e719a7a6fa9124c520f73397b2a2bc88b2eb2","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-22T06:32:14.747728+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-05-25T05:56:04.434614Z","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-05-25T05:56:40.003375Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.04169","last_updated":"2024-11-06T19:00:00Z","snapshot_observed_at":"2026-08-16T13:02:20.007175Z","submitted_at":"2024-11-06T19:00:00Z","title":"On the complexity of sampling from shallow Brownian circuits","version":1},"cited_work":{"arxiv_id":"2411.04169","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.04169","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bentsen, B","venue":null,"work_id":"7a920bfd-66e3-45af-92ed-bf8961e85198","year":2024},"citing_paper":{"arxiv_id":"2605.22909","last_updated":"2026-05-21T18:00:28Z","snapshot_observed_at":"2026-07-06T23:33:09.561760Z","submitted_at":"2026-05-21T18:00:28Z","title":"Sample-efficient benchmarking of shallow all-to-all random quantum circuits","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-05-25T05:56:04.434614Z"},"links":{"cited_paper":"/paper/2411.04169","citing_paper":"/paper/2605.22909"},"observation_digest":"sha256:2bd39116dc46203be6702ec45ee8e07db2554ee624ab3f980cd7af1d6c10cad4","observation_id":"aba182f9-2de8-4ea2-a586-7071b8fb3c2d","resolution":{"observed_at":"2026-05-25T05:56:40.005892Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.04169/citation-record","integrity":"/paper/2411.04169/integrity","json":"/paper/2411.04169/citation-record.json","paper":"/paper/2411.04169"},"outbound":[],"paper":{"arxiv_id":"2411.04169","last_updated":"2024-11-06T19:00:00Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T13:02:20.007175Z","submitted_at":"2024-11-06T19:00:00Z","title":"On the complexity of sampling from shallow Brownian circuits"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2411.04169."}