{"as_of":"2026-08-11T14:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:28f2270d7969c3da86b8e5492345dd01d28b366235959c4aa80bbcf1bd1b6860","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-11T06:34:44.6726+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-07T14:53:08.548356Z","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-07T14:53:10.233364Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.06163","last_updated":"2020-12-11T06:43:53Z","snapshot_observed_at":"2026-08-06T14:49:27.286817Z","submitted_at":"2020-12-11T06:43:53Z","title":"Classification of 8-divisible binary linear codes with minimum distance 24","version":1},"cited_work":{"arxiv_id":"2012.06163","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.06163","snapshot_observed_at":"2026-08-07T14:53:10.233364Z","title":"Classification of 8-divisible binary linear codes with minimum distance 24","venue":"cs.IT","work_id":"20426bf1-24d3-4346-bd24-9261000a4a4a","year":2020},"citing_paper":{"arxiv_id":"2505.17531","last_updated":"2025-05-23T06:39:07Z","snapshot_observed_at":"2026-08-08T00:43:04.310734Z","submitted_at":"2025-05-23T06:39:07Z","title":"Nodal surfaces in $\\mathbb{P}^3$ and coding theory","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T14:53:08.548356Z"},"links":{"cited_paper":"/paper/2012.06163","citing_paper":"/paper/2505.17531"},"observation_digest":"sha256:e2e70946f1e1584346f76c6537f096bd74eea5fdd44265a54d09c88fa6fc573c","observation_id":"b50b8b73-4b1e-4d16-a532-b60e9786afe2","resolution":{"observed_at":"2026-08-07T14:53:10.296397Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2012.06163/citation-record","integrity":"/paper/2012.06163/integrity","json":"/paper/2012.06163/citation-record.json","paper":"/paper/2012.06163"},"outbound":[],"paper":{"arxiv_id":"2012.06163","last_updated":"2020-12-11T06:43:53Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-06T14:49:27.286817Z","submitted_at":"2020-12-11T06:43:53Z","title":"Classification of 8-divisible binary linear codes with minimum distance 24"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2012.06163."}