{"as_of":"2026-08-13T19:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4811d511715ffd7f84ac6c86bb82110c08a0ea70af0c2978fb7eafb4b4e6bd2f","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-13T06:32:02.005865+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-12T14:19:57.008767Z","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-12T14:19:57.086961Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1701.07470","last_updated":"2021-09-24T15:15:33Z","snapshot_observed_at":"2026-07-06T05:27:34.280561Z","submitted_at":"2017-01-25T20:12:02Z","title":"Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering","version":2},"cited_work":{"arxiv_id":"1701.07470","doi":null,"metadata_source":"pith","pith_arxiv_id":"1701.07470","snapshot_observed_at":"2026-08-12T14:19:57.086961Z","title":"Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering","venue":"cs.LO","work_id":"2d4a1d88-09de-4568-90e0-47a71622ba98","year":2017},"citing_paper":{"arxiv_id":"2411.17739","last_updated":"2025-09-04T16:08:27Z","snapshot_observed_at":"2026-08-12T13:54:17.961403Z","submitted_at":"2024-11-24T08:21:07Z","title":"Undecidability of the elementary theory of Young--Fibonacci lattice","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:19:57.008767Z"},"links":{"cited_paper":"/paper/1701.07470","citing_paper":"/paper/2411.17739"},"observation_digest":"sha256:902633b93e99d794908c6ecbfa6b10b6f618b064ed17c22515a85d5286986fae","observation_id":"a2228683-71b6-4f0f-ace0-b23560e8110d","resolution":{"observed_at":"2026-08-12T14:19:57.093995Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1701.07470/citation-record","integrity":"/paper/1701.07470/integrity","json":"/paper/1701.07470/citation-record.json","paper":"/paper/1701.07470"},"outbound":[],"paper":{"arxiv_id":"1701.07470","last_updated":"2021-09-24T15:15:33Z","latest_version":2,"primary_category":"cs.LO","snapshot_observed_at":"2026-07-06T05:27:34.280561Z","submitted_at":"2017-01-25T20:12:02Z","title":"Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1701.07470."}