{"as_of":"2026-08-09T13:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c870e6bc0dea31d0ef80729e1ef016a405e7bdaf3a5b7dfe1cfaf14560c8d784","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T15:24:32.279371Z","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-08T15:24:32.407544Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.05597","last_updated":"2026-04-13T07:17:28Z","snapshot_observed_at":"2026-07-06T22:09:33.606473Z","submitted_at":"2025-08-07T17:39:40Z","title":"NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing","version":4},"cited_work":{"arxiv_id":"2508.05597","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.05597","snapshot_observed_at":"2026-08-08T15:24:32.407544Z","title":"NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing","venue":"cs.CC","work_id":"f5e28c0d-f147-48c0-89b1-1f58098d6389","year":2025},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T13:10:03.483137Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.279371Z"},"links":{"cited_paper":"/paper/2508.05597","citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:dcf61c98d9316211961f8115ed36161c6215ed0576874a8883d059980b8521f9","observation_id":"47b24962-7b63-4ba9-af99-ea3cd92c3d2a","resolution":{"observed_at":"2026-08-08T15:24:32.411844Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2508.05597/citation-record","integrity":"/paper/2508.05597/integrity","json":"/paper/2508.05597/citation-record.json","paper":"/paper/2508.05597"},"outbound":[],"paper":{"arxiv_id":"2508.05597","last_updated":"2026-04-13T07:17:28Z","latest_version":4,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T22:09:33.606473Z","submitted_at":"2025-08-07T17:39:40Z","title":"NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing"},"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 1 inbound Pith citation observation for arXiv:2508.05597."}