{"as_of":"2026-08-21T08:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2cb14370b4262d4838e6aa36537ffc6aa124aeed9c7f57845c1417fa9c382109","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-21T06:32:19.484+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-14T11:55:17.767734Z","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-14T11:55:17.947703Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1206.0717","last_updated":"2013-03-25T10:17:46Z","snapshot_observed_at":"2026-08-15T00:57:58.853522Z","submitted_at":"2012-06-04T19:34:19Z","title":"How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?","version":2},"cited_work":{"arxiv_id":"1206.0717","doi":null,"metadata_source":"pith","pith_arxiv_id":"1206.0717","snapshot_observed_at":"2026-08-14T11:55:17.947703Z","title":"How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?","venue":"quant-ph","work_id":"a48029f0-3bcb-4719-8907-31cbe3bcc3d6","year":2012},"citing_paper":{"arxiv_id":"1908.08312","last_updated":"2019-11-07T09:34:01Z","snapshot_observed_at":"2026-08-17T20:27:34.160860Z","submitted_at":"2019-08-22T11:15:12Z","title":"Pretty simple bounds on quantum state discrimination","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:55:17.767734Z"},"links":{"cited_paper":"/paper/1206.0717","citing_paper":"/paper/1908.08312"},"observation_digest":"sha256:dc4b87e918a7df9a59fa42dc14b5a992d051a5f5f38473578c538d987d043dbe","observation_id":"be9a0235-5008-471c-a2b8-ebcc6d80dbfa","resolution":{"observed_at":"2026-08-14T11:55:17.951759Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1206.0717/citation-record","integrity":"/paper/1206.0717/integrity","json":"/paper/1206.0717/citation-record.json","paper":"/paper/1206.0717"},"outbound":[],"paper":{"arxiv_id":"1206.0717","last_updated":"2013-03-25T10:17:46Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-15T00:57:58.853522Z","submitted_at":"2012-06-04T19:34:19Z","title":"How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1206.0717."}