{"as_of":"2026-08-16T21:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f22b1946ae6d9f2befbaebaee14fd8e9b2a6305b07f46b912a1e4c20dddb45bb","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-16T06:30:59.297886+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-14T16:01:07.364747Z","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-14T16:01:07.637143Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1609.09392","last_updated":"2016-10-04T18:38:45Z","snapshot_observed_at":"2026-08-15T20:03:11.949344Z","submitted_at":"2016-09-29T15:35:09Z","title":"Polynomial-time algorithms for the curve graph","version":2},"cited_work":{"arxiv_id":"1609.09392","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.09392","snapshot_observed_at":"2026-08-14T16:01:07.637143Z","title":"Polynomial-time algorithms for the curve graph","venue":"math.GT","work_id":"64a69ede-e5f2-4f75-a37c-c9a7def28862","year":2016},"citing_paper":{"arxiv_id":"1908.00472","last_updated":"2019-08-01T16:00:31Z","snapshot_observed_at":"2026-08-16T08:39:19.380450Z","submitted_at":"2019-08-01T16:00:31Z","title":"On Translation Lengths of Anosov Maps on Curve Graph of Torus","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T16:01:07.364747Z"},"links":{"cited_paper":"/paper/1609.09392","citing_paper":"/paper/1908.00472"},"observation_digest":"sha256:212f61c29e5db03d2c0b89eff4b37362331a93475c5220f125ece1d000b26e03","observation_id":"f6c17bb4-bb2f-48fe-8191-b2b3f997f853","resolution":{"observed_at":"2026-08-14T16:01:07.644084Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1609.09392/citation-record","integrity":"/paper/1609.09392/integrity","json":"/paper/1609.09392/citation-record.json","paper":"/paper/1609.09392"},"outbound":[],"paper":{"arxiv_id":"1609.09392","last_updated":"2016-10-04T18:38:45Z","latest_version":2,"primary_category":"math.GT","snapshot_observed_at":"2026-08-15T20:03:11.949344Z","submitted_at":"2016-09-29T15:35:09Z","title":"Polynomial-time algorithms for the curve graph"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1609.09392."}