{"as_of":"2026-08-09T23:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:73aadbbd9aacc3f8f4d98ba18a1c2a72734e10875ac8137aab7536cb9639fd4a","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T14:05:55.721700Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2607.22551/citation-record","integrity":"/paper/2607.22551/integrity","json":"/paper/2607.22551/citation-record.json","paper":"/paper/2607.22551"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T14:05:50.409714Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:50.409714Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:fe52a85d78d902ed9998d7a18f4ab24048d02de1737e45104a79eaed8759bf7c","observation_id":"fe2baea6-aea3-4881-87d1-414f876d3580","resolution":{"observed_at":"2026-08-02T14:05:50.409714Z","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":"10.20537/2076-7633-2019-11-2-205-217","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On some stochastic mirror descent methods for constrained online op- timization problems","venue":"Computer Research and Modeling","work_id":"b509afa1-e2bc-41df-9330-7b82db44dd96","year":2019},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:50.505646Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:205dee8f736ce4d83a1156037f033e95eae663d8ea69f28aa2885db784b16f4a","observation_id":"25a3c344-cd72-4d03-b1fb-21c2697256e0","resolution":{"observed_at":"2026-08-02T14:08:19.505227Z","resolver_source":"doi","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":"2604.26735","last_updated":"2026-04-29T14:36:49Z","snapshot_observed_at":"2026-08-09T09:23:31.768832Z","submitted_at":"2026-04-29T14:36:49Z","title":"Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.26735","snapshot_observed_at":"2026-08-02T14:05:50.645860Z","title":"Ahookhosh, J","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:50.645860Z"},"links":{"cited_paper":"/paper/2604.26735","citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:099d5849d1bf0c70204891d42b54f5892dfdfbf68b1a839d0ec5ce9dc73aaf7e","observation_id":"8d530593-9270-4b76-8bd4-a81c80183f8b","resolution":{"observed_at":"2026-08-02T14:05:50.645860Z","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-02T14:05:50.777843Z","title":"Bayandina, P","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:50.777843Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:fd6a5c2e416f6265fed0b21dbd3ff96ba0da7793158ddc6d8e50d04af2a0ff16","observation_id":"22fe223b-f56e-4f58-b90b-33a1ce8dfc85","resolution":{"observed_at":"2026-08-02T14:05:50.777843Z","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-02T14:05:50.985192Z","title":"Bayandina: Adaptive Stochastic Mirror Descent for Constrained Optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:50.985192Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:9b5a7f03e34efa2253c8b9d28f3af491c243ab73b9337047af5b3c54353f4ee6","observation_id":"f9340f49-3f1b-45a7-b81d-844640c95d21","resolution":{"observed_at":"2026-08-02T14:05:50.985192Z","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-02T14:05:51.118671Z","title":"Ben-Tal, A","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:51.118671Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:dc85427d84f415f6796fb5ef4b48973158dd8991be01fd846627fc5643f4e2d6","observation_id":"9cde009c-e9ab-4fb1-abf5-952e2a06b29e","resolution":{"observed_at":"2026-08-02T14:05:51.118671Z","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-02T14:05:51.286480Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:51.286480Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:04a9e5935245fda3365e6403c52e17ed4c5289d3f5fcdb4572b1b72f3198b2a9","observation_id":"e64a306a-bfc4-4642-9b82-4be379c87f19","resolution":{"observed_at":"2026-08-02T14:05:51.286480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.04375","last_updated":"2026-04-14T19:17:46Z","snapshot_observed_at":"2026-07-06T22:24:04.107920Z","submitted_at":"2025-09-04T16:32:43Z","title":"Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.04375","snapshot_observed_at":"2026-08-02T14:05:51.428677Z","title":"de Brito, F","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:51.428677Z"},"links":{"cited_paper":"/paper/2509.04375","citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:068750f81849a7bbc50b32fb3535ab20f92bd7eb59383cb59fb401656f218e27","observation_id":"afb2a55e-55be-4ac3-a435-c1e1ab61f7a4","resolution":{"observed_at":"2026-08-02T14:05:51.428677Z","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-02T14:05:51.616694Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:51.616694Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:7f81b02056bf7783277c3a80e9abc1f9d02fb46a263df0d8cea77c74cc1cd461","observation_id":"c02766d4-122f-422e-9ffb-86f80371b726","resolution":{"observed_at":"2026-08-02T14:05:51.616694Z","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-02T14:05:51.751220Z","title":"A Continuized View on Nesterov Acceleration for Stochastic Gradient Descent and Randomized Gossip","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:51.751220Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:f1bed2cd76ff888a0c4eb254fba45f5696b12bea68a7f1e27a8ed63f3d71c6b9","observation_id":"978b7a9f-3754-4e53-9727-a3723a98bc31","resolution":{"observed_at":"2026-08-02T14:05:51.751220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.02281","last_updated":"2026-06-22T23:48:14Z","snapshot_observed_at":"2026-08-09T16:43:35.744859Z","submitted_at":"2025-05-04T22:43:57Z","title":"Minimisation of Quasar-Convex Functions Using Random Zeroth-Order Oracles","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.02281","snapshot_observed_at":"2026-08-02T14:05:51.881627Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:51.881627Z"},"links":{"cited_paper":"/paper/2505.02281","citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:1c746253fcfc7f2de17af09faaa2e4c487dfd2ef001115e217bc1495c2e05f55","observation_id":"a0c4c4b3-14d5-4022-98c4-e1d3fb81efe5","resolution":{"observed_at":"2026-08-02T14:05:51.881627Z","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-02T14:05:52.027836Z","title":"Fercoq, A","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:52.027836Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:48a7cb09cc2b03cdeb57ef33b82b1aa546c2dd6a52eb63979fce62e733fe7053","observation_id":"17a9ceaf-05f1-4330-ba1d-67c0c9fab569","resolution":{"observed_at":"2026-08-02T14:05:52.027836Z","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-02T14:05:52.193155Z","title":"Uniform Convergence of Gradients for Non-Convex Learning and Optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:52.193155Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:ee3e89415da57eb5f9555dd08ce9c0cc4141a1848223392ab074bdeb706f5875","observation_id":"11ad4b42-7313-4fbc-a0f5-7983e8886c90","resolution":{"observed_at":"2026-08-02T14:05:52.193155Z","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-02T14:05:52.370259Z","title":"Guminov, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:52.370259Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:452f97c15ddab56a78d5b00b6a864b05721e5bee3e68b5d467547f6c60df49c7","observation_id":"9be2c452-e1b6-4b9c-8f7b-4c47997fd68c","resolution":{"observed_at":"2026-08-02T14:05:52.370259Z","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-02T14:05:52.498795Z","title":"Hardt, T","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:52.498795Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:6470eb4f265f3d103213a97fbf34e5696abceb56df75162a1bd1c3e631ceb415","observation_id":"602c670c-2ef8-445a-86a5-e1c3de565cb4","resolution":{"observed_at":"2026-08-02T14:05:52.498795Z","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-02T14:05:52.609266Z","title":"Hermant, J.-F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:52.609266Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:15985666537bef781efc091bff94dcd4fa5cd4a51af2546307dcdf16d2c806cb","observation_id":"1b2f1346-a2e9-4a98-bc53-91dbf4c312de","resolution":{"observed_at":"2026-08-02T14:05:52.609266Z","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-02T14:05:52.735707Z","title":"Hinder, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:52.735707Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:bfd4a3f667d26b8d8c4e0d930b3dcee3267dbf959744a88b9d5917cd26723a9a","observation_id":"82a762bf-d606-4bfd-b9c2-20b8b13687a1","resolution":{"observed_at":"2026-08-02T14:05:52.735707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.04937","last_updated":"2020-10-27T11:58:31Z","snapshot_observed_at":"2026-07-06T10:03:10.192827Z","submitted_at":"2020-10-10T08:16:32Z","title":"On The Convergence of First Order Methods for Quasar-Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.04937","snapshot_observed_at":"2026-08-02T14:05:52.856314Z","title":"On the convergence of first order methods for quasar-convex optimization","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:52.856314Z"},"links":{"cited_paper":"/paper/2010.04937","citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:a57b357322e31dcce4f5834a396d92487fdf865f572ac7f44be856af7ac2a180","observation_id":"c18f0e7a-fdd8-4ede-a81e-c6c148edf438","resolution":{"observed_at":"2026-08-02T14:05:52.856314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.08474","last_updated":"2026-05-08T20:50:40Z","snapshot_observed_at":"2026-07-06T23:20:43.010758Z","submitted_at":"2026-05-08T20:50:40Z","title":"Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.08474","snapshot_observed_at":"2026-08-02T14:05:53.003364Z","title":"arXiv:2605.08474v1https://arxiv.org/pdf/2605.08474v1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:53.003364Z"},"links":{"cited_paper":"/paper/2605.08474","citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:44b9aa319a94e7c813f5738c927e0a8c9556fc172b04efe44beca38a577ff779","observation_id":"f87828c3-4401-4468-97fd-aaf9bd71b980","resolution":{"observed_at":"2026-08-02T14:05:53.003364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.18976","last_updated":"2025-02-11T17:04:50Z","snapshot_observed_at":"2026-08-07T12:24:26.298830Z","submitted_at":"2024-05-29T10:40:49Z","title":"Accelerated Mirror Descent for Non-Euclidean Star-convex Functions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.18976","snapshot_observed_at":"2026-08-02T14:05:53.153902Z","title":"Accelerated Mirror De- scent for Non-Euclidean Star-convex Functions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:53.153902Z"},"links":{"cited_paper":"/paper/2405.18976","citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:f5217bc338eab209b8f7d07f613dc927ede470bc0a81130eb4b12b546910a903","observation_id":"557aa5dc-ec0a-4134-85bb-c6b8e6cbc2f8","resolution":{"observed_at":"2026-08-02T14:05:53.153902Z","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-02T14:05:53.283018Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:53.283018Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:e868e2d1fc5158061abd767acae56d8e2cfe7626a87e33a99d332b9d434dfb46","observation_id":"76a12b20-e43f-45cc-80c3-b4d5ee2fc69d","resolution":{"observed_at":"2026-08-02T14:05:53.283018Z","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-02T14:05:53.437241Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:53.437241Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:ff52fc9d74be81d5fbbb797a40bc6749c131392c0f96475e0033cccb6b2e382b","observation_id":"ee4b346d-751a-4d93-bcae-aad4e394e8c4","resolution":{"observed_at":"2026-08-02T14:05:53.437241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2510.01943","last_updated":"2026-07-14T21:21:43Z","snapshot_observed_at":"2026-08-04T12:53:48.140653Z","submitted_at":"2025-10-02T12:07:05Z","title":"Smooth Quasar-Convex Optimization with Constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.01943","snapshot_observed_at":"2026-08-02T14:05:53.557310Z","title":"arXiv:2510.01943v2https://arxiv.org/abs/2510.01943v2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:53.557310Z"},"links":{"cited_paper":"/paper/2510.01943","citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:2e6ebb33a9f978b2ce90ed6b028ddb2b7b143733749c5a0bafadce0a5c3b4d62","observation_id":"8865e970-a83e-4b6f-9eef-3ade399d0b20","resolution":{"observed_at":"2026-08-02T14:05:53.557310Z","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-02T14:05:53.743365Z","title":"Cubic regularization of Newton method and its global performance","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:53.743365Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:9c0ab09d991060c4e5e41438ba8f557491a7e4dec5f3416a570cf10c10ca64a7","observation_id":"7c565f14-b3f3-4b89-8d3e-d63f1d35912a","resolution":{"observed_at":"2026-08-02T14:05:53.743365Z","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-02T14:05:53.856274Z","title":"Nemirovskii: Efficient methods for large-scale convex optimization problems","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:53.856274Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:4df8afdf4f5c52ac278b1a388903d941102344b106a61aa7211e8a24adadb1ad","observation_id":"dccc4191-9570-4333-b225-caf50b411898","resolution":{"observed_at":"2026-08-02T14:05:53.856274Z","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-02T14:05:54.003556Z","title":"Nemirovsky, D","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:54.003556Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:5e76c0bb73f02493a9d8bdbb59cd0063f6e56124f8c2ae6a9cc49e1925083c21","observation_id":"bceb73f7-b9a0-45df-81e7-2e213fb62b3c","resolution":{"observed_at":"2026-08-02T14:05:54.003556Z","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-02T14:05:54.125291Z","title":"Polyak: A general method of solving extremum problems","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:54.125291Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:044a4e506833ccbc03f43e35959f7313ca933c7a187ab1f35bf00988034f9ace","observation_id":"2cf024fb-f20e-4420-a9ec-7d7e3e6d7f5e","resolution":{"observed_at":"2026-08-02T14:05:54.125291Z","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-02T14:05:54.292712Z","title":"S., Alkousa, M","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:54.292712Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:df72f0a236448d2306385ddcc5dd88e0711d21cd83eda20f8aff5f38d7806ce3","observation_id":"27faa470-34c1-45cc-bed1-400fc9da7a67","resolution":{"observed_at":"2026-08-02T14:05:54.292712Z","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-02T14:05:54.415867Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:54.415867Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:a336dc6aff477c43e8a027813283c4d3e1145d77a1b5db81fd3a2d0efa9ed2a7","observation_id":"8d190390-c224-4133-903b-8e5fd50cc094","resolution":{"observed_at":"2026-08-02T14:05:54.415867Z","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-02T14:05:54.549155Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:54.549155Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:8727736a9a955273f39771f989aa23466dc74aba2ccfc42dc5f312654ba69fc4","observation_id":"f4dbce77-3e1f-4041-a93f-0612f3f714f4","resolution":{"observed_at":"2026-08-02T14:05:54.549155Z","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":"10.1007/978-3-030-22629-9_7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Lecture notes in computer science","work_id":"bf7c7ad2-97b1-4918-b403-f4710793baec","year":2019},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:54.706807Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:f0d98c3d9a874d662c3c4369e8c9ca48ab6cccc54137d223847330b597729b6b","observation_id":"7a9a6421-45df-4457-b7f7-dcf1d11cc8bc","resolution":{"observed_at":"2026-08-02T14:08:19.243866Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T14:05:54.863128Z","title":"Shpirko, Yu","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:54.863128Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:3abf8214915a8c9346ee1a79b7a975fb9344226ae305126b9f4ef4860417c331","observation_id":"02b30e3d-83d0-4de0-aada-ea56ec4e58d9","resolution":{"observed_at":"2026-08-02T14:05:54.863128Z","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-02T14:05:54.985366Z","title":null,"venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:54.985366Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:fb79d1721de5b6b651f00925882e416e69aa2238feffdd58c876e011351057aa","observation_id":"a147ab0d-e1f3-4da4-a1bc-b18bc6ed5d6a","resolution":{"observed_at":"2026-08-02T14:05:54.985366Z","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-02T14:05:55.125128Z","title":"On some mirror descent methods for strongly convex programming problems with Lipschitz functional constraints","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:55.125128Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:f11fe221200e34e5fcb1faa0f840c9ceb060bc85d92c0ea3b738841d8fc5c4a2","observation_id":"d9dde1fc-4cc4-498e-90fa-8f4c87b48e7e","resolution":{"observed_at":"2026-08-02T14:05:55.125128Z","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":"10.1007/978-3-030-10934-9_5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Communications in computer and information science","work_id":"aea14533-485e-4de1-aac5-8dfa5495fe39","year":2019},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:55.270554Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:1e3cb1bd37e0ffb416e560f5c522a797093506892a332eb52cc047f1e422f8b4","observation_id":"d68a78ff-a39f-43f5-80bd-d81448428c33","resolution":{"observed_at":"2026-08-02T14:08:18.890704Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-032-15791-1_7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Lecture notes in computer science","work_id":"bf8bc332-19f7-41cb-818c-041764f55af4","year":2026},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:55.392549Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:1909adbedc26f57afb5ac3b69a7aaaa2995de79af29ae5b847501c190fe879ea","observation_id":"5c5e7732-5542-466b-9fd1-eb58fabe64a8","resolution":{"observed_at":"2026-08-02T14:08:18.678138Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T14:05:55.514579Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:55.514579Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:561fd33f3ba16d2f2d904ecd0214e5acc990af7749f56bbc7d799ba72a8a74ab","observation_id":"fe96288e-511d-4268-bb0e-6379c4a9a9a0","resolution":{"observed_at":"2026-08-02T14:05:55.514579Z","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-02T14:05:55.609883Z","title":"Continuized Acceleration for Quasar Convex Functions in Non-Convex Optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:55.609883Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:b8516aa8e6131885b2dec54dc3436e4db0d75a05072ca86ae1362f731a2447b3","observation_id":"7a3d620c-41cd-4d3a-bcab-5bcfe596ea39","resolution":{"observed_at":"2026-08-02T14:05:55.609883Z","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-02T14:05:55.721700Z","title":"Xu: Primal-dual stochastic gradient method for convex programs with many func- tional constraints","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T14:05:55.721700Z"},"links":{"citing_paper":"/paper/2607.22551"},"observation_digest":"sha256:51648175fcd29f78f5959af2606b4ee4d4d31ad39f89e36a33f343c932910337","observation_id":"ddc0fc73-c235-4be9-b359-fd7f2d3fc298","resolution":{"observed_at":"2026-08-02T14:05:55.721700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22551","last_updated":"2026-05-14T11:05:09Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T16:43:23.424428Z","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":39},"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 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2607.22551."}