{"as_of":"2026-08-15T23:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:95ebfcd297a04d5655b0dedfe12ae0aca02fdc0b79f9acf68021ac71db8fdf78","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-15T06:32:42.880941+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-15T16:24:36.949849Z","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-14T14:00:18.842103Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"0904.2759","last_updated":"2009-04-17T18:41:43Z","snapshot_observed_at":"2026-08-15T05:50:19.019592Z","submitted_at":"2009-04-17T18:41:43Z","title":"Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function","version":1},"cited_work":{"arxiv_id":"0904.2759","doi":null,"metadata_source":"pith","pith_arxiv_id":"0904.2759","snapshot_observed_at":"2026-08-14T14:00:18.842103Z","title":"Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function","venue":"quant-ph","work_id":"2f35982c-0240-41d1-9794-8b3716a64866","year":2009},"citing_paper":{"arxiv_id":"1908.04232","last_updated":"2019-08-29T11:23:23Z","snapshot_observed_at":"2026-08-15T08:20:41.431528Z","submitted_at":"2019-08-12T16:32:33Z","title":"Span Programs and Quantum Space Complexity","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T14:00:18.796484Z"},"links":{"cited_paper":"/paper/0904.2759","citing_paper":"/paper/1908.04232"},"observation_digest":"sha256:6649b77a99376ae320f0ded35c9978f3bcde134be10b007f0c29166ca71e319f","observation_id":"ba5a2c06-3bac-490e-b28d-feb977350a94","resolution":{"observed_at":"2026-08-14T14:00:18.848761Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0904.2759","last_updated":"2009-04-17T18:41:43Z","snapshot_observed_at":"2026-08-15T05:50:19.019592Z","submitted_at":"2009-04-17T18:41:43Z","title":"Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0904.2759","snapshot_observed_at":"2026-08-15T16:24:36.949849Z","title":"Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.07876","last_updated":"2025-09-09T15:58:50Z","snapshot_observed_at":"2026-08-15T16:07:02.557763Z","submitted_at":"2025-09-09T15:58:50Z","title":"The Compressed Oracle is a Worthy (Multiplicative) Adversary","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:36.949849Z"},"links":{"cited_paper":"/paper/0904.2759","citing_paper":"/paper/2509.07876"},"observation_digest":"sha256:96c2973a464c5874cea6690ae75858ac0292acad02b3580f440f195fd64768b6","observation_id":"efe69128-2f34-42e7-a6b9-c9e6e2f4a86c","resolution":{"observed_at":"2026-08-15T16:24:36.949849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/0904.2759/citation-record","integrity":"/paper/0904.2759/integrity","json":"/paper/0904.2759/citation-record.json","paper":"/paper/0904.2759"},"outbound":[],"paper":{"arxiv_id":"0904.2759","last_updated":"2009-04-17T18:41:43Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-15T05:50:19.019592Z","submitted_at":"2009-04-17T18:41:43Z","title":"Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:0904.2759."}