{"as_of":"2026-08-21T03:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a6ade95b5e9affae5d0357d385d561e6ce9a42ad2ebdf6d6a53114b951f0ef94","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-20T06:33:59.587034+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-12T17:08:49.012741Z","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-11T19:42:17.777037Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.01802","last_updated":"2024-07-01T20:58:34Z","snapshot_observed_at":"2026-08-21T01:18:26.018582Z","submitted_at":"2024-07-01T20:58:34Z","title":"An XOR Lemma for Deterministic Communication Complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01802","snapshot_observed_at":"2026-08-12T17:08:49.012741Z","title":"A Technique for Hardness Amplification Against AC0","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.13015","last_updated":"2025-06-16T11:37:24Z","snapshot_observed_at":"2026-08-16T11:52:45.650907Z","submitted_at":"2024-11-20T03:36:48Z","title":"Strong XOR Lemma for Information Complexity","version":2},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-12T17:08:49.012741Z"},"links":{"cited_paper":"/paper/2407.01802","citing_paper":"/paper/2411.13015"},"observation_digest":"sha256:ae2f4a3a9fb8fb77f90364243d228a0a94bc89943ae438b6d8ae899f13ae31fc","observation_id":"ae0adab2-ea12-43ab-8acf-e9dcf6cd292c","resolution":{"observed_at":"2026-08-12T17:08:49.012741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01802","last_updated":"2024-07-01T20:58:34Z","snapshot_observed_at":"2026-08-21T01:18:26.018582Z","submitted_at":"2024-07-01T20:58:34Z","title":"An XOR Lemma for Deterministic Communication Complexity","version":1},"cited_work":{"arxiv_id":"2407.01802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.01802","snapshot_observed_at":"2026-08-11T19:42:17.777037Z","title":"An XOR Lemma for Deterministic Communication Complexity","venue":"cs.CC","work_id":"9ac36d95-8828-41c2-b003-5984fd4b9924","year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.178027Z"},"links":{"cited_paper":"/paper/2407.01802","citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:cd47b60f625323223fc2050e8ced5ef5538f4e4c99043f9e0bc233cb7b1a202f","observation_id":"f60409b6-3fb3-443e-8aa6-85bfc641fb8b","resolution":{"observed_at":"2026-08-11T19:42:17.780450Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.01802/citation-record","integrity":"/paper/2407.01802/integrity","json":"/paper/2407.01802/citation-record.json","paper":"/paper/2407.01802"},"outbound":[],"paper":{"arxiv_id":"2407.01802","last_updated":"2024-07-01T20:58:34Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-21T01:18:26.018582Z","submitted_at":"2024-07-01T20:58:34Z","title":"An XOR Lemma for Deterministic Communication 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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2407.01802."}