{"as_of":"2026-08-12T11:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d88599f9e29cdacfe6ac146caf84fa7a683d2bfa8cdbc9fbc1992be7fb4070d0","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-12T06:34:41.77262+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-06T17:36:21.607785Z","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-07-10T06:15:00.866473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.20204","last_updated":"2025-05-06T07:55:00Z","snapshot_observed_at":"2026-07-06T18:53:31.241776Z","submitted_at":"2024-07-29T17:35:19Z","title":"Constant-Cost Communication is not Reducible to k-Hamming Distance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.20204","snapshot_observed_at":"2026-08-06T17:36:21.607785Z","title":"Constant-cost communication does not reduce tok-Hamming Distance","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.11162","last_updated":"2025-07-15T10:10:21Z","snapshot_observed_at":"2026-08-09T22:35:57.218938Z","submitted_at":"2025-07-15T10:10:21Z","title":"Equality is Far Weaker than Constant-Cost Communication","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:36:21.607785Z"},"links":{"cited_paper":"/paper/2407.20204","citing_paper":"/paper/2507.11162"},"observation_digest":"sha256:75c7fb7127af3c575991c9ee6ef68b982b85e428dab9383ff872286c37b52808","observation_id":"ec3ce024-f4e0-4f2e-8c93-1572044560b9","resolution":{"observed_at":"2026-08-06T17:36:21.607785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.20204","last_updated":"2025-05-06T07:55:00Z","snapshot_observed_at":"2026-07-06T18:53:31.241776Z","submitted_at":"2024-07-29T17:35:19Z","title":"Constant-Cost Communication is not Reducible to k-Hamming Distance","version":2},"cited_work":{"arxiv_id":"2407.20204","doi":"10.48550/arxiv.2407.20204","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.20204","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Constant-cost communication does not reduce to k - H amming distance","venue":null,"work_id":"3b640e78-6b54-4b03-ab09-098b9a74b360","year":2025},"citing_paper":{"arxiv_id":"2604.03805","last_updated":"2026-04-04T17:18:55Z","snapshot_observed_at":"2026-07-06T22:52:52.882543Z","submitted_at":"2026-04-04T17:18:55Z","title":"No Constant-Cost Protocol for Point--Line Incidence","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-13T16:54:03.233284Z"},"links":{"cited_paper":"/paper/2407.20204","citing_paper":"/paper/2604.03805"},"observation_digest":"sha256:df74aa4e915ff59e517d16245c52f8ad2e18ac30d0911e225130fe3c6e9c49da","observation_id":"5b0fedee-65c1-45c9-8149-1d1a99789eb8","resolution":{"observed_at":"2026-05-13T17:03:00.933173Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.20204/citation-record","integrity":"/paper/2407.20204/integrity","json":"/paper/2407.20204/citation-record.json","paper":"/paper/2407.20204"},"outbound":[],"paper":{"arxiv_id":"2407.20204","last_updated":"2025-05-06T07:55:00Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T18:53:31.241776Z","submitted_at":"2024-07-29T17:35:19Z","title":"Constant-Cost Communication is not Reducible to k-Hamming Distance"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2407.20204."}