{"as_of":"2026-08-16T20:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b38c48891e54ed05744e962a8e84a05ba6e8959edfedee846e8704161d1c763f","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-14T14:53:04.080927Z","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-14T14:53:04.312802Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1903.00783","last_updated":"2020-10-01T22:30:11Z","snapshot_observed_at":"2026-08-16T12:50:31.770484Z","submitted_at":"2019-03-02T22:36:55Z","title":"Chain complex reduction via fast digraph traversal","version":2},"cited_work":{"arxiv_id":"1903.00783","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.00783","snapshot_observed_at":"2026-08-14T14:53:04.312802Z","title":"Chain complex reduction via fast digraph traversal","venue":"math.AT","work_id":"9febeb6e-3d29-4f54-b339-0e4e1c646d1c","year":2019},"citing_paper":{"arxiv_id":"1908.02518","last_updated":"2021-02-26T19:39:06Z","snapshot_observed_at":"2026-08-14T14:39:05.248371Z","submitted_at":"2019-08-07T10:33:51Z","title":"Ripser: efficient computation of Vietoris-Rips persistence barcodes","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:53:04.080927Z"},"links":{"cited_paper":"/paper/1903.00783","citing_paper":"/paper/1908.02518"},"observation_digest":"sha256:9c54b551cfe33d4e254f3e6c175460f6e54172f0ae6fa2c689b21c5139802289","observation_id":"eaf39b0b-0544-4e68-8bf9-9b26640a8d87","resolution":{"observed_at":"2026-08-14T14:53:04.321672Z","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/1903.00783/citation-record","integrity":"/paper/1903.00783/integrity","json":"/paper/1903.00783/citation-record.json","paper":"/paper/1903.00783"},"outbound":[],"paper":{"arxiv_id":"1903.00783","last_updated":"2020-10-01T22:30:11Z","latest_version":2,"primary_category":"math.AT","snapshot_observed_at":"2026-08-16T12:50:31.770484Z","submitted_at":"2019-03-02T22:36:55Z","title":"Chain complex reduction via fast digraph traversal"},"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:1903.00783."}