{"as_of":"2026-08-10T03:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f582996e37a1f27af058102ec91c745db8218ceb24340f93ce9fe417cfb0027e","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-09T06:31:02.800959+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-08T05:04:33.529111Z","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-08T06:16:17.936174Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.16484","last_updated":"2023-02-14T12:04:13Z","snapshot_observed_at":"2026-07-06T14:24:41.980034Z","submitted_at":"2022-11-29T18:54:14Z","title":"A Finite Axiomatisation of Finite-State Automata Using String Diagrams","version":3},"cited_work":{"arxiv_id":"2211.16484","doi":"10.48550/arxiv.2211.16484","metadata_source":"pith","pith_arxiv_id":"2211.16484","snapshot_observed_at":"2026-08-08T06:16:17.936174Z","title":"A Finite Axiomatisation of Finite-State Automata Using String Diagrams","venue":"cs.LO","work_id":"3df010f3-b9a4-4453-9a2b-147d04c85416","year":2022},"citing_paper":{"arxiv_id":"2502.08497","last_updated":"2025-02-12T15:32:52Z","snapshot_observed_at":"2026-08-09T15:43:33.510247Z","submitted_at":"2025-02-12T15:32:52Z","title":"Foundations of Digital Circuits: Denotation, Operational, and Algebraic Semantics","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T05:04:33.529111Z"},"links":{"cited_paper":"/paper/2211.16484","citing_paper":"/paper/2502.08497"},"observation_digest":"sha256:25f620d5c5e9ee41c16d4528c807996536ac59dde3b9ef4fcb128999543ba6b2","observation_id":"cfaba8f5-d02e-4188-beb9-30da48b5aed8","resolution":{"observed_at":"2026-08-08T05:04:33.643125Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2211.16484/citation-record","integrity":"/paper/2211.16484/integrity","json":"/paper/2211.16484/citation-record.json","paper":"/paper/2211.16484"},"outbound":[],"paper":{"arxiv_id":"2211.16484","last_updated":"2023-02-14T12:04:13Z","latest_version":3,"primary_category":"cs.LO","snapshot_observed_at":"2026-07-06T14:24:41.980034Z","submitted_at":"2022-11-29T18:54:14Z","title":"A Finite Axiomatisation of Finite-State Automata Using String Diagrams"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2211.16484."}