{"as_of":"2026-08-10T10:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:51ddde4034db85cf1287975f7449bf2a641a2411799d83fff4ac07cf89645f51","coverage":[{"denominator":3,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:49:07.054642Z","state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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.298912Z","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.382105Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.10426","last_updated":"2025-07-14T16:15:54Z","snapshot_observed_at":"2026-08-09T11:10:28.903888Z","submitted_at":"2025-07-14T16:15:54Z","title":"Communication Complexity is NP-hard","version":1},"cited_work":{"arxiv_id":"2507.10426","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.10426","snapshot_observed_at":"2026-08-08T15:24:32.382105Z","title":"Communication Complexity is NP-hard","venue":"cs.CC","work_id":"af9716a7-ec60-4b80-859c-e80ec848ad7a","year":2025},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-09T23:10:35.221253Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.298912Z"},"links":{"cited_paper":"/paper/2507.10426","citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:f2ef5cb6cdf674d88e46087bde8b2a1db500c3db00ad13d2a713a8cd4b37e6c8","observation_id":"d12b3ec8-a24f-4395-8ee8-2a4b3f61da20","resolution":{"observed_at":"2026-08-08T15:24:32.385985Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.10426/citation-record","integrity":"/paper/2507.10426/integrity","json":"/paper/2507.10426/citation-record.json","paper":"/paper/2507.10426"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:49:07.625163Z","title":"Minimal NFA problems are hard","venue":null,"work_id":"202f432c-0809-47ac-9730-31200a9f4a35","year":1993},"citing_paper":{"arxiv_id":"2507.10426","last_updated":"2025-07-14T16:15:54Z","snapshot_observed_at":"2026-08-09T11:10:28.903888Z","submitted_at":"2025-07-14T16:15:54Z","title":"Communication Complexity is NP-hard","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T17:49:06.873027Z"},"links":{"citing_paper":"/paper/2507.10426"},"observation_digest":"sha256:e5ab28531c017402f9ed70d52dfb34c3496422bebd659caa67d21d4febbc5715","observation_id":"b2ef6d1b-b94d-4aac-84e2-c01692fe96b1","resolution":{"observed_at":"2026-08-06T17:49:07.740589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:49:07.429785Z","title":"On the complexity of communication complexity","venue":null,"work_id":"43c3166d-2ad0-40b1-8358-acf533308aa9","year":2009},"citing_paper":{"arxiv_id":"2507.10426","last_updated":"2025-07-14T16:15:54Z","snapshot_observed_at":"2026-08-09T11:10:28.903888Z","submitted_at":"2025-07-14T16:15:54Z","title":"Communication Complexity is NP-hard","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T17:49:06.931382Z"},"links":{"citing_paper":"/paper/2507.10426"},"observation_digest":"sha256:b8502ae183acb1227b9a73a435c7ed389c699e05b0bd4e452cac9a0f5ec5c6e1","observation_id":"898a8410-2b75-47eb-b7eb-e161b7f8b820","resolution":{"observed_at":"2026-08-06T17:49:07.509293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:49:07.205971Z","title":"Some complexity questions related to distributive computing","venue":null,"work_id":"bce2b2cc-b451-45d2-a363-85d744be45de","year":1979},"citing_paper":{"arxiv_id":"2507.10426","last_updated":"2025-07-14T16:15:54Z","snapshot_observed_at":"2026-08-09T11:10:28.903888Z","submitted_at":"2025-07-14T16:15:54Z","title":"Communication Complexity is NP-hard","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T17:49:07.054642Z"},"links":{"citing_paper":"/paper/2507.10426"},"observation_digest":"sha256:27a5509a1830ca911ddf6f96f9da03741ae35f717c458709c405bbe3e5d33b9b","observation_id":"1822fcf0-d5b4-4a58-bf32-38d10428f578","resolution":{"observed_at":"2026-08-06T17:49:07.301686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.10426","last_updated":"2025-07-14T16:15:54Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-09T11:10:28.903888Z","submitted_at":"2025-07-14T16:15:54Z","title":"Communication Complexity is NP-hard"},"reference_resolution":{"displayed":3,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":3},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 3 of 3 outbound references and 1 inbound Pith citation observation for arXiv:2507.10426."}