{"as_of":"2026-08-09T22:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:85932c6a231617d7ba59b1e3c3ebd79145dca5d81755d0aa825d0604e2de767e","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-09T06:31:02.800959+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-08T04:56:54.550547Z","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.611292Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.17296","last_updated":"2024-05-15T05:16:24Z","snapshot_observed_at":"2026-08-04T08:53:23.652013Z","submitted_at":"2023-11-29T00:48:18Z","title":"Mirror Duality in Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.17296","snapshot_observed_at":"2026-08-08T04:56:54.550547Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08532","last_updated":"2025-06-16T23:04:01Z","snapshot_observed_at":"2026-08-09T22:26:17.419171Z","submitted_at":"2025-02-12T16:12:17Z","title":"Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness","version":2},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-08T04:56:54.550547Z"},"links":{"cited_paper":"/paper/2311.17296","citing_paper":"/paper/2502.08532"},"observation_digest":"sha256:13f988b5fb5cb34ff850a82760d3073f95be91157cc98ffe0e19cc076c1c858a","observation_id":"fd8a9e62-d6aa-47de-bd40-78ee1264af13","resolution":{"observed_at":"2026-08-08T04:56:54.550547Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.17296","last_updated":"2024-05-15T05:16:24Z","snapshot_observed_at":"2026-08-04T08:53:23.652013Z","submitted_at":"2023-11-29T00:48:18Z","title":"Mirror Duality in Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.17296","snapshot_observed_at":"2026-08-06T21:42:46.312523Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.23756","last_updated":"2025-06-30T11:56:51Z","snapshot_observed_at":"2026-08-09T01:26:32.213386Z","submitted_at":"2025-06-30T11:56:51Z","title":"Optimized methods for composite optimization: a reduction perspective","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T21:42:46.312523Z"},"links":{"cited_paper":"/paper/2311.17296","citing_paper":"/paper/2506.23756"},"observation_digest":"sha256:f23bf349e839b6a0f3d1a083d5badf112f6b28b738cfc1bab4b2bfb02260516d","observation_id":"7a058809-194a-4218-9fe8-7bbcae291bd9","resolution":{"observed_at":"2026-08-06T21:42:46.312523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.17296","last_updated":"2024-05-15T05:16:24Z","snapshot_observed_at":"2026-08-04T08:53:23.652013Z","submitted_at":"2023-11-29T00:48:18Z","title":"Mirror Duality in Convex Optimization","version":2},"cited_work":{"arxiv_id":"2311.17296","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.17296","snapshot_observed_at":"2026-07-02T08:06:47.611292Z","title":"Mirror duality in convex optimization","venue":null,"work_id":"1662c5e1-42d1-46e2-b8a9-324fac7d1793","year":2023},"citing_paper":{"arxiv_id":"2511.20370","last_updated":"2026-04-17T09:44:26Z","snapshot_observed_at":"2026-08-09T13:14:31.481090Z","submitted_at":"2025-11-25T14:51:41Z","title":"Nonlinearly preconditioned gradient flows","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-17T04:43:53.167736Z"},"links":{"cited_paper":"/paper/2311.17296","citing_paper":"/paper/2511.20370"},"observation_digest":"sha256:a5de87f4a735f6239ff0228ea1c053d9b262b997441a67e08bb64d96f7f77b40","observation_id":"38089b15-a4fb-4b5e-b401-67503441373d","resolution":{"observed_at":"2026-05-17T04:44:02.271007Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.17296","last_updated":"2024-05-15T05:16:24Z","snapshot_observed_at":"2026-08-04T08:53:23.652013Z","submitted_at":"2023-11-29T00:48:18Z","title":"Mirror Duality in Convex Optimization","version":2},"cited_work":{"arxiv_id":"2311.17296","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.17296","snapshot_observed_at":"2026-07-02T08:06:47.611292Z","title":"Mirror duality in convex optimization","venue":null,"work_id":"1662c5e1-42d1-46e2-b8a9-324fac7d1793","year":2023},"citing_paper":{"arxiv_id":"2605.02231","last_updated":"2026-05-04T05:04:35Z","snapshot_observed_at":"2026-07-06T23:15:23.301944Z","submitted_at":"2026-05-04T05:04:35Z","title":"A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-08T18:49:18.327294Z"},"links":{"cited_paper":"/paper/2311.17296","citing_paper":"/paper/2605.02231"},"observation_digest":"sha256:2db68494ba7e66fe7683a8767efb94e033068b3bb509cd4b04b5c92fbf2fc3f6","observation_id":"07e14fdc-2483-4f40-8009-aa2a36c3902b","resolution":{"observed_at":"2026-05-09T06:10:42.265824Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.17296","last_updated":"2024-05-15T05:16:24Z","snapshot_observed_at":"2026-08-04T08:53:23.652013Z","submitted_at":"2023-11-29T00:48:18Z","title":"Mirror Duality in Convex Optimization","version":2},"cited_work":{"arxiv_id":"2311.17296","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.17296","snapshot_observed_at":"2026-07-02T08:06:47.611292Z","title":"Mirror duality in convex optimization","venue":null,"work_id":"1662c5e1-42d1-46e2-b8a9-324fac7d1793","year":2023},"citing_paper":{"arxiv_id":"2606.02787","last_updated":"2026-06-01T18:51:26Z","snapshot_observed_at":"2026-07-06T23:43:07.940839Z","submitted_at":"2026-06-01T18:51:26Z","title":"Adaptive Accelerated Mirror Descent in Primal and Dual Spaces","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T13:17:11.219557Z"},"links":{"cited_paper":"/paper/2311.17296","citing_paper":"/paper/2606.02787"},"observation_digest":"sha256:4b87f95a5f063b7bb74e821246312b3115d68b7186e40faeaa49d0c5c5877122","observation_id":"9a4adad9-3cad-40d3-84e0-938d2541d2fd","resolution":{"observed_at":"2026-07-02T00:46:24.659770Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.17296","last_updated":"2024-05-15T05:16:24Z","snapshot_observed_at":"2026-08-04T08:53:23.652013Z","submitted_at":"2023-11-29T00:48:18Z","title":"Mirror Duality in Convex Optimization","version":2},"cited_work":{"arxiv_id":"2311.17296","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.17296","snapshot_observed_at":"2026-07-02T08:06:47.611292Z","title":"Mirror duality in convex optimization","venue":null,"work_id":"1662c5e1-42d1-46e2-b8a9-324fac7d1793","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":49,"source":"arxiv_source","source_observed_at":"2026-06-30T08:38:03.985543Z"},"links":{"cited_paper":"/paper/2311.17296","citing_paper":"/paper/2606.28973"},"observation_digest":"sha256:2eb1eb90af19292b3fed26dca9aaac150a81b7f11f0a0fb399171ac243a34653","observation_id":"15fabf90-cd69-4622-a79e-2abd84da62d7","resolution":{"observed_at":"2026-06-30T08:44:27.671896Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.17296","last_updated":"2024-05-15T05:16:24Z","snapshot_observed_at":"2026-08-04T08:53:23.652013Z","submitted_at":"2023-11-29T00:48:18Z","title":"Mirror Duality in Convex Optimization","version":2},"cited_work":{"arxiv_id":"2311.17296","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.17296","snapshot_observed_at":"2026-07-02T08:06:47.611292Z","title":"Mirror duality in convex optimization","venue":null,"work_id":"1662c5e1-42d1-46e2-b8a9-324fac7d1793","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":48,"source":"arxiv_source","source_observed_at":"2026-07-02T08:05:55.418491Z"},"links":{"cited_paper":"/paper/2311.17296","citing_paper":"/paper/2607.00665"},"observation_digest":"sha256:60c6012a9c3758284a14e036eb7cf1caac7c0cfad6cc45d1f19e32cfd15120b2","observation_id":"98661be4-ff32-41c2-8d8d-790ce349b0b1","resolution":{"observed_at":"2026-07-02T08:06:47.612585Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2311.17296/citation-record","integrity":"/paper/2311.17296/integrity","json":"/paper/2311.17296/citation-record.json","paper":"/paper/2311.17296"},"outbound":[],"paper":{"arxiv_id":"2311.17296","last_updated":"2024-05-15T05:16:24Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-04T08:53:23.652013Z","submitted_at":"2023-11-29T00:48:18Z","title":"Mirror Duality in Convex Optimization"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2311.17296."}