{"as_of":"2026-08-17T04:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:44cd9d4bd3bbb760db7e41a4a1fbee97b233f0d8dccd2952ccaf5528e3d85848","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:26:59.738334Z","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-06-29T16:13:36.142489Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1509.03668","last_updated":"2015-09-11T21:30:32Z","snapshot_observed_at":"2026-08-14T22:32:43.824980Z","submitted_at":"2015-09-11T21:30:32Z","title":"An efficient linear programming method for Optimal Transportation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1509.03668","snapshot_observed_at":"2026-08-06T20:11:51.044398Z","title":"An efficient linear programming method for optimal transportation","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.03669","last_updated":"2026-06-24T08:51:41Z","snapshot_observed_at":"2026-08-13T07:55:55.691710Z","submitted_at":"2025-07-04T15:43:33Z","title":"The Monge optimal transport barycenter problem","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:51.044398Z"},"links":{"cited_paper":"/paper/1509.03668","citing_paper":"/paper/2507.03669"},"observation_digest":"sha256:f94df0e16433d3d140a03808f98961e983a3fb326e5618f0041c4dcdd50c8fa1","observation_id":"5f5645e8-ba17-496a-920d-63124255558d","resolution":{"observed_at":"2026-08-06T20:11:51.044398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1509.03668","last_updated":"2015-09-11T21:30:32Z","snapshot_observed_at":"2026-08-14T22:32:43.824980Z","submitted_at":"2015-09-11T21:30:32Z","title":"An efficient linear programming method for Optimal Transportation","version":1},"cited_work":{"arxiv_id":"1509.03668","doi":null,"metadata_source":"pith","pith_arxiv_id":"1509.03668","snapshot_observed_at":"2026-06-29T16:13:36.142489Z","title":"An efficient linear programming method for Optimal Transportation","venue":"math.NA","work_id":"819ba7f5-b3ab-4ac4-b7f4-a804e73a8de8","year":2015},"citing_paper":{"arxiv_id":"2605.26659","last_updated":"2026-05-26T07:44:35Z","snapshot_observed_at":"2026-08-12T21:09:43.118151Z","submitted_at":"2026-05-26T07:44:35Z","title":"FINOM: Fast Sinkhorn on Non-uniform Meshes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T16:07:37.116957Z"},"links":{"cited_paper":"/paper/1509.03668","citing_paper":"/paper/2605.26659"},"observation_digest":"sha256:833d4f60feeaf1bf99ec83cdee07e13b23e2ce4253a7f66e46ed2b7f0659e358","observation_id":"7e1ddc4e-3e07-4b0f-b64c-a72dc0d3ce2f","resolution":{"observed_at":"2026-06-29T16:13:36.143696Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1509.03668","last_updated":"2015-09-11T21:30:32Z","snapshot_observed_at":"2026-08-14T22:32:43.824980Z","submitted_at":"2015-09-11T21:30:32Z","title":"An efficient linear programming method for Optimal Transportation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1509.03668","snapshot_observed_at":"2026-08-16T00:26:59.738334Z","title":"arXiv preprint arXiv:1509.03668 (2015)","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.12060","last_updated":"2026-08-12T13:47:05Z","snapshot_observed_at":"2026-08-16T00:15:47.748370Z","submitted_at":"2026-08-12T13:47:05Z","title":"A Multiscale Primal-Dual Interior-Point Relaxation Method for Large-Scale Optimal Transport Problems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T00:26:59.738334Z"},"links":{"cited_paper":"/paper/1509.03668","citing_paper":"/paper/2608.12060"},"observation_digest":"sha256:0ab5f5997f86cddd4ab763c0fa0d31371d331c48c142820564c7bb67db9ed5b8","observation_id":"8e5d8e67-2553-4d78-ac9e-e35aeaf86fb1","resolution":{"observed_at":"2026-08-16T00:26:59.738334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1509.03668/citation-record","integrity":"/paper/1509.03668/integrity","json":"/paper/1509.03668/citation-record.json","paper":"/paper/1509.03668"},"outbound":[],"paper":{"arxiv_id":"1509.03668","last_updated":"2015-09-11T21:30:32Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-14T22:32:43.824980Z","submitted_at":"2015-09-11T21:30:32Z","title":"An efficient linear programming method for Optimal Transportation"},"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 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1509.03668."}