{"as_of":"2026-08-08T11:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4d8f2b1923a939d87a7ca66d79364d8e84401d4dc4724937e4a2e233624eefa0","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-08T06:32:00.761636+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.372494Z","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-07-10T06:06:50.446531Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.00029","last_updated":"2022-08-09T21:16:42Z","snapshot_observed_at":"2026-07-06T13:36:51.591221Z","submitted_at":"2022-07-29T18:20:03Z","title":"Communication Complexity of Collision","version":2},"cited_work":{"arxiv_id":"2208.00029","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.00029","snapshot_observed_at":"2026-07-10T06:06:50.446531Z","title":"Communication Complexity of Collision","venue":"cs.CC","work_id":"ebf41b5b-d575-47d7-901e-83e6304b0fb5","year":2022},"citing_paper":{"arxiv_id":"2607.08517","last_updated":"2026-07-09T14:11:09Z","snapshot_observed_at":"2026-08-07T11:28:08.853622Z","submitted_at":"2026-07-09T14:11:09Z","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-10T06:05:38.945129Z"},"links":{"cited_paper":"/paper/2208.00029","citing_paper":"/paper/2607.08517"},"observation_digest":"sha256:b3a86687665ad3fcbc9030c5d0fcb367874a798db500abb9a308dadd67b898b6","observation_id":"3604eafa-f4d0-406a-a7bf-042bf1b1d4e0","resolution":{"observed_at":"2026-07-10T06:06:50.447969Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.00029","last_updated":"2022-08-09T21:16:42Z","snapshot_observed_at":"2026-07-06T13:36:51.591221Z","submitted_at":"2022-07-29T18:20:03Z","title":"Communication Complexity of Collision","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.00029","snapshot_observed_at":"2026-08-04T05:30:50.372494Z","title":"arXiv preprint arXiv:2208.00029 , year=","venue":null,"work_id":null,"year":null},"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":25,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.372494Z"},"links":{"cited_paper":"/paper/2208.00029","citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:201325ecb6bc598f0697de463645ec08a3c3815e62bd0ad64dbdc88106802460","observation_id":"c5b06d5e-03f7-42c6-9c9d-58d63cd86cc8","resolution":{"observed_at":"2026-08-04T05:30:50.372494Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2208.00029/citation-record","integrity":"/paper/2208.00029/integrity","json":"/paper/2208.00029/citation-record.json","paper":"/paper/2208.00029"},"outbound":[],"paper":{"arxiv_id":"2208.00029","last_updated":"2022-08-09T21:16:42Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T13:36:51.591221Z","submitted_at":"2022-07-29T18:20:03Z","title":"Communication Complexity of Collision"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2208.00029."}