{"as_of":"2026-08-23T16:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4ee4f28ddfb4235ab0751adaf91f176cfceb68ec1dc35d0dbf8dcfc4c6a75086","coverage":[{"denominator":2,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T10:32:38.304117Z","state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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-07-31T15:58:23.737989Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2601.10526","last_updated":"2026-07-09T23:48:51Z","snapshot_observed_at":"2026-08-20T18:50:33.393912Z","submitted_at":"2026-01-15T15:52:23Z","title":"On the suboptimality of linear codes for binary distributed hypothesis testing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.10526","snapshot_observed_at":"2026-07-31T15:58:23.737989Z","title":"On the suboptimal ity of linear codes for binary distributed hypothesis testi ng,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28162","last_updated":"2026-07-30T13:03:16Z","snapshot_observed_at":"2026-08-16T14:15:46.699095Z","submitted_at":"2026-07-30T13:03:16Z","title":"On The Most Discriminative Boolean Functions for Correlated Sources","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T15:58:23.737989Z"},"links":{"cited_paper":"/paper/2601.10526","citing_paper":"/paper/2607.28162"},"observation_digest":"sha256:45901c1973907191c4494db397ed1ff5e393b935ff09ba372e680726007644b9","observation_id":"e1359ba7-54c3-4794-814b-1c8722af3166","resolution":{"observed_at":"2026-07-31T15:58:23.737989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2601.10526/citation-record","integrity":"/paper/2601.10526/integrity","json":"/paper/2601.10526/citation-record.json","paper":"/paper/2601.10526"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T10:32:38.155098Z","title":"Hypothesis testing with communication constraints","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2601.10526","last_updated":"2026-07-09T23:48:51Z","snapshot_observed_at":"2026-08-20T18:50:33.393912Z","submitted_at":"2026-01-15T15:52:23Z","title":"On the suboptimality of linear codes for binary distributed hypothesis testing","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T10:32:38.155098Z"},"links":{"citing_paper":"/paper/2601.10526"},"observation_digest":"sha256:d9597b1971c35b36a9408400012e7afd56986106d70ff4443a61b1ce89e52d4d","observation_id":"adad2181-9ec1-4d8b-aacb-08c0d7593d80","resolution":{"observed_at":"2026-08-03T10:32:38.155098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.00310","last_updated":"2017-12-31T16:29:01Z","snapshot_observed_at":"2026-08-14T19:58:55.448206Z","submitted_at":"2017-12-31T16:29:01Z","title":"On Binary Distributed Hypothesis Testing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.00310","snapshot_observed_at":"2026-08-03T10:32:38.304117Z","title":"Comparison of experiments","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2601.10526","last_updated":"2026-07-09T23:48:51Z","snapshot_observed_at":"2026-08-20T18:50:33.393912Z","submitted_at":"2026-01-15T15:52:23Z","title":"On the suboptimality of linear codes for binary distributed hypothesis testing","version":2},"reference_index":120,"source":"pdf_text","source_observed_at":"2026-08-03T10:32:38.304117Z"},"links":{"cited_paper":"/paper/1801.00310","citing_paper":"/paper/2601.10526"},"observation_digest":"sha256:c9da739d3c10845e7f33e8a9f6d49a31010a1f4f61326252f311de3150db5768","observation_id":"ce1804f6-66f3-47ae-b789-6161156ff509","resolution":{"observed_at":"2026-08-03T10:32:38.304117Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.10526","last_updated":"2026-07-09T23:48:51Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-20T18:50:33.393912Z","submitted_at":"2026-01-15T15:52:23Z","title":"On the suboptimality of linear codes for binary distributed hypothesis testing"},"reference_resolution":{"displayed":2,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":2},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 2 of 2 outbound references and 1 inbound Pith citation observation for arXiv:2601.10526."}