{"as_of":"2026-08-08T03:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:51b8f8c5abd6f8352af7fe4312c69683049c7ede0be24011b9e72ea2d583f65c","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:01:08.511203Z","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.656914Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.04917","last_updated":"2023-06-12T15:29:49Z","snapshot_observed_at":"2026-07-06T15:24:42.200476Z","submitted_at":"2023-05-08T17:53:13Z","title":"Gradient descent with a general cost","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.04917","snapshot_observed_at":"2026-08-07T15:01:08.511203Z","title":"Gradient descent with a general cost.arXiv preprint arXiv:2305.04917, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16970","last_updated":"2025-05-22T17:50:10Z","snapshot_observed_at":"2026-08-08T01:02:59.562855Z","submitted_at":"2025-05-22T17:50:10Z","title":"Horospherically Convex Optimization on Hadamard Manifolds Part I: Analysis and Algorithms","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T15:01:08.511203Z"},"links":{"cited_paper":"/paper/2305.04917","citing_paper":"/paper/2505.16970"},"observation_digest":"sha256:dcb5fe5bd1b9b6cbe984398c56d19e46655eb027a4ae642d51cad91317887e18","observation_id":"3949a307-9a27-46e4-8fe1-5ae2d5d101de","resolution":{"observed_at":"2026-08-07T15:01:08.511203Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.04917","last_updated":"2023-06-12T15:29:49Z","snapshot_observed_at":"2026-07-06T15:24:42.200476Z","submitted_at":"2023-05-08T17:53:13Z","title":"Gradient descent with a general cost","version":2},"cited_work":{"arxiv_id":"2305.04917","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.04917","snapshot_observed_at":"2026-07-02T08:06:47.656914Z","title":"Gradient descent with a general cost","venue":null,"work_id":"c5bf4515-0263-420b-96d0-f297c97d70a2","year":2023},"citing_paper":{"arxiv_id":"2605.12666","last_updated":"2026-05-12T19:16:13Z","snapshot_observed_at":"2026-08-03T00:15:00.075977Z","submitted_at":"2026-05-12T19:16:13Z","title":"Newton methods beyond Hessian Lipschitz continuity: A nonlinear preconditioning approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-14T20:32:13.593088Z"},"links":{"cited_paper":"/paper/2305.04917","citing_paper":"/paper/2605.12666"},"observation_digest":"sha256:4a012703278f759dd7d9c573a23d42af193c39c196c6f7bd79982d99b666b65c","observation_id":"5378b515-0282-403f-b2bd-5ad1e2f05823","resolution":{"observed_at":"2026-05-14T20:32:56.523066Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.04917","last_updated":"2023-06-12T15:29:49Z","snapshot_observed_at":"2026-07-06T15:24:42.200476Z","submitted_at":"2023-05-08T17:53:13Z","title":"Gradient descent with a general cost","version":2},"cited_work":{"arxiv_id":"2305.04917","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.04917","snapshot_observed_at":"2026-07-02T08:06:47.656914Z","title":"Gradient descent with a general cost","venue":null,"work_id":"c5bf4515-0263-420b-96d0-f297c97d70a2","year":2023},"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":55,"source":"arxiv_source","source_observed_at":"2026-06-30T08:38:03.985543Z"},"links":{"cited_paper":"/paper/2305.04917","citing_paper":"/paper/2606.28973"},"observation_digest":"sha256:8e02ed2d976f6470e226b9a34af888f18b4b515868f40f522e09ace0613de89f","observation_id":"85f18c93-bfb4-4c21-ae53-69eff14164be","resolution":{"observed_at":"2026-06-30T08:44:27.692373Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.04917","last_updated":"2023-06-12T15:29:49Z","snapshot_observed_at":"2026-07-06T15:24:42.200476Z","submitted_at":"2023-05-08T17:53:13Z","title":"Gradient descent with a general cost","version":2},"cited_work":{"arxiv_id":"2305.04917","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.04917","snapshot_observed_at":"2026-07-02T08:06:47.656914Z","title":"Gradient descent with a general cost","venue":null,"work_id":"c5bf4515-0263-420b-96d0-f297c97d70a2","year":2023},"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":54,"source":"arxiv_source","source_observed_at":"2026-07-02T08:05:55.418491Z"},"links":{"cited_paper":"/paper/2305.04917","citing_paper":"/paper/2607.00665"},"observation_digest":"sha256:d78bdeb8ac4d70aea848ea127b3166fb649c21aa5041266b49ec1a603efd73be","observation_id":"2713fbf0-1319-432e-b1ba-fd277f70341c","resolution":{"observed_at":"2026-07-02T08:06:47.658240Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.04917/citation-record","integrity":"/paper/2305.04917/integrity","json":"/paper/2305.04917/citation-record.json","paper":"/paper/2305.04917"},"outbound":[],"paper":{"arxiv_id":"2305.04917","last_updated":"2023-06-12T15:29:49Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T15:24:42.200476Z","submitted_at":"2023-05-08T17:53:13Z","title":"Gradient descent with a general cost"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2305.04917."}