{"as_of":"2026-08-14T07:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5e03dfb2b3f84d75e865f4a27d436c1e594c86cff652c92325f92853d6a66b96","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-14T06:32:32.682623+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-07T15:05:22.744739Z","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-07T15:05:23.273085Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.13420","last_updated":"2025-08-19T00:35:54Z","snapshot_observed_at":"2026-08-05T19:00:11.695995Z","submitted_at":"2025-08-19T00:35:54Z","title":"On subshifts with low maximal pattern complexity","version":1},"cited_work":{"arxiv_id":"2508.13420","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.13420","snapshot_observed_at":"2026-08-07T15:05:23.273085Z","title":"On subshifts with low maximal pattern complexity","venue":"math.DS","work_id":"1d8a0d0b-9ccf-40a5-95d4-fede808c37aa","year":2025},"citing_paper":{"arxiv_id":"2608.06103","last_updated":"2026-08-06T14:38:54Z","snapshot_observed_at":"2026-08-13T23:57:45.120582Z","submitted_at":"2026-08-06T14:38:54Z","title":"Maximal pattern complexity and structure of null systems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:05:22.744739Z"},"links":{"cited_paper":"/paper/2508.13420","citing_paper":"/paper/2608.06103"},"observation_digest":"sha256:d501f6c7a38ed591b5f1a38ce638dab47a9a0a72a6041789e40e49f59887a89f","observation_id":"47bd8972-b2a2-4e7a-9070-5d6ba126bb88","resolution":{"observed_at":"2026-08-07T15:05:23.312748Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.13420/citation-record","integrity":"/paper/2508.13420/integrity","json":"/paper/2508.13420/citation-record.json","paper":"/paper/2508.13420"},"outbound":[],"paper":{"arxiv_id":"2508.13420","last_updated":"2025-08-19T00:35:54Z","latest_version":1,"primary_category":"math.DS","snapshot_observed_at":"2026-08-05T19:00:11.695995Z","submitted_at":"2025-08-19T00:35:54Z","title":"On subshifts with low maximal pattern complexity"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2508.13420."}