{"as_of":"2026-08-17T05:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:399f116b45d27c006e474edf3ac89e59014e46e92985a5816ba0b1b7d0b6c497","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-16T06:30:59.297886+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-06-26T03:41:39.786135Z","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-04T14:29:54.155340Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.01987","last_updated":"2021-06-04T00:09:00Z","snapshot_observed_at":"2026-08-13T21:35:27.675369Z","submitted_at":"2020-09-16T01:32:03Z","title":"Strong data processing constant is achieved by binary inputs","version":2},"cited_work":{"arxiv_id":"2010.01987","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.01987","snapshot_observed_at":"2026-07-04T14:29:54.155340Z","title":"Ordentlich and Y","venue":null,"work_id":"1dfbe540-8319-4d0a-a582-350a1fdba905","year":2022},"citing_paper":{"arxiv_id":"2606.27073","last_updated":"2026-06-25T14:15:59Z","snapshot_observed_at":"2026-08-16T14:15:49.595487Z","submitted_at":"2026-06-25T14:15:59Z","title":"Retention Profiles and KL Contraction Bounds in Finite Markov Chains","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-26T03:41:39.786135Z"},"links":{"cited_paper":"/paper/2010.01987","citing_paper":"/paper/2606.27073"},"observation_digest":"sha256:fbe24400a85e9af2ddc7e371333267bc6eec42b10e36ab7297beb5761c9c974e","observation_id":"3866fe44-2555-4b48-82ee-77db6b111b96","resolution":{"observed_at":"2026-07-04T14:29:54.157057Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2010.01987/citation-record","integrity":"/paper/2010.01987/integrity","json":"/paper/2010.01987/citation-record.json","paper":"/paper/2010.01987"},"outbound":[],"paper":{"arxiv_id":"2010.01987","last_updated":"2021-06-04T00:09:00Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-13T21:35:27.675369Z","submitted_at":"2020-09-16T01:32:03Z","title":"Strong data processing constant is achieved by binary inputs"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2010.01987."}