{"as_of":"2026-08-09T20:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:96107588b9bb19a385c6e2912e41795f1838672fd347434fee81000d99184bae","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-06T22:56:25.726044Z","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-06T22:56:28.467146Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2207.09854","last_updated":"2022-07-20T12:39:34Z","snapshot_observed_at":"2026-08-04T06:17:29.953383Z","submitted_at":"2022-07-20T12:39:34Z","title":"Auto-active Verification of Graph Algorithms, Written in OCaml","version":1},"cited_work":{"arxiv_id":"2207.09854","doi":null,"metadata_source":"pith","pith_arxiv_id":"2207.09854","snapshot_observed_at":"2026-08-06T22:56:28.467146Z","title":"Auto-active Verification of Graph Algorithms, Written in OCaml","venue":"cs.LO","work_id":"67e19f78-0bb9-45f3-b6ad-91f3d05fd1e8","year":2022},"citing_paper":{"arxiv_id":"2506.20310","last_updated":"2025-06-25T10:48:38Z","snapshot_observed_at":"2026-08-09T08:24:48.202407Z","submitted_at":"2025-06-25T10:48:38Z","title":"Unfolding Iterators: Specification and Verification of Higher-Order Iterators, in OCaml","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:56:25.726044Z"},"links":{"cited_paper":"/paper/2207.09854","citing_paper":"/paper/2506.20310"},"observation_digest":"sha256:e80e7411a27ffb3e543b7d9a48a45d290d02283f05a17b9918b1da129854cab7","observation_id":"44f8909b-5f59-4b1a-ac77-60d81e9bafd5","resolution":{"observed_at":"2026-08-06T22:56:28.514488Z","resolver_source":"local_arxiv","status":"verified_exact"},"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/2207.09854/citation-record","integrity":"/paper/2207.09854/integrity","json":"/paper/2207.09854/citation-record.json","paper":"/paper/2207.09854"},"outbound":[],"paper":{"arxiv_id":"2207.09854","last_updated":"2022-07-20T12:39:34Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-04T06:17:29.953383Z","submitted_at":"2022-07-20T12:39:34Z","title":"Auto-active Verification of Graph Algorithms, Written in OCaml"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2207.09854."}