{"as_of":"2026-08-21T11:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:972a7a7b9443eae51ceb3aa2bb648b7f4eda733802d2052c7bd5d3b34ac3119a","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:04:35.119249Z","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-04T21:23:38.963124Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.12253","last_updated":"2024-01-20T21:23:09Z","snapshot_observed_at":"2026-08-16T14:25:53.060300Z","submitted_at":"2024-01-20T21:23:09Z","title":"Accelerating Sinkhorn Algorithm with Sparse Newton Iterations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.12253","snapshot_observed_at":"2026-08-15T17:04:35.119249Z","title":", Shavlovsky , M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.17641","last_updated":"2025-08-25T04:07:40Z","snapshot_observed_at":"2026-08-21T09:44:38.719903Z","submitted_at":"2025-08-25T04:07:40Z","title":"An efficient algorithm for entropic optimal transport under martingale-type constraints","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T17:04:35.119249Z"},"links":{"cited_paper":"/paper/2401.12253","citing_paper":"/paper/2508.17641"},"observation_digest":"sha256:df00cabf70b626c405aebb1d39fe73cf60a7c622641594f54833d5d5192b2ba7","observation_id":"d44bc048-a9fd-44b5-b502-55d10ed1f3e4","resolution":{"observed_at":"2026-08-15T17:04:35.119249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.12253","last_updated":"2024-01-20T21:23:09Z","snapshot_observed_at":"2026-08-16T14:25:53.060300Z","submitted_at":"2024-01-20T21:23:09Z","title":"Accelerating Sinkhorn Algorithm with Sparse Newton Iterations","version":1},"cited_work":{"arxiv_id":"2401.12253","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.12253","snapshot_observed_at":"2026-08-04T21:23:38.963124Z","title":"Accelerating Sinkhorn Algorithm with Sparse Newton Iterations","venue":"math.OC","work_id":"e5c59ad2-01f0-4f9d-bdce-9ddbb0c6e4bb","year":2024},"citing_paper":{"arxiv_id":"2509.08104","last_updated":"2025-09-09T19:31:06Z","snapshot_observed_at":"2026-08-07T17:53:12.499049Z","submitted_at":"2025-09-09T19:31:06Z","title":"APML: Adaptive Probabilistic Matching Loss for Robust 3D Point Cloud Reconstruction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T21:23:38.131648Z"},"links":{"cited_paper":"/paper/2401.12253","citing_paper":"/paper/2509.08104"},"observation_digest":"sha256:5f8661eec68601da8277214415ef815ed817e3b69f107fdae896ec0fac497d90","observation_id":"aa5f4830-05c9-4ddd-a85c-1609a348df8a","resolution":{"observed_at":"2026-08-04T21:23:39.037755Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2401.12253/citation-record","integrity":"/paper/2401.12253/integrity","json":"/paper/2401.12253/citation-record.json","paper":"/paper/2401.12253"},"outbound":[],"paper":{"arxiv_id":"2401.12253","last_updated":"2024-01-20T21:23:09Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T14:25:53.060300Z","submitted_at":"2024-01-20T21:23:09Z","title":"Accelerating Sinkhorn Algorithm with Sparse Newton Iterations"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2401.12253."}