{"as_of":"2026-08-16T15:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bc05916792b73b4bfb4752ae1fec140c13040219cb7fb628d0eca4dd3b8498bc","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-16T06:30:59.297886+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-15T16:24:36.945154Z","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-15T16:24:37.087044Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1209.2713","last_updated":"2013-06-03T08:44:13Z","snapshot_observed_at":"2026-08-15T17:25:57.652597Z","submitted_at":"2012-09-12T20:00:49Z","title":"Explicit relation between all lower bound techniques for quantum query complexity","version":2},"cited_work":{"arxiv_id":"1209.2713","doi":null,"metadata_source":"pith","pith_arxiv_id":"1209.2713","snapshot_observed_at":"2026-08-15T16:24:37.087044Z","title":"Explicit relation between all lower bound techniques for quantum query complexity","venue":"quant-ph","work_id":"468a6d08-b43a-486d-bdb3-1b00cb6d78a6","year":2012},"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":27,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:36.945154Z"},"links":{"cited_paper":"/paper/1209.2713","citing_paper":"/paper/2509.07876"},"observation_digest":"sha256:f18d51575418eb668da21fd8d22a749c95478dacafd4896d5373d1df76c3e9b4","observation_id":"f0c731d6-647c-4b9f-8b06-a5876ba7ec35","resolution":{"observed_at":"2026-08-15T16:24:37.092179Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1209.2713/citation-record","integrity":"/paper/1209.2713/integrity","json":"/paper/1209.2713/citation-record.json","paper":"/paper/1209.2713"},"outbound":[],"paper":{"arxiv_id":"1209.2713","last_updated":"2013-06-03T08:44:13Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-15T17:25:57.652597Z","submitted_at":"2012-09-12T20:00:49Z","title":"Explicit relation between all lower bound techniques for quantum query complexity"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1209.2713."}