{"as_of":"2026-08-09T03:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6600a0fc193acee2304f70495d4ce5f9192a453f218f5fd2c4e26f98a2e38619","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-08T17:16:31.390823Z","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-13T21:28:17.610909Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.02744","last_updated":"2022-05-05T16:24:29Z","snapshot_observed_at":"2026-07-06T13:07:05.427227Z","submitted_at":"2022-05-05T16:24:29Z","title":"Streaming and Sketching Complexity of CSPs: A survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.02744","snapshot_observed_at":"2026-08-08T17:16:31.390823Z","title":"Streaming and sketching complexity of csps: A survey, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-08T17:07:01.677947Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.390823Z"},"links":{"cited_paper":"/paper/2205.02744","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:2413526d59e1022115e8ac5e2681ca8d6727ea1de93c8297dbb8be2bdd044852","observation_id":"bd35a273-4800-4543-b60b-44ef290874d1","resolution":{"observed_at":"2026-08-08T17:16:31.390823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.02744","last_updated":"2022-05-05T16:24:29Z","snapshot_observed_at":"2026-07-06T13:07:05.427227Z","submitted_at":"2022-05-05T16:24:29Z","title":"Streaming and Sketching Complexity of CSPs: A survey","version":1},"cited_work":{"arxiv_id":"2205.02744","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.02744","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Streaming and sketching complexity of csps: A survey","venue":null,"work_id":"2946b392-5fa5-4edd-ad8e-a0b96e29f7a2","year":null},"citing_paper":{"arxiv_id":"2604.01400","last_updated":"2026-04-01T21:01:17Z","snapshot_observed_at":"2026-08-02T16:49:28.528077Z","submitted_at":"2026-04-01T21:01:17Z","title":"Near-Optimal Space Lower Bounds for Streaming CSPs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-13T21:26:02.324238Z"},"links":{"cited_paper":"/paper/2205.02744","citing_paper":"/paper/2604.01400"},"observation_digest":"sha256:88706660bfa330ece62fc485f8bb836b4c3a17f2450627120888ca17d6d565ae","observation_id":"76948c22-c500-4a4b-8d67-1b3dde6bff64","resolution":{"observed_at":"2026-05-13T21:28:17.612984Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2205.02744/citation-record","integrity":"/paper/2205.02744/integrity","json":"/paper/2205.02744/citation-record.json","paper":"/paper/2205.02744"},"outbound":[],"paper":{"arxiv_id":"2205.02744","last_updated":"2022-05-05T16:24:29Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T13:07:05.427227Z","submitted_at":"2022-05-05T16:24:29Z","title":"Streaming and Sketching Complexity of CSPs: A survey"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2205.02744."}