{"as_of":"2026-08-08T17:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2b1f9cc537667597c7269888268f8f5af5eb6ad69850483fafc6294f5a7a1c78","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-08T06:32:00.761636+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-31T17:24:55.239745Z","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":"2007.09739","last_updated":"2021-04-16T11:42:14Z","snapshot_observed_at":"2026-07-06T09:40:01.447392Z","submitted_at":"2020-07-19T18:27:42Z","title":"Milliken's tree theorem and its applications: a computability-theoretic perspective","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.09739","snapshot_observed_at":"2026-07-31T17:24:55.239745Z","title":"Milliken’s tree theorem and its applications: a computability-theoretic perspective.arXiv preprint arXiv:2007.09739, page 141, 2020","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.28116","last_updated":"2026-07-30T12:24:42Z","snapshot_observed_at":"2026-08-03T00:04:04.719716Z","submitted_at":"2026-07-30T12:24:42Z","title":"$\\Pi^0_4$ conservation of a Carlson-Simpson lemma for 1-variable words","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T17:24:55.239745Z"},"links":{"cited_paper":"/paper/2007.09739","citing_paper":"/paper/2607.28116"},"observation_digest":"sha256:62633b6783faefadd67538d59f8d3a65b56b3ce80d240bbded503b18c3fac787","observation_id":"42eadb65-3ae8-4b20-a938-16f898597247","resolution":{"observed_at":"2026-07-31T17:24:55.239745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2007.09739/citation-record","integrity":"/paper/2007.09739/integrity","json":"/paper/2007.09739/citation-record.json","paper":"/paper/2007.09739"},"outbound":[],"paper":{"arxiv_id":"2007.09739","last_updated":"2021-04-16T11:42:14Z","latest_version":2,"primary_category":"math.LO","snapshot_observed_at":"2026-07-06T09:40:01.447392Z","submitted_at":"2020-07-19T18:27:42Z","title":"Milliken's tree theorem and its applications: a computability-theoretic perspective"},"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 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2007.09739."}