{"as_of":"2026-08-16T08:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1cad6d3663b1302c24174be572399ad0c3dc6bcfbe585e08d651bd6dc2f20c88","coverage":[{"denominator":7,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-17T22:21:39.988265Z","state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2511.11359/citation-record","integrity":"/paper/2511.11359/integrity","json":"/paper/2511.11359/citation-record.json","paper":"/paper/2511.11359"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Semi- Streaming Bipartite Matching in Fewer Passes and Optimal Space","venue":null,"work_id":"bcfc3256-f5d3-4992-bfe3-8c9e7a289470","year":2022},"citing_paper":{"arxiv_id":"2511.11359","last_updated":"2026-05-11T15:32:20Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-14T14:45:22Z","title":"Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-17T22:21:39.988265Z"},"links":{"citing_paper":"/paper/2511.11359"},"observation_digest":"sha256:fbf0f2367587c2fa090e730ad229ab87905ad3fda4932dd786378069abb445e5","observation_id":"d95ae306-25b7-48f5-b214-88870a07f7fc","resolution":{"observed_at":"2026-05-17T22:22:09.262662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2210.16456","last_updated":"2022-10-29T01:04:19Z","snapshot_observed_at":"2026-08-15T17:43:34.387864Z","submitted_at":"2022-10-29T01:04:19Z","title":"Flows, Scaling, and Entropy Revisited: a Unified Perspective via Optimizing Joint Distributions","version":1},"cited_work":{"arxiv_id":"2210.16456","doi":"10.48550/arxiv.2210.16456","metadata_source":"arxiv_reference","pith_arxiv_id":"2210.16456","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Altschuler","venue":"arXiv (Cornell University)","work_id":"7584f981-c82d-47fc-9cbf-371d1fddbfbe","year":null},"citing_paper":{"arxiv_id":"2511.11359","last_updated":"2026-05-11T15:32:20Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-14T14:45:22Z","title":"Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-17T22:21:39.988265Z"},"links":{"cited_paper":"/paper/2210.16456","citing_paper":"/paper/2511.11359"},"observation_digest":"sha256:5fb959bcd966b2155acc29c7d248a2f02120de6fce6ddaf9b29c2ecb5c1cd5bb","observation_id":"15fc5a16-136b-474f-b32e-930b949c26b2","resolution":{"observed_at":"2026-05-17T22:22:08.931971Z","resolver_source":"arxiv_id","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Springer Nature Switzerland, Cham","venue":null,"work_id":"81ed87dc-fcb0-4f89-9503-b8cd39b609db","year":2019},"citing_paper":{"arxiv_id":"2511.11359","last_updated":"2026-05-11T15:32:20Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-14T14:45:22Z","title":"Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-17T22:21:39.988265Z"},"links":{"citing_paper":"/paper/2511.11359"},"observation_digest":"sha256:faaba7a18ec067d94d81f0124b52fd1f2aa2362f45b869bf35eb0059a4cae595","observation_id":"b0cb2934-bc80-4ba1-8f1c-460e609e4fe3","resolution":{"observed_at":"2026-05-17T22:22:09.252469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast algorithms for computational optimal transport and Wasserstein barycenter","venue":null,"work_id":"f0ce84a0-1ad9-4c2f-841d-db453d9e64c2","year":2088},"citing_paper":{"arxiv_id":"2511.11359","last_updated":"2026-05-11T15:32:20Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-14T14:45:22Z","title":"Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-17T22:21:39.988265Z"},"links":{"citing_paper":"/paper/2511.11359"},"observation_digest":"sha256:6651f91fd5309d72eb9f5fcbc9f5f7dfe1029b3949ed066ece6443d5d04ecfd6","observation_id":"0facf310-10e6-48d7-8e94-a4c85286bc08","resolution":{"observed_at":"2026-05-17T22:22:09.257749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Path finding methods for linear programming: Solving linear programsin ˜O( √ rank) iterations and faster algorithms for maximum flow","venue":null,"work_id":"6612a1b6-73b1-417d-aee8-a2c2a2d796f2","year":2014},"citing_paper":{"arxiv_id":"2511.11359","last_updated":"2026-05-11T15:32:20Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-14T14:45:22Z","title":"Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-17T22:21:39.988265Z"},"links":{"citing_paper":"/paper/2511.11359"},"observation_digest":"sha256:016a1e6c252701cf9b80b2b3cbdce8bd6c8048937602d07e1be1d0fd7888d370","observation_id":"ab8ad08c-dc13-4eec-98b2-1ae26e302ff0","resolution":{"observed_at":"2026-05-17T22:22:09.255187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2407.19689","last_updated":"2024-07-29T04:20:22Z","snapshot_observed_at":"2026-08-16T05:34:31.439272Z","submitted_at":"2024-07-29T04:20:22Z","title":"PDOT: a Practical Primal-Dual Algorithm and a GPU-Based Solver for Optimal Transport","version":1},"cited_work":{"arxiv_id":"2407.19689","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.19689","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2407.19689","venue":null,"work_id":"abdadd4a-94cb-4592-bf9a-cc5483d4ef86","year":2024},"citing_paper":{"arxiv_id":"2511.11359","last_updated":"2026-05-11T15:32:20Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-14T14:45:22Z","title":"Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-17T22:21:39.988265Z"},"links":{"cited_paper":"/paper/2407.19689","citing_paper":"/paper/2511.11359"},"observation_digest":"sha256:ac09ee201a69d01e24712fabb51e2bc70547da6af1d8c583b721aa40ef7ab474","observation_id":"1b0458b4-0dd1-4e79-952c-564718119a63","resolution":{"observed_at":"2026-05-17T22:22:08.937495Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Area-convexity, l∞regularization, and undirected multicommodity flow","venue":null,"work_id":"b52ba6f1-8416-42db-9d1b-63dd94141267","year":2017},"citing_paper":{"arxiv_id":"2511.11359","last_updated":"2026-05-11T15:32:20Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-14T14:45:22Z","title":"Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-17T22:21:39.988265Z"},"links":{"citing_paper":"/paper/2511.11359"},"observation_digest":"sha256:744922ab6275f220aacdc78f612d35b76f753d53e66c1be0a70ff42e6ec555e5","observation_id":"ca3916a5-0443-4b08-bbac-7e59d13a4f00","resolution":{"observed_at":"2026-05-17T22:22:09.260217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2511.11359","last_updated":"2026-05-11T15:32:20Z","latest_version":4,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-14T14:45:22Z","title":"Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space"},"reference_resolution":{"displayed":7,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":5},"total_outbound_references":7},"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 7 of 7 outbound references and 0 inbound Pith citation observations for arXiv:2511.11359."}