{"as_of":"2026-08-13T08:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2a26519eb4d7c88cb1a091984d25f857a4affb03912deeeeb748b2329ab2913a","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-13T06:32:02.005865+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-12T15:20:03.663320Z","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-12T15:20:03.711908Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2104.14587","last_updated":"2021-04-29T18:17:12Z","snapshot_observed_at":"2026-08-13T01:44:58.923641Z","submitted_at":"2021-04-29T18:17:12Z","title":"One more proof of the first linear programming bound for binary codes and two conjectures","version":1},"cited_work":{"arxiv_id":"2104.14587","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.14587","snapshot_observed_at":"2026-08-12T15:20:03.711908Z","title":"One more proof of the first linear programming bound for binary codes and two conjectures","venue":"cs.IT","work_id":"982c9d8e-55b2-4c8c-8dec-3bd80126412d","year":2021},"citing_paper":{"arxiv_id":"2411.14597","last_updated":"2024-11-21T21:43:24Z","snapshot_observed_at":"2026-08-12T15:04:42.399403Z","submitted_at":"2024-11-21T21:43:24Z","title":"Eigenvalues and eigenfunctions of a Hamming ball","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T15:20:03.663320Z"},"links":{"cited_paper":"/paper/2104.14587","citing_paper":"/paper/2411.14597"},"observation_digest":"sha256:802fb76e7bfab9465c7d30c9337cda5453c352bad851f77976673dea12979633","observation_id":"8d7d47c1-7151-49ea-81f9-26c4f60dc114","resolution":{"observed_at":"2026-08-12T15:20:03.719143Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2104.14587/citation-record","integrity":"/paper/2104.14587/integrity","json":"/paper/2104.14587/citation-record.json","paper":"/paper/2104.14587"},"outbound":[],"paper":{"arxiv_id":"2104.14587","last_updated":"2021-04-29T18:17:12Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-13T01:44:58.923641Z","submitted_at":"2021-04-29T18:17:12Z","title":"One more proof of the first linear programming bound for binary codes and two conjectures"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2104.14587."}