{"as_of":"2026-08-09T19:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8db234b10095d0896b2bada803fba96be2366984705455ebf6c7a9f2205eac9d","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-09T06:31:02.800959+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-04T05:30:50.369964Z","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-11T07:26:00.162370Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.03415","last_updated":"2020-12-07T02:10:37Z","snapshot_observed_at":"2026-08-09T02:51:14.224010Z","submitted_at":"2020-12-07T02:10:37Z","title":"On Query-to-Communication Lifting for Adversary Bounds","version":1},"cited_work":{"arxiv_id":"2012.03415","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.03415","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On query-to-communication lifting for adversary bounds","venue":null,"work_id":"4b91c57e-9b74-444d-abe4-df49946d103c","year":2012},"citing_paper":{"arxiv_id":"2604.07639","last_updated":"2026-04-08T22:55:59Z","snapshot_observed_at":"2026-07-06T22:55:50.808914Z","submitted_at":"2026-04-08T22:55:59Z","title":"Exponential quantum advantage in processing massive classical data","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-05-10T17:11:43.184192Z"},"links":{"cited_paper":"/paper/2012.03415","citing_paper":"/paper/2604.07639"},"observation_digest":"sha256:d7455b2bad97efcecd6857bdd5de6f12fd37066335d0a0127e6f520d04d5cd73","observation_id":"a9401350-951f-412b-9f3e-0b4756923086","resolution":{"observed_at":"2026-05-11T07:26:00.166663Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.03415","last_updated":"2020-12-07T02:10:37Z","snapshot_observed_at":"2026-08-09T02:51:14.224010Z","submitted_at":"2020-12-07T02:10:37Z","title":"On Query-to-Communication Lifting for Adversary Bounds","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.03415","snapshot_observed_at":"2026-08-04T05:30:50.369964Z","title":"arXiv preprint arXiv:2012.03415 , year=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.369964Z"},"links":{"cited_paper":"/paper/2012.03415","citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:549d33a8bf9f9457eb69301a2ebc30abb01cbcffda262455778ee6434e67279a","observation_id":"0c69e2a0-c17a-4b33-a74e-ca85ce05c98d","resolution":{"observed_at":"2026-08-04T05:30:50.369964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2012.03415/citation-record","integrity":"/paper/2012.03415/integrity","json":"/paper/2012.03415/citation-record.json","paper":"/paper/2012.03415"},"outbound":[],"paper":{"arxiv_id":"2012.03415","last_updated":"2020-12-07T02:10:37Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-09T02:51:14.224010Z","submitted_at":"2020-12-07T02:10:37Z","title":"On Query-to-Communication Lifting for Adversary Bounds"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2012.03415."}