{"as_of":"2026-08-13T23:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0072b2c7554aabdf1514b47d5cac2562b91976f46862ee4e647355d6f7bf7f6e","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":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-13T06:32:02.005865+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T10:57:12.977507Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T08:06:47.665232Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.11620","last_updated":"2024-08-21T13:47:01Z","snapshot_observed_at":"2026-08-12T22:59:58.490482Z","submitted_at":"2024-08-21T13:47:01Z","title":"Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11620","snapshot_observed_at":"2026-08-11T10:57:12.977507Z","title":", year 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16063","last_updated":"2025-07-25T17:13:43Z","snapshot_observed_at":"2026-08-13T05:58:14.718174Z","submitted_at":"2024-12-20T17:06:53Z","title":"Examining Entropic Unbalanced Optimal Transport and Sinkhorn Divergences for Spatial Forecast Verification","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T10:57:12.977507Z"},"links":{"cited_paper":"/paper/2408.11620","citing_paper":"/paper/2412.16063"},"observation_digest":"sha256:34a77ff45fc7fcd8dfd5d14543d769e3eac1433d1adebc2ea3b734694729542f","observation_id":"68617d8c-b18a-4fcb-8e84-ad868c805cf7","resolution":{"observed_at":"2026-08-11T10:57:12.977507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11620","last_updated":"2024-08-21T13:47:01Z","snapshot_observed_at":"2026-08-12T22:59:58.490482Z","submitted_at":"2024-08-21T13:47:01Z","title":"Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11620","snapshot_observed_at":"2026-08-07T10:40:35.435432Z","title":"Chizat , Annealed sinkhorn for optimal transport: convergence, regularization path and debiasing , arXiv preprint arXiv:2408.11620, (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04948","last_updated":"2026-05-27T08:59:05Z","snapshot_observed_at":"2026-08-12T09:09:30.447616Z","submitted_at":"2025-06-05T12:21:44Z","title":"Unregularized limit of stochastic gradient method for Wasserstein distributionally robust optimization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:40:35.435432Z"},"links":{"cited_paper":"/paper/2408.11620","citing_paper":"/paper/2506.04948"},"observation_digest":"sha256:158d512c77d1dc79d16c7198984875539504ceb01438ea666d43148235c6f2c5","observation_id":"1a20af81-4d3d-49f8-a86b-eed775637f38","resolution":{"observed_at":"2026-08-07T10:40:35.435432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11620","last_updated":"2024-08-21T13:47:01Z","snapshot_observed_at":"2026-08-12T22:59:58.490482Z","submitted_at":"2024-08-21T13:47:01Z","title":"Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11620","snapshot_observed_at":"2026-08-07T14:49:07.121764Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14780","last_updated":"2025-05-23T11:39:19Z","snapshot_observed_at":"2026-08-07T14:39:07.540755Z","submitted_at":"2025-05-23T11:39:19Z","title":"Faster Computation of Entropic Optimal Transport via Stable Low Frequency Modes","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T14:49:07.121764Z"},"links":{"cited_paper":"/paper/2408.11620","citing_paper":"/paper/2506.14780"},"observation_digest":"sha256:3d29c445424fc5fa2420840eb5f4fd08c5ab71e4f4bcccbccb089d2f493befec","observation_id":"3f8dbc74-05be-4ccc-b372-73a744ac797e","resolution":{"observed_at":"2026-08-07T14:49:07.121764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11620","last_updated":"2024-08-21T13:47:01Z","snapshot_observed_at":"2026-08-12T22:59:58.490482Z","submitted_at":"2024-08-21T13:47:01Z","title":"Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing","version":1},"cited_work":{"arxiv_id":"2408.11620","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.11620","snapshot_observed_at":"2026-07-02T08:06:47.665232Z","title":"arXiv preprint arXiv:2408.11620 , year=","venue":null,"work_id":"52000615-12fc-44ee-9d16-afb41a0f0065","year":2024},"citing_paper":{"arxiv_id":"2605.25551","last_updated":"2026-05-25T08:08:47Z","snapshot_observed_at":"2026-08-02T06:58:41.405375Z","submitted_at":"2026-05-25T08:08:47Z","title":"Learning Permutation from Structure Without Supervision","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:58.959999Z"},"links":{"cited_paper":"/paper/2408.11620","citing_paper":"/paper/2605.25551"},"observation_digest":"sha256:57b9c41b0c417c1870fdbdd0310b5309b39a71b34926b884ce03893936a71171","observation_id":"3df2abfb-49a3-4006-9da3-5bd82e15f517","resolution":{"observed_at":"2026-06-29T22:23:59.884877Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11620","last_updated":"2024-08-21T13:47:01Z","snapshot_observed_at":"2026-08-12T22:59:58.490482Z","submitted_at":"2024-08-21T13:47:01Z","title":"Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing","version":1},"cited_work":{"arxiv_id":"2408.11620","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.11620","snapshot_observed_at":"2026-07-02T08:06:47.665232Z","title":"arXiv preprint arXiv:2408.11620 , year=","venue":null,"work_id":"52000615-12fc-44ee-9d16-afb41a0f0065","year":2024},"citing_paper":{"arxiv_id":"2605.30267","last_updated":"2026-06-01T18:53:58Z","snapshot_observed_at":"2026-08-12T20:21:42.898391Z","submitted_at":"2026-05-28T17:29:12Z","title":"Accelerating Sinkhorn for Entropy-Regularized Optimal Transport","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T05:49:23.173224Z"},"links":{"cited_paper":"/paper/2408.11620","citing_paper":"/paper/2605.30267"},"observation_digest":"sha256:48f43f07ab00ef432d204826cde28481f5e1e2eff8be2edd65387ffb6179763e","observation_id":"340bed9a-7025-43dd-8a8f-dfc18382c8b1","resolution":{"observed_at":"2026-06-29T05:53:08.813621Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11620","last_updated":"2024-08-21T13:47:01Z","snapshot_observed_at":"2026-08-12T22:59:58.490482Z","submitted_at":"2024-08-21T13:47:01Z","title":"Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing","version":1},"cited_work":{"arxiv_id":"2408.11620","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.11620","snapshot_observed_at":"2026-07-02T08:06:47.665232Z","title":"arXiv preprint arXiv:2408.11620 , year=","venue":null,"work_id":"52000615-12fc-44ee-9d16-afb41a0f0065","year":2024},"citing_paper":{"arxiv_id":"2606.28973","last_updated":"2026-06-27T15:25:34Z","snapshot_observed_at":"2026-07-07T00:02:57.622708Z","submitted_at":"2026-06-27T15:25:34Z","title":"Sharp $O(1/k)$ convergence rate for the Sinkhorn algorithm via a local analysis","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-30T08:38:03.985543Z"},"links":{"cited_paper":"/paper/2408.11620","citing_paper":"/paper/2606.28973"},"observation_digest":"sha256:4fcc7182feca8e2f59fabc3a4ad967591cca2fa13b38bdfe82a473b312ced013","observation_id":"3b32b5ae-315f-4091-91f3-a1ec31724a51","resolution":{"observed_at":"2026-06-30T08:44:27.702824Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11620","last_updated":"2024-08-21T13:47:01Z","snapshot_observed_at":"2026-08-12T22:59:58.490482Z","submitted_at":"2024-08-21T13:47:01Z","title":"Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing","version":1},"cited_work":{"arxiv_id":"2408.11620","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.11620","snapshot_observed_at":"2026-07-02T08:06:47.665232Z","title":"arXiv preprint arXiv:2408.11620 , year=","venue":null,"work_id":"52000615-12fc-44ee-9d16-afb41a0f0065","year":2024},"citing_paper":{"arxiv_id":"2607.00665","last_updated":"2026-07-01T09:13:24Z","snapshot_observed_at":"2026-08-03T18:18:39.283181Z","submitted_at":"2026-07-01T09:13:24Z","title":"Effective dynamics of the Sinkhorn algorithm in the regime of low entropy regularization","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-02T08:05:55.418491Z"},"links":{"cited_paper":"/paper/2408.11620","citing_paper":"/paper/2607.00665"},"observation_digest":"sha256:9f2ca15ee334adea786004f0d7c9c01c7c3f8cee9b0d79149da473295f269ea7","observation_id":"93ef8543-84fa-424f-8eed-8ecd4af6984a","resolution":{"observed_at":"2026-07-02T08:06:47.666530Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2408.11620/citation-record","integrity":"/paper/2408.11620/integrity","json":"/paper/2408.11620/citation-record.json","paper":"/paper/2408.11620"},"outbound":[],"paper":{"arxiv_id":"2408.11620","last_updated":"2024-08-21T13:47:01Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T22:59:58.490482Z","submitted_at":"2024-08-21T13:47:01Z","title":"Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2408.11620."}