{"as_of":"2026-08-09T02:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4df6efb9888109feaa4279e0a800075087c64958b2f238603ecbe96ebe84c261","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-08T06:32:00.761636+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-05T23:50:27.506438Z","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-05T23:50:19.630561Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.03317","last_updated":"2020-06-10T13:18:21Z","snapshot_observed_at":"2026-08-07T01:18:03.095135Z","submitted_at":"2020-02-09T08:41:55Z","title":"Reed-Muller Codes: Theory and Algorithms","version":2},"cited_work":{"arxiv_id":"2002.03317","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.03317","snapshot_observed_at":"2026-08-05T23:50:19.630561Z","title":"Reed-Muller Codes: Theory and Algorithms","venue":"cs.IT","work_id":"3457c885-581e-4789-a5bd-5b61f46c675e","year":2020},"citing_paper":{"arxiv_id":"2508.04794","last_updated":"2025-08-06T18:10:37Z","snapshot_observed_at":"2026-08-06T07:25:20.927061Z","submitted_at":"2025-08-06T18:10:37Z","title":"Automorphism gadgets in homological product codes","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T23:50:12.634069Z"},"links":{"cited_paper":"/paper/2002.03317","citing_paper":"/paper/2508.04794"},"observation_digest":"sha256:74088eb480c822bc212ba5561daa6002ab66a113c64e87d4ff2181de7fdac545","observation_id":"7617d4a1-e3eb-445a-b7d9-578c2e6112f8","resolution":{"observed_at":"2026-08-05T23:50:19.636157Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.03317","last_updated":"2020-06-10T13:18:21Z","snapshot_observed_at":"2026-08-07T01:18:03.095135Z","submitted_at":"2020-02-09T08:41:55Z","title":"Reed-Muller Codes: Theory and Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.03317","snapshot_observed_at":"2026-08-05T23:50:27.506438Z","title":"Reed-muller codes: Theory and algorithms","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2508.04796","last_updated":"2026-07-02T23:06:55Z","snapshot_observed_at":"2026-08-06T12:35:36.047653Z","submitted_at":"2025-08-06T18:14:43Z","title":"Parity-Aware Byte-Pair Encoding: Improving Cross-lingual Fairness in Tokenization","version":3},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-05T23:50:27.506438Z"},"links":{"cited_paper":"/paper/2002.03317","citing_paper":"/paper/2508.04796"},"observation_digest":"sha256:7a8f200f094a7ea9044b4dfdc3f9add4088fbafaac7e81cfc02b7f7b31899c3a","observation_id":"b4c4559a-d1b0-41ab-b990-4ab751225dc0","resolution":{"observed_at":"2026-08-05T23:50:27.506438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2002.03317/citation-record","integrity":"/paper/2002.03317/integrity","json":"/paper/2002.03317/citation-record.json","paper":"/paper/2002.03317"},"outbound":[],"paper":{"arxiv_id":"2002.03317","last_updated":"2020-06-10T13:18:21Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T01:18:03.095135Z","submitted_at":"2020-02-09T08:41:55Z","title":"Reed-Muller Codes: Theory and Algorithms"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2002.03317."}