{"as_of":"2026-08-08T11:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b04f6c532316309a3d6accb32abdb5971431af9a99187670e62594b8c2264043","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-08T06:32:00.761636+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-07T12:46:45.514535Z","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-07T12:46:47.794236Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.11738","last_updated":"2021-10-22T12:16:08Z","snapshot_observed_at":"2026-07-06T12:00:39.539050Z","submitted_at":"2021-10-22T12:16:08Z","title":"A Fast and Accurate Splitting Method for Optimal Transport: Analysis and Implementation","version":1},"cited_work":{"arxiv_id":"2110.11738","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.11738","snapshot_observed_at":"2026-08-07T12:46:47.794236Z","title":"A Fast and Accurate Splitting Method for Optimal Transport: Analysis and Implementation","venue":"math.OC","work_id":"291f5a08-baa1-4d32-9136-a7bff324210f","year":2021},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.514535Z"},"links":{"cited_paper":"/paper/2110.11738","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:3fd895bd9e0121175a5109315081346d61d41f5aa169cb2456e37a808d1c32b1","observation_id":"5d774289-cd90-4c6b-836e-316870bd10b6","resolution":{"observed_at":"2026-08-07T12:46:47.839135Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2110.11738/citation-record","integrity":"/paper/2110.11738/integrity","json":"/paper/2110.11738/citation-record.json","paper":"/paper/2110.11738"},"outbound":[],"paper":{"arxiv_id":"2110.11738","last_updated":"2021-10-22T12:16:08Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T12:00:39.539050Z","submitted_at":"2021-10-22T12:16:08Z","title":"A Fast and Accurate Splitting Method for Optimal Transport: Analysis and Implementation"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2110.11738."}