{"as_of":"2026-08-10T15:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:133bc3c597259521e83c142ae3be98b59e01016081d4305d7e260e09d48cb47a","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:55:08.382538Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2506.09711/citation-record","integrity":"/paper/2506.09711/integrity","json":"/paper/2506.09711/citation-record.json","paper":"/paper/2506.09711"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:14.087587Z","title":"Al-Mohy and Nicholas J","venue":null,"work_id":"18cc6720-67b6-4ffe-8fda-f2023091f395","year":2011},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.091864Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:656de6025b3e98741a1bc64ccb2d41794f1447895cc728dcae72fcbdbf6f7c32","observation_id":"e7e56dcb-b539-417e-8979-46bc94832e60","resolution":{"observed_at":"2026-08-07T04:55:14.146854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1407.1537","last_updated":"2016-11-07T19:30:37Z","snapshot_observed_at":"2026-08-02T04:55:45.852668Z","submitted_at":"2014-07-06T20:11:48Z","title":"Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1407.1537","snapshot_observed_at":"2026-08-07T04:55:07.096654Z","title":"Linear coupling: An ultimate unification of gradient and mirror descent.arXiv preprint arXiv:1407.1537, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.096654Z"},"links":{"cited_paper":"/paper/1407.1537","citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:71bcb5d4320d85714d9b05f01cc1aebaee9c4af88678cae2fb618b5158ca061e","observation_id":"f586cfdd-2cfb-443f-b470-cc51e6403eeb","resolution":{"observed_at":"2026-08-07T04:55:07.096654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:13.893745Z","title":"Near-linear time approximation al- gorithms for optimal transport via sinkhorn iteration","venue":null,"work_id":"d8c1c67f-0f37-4f68-bb82-f426058e145d","year":2017},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.101353Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:dfe5ad6234ec1e2d1ecaa04bb68a501a6432c454113f27306e1efffe8643d689","observation_id":"59634183-54fe-4b55-a7a7-5edbac06bef5","resolution":{"observed_at":"2026-08-07T04:55:13.979999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:13.777122Z","title":"The multiplicative weights update method: a meta-algorithm and applications.Theory of computing, 8(1):121–164, 2012","venue":null,"work_id":"81d55419-7674-4d7e-9fb0-c9e883ed94d2","year":2012},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.106327Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:df7a505fc8a60b269b6d80af71a64fed1083157a915615ebd4696f95c7d5d8df","observation_id":"226c7617-b6f1-47ba-b6ff-3de16a99f818","resolution":{"observed_at":"2026-08-07T04:55:13.824399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:07.111068Z","title":"SIAM, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.111068Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:2c644b7bc1cafb224b00670f80d2e09454b8491a261facff825ee50bb6fb8245","observation_id":"5f233f82-c8bd-4c0f-8812-a801f4fdd81d","resolution":{"observed_at":"2026-08-07T04:55:07.111068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:07.116042Z","title":"Mirror descent and nonlinear projected subgradient methods for convex optimization.Operations Research Letters, 31(3):167–175, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.116042Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:be7bf0c585beecf4309bd030d9fc43eca8d3bf88843e1c559af9a3f5eec36ef0","observation_id":"eca2a797-54d6-4be1-9c59-8276375c8bcd","resolution":{"observed_at":"2026-08-07T04:55:07.116042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:13.604222Z","title":"Boumal, B","venue":null,"work_id":"a6dbb363-c3c1-4e31-b75a-134923e84868","year":2014},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.121581Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:1998b2ea7534596b5250d8fd83b214496bd0c74cbb8c8b701aac5daa251a9a86","observation_id":"ecbd63e0-66bd-4df6-806c-378a3b6ce987","resolution":{"observed_at":"2026-08-07T04:55:13.662218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:13.479928Z","title":"Boyd and L","venue":null,"work_id":"1ae5f42f-6685-40a0-b30a-fe21132b6871","year":2004},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.126659Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:517345901f253a5554eb94e4035ba111af8c2f3da910e7c20d2d8e4edaa6b1a7","observation_id":"93f4023f-881c-4eeb-b80f-8b48a6611fe6","resolution":{"observed_at":"2026-08-07T04:55:13.543343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:13.270880Z","title":"SIAM Studies in Applied Mathematics","venue":null,"work_id":"102b5609-f782-4223-bf82-153aebd556e2","year":1994},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.130723Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:3ce3fb7e33dc30d31fa9248ff822a4073e055fa259631b1982f8df57ed46f86f","observation_id":"3f8ae18c-262b-4822-9fb2-976a7364f0d4","resolution":{"observed_at":"2026-08-07T04:55:13.377985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:07.135098Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.135098Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:4f74c24b42154cdcec093a418b614343f6c5fdbe43f94e666f874a56a9871c82","observation_id":"e57729e5-8f9d-4215-bbc2-15f63c69d8ca","resolution":{"observed_at":"2026-08-07T04:55:07.135098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:13.123849Z","title":"Remainder terms for some quantum entropy inequalities","venue":null,"work_id":"9cf95671-8856-4d14-8d5b-06c96ea73086","year":2014},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.142014Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:3bef5ca2db490c10dbadfe44736f7030fa57e4f8977afe4014212abad4b7ed15","observation_id":"af06798d-049c-40c2-805e-ff85162802e0","resolution":{"observed_at":"2026-08-07T04:55:13.194147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:07.150649Z","title":"Sinkhorn distances: Lightspeed computation of optimal transport.Advances in neural information processing systems, 26, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.150649Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:b6ba3fe484ece60ebff892e1a0506f1809747613c254425ea2997716ad6d8097","observation_id":"5756ca63-3f36-4d82-a2af-f032c85ade95","resolution":{"observed_at":"2026-08-07T04:55:07.150649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:07.160434Z","title":"Distinguishing separable and entangled states.Physical Review Letters, 88(18):187904, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.160434Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:e840408464d3ff73098779d082212d964331f1d138621da2574a262699c93ba6","observation_id":"cfab7d89-50fc-438a-91b6-5995a4b5a846","resolution":{"observed_at":"2026-08-07T04:55:07.160434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:12.956484Z","title":"Driscoll, Nicholas Hale, and Lloyd N","venue":null,"work_id":"2bf577b6-a775-4159-ac84-c471ca028afc","year":2014},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.171075Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:cfb01e199b5937607bb5f47606601b967dd3f900b5cec076c41f295736ccb744","observation_id":"ae8a6fee-5f78-4351-9f8a-bfb50e3aff17","resolution":{"observed_at":"2026-08-07T04:55:13.040905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:12.774105Z","title":"Computational optimal trans- port: Complexity by accelerated gradient descent is better than by sinkhorn algorithm","venue":null,"work_id":"42155b9f-6990-49fe-b3c2-e752077ea7c1","year":2018},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.176903Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:77b7cf56ddf3245dd59fbebfc0bb44360291097a71b23384f19b885767780629","observation_id":"35f9607d-2da9-487a-b790-9307bf406009","resolution":{"observed_at":"2026-08-07T04:55:12.865614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.11235","last_updated":"2024-03-09T13:28:29Z","snapshot_observed_at":"2026-08-09T01:25:35.554813Z","submitted_at":"2023-01-26T17:18:36Z","title":"Handbook of Convergence Theorems for (Stochastic) Gradient Methods","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.11235","snapshot_observed_at":"2026-08-07T04:55:07.182515Z","title":"Handbook of convergence theorems for (stochastic) gradient methods.arXiv preprint arXiv:2301.11235, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.182515Z"},"links":{"cited_paper":"/paper/2301.11235","citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:645795851f04884a81cb2be12060e7228e54a984061634ae1f85f5e073e9fd6e","observation_id":"617cb15a-46d4-4730-9626-b7d35b9579a1","resolution":{"observed_at":"2026-08-07T04:55:07.182515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:12.607309Z","title":"De Gruyter, 2nd edition, 2011","venue":null,"work_id":"ed96d269-e558-4fa2-8fc0-bd067516261d","year":2011},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.189508Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:0a87ad29610000621448897358b271d8a0cac1cc98e623ead3eec5865193abf5","observation_id":"c71b7f41-326d-4447-99a1-68fb08f438bb","resolution":{"observed_at":"2026-08-07T04:55:12.705181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:07.196375Z","title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming.Journal of the ACM (JACM), 42(6):1115–1145, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.196375Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:c9c08c3f573f6b3a6776cc5efcab5059d8c52ed1140a910cf8760e244c2befce","observation_id":"fb64a183-71c3-48f4-8e4b-a66157b2aad4","resolution":{"observed_at":"2026-08-07T04:55:07.196375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:07.205337Z","title":"Golub and Charles F","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.205337Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:ba1deacd06ab3f7e828ff1d60c2e5869b4c05da2f9cad70e0ac0c926738bce3a","observation_id":"520e0e31-f3c5-41e8-98b6-678d7cedd231","resolution":{"observed_at":"2026-08-07T04:55:07.205337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:07.212799Z","title":"A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines.Communications in Statistics-Simulation and Computation, 18(3):1059– 1076, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.212799Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:e99948b5afbb2b683a04448830543586af5fbfb308170b3c5029871f416fbbf0","observation_id":"a7ddd25e-0504-48c4-8125-dfb6e055032a","resolution":{"observed_at":"2026-08-07T04:55:07.212799Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:12.431035Z","title":"Onthedualityofstrongconvexityand strong smoothness: Learning applications and matrix regularization.Unpublished Manuscript, http://ttic","venue":null,"work_id":"cbb84266-62d7-4989-a954-99a570090ddd","year":2009},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.219886Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:05cc4a894dcb36dab427835f6300eb59a1666e809b4c6f507794955994d94ac7","observation_id":"9de31570-a7e4-43e2-9780-a1d9e3543349","resolution":{"observed_at":"2026-08-07T04:55:12.518711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:12.248272Z","title":null,"venue":null,"work_id":"c7b3aa0d-6880-49dc-8373-0750de0653db","year":1988},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.224594Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:ad39054e01183ec5ce083cb61d744dae25680f6e266ebfef014f49647b0360fd","observation_id":"2fd3233f-8b2c-40e3-93af-d625de9ecae6","resolution":{"observed_at":"2026-08-07T04:55:12.338276Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.04332","last_updated":"2019-08-01T03:41:16Z","snapshot_observed_at":"2026-08-06T15:37:39.394416Z","submitted_at":"2018-02-12T19:53:19Z","title":"Entropy Penalized Semidefinite Programming","version":4},"cited_work":{"arxiv_id":"1802.04332","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.04332","snapshot_observed_at":"2026-08-07T04:55:08.505124Z","title":"Entropy Penalized Semidefinite Programming","venue":"math.OC","work_id":"b0bc5fa2-068b-4c6c-a814-bd89088c1be4","year":2018},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.229119Z"},"links":{"cited_paper":"/paper/1802.04332","citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:a51996b2500216f65cdb4f365bf977aa4e9aa6ff77498a8406e9eaec43b27c6f","observation_id":"ac635384-3f06-4456-a6ac-b671f9084f35","resolution":{"observed_at":"2026-08-07T04:55:08.582843Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:12.095220Z","title":"Learning the kernel matrix with semidefinite programming.Journal of Machine Learning Research, 5:27–72, 2004","venue":null,"work_id":"4cd15234-56e9-493d-8368-a23b876cc1f0","year":2004},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.233324Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:f5f577ff45abdf4547b2f5a24a2620201ddbbd60011797ac4156bca276161545","observation_id":"d1adf6af-4169-4cab-8041-9cb97fed08b2","resolution":{"observed_at":"2026-08-07T04:55:12.163178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:11.883923Z","title":"Fastcomputation of optimal transport via entropy-regularized extragradient methods, 2024","venue":null,"work_id":"0c8d136e-ea3a-4c1a-a187-63ae8e0e5ff9","year":2024},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.237054Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:d19e828ede3eb50fe8b310cb1dee97a87413ac13021dfc3fc289a725aaddb1fb","observation_id":"dc87e157-4c80-492d-b582-1a00d8e9cd40","resolution":{"observed_at":"2026-08-07T04:55:11.977471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:11.724067Z","title":"Variational embedding for quantum many-body problems.Com- munications on Pure and Applied Mathematics, 75(9):2033–2068, 2022","venue":null,"work_id":"b950a972-5b54-47a1-9f0f-7f205f469bc2","year":2022},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.241590Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:9fef5bab1d07cfccafc741a15cee02d3b4da22221b085966781cfaa31fcd559a","observation_id":"2d8a50e9-708c-406c-9a7c-046a0168c530","resolution":{"observed_at":"2026-08-07T04:55:11.779654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:11.473523Z","title":"On the efficiency of entropic regularized algorithms for optimal transport.Journal of Machine Learning Research, 23(137):1–42, 2022","venue":null,"work_id":"05473b48-6f39-4385-bb40-efe8e898444b","year":2022},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.245515Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:b99863c3ce3d4ee37bd0cdffaecd8910c6e1199d764b0d8aaea9baa6cc9b6e9f","observation_id":"816edafa-2b35-4e69-abc6-648e1c4bb132","resolution":{"observed_at":"2026-08-07T04:55:11.595977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.12133","last_updated":"2023-03-21T18:45:37Z","snapshot_observed_at":"2026-07-06T15:06:22.794892Z","submitted_at":"2023-03-21T18:45:37Z","title":"Fast randomized entropically regularized semidefinite programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.12133","snapshot_observed_at":"2026-08-07T04:55:07.250279Z","title":"Fast randomized entropically regularized semidefinite programming.arXiv preprint arXiv:2303.12133, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.250279Z"},"links":{"cited_paper":"/paper/2303.12133","citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:6d19bed09f268d17c76b1b0ac33c61b360d2c5c5cdefee872b7d62ed47ff8de7","observation_id":"59b00159-c77f-46d5-b707-03072ef044a5","resolution":{"observed_at":"2026-08-07T04:55:07.250279Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:11.269922Z","title":"Fast entropy-regularized SDP relaxations for permutation synchronization.In preparation, 2025","venue":null,"work_id":"c2c5d0e4-d027-4342-856a-ef6379e12c73","year":2025},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.255280Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:4b31b9d68c2f6ed4374c562d877166d9d6b3e7bf630ec77bb1c41f258932905c","observation_id":"10db11f5-317c-4044-a805-769f34e3176f","resolution":{"observed_at":"2026-08-07T04:55:11.393367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:11.082565Z","title":null,"venue":null,"work_id":"7fee7173-7501-438c-9eb0-09fa9d7ab5a3","year":2020},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.259418Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:677f857b043f8ff4deefd7e4a183654e6ea00a5d17c03cc6f35793f536817129","observation_id":"b5a98084-6943-437a-9628-a6c2c7468111","resolution":{"observed_at":"2026-08-07T04:55:11.173432Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:10.905531Z","title":"Hutch++: Optimal stochastic trace estimation","venue":null,"work_id":"6d116d07-2f73-47cb-aece-88738727f756","year":2021},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.303855Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:9b778ca00fc0dd0152316f9c3cb8c97333d9e03676e019f96a7b2b02d6e9d1e8","observation_id":"1f0d3288-f83f-4335-9781-746eaf5cd26d","resolution":{"observed_at":"2026-08-07T04:55:11.009670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:07.364172Z","title":"Problem complexity and method efficiency in optimization","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.364172Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:a98ee4cc97c67be08560d189816b269192fac408d8c59951825e2675d50ad556","observation_id":"ca625230-dbaa-4173-97fc-1def1ed040f5","resolution":{"observed_at":"2026-08-07T04:55:07.364172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:10.721642Z","title":"Nielsen and I","venue":null,"work_id":"4c7daeb6-374a-45dc-b0b4-0549c3b0412e","year":2001},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.493529Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:b05873cb2d3ca908773d597a0dce06a73931bf8126e6e789f7397b6d012047f5","observation_id":"698ad39d-f8a2-41ac-b201-7e019d5ff841","resolution":{"observed_at":"2026-08-07T04:55:10.800713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:10.542630Z","title":"Solving the multi-way matching problem by permutation synchronization.Advances in neural information processing systems, 26, 2013","venue":null,"work_id":"667c38a0-3b26-4913-bdf1-1493e15161eb","year":2013},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.555149Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:f3b9b0865cdccf204c6db788b7c5c91ce55facac0c03345d8d207d6373a7563f","observation_id":"f0461c41-cbbd-4730-b878-43b0c1ffdb57","resolution":{"observed_at":"2026-08-07T04:55:10.619814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:07.643872Z","title":"PhD thesis, California Institute of Technology, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.643872Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:076cb1636d7274842e031d82f522893fac6e9922bfc4f9e29e460dc7e2ee8843","observation_id":"514a09ee-2256-4c7e-8d34-29ec2248c259","resolution":{"observed_at":"2026-08-07T04:55:07.643872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:10.380922Z","title":"Logarithmically sparse symmetric matrices.Beiträge zur Algebra und Geome- trie/Contributions to Algebra and Geometry, pages 1–16, 2024","venue":null,"work_id":"6d558e94-dbf4-4c58-ba0f-e1bc4d9184e4","year":2024},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.707183Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:d1bc19f60e1958050e0307fb21597b2dcdc84d92033f2d78282abf3fc12d0373","observation_id":"56eec533-fd21-4685-a669-40f98b15310e","resolution":{"observed_at":"2026-08-07T04:55:10.417028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:10.189471Z","title":"Gibbs manifolds.Information Geometry, 7(Suppl 2):691–717, 2024","venue":null,"work_id":"2b6a22d3-1d9c-4daa-b446-11716a249bb3","year":2024},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.741555Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:9666cbfedc9869432a086c71f6ca15febf107e89bdbfbc7c3419c9de7ac05028","observation_id":"9968ce7b-d408-4f28-814d-4b86983c98be","resolution":{"observed_at":"2026-08-07T04:55:10.297847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:07.802009Z","title":"Computational optimal transport: With applications to data science.Foundations and Trends®in Machine Learning, 11(5-6):355–607, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.802009Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:e450116776212244d9d2f46110b98a9530f6ff9c20f9d3f28f727db8e04e588e","observation_id":"76db2d27-6277-4cb5-b890-4b714d7ff8c4","resolution":{"observed_at":"2026-08-07T04:55:07.802009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:55:10.019700Z","title":"Entropic estimation of optimal transport maps, 2024","venue":null,"work_id":"a8233ca6-cb4f-4dcc-9593-bc645fb512f8","year":2024},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:07.900582Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:0b8b0185443fd685c8a1769c33f1115408e9ffe45006f692fd1561dfc8652c69","observation_id":"de95debb-abb1-4e00-8b1f-a22c9ff998c9","resolution":{"observed_at":"2026-08-07T04:55:10.109960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:09.866015Z","title":"Coordinate methods for acceleratingℓ∞ regression and faster approximate maximum flow","venue":null,"work_id":"eeb19399-8077-40c5-8e92-816b631f9487","year":2018},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:08.009151Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:5f125ef8f0f901f64298f242b9d70a2dacbd3566fa3d82e031e5e99c58bbacc6","observation_id":"d8914f51-cbdd-4724-90dd-2028356406b4","resolution":{"observed_at":"2026-08-07T04:55:09.944092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:09.739963Z","title":"SIAM, 2019","venue":null,"work_id":"975a8681-39b4-43c3-bae3-48bf2e6fea08","year":2019},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:08.043776Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:69b12d22027f33f43d9aee5f184661f8978c3fde19b93586a913986af4e1b75d","observation_id":"f3dde6f2-4066-4dfd-b192-85c5622fc71e","resolution":{"observed_at":"2026-08-07T04:55:09.790078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:09.539827Z","title":"Mathematische grundlagen der quantenmechanik","venue":null,"work_id":"a0dd9d0a-8ef8-4d59-a2a9-0cd2c8241abe","year":1932},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:08.112149Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:9fd9f8c6555873708128d76d6c47eb9de5583bd9d136ddb2486f4791ee1478bb","observation_id":"99e32a4d-4add-4e6d-82fb-792822202c28","resolution":{"observed_at":"2026-08-07T04:55:09.607580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:09.375735Z","title":"An explicit analysis of the entropic penalty in linear programming","venue":null,"work_id":"759d8278-c99c-418b-b469-9dff7103a7ee","year":2018},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:08.178643Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:686980b45b70147a8fc2056196dbc5d02478d68d3b66df3c6f7b7ea9cc76e567","observation_id":"cc22d808-87a9-429d-99b4-06fd55e5b0af","resolution":{"observed_at":"2026-08-07T04:55:09.436595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:09.212863Z","title":"Distance metric learning for large margin nearest neighbor classification.Journal of Machine Learning Research, 10:207–244, 2009","venue":null,"work_id":"4114a77c-d454-4a3f-9ee5-dc5892d6b29d","year":2009},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:08.241869Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:62f79f84d899e116173a646e941610eb732fcc047247ceaa35f8c04db3bfbd43","observation_id":"970c9084-32a6-4d6a-9680-d88771f7253d","resolution":{"observed_at":"2026-08-07T04:55:09.288977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:09.025328Z","title":"Tropp, Olivier Fercoq, Madeleine Udell, and Volkan Cevher","venue":null,"work_id":"62220315-1247-4d51-b292-a0a22ff95318","year":2021},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:08.289539Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:98dac1fc040b0830752761ba5f2f9f5d0064830d0fbb95fb77b75763f77696bf","observation_id":"0ce98cbb-6cb9-44b9-8f1b-eb82cf3e4cd5","resolution":{"observed_at":"2026-08-07T04:55:09.135145Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:08.874642Z","title":null,"venue":null,"work_id":"b3ceadd5-88e0-435e-a01b-38f2e405b985","year":null},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:08.347700Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:4477023669cadf05db80127ceee5bd3a07298cd9239b1d0837a1ea54681d7218","observation_id":"bbdb0c90-d7bc-4023-9305-7e85edb57fe8","resolution":{"observed_at":"2026-08-07T04:55:08.954812Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-07T04:55:08.710674Z","title":"Step 1.Consider the marginalµ t =π β,λt 1n appearing in (4.8) via the differenceµt −µ(which is the dual gradient with respect toϕ)","venue":null,"work_id":"c1dd9ba0-1bbb-4631-b190-b6fd875f19b6","year":null},"citing_paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T04:55:08.382538Z"},"links":{"citing_paper":"/paper/2506.09711"},"observation_digest":"sha256:977c85190f60d50e050ceef9ff478b9db65f0362ddee48cd60a3b18b7d647155","observation_id":"9b2d54e1-f7e6-45fd-b6d9-df839adf93b1","resolution":{"observed_at":"2026-08-07T04:55:08.742780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.09711","last_updated":"2025-07-01T05:59:07Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T11:34:12.279430Z","submitted_at":"2025-06-11T13:24:18Z","title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":1,"verified_fuzzy":28},"total_outbound_references":47},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2506.09711."}