{"as_of":"2026-08-20T03:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:91c732a96b1bbd2e8a32c1970f4f1a0563bd21f156c35b664cc9338e108b9ab7","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-19T06:32:44.657259+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-10T19:08:00.276317Z","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-07-02T06:06:41.841442Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1705.09634","last_updated":"2018-02-07T18:55:19Z","snapshot_observed_at":"2026-08-14T20:57:56.746902Z","submitted_at":"2017-05-26T16:14:38Z","title":"Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.09634","snapshot_observed_at":"2026-08-10T19:08:00.276317Z","title":"Altschuler, J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.10681","last_updated":"2025-07-09T03:29:30Z","snapshot_observed_at":"2026-08-18T18:27:19.351680Z","submitted_at":"2025-01-18T07:16:42Z","title":"Multi-scale Optimal Transport for Complete Collider Events","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T19:08:00.276317Z"},"links":{"cited_paper":"/paper/1705.09634","citing_paper":"/paper/2501.10681"},"observation_digest":"sha256:a9b3a550a53de62d29e994f929f879037f1eddaa8c950b13475e1ebc7d035219","observation_id":"4be07805-e670-469b-b286-85d5752c79f6","resolution":{"observed_at":"2026-08-10T19:08:00.276317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.09634","last_updated":"2018-02-07T18:55:19Z","snapshot_observed_at":"2026-08-14T20:57:56.746902Z","submitted_at":"2017-05-26T16:14:38Z","title":"Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration","version":2},"cited_work":{"arxiv_id":"1705.09634","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.09634","snapshot_observed_at":"2026-07-02T06:06:41.841442Z","title":"Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration","venue":"cs.DS","work_id":"e8c83240-67df-4acc-877c-7ac6fe1d8674","year":2017},"citing_paper":{"arxiv_id":"2606.05327","last_updated":"2026-08-13T18:52:58Z","snapshot_observed_at":"2026-08-19T23:09:18.862227Z","submitted_at":"2026-06-03T18:11:44Z","title":"Multimarginal flow matching with optimal transport potentials","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-28T07:29:08.311282Z"},"links":{"cited_paper":"/paper/1705.09634","citing_paper":"/paper/2606.05327"},"observation_digest":"sha256:9f0ca2f40ff7df6e58fd9d3822a4c21bcefd18ccdeea80f04db6a5d0909c7ef4","observation_id":"ba71e90e-d87d-4c6d-91db-e3c583d99d7c","resolution":{"observed_at":"2026-07-02T06:06:41.842682Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1705.09634/citation-record","integrity":"/paper/1705.09634/integrity","json":"/paper/1705.09634/citation-record.json","paper":"/paper/1705.09634"},"outbound":[],"paper":{"arxiv_id":"1705.09634","last_updated":"2018-02-07T18:55:19Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T20:57:56.746902Z","submitted_at":"2017-05-26T16:14:38Z","title":"Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1705.09634."}