{"as_of":"2026-08-15T17:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:45d55eac81fce03b95d496f0d1178d95e885342c575a9c316d34637d65fd6132","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:08:04.621208Z","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-05-24T07:59:09.381186Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2001.04341","last_updated":"2020-08-05T01:28:44Z","snapshot_observed_at":"2026-07-06T08:50:09.743009Z","submitted_at":"2020-01-13T15:33:46Z","title":"Information Newton's flow: second-order optimization method in probability space","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.04341","snapshot_observed_at":"2026-08-14T05:08:04.621208Z","title":"Information newton’s flow: second-order optimization method in probability space","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"1909.02102","last_updated":"2022-06-23T20:11:02Z","snapshot_observed_at":"2026-08-14T04:57:57.556179Z","submitted_at":"2019-09-04T20:43:21Z","title":"Accelerated Information Gradient flow","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T05:08:04.621208Z"},"links":{"cited_paper":"/paper/2001.04341","citing_paper":"/paper/1909.02102"},"observation_digest":"sha256:bb41b651ab7b1165c2cb8dc768c17732654a459631ed8906ffc14a3d0f0daeca","observation_id":"21292b78-3483-4287-ac50-fd710cab1c00","resolution":{"observed_at":"2026-08-14T05:08:04.621208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.04341","last_updated":"2020-08-05T01:28:44Z","snapshot_observed_at":"2026-07-06T08:50:09.743009Z","submitted_at":"2020-01-13T15:33:46Z","title":"Information Newton's flow: second-order optimization method in probability space","version":4},"cited_work":{"arxiv_id":"2001.04341","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.04341","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Operator Theory 46 (2001), no","venue":null,"work_id":"6783890e-8721-49d8-8cf1-33ffac62d2ff","year":2001},"citing_paper":{"arxiv_id":"2307.16421","last_updated":"2025-09-02T14:55:44Z","snapshot_observed_at":"2026-07-06T16:00:29.832559Z","submitted_at":"2023-07-31T06:11:47Z","title":"Wasserstein Mirror Gradient Flow as the limit of the Sinkhorn Algorithm","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-24T07:56:55.918679Z"},"links":{"cited_paper":"/paper/2001.04341","citing_paper":"/paper/2307.16421"},"observation_digest":"sha256:2f4914f6b7efde42fa89351f976462d3e2c9ac028e561fbe6042b835ae9a656b","observation_id":"fb7926b0-5b1b-45b3-8934-fc510c6439e7","resolution":{"observed_at":"2026-05-24T07:59:09.385441Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.04341","last_updated":"2020-08-05T01:28:44Z","snapshot_observed_at":"2026-07-06T08:50:09.743009Z","submitted_at":"2020-01-13T15:33:46Z","title":"Information Newton's flow: second-order optimization method in probability space","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.04341","snapshot_observed_at":"2026-08-11T12:47:48.201636Z","title":"Information Newton’s flow: second-order optimization method in probability space.arXiv preprint arXiv:2001.04341, 2020","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2412.13928","last_updated":"2025-05-19T18:37:05Z","snapshot_observed_at":"2026-08-12T02:24:07.471662Z","submitted_at":"2024-12-18T15:12:41Z","title":"Subspace Langevin Monte Carlo","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T12:47:48.201636Z"},"links":{"cited_paper":"/paper/2001.04341","citing_paper":"/paper/2412.13928"},"observation_digest":"sha256:8b1f1406a0d3c3ebb5dc8181189d5b187dce5c07a9b867e5ae0609707a28b0b7","observation_id":"6789308d-cc93-4197-bf6b-a496c2dda913","resolution":{"observed_at":"2026-08-11T12:47:48.201636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.04341","last_updated":"2020-08-05T01:28:44Z","snapshot_observed_at":"2026-07-06T08:50:09.743009Z","submitted_at":"2020-01-13T15:33:46Z","title":"Information Newton's flow: second-order optimization method in probability space","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.04341","snapshot_observed_at":"2026-08-10T23:26:24.800656Z","title":"Information N ewton's flow: Second-order optimization method in probability space","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2412.20556","last_updated":"2026-07-15T21:51:08Z","snapshot_observed_at":"2026-08-11T06:06:08.236600Z","submitted_at":"2024-12-29T19:31:23Z","title":"Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T23:26:24.800656Z"},"links":{"cited_paper":"/paper/2001.04341","citing_paper":"/paper/2412.20556"},"observation_digest":"sha256:66adab81181110a91bd6bdf37e9ac259624e2a541227207159b786c9733efc9b","observation_id":"f30578fa-b8cf-4bf3-8908-a583f2b96384","resolution":{"observed_at":"2026-08-10T23:26:24.800656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.04341","last_updated":"2020-08-05T01:28:44Z","snapshot_observed_at":"2026-07-06T08:50:09.743009Z","submitted_at":"2020-01-13T15:33:46Z","title":"Information Newton's flow: second-order optimization method in probability space","version":4},"cited_work":{"arxiv_id":"2001.04341","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.04341","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Operator Theory 46 (2001), no","venue":null,"work_id":"6783890e-8721-49d8-8cf1-33ffac62d2ff","year":2001},"citing_paper":{"arxiv_id":"2605.17963","last_updated":"2026-05-18T07:18:22Z","snapshot_observed_at":"2026-08-13T12:02:11.160407Z","submitted_at":"2026-05-18T07:18:22Z","title":"From Saddle Points Toward Global Minima: A Newton-Type Method on Wasserstein Space","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-20T09:51:19.291136Z"},"links":{"cited_paper":"/paper/2001.04341","citing_paper":"/paper/2605.17963"},"observation_digest":"sha256:d3ea26a610cae595c41943e296c5ea044602ccaa052774182ae31a7e28618227","observation_id":"3d0aa7e9-fe23-4e4b-9334-31eaf1f1aa49","resolution":{"observed_at":"2026-05-20T09:53:15.898417Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2001.04341/citation-record","integrity":"/paper/2001.04341/integrity","json":"/paper/2001.04341/citation-record.json","paper":"/paper/2001.04341"},"outbound":[],"paper":{"arxiv_id":"2001.04341","last_updated":"2020-08-05T01:28:44Z","latest_version":4,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T08:50:09.743009Z","submitted_at":"2020-01-13T15:33:46Z","title":"Information Newton's flow: second-order optimization method in probability space"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2001.04341."}