{"as_of":"2026-08-16T23:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:28a5cfaa355c279d0445f07c60d8912d8e25eaed79a25dd1d98ba395333d55a9","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-16T06:30:59.297886+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.933516Z","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-13T04:42:16.398158Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1104.4468","last_updated":"2011-07-08T18:04:16Z","snapshot_observed_at":"2026-08-15T04:48:37.472897Z","submitted_at":"2011-04-22T15:38:45Z","title":"A strong direct product theorem for quantum query complexity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1104.4468","snapshot_observed_at":"2026-08-15T16:24:36.933516Z","title":"A strong direct product theorem for quantum query complexity","venue":null,"work_id":null,"year":2013},"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":24,"source":"arxiv_source","source_observed_at":"2026-08-15T16:24:36.933516Z"},"links":{"cited_paper":"/paper/1104.4468","citing_paper":"/paper/2509.07876"},"observation_digest":"sha256:632796047a6b93c7cab763b8ac9a30dc9e11ae9bc912ce03cbd6b4d4cd41e0d2","observation_id":"188e4159-4273-4fb9-965c-256a53d46c67","resolution":{"observed_at":"2026-08-15T16:24:36.933516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1104.4468","last_updated":"2011-07-08T18:04:16Z","snapshot_observed_at":"2026-08-15T04:48:37.472897Z","submitted_at":"2011-04-22T15:38:45Z","title":"A strong direct product theorem for quantum query complexity","version":3},"cited_work":{"arxiv_id":"1104.4468","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1104.4468","snapshot_observed_at":"2026-07-04T18:10:02.909548Z","title":"2011 , Bdsk-File-1 =","venue":null,"work_id":"f5b0ee27-aa3d-4b0b-9be8-b5803db9df4d","year":2011},"citing_paper":{"arxiv_id":"2605.12385","last_updated":"2026-05-12T16:47:51Z","snapshot_observed_at":"2026-08-03T03:00:21.805076Z","submitted_at":"2026-05-12T16:47:51Z","title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","version":1},"reference_index":122,"source":"arxiv_source","source_observed_at":"2026-05-13T04:38:04.165728Z"},"links":{"cited_paper":"/paper/1104.4468","citing_paper":"/paper/2605.12385"},"observation_digest":"sha256:6e3ec81e895d67e1d2ee6d3801f359578d62840fe8cfead6c288388325f38618","observation_id":"ba435d05-fc08-4f8a-bbbb-5532c40da4ba","resolution":{"observed_at":"2026-07-04T18:10:02.909548Z","resolver_source":"arxiv_id","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/1104.4468/citation-record","integrity":"/paper/1104.4468/integrity","json":"/paper/1104.4468/citation-record.json","paper":"/paper/1104.4468"},"outbound":[],"paper":{"arxiv_id":"1104.4468","last_updated":"2011-07-08T18:04:16Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-15T04:48:37.472897Z","submitted_at":"2011-04-22T15:38:45Z","title":"A strong direct product theorem 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 2 inbound Pith citation observations for arXiv:1104.4468."}