{"as_of":"2026-08-17T03:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b136014b8e2b9baf8e19c51ac130d71e5152f1a02c9defbfa4cbb85b65f53f6d","coverage":[{"denominator":128,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T19:10:52.503291Z","state":"measured"},{"denominator":102,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":102,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:37:36.343153Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-14T19:59:25.750285Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.07138","snapshot_observed_at":"2026-08-15T22:37:36.343153Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.06805","last_updated":"2025-05-11T01:05:29Z","snapshot_observed_at":"2026-08-16T15:52:55.484940Z","submitted_at":"2025-05-11T01:05:29Z","title":"A stochastic gradient method for trilevel optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T22:37:36.343153Z"},"links":{"cited_paper":"/paper/2412.07138","citing_paper":"/paper/2505.06805"},"observation_digest":"sha256:88778c50e7be991588d2929d859a93ba61dbc8432a3887fecd5e91c216480502","observation_id":"184ad58c-2e52-414f-8dc4-7aa0e075007e","resolution":{"observed_at":"2026-08-15T22:37:36.343153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"cited_work":{"arxiv_id":"2412.07138","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.07138","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"05136e4f-8063-4047-8f42-51cf68bf903c","year":2024},"citing_paper":{"arxiv_id":"2605.12718","last_updated":"2026-05-12T20:26:41Z","snapshot_observed_at":"2026-08-02T04:56:08.043773Z","submitted_at":"2026-05-12T20:26:41Z","title":"CHAL: Council of Hierarchical Agentic Language","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-05-14T19:59:13.378797Z"},"links":{"cited_paper":"/paper/2412.07138","citing_paper":"/paper/2605.12718"},"observation_digest":"sha256:f58c3b2878336caa8b5a51b96dea44b59299fc735dac20f8294d7a962aac3b11","observation_id":"cf9f12a2-180c-477f-9633-25b649cb63b2","resolution":{"observed_at":"2026-05-14T19:59:25.753484Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.07138/citation-record","integrity":"/paper/2412.07138/integrity","json":"/paper/2412.07138/citation-record.json","paper":"/paper/2412.07138"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:10:52.057373Z","title":"A gradient method for multilevel optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.057373Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:30ae84da90ef7bdda5fdc6bb5893d702e470f933093d00e490556a15e620b3b6","observation_id":"bbee5fce-7468-4416-9b87-8f38a6b409c7","resolution":{"observed_at":"2026-08-11T19:10:52.057373Z","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-11T19:10:52.062428Z","title":"Betty: An automatic differentiation library for multilevel optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.062428Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:3ea88eaadded4b79af4b11bbe5b40f01e6c4ecfe892848e9d67433a3c18591f6","observation_id":"c00e5244-d635-4548-a8fc-5726275abfca","resolution":{"observed_at":"2026-08-11T19:10:52.062428Z","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-11T19:10:52.067200Z","title":"When nas meets robustness: In search of robust architectures against adversarial attacks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.067200Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:0d6bd080e255657f8acf35feb030f9dd67d2547be743cdaa435607d1b5e218ef","observation_id":"ea94778a-ca84-45cd-be47-9e4927ae9ff7","resolution":{"observed_at":"2026-08-11T19:10:52.067200Z","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-11T19:10:52.072827Z","title":"Provably convergent federated trilevel learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.072827Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:42ca314e5a5807d602b08d470afd482d829211c343a098d073b852a08dad83a4","observation_id":"44bec79c-cfa4-4a73-9f7f-8a986b14925a","resolution":{"observed_at":"2026-08-11T19:10:52.072827Z","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-11T19:10:52.077561Z","title":"The computational complexity of multi-level linear programs","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.077561Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:0b9440dcbde89b161d19b91d620b73c6f84fc3b4fee16c2be97f5892014acb76","observation_id":"e02f707d-e95d-4406-97c0-ec0be7067864","resolution":{"observed_at":"2026-08-11T19:10:52.077561Z","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-11T19:10:52.081963Z","title":"Mixed-integer multi-level optimization through multi-parametric programming","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.081963Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:5172da238ff2a962652e62ccfcef3b233a01dcdc4b4ecb1b3e001c4b89b2a1da","observation_id":"9bd0eb9f-3c72-4e70-8d3b-63e7b0e02c2b","resolution":{"observed_at":"2026-08-11T19:10:52.081963Z","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-11T19:10:52.087722Z","title":"Computational difficulties of bilevel linear programming","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.087722Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:462d6da5942dd47b4790ea9a81c2f2dd7e0b46f968175ec6f5a0ece79f8ae4ef","observation_id":"2323e23f-dd77-4a9a-80f1-b471d1356784","resolution":{"observed_at":"2026-08-11T19:10:52.087722Z","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-11T19:10:52.092031Z","title":"A review on bilevel optimization: From classical to evolutionary approaches and applications","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.092031Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:0f258b2c1786db1695e2338dfd27716c515321cbf868bc34ddeedc8138e08c13","observation_id":"21e12519-d2db-45a4-b61a-c05603a6a5ca","resolution":{"observed_at":"2026-08-11T19:10:52.092031Z","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-11T19:10:52.096294Z","title":"Communication-efficient stochastic zeroth-order optimization for federated learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.096294Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:5d18e31c1ce5b35d661e4b06c08b322466222775e20ce1e411289c38311a856f","observation_id":"d3aac9b0-70e6-400d-ac6b-98ee89e04323","resolution":{"observed_at":"2026-08-11T19:10:52.096294Z","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-11T19:10:52.100453Z","title":"Zeroth-order methods for nondifferentiable, nonconvex, and hierarchical federated optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.100453Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:0512ee84aa1307979bb87dcce925dbad92343661f2f4de89e5f96bef7ec560c4","observation_id":"aaed98d5-2416-40a3-ac95-55b10b922d1e","resolution":{"observed_at":"2026-08-11T19:10:52.100453Z","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-11T19:10:52.104983Z","title":"Zeroth-order stochastic variance reduction for nonconvex optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.104983Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:978edc2021ce9225c73e8c47f8f371ffe9253aa3b12f7d41d9e408e27ec5802f","observation_id":"0797b59c-bf96-461d-8da5-2c81f2b7abea","resolution":{"observed_at":"2026-08-11T19:10:52.104983Z","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-11T19:10:52.109246Z","title":"Zo-adamm: Zeroth-order adaptive momentum method for black-box optimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.109246Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:019dfcbe94c73eb9ccc0810c77f3ea5c876b6610244db9803715f4923efe0fcd","observation_id":"e65c27a2-d1c0-42ee-a930-48b211f89513","resolution":{"observed_at":"2026-08-11T19:10:52.109246Z","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-11T19:10:52.113549Z","title":"Stochastic zeroth-order optimization in high dimensions","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.113549Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:10e51af1673aa7a3790b4cc0786e8110be38e5aa8378674a93b36ccde77aff08","observation_id":"69496f40-972f-4d9c-af02-94ddbd6e7c7e","resolution":{"observed_at":"2026-08-11T19:10:52.113549Z","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-11T19:10:52.118259Z","title":"Zoo: Zeroth order optimization based black-box attacks to deep neural networks without training substitute models","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.118259Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:f4e7b8c4d85ee7b8f6dc239ee92a11a4f5e788cc3749dde8db3078a14748f0df","observation_id":"6f37f70c-4aeb-49be-bd2b-3463cb69c409","resolution":{"observed_at":"2026-08-11T19:10:52.118259Z","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-11T19:10:52.122992Z","title":"Zeroth-order non-convex learning via hierarchical dual averaging","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.122992Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:e221110b6d2e7d2c3404bca014b7e003c9edf888cd18f4ff3d0bffe9530ee1d1","observation_id":"5cb6a5bd-0392-404d-bcaa-08b9d3fa5d6d","resolution":{"observed_at":"2026-08-11T19:10:52.122992Z","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-11T19:10:52.127353Z","title":"A zeroth-order block coordinate descent algorithm for huge-scale black-box optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.127353Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:21e803b96df88b2d23b12218b3a2e33aea76167c75e0b4059c75c42a50a27fb8","observation_id":"3df3d950-1148-42b3-bed4-6b84d26d1cbf","resolution":{"observed_at":"2026-08-11T19:10:52.127353Z","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-11T19:10:52.131384Z","title":"Can stochastic zeroth-order frank-wolfe method converge faster for non- convex problems? In International conference on machine learning, pages 3377–3386","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.131384Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:37e8b85aa101938f5c42128d4f0e8f57cc58b7477ebd7ee48c3cefc242882d2b","observation_id":"a0c4fb39-eabf-4b0b-a3a7-79328df7526a","resolution":{"observed_at":"2026-08-11T19:10:52.131384Z","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-11T19:10:52.135440Z","title":"Zeroth-order optimization with weak dimension dependency","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.135440Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:a46b88835a253f8bc53a3036416e969eb592bd7c4553a59ad45e06655ec76332","observation_id":"3e4147d7-9bfe-440d-9018-b74b5754ae94","resolution":{"observed_at":"2026-08-11T19:10:52.135440Z","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-11T19:10:52.140622Z","title":"Zeroth-order optimization for composite problems with functional constraints","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.140622Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:44b69b579c1fb66d0f60aca56c8072f42fad42a4293b7e7c9f3dee9344e8e739","observation_id":"70cfb9f5-96c8-4331-93eb-e2a23b62218e","resolution":{"observed_at":"2026-08-11T19:10:52.140622Z","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-11T19:10:52.145167Z","title":"Escaping saddle points in zeroth-order optimization: the power of two-point estimators","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.145167Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:0fb07b48ff7c172f90d07c8e47df7f9125fe725ceb5e30b1ef0ccdb68a41b3d1","observation_id":"92fe52e3-08e9-4e97-9b16-0d745066ce18","resolution":{"observed_at":"2026-08-11T19:10:52.145167Z","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-11T19:10:52.149627Z","title":"Black-box generalization: Stability of zeroth-order learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.149627Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:c5aebfb41f52fc43442296cfb5bece9b15c548e7103d56c6eba5e6656d2d609e","observation_id":"9978564d-9e4c-4294-af88-fc8c253f60c5","resolution":{"observed_at":"2026-08-11T19:10:52.149627Z","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-11T19:10:52.154030Z","title":"Autozoom: Autoencoder-based zeroth order optimization method for attacking black-box neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.154030Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:bff11331a7b062dfdbfaeb47a10132e4cbcbf6deaa3ba3e57a9794ba8ba60bb6","observation_id":"72f4ef16-2c27-4526-a830-1248349d9444","resolution":{"observed_at":"2026-08-11T19:10:52.154030Z","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-11T19:10:52.159099Z","title":"An optimal structured zeroth-order algorithm for non-smooth optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.159099Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:5bf1f26e904f27bd2528f26cbf208299537c0370ae802cf815b6d1cfbf32a34b","observation_id":"1a3d4ad7-02d0-4022-98e7-59b3d8363552","resolution":{"observed_at":"2026-08-11T19:10:52.159099Z","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-11T19:10:52.163299Z","title":"A comprehensive linear speedup analysis for asynchronous stochastic parallel optimization from zeroth-order to first-order","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.163299Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:8019b458ca6f1f3eec21e0ed336f6637066725bf7ae445dd4593dfb06c393100","observation_id":"abf68641-472c-462b-a50e-b43c32a133bb","resolution":{"observed_at":"2026-08-11T19:10:52.163299Z","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-11T19:10:52.167754Z","title":"Distributed zero-order algorithms for nonconvex multiagent optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.167754Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:a05a86e2318737d7f24f63928dd6ba06f2ce1113633683cc7545da4b90878afd","observation_id":"f91421a6-f218-4959-93c5-c8506adfbd74","resolution":{"observed_at":"2026-08-11T19:10:52.167754Z","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-11T19:10:52.172112Z","title":"Fine-grained theoretical analysis of federated zeroth-order optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.172112Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:152b490e541719485825c67dcd51507159ac0cf5cd4babfb3779f84d8a2f7444","observation_id":"446b5999-efc0-41ce-b0eb-6e8a5785d540","resolution":{"observed_at":"2026-08-11T19:10:52.172112Z","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-11T19:10:52.177894Z","title":"Distributed zero-order optimization under adversarial noise","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.177894Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:eb6ec0f0a3d48952dcf2b7b76a8a1b41a573b5550e89137765c4712f0db9dc5b","observation_id":"64503779-c951-4cb1-ac93-5d253820122f","resolution":{"observed_at":"2026-08-11T19:10:52.177894Z","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-11T19:10:52.182962Z","title":"Distributed zeroth order optimization over random networks: A kiefer-wolfowitz stochastic approximation approach","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.182962Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:e81df2c5350788cd4f38f0ff866aa3b4a15da05b3353e453fb473e7cc6b62758","observation_id":"6a12aaa5-b3a5-4fa3-8388-f9b5438c48c2","resolution":{"observed_at":"2026-08-11T19:10:52.182962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.04077","last_updated":"2023-08-08T06:26:54Z","snapshot_observed_at":"2026-08-16T15:10:03.614495Z","submitted_at":"2023-08-08T06:26:54Z","title":"Federated Zeroth-Order Optimization using Trajectory-Informed Surrogate Gradients","version":1},"cited_work":{"arxiv_id":"2308.04077","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.04077","snapshot_observed_at":"2026-08-11T19:10:52.802534Z","title":"Federated Zeroth-Order Optimization using Trajectory-Informed Surrogate Gradients","venue":"cs.LG","work_id":"77c532c5-57b8-4185-8a79-c9722a12d634","year":2023},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.187737Z"},"links":{"cited_paper":"/paper/2308.04077","citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:f3b200796f82688553746dfa8a90fab75aa45121163f3caea0e856e83981604a","observation_id":"9d4b63d6-dbd8-4462-af00-66909956b8df","resolution":{"observed_at":"2026-08-11T19:10:52.808531Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:52.192688Z","title":"Meta- learning to improve pre-training","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.192688Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:3364e384130030303812c4de679bfee0754a96ca58bac0cecb2467cc93696eed","observation_id":"0a3c804c-67ca-4d5e-8c8c-45228f08cb64","resolution":{"observed_at":"2026-08-11T19:10:52.192688Z","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-11T19:10:52.197646Z","title":"Learning from mistakes–a framework for neural architecture search","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.197646Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:485490f67cabf548cd07d68918eeacff5e8baa2adf6d124b22a6d50e8929c668","observation_id":"0a014541-804f-4f6b-bf03-b1035af1edd3","resolution":{"observed_at":"2026-08-11T19:10:52.197646Z","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-11T19:10:52.202716Z","title":"Convex optimization algorithms","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.202716Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:7e66b5fc06761137cfef5b0b71fed8b45d7137384f925fa844fbeac7be349cc1","observation_id":"2250685b-598d-4eb9-8f24-9b32b59f65fd","resolution":{"observed_at":"2026-08-11T19:10:52.202716Z","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-11T19:10:52.207611Z","title":"Cutting plane methods in machine learning.Optimization for Machine Learning, pages 185–218, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.207611Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:7f8f68d5a899dc4511af2a117c89297be2e77fa435f9f88ffb1a917995ed80e1","observation_id":"1fc6e1c8-babe-44c1-8774-fbebf7de2c08","resolution":{"observed_at":"2026-08-11T19:10:52.207611Z","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-11T19:10:52.212487Z","title":"Distributed robust optimization (DRO), part I: Framework and example","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.212487Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:b56831ab1e914ddea5d2f3bc8df137f418177ef3f88dc605bbe1baa54eef5db5","observation_id":"2d36a900-66c5-42dc-917d-4080c0724fb8","resolution":{"observed_at":"2026-08-11T19:10:52.212487Z","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-11T19:10:52.217523Z","title":"A polyhedral approximation framework for convex and robust distributed optimization","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.217523Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:756956a215a09e1b79bdf11826d6c7892e8f834e993499f01a5cf818f06a6d9e","observation_id":"177ca8c8-2f8f-4a6b-b670-9b2d30b7ed71","resolution":{"observed_at":"2026-08-11T19:10:52.217523Z","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-11T19:10:52.222049Z","title":"Asynchronous distributed bilevel optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.222049Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:ca55d6ff896848635cb5ed8dd75a350aeaae3c84c83738ac180887cf029c4e11","observation_id":"a6c51704-b625-47a7-bda5-0e515ec0d69f","resolution":{"observed_at":"2026-08-11T19:10:52.222049Z","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-11T19:10:52.226485Z","title":"Robust beamforming for downlink multi-cell systems: A bilevel optimization perspective","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.226485Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:f5c9a0de583bd6effb69b73faeb14b44f0fcb35f8a86374598e7e3bcee15b400","observation_id":"35945458-1ca9-4449-a0d0-f08fba5c52e4","resolution":{"observed_at":"2026-08-11T19:10:52.226485Z","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-11T19:10:52.230865Z","title":"Centralized and federated learning for predictive vnf autoscaling in multi-domain 5g networks and beyond","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.230865Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:2346dfc031809650b3e3c3f336e64aaade6108ea2c4223a6f14b93314973cfaa","observation_id":"43fde2c8-8d8e-430f-afdc-df3c5bd08e70","resolution":{"observed_at":"2026-08-11T19:10:52.230865Z","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-11T19:10:52.235122Z","title":"Advances in asynchronous parallel and distributed optimization","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.235122Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:3488af6acf5c7f35d9cddc1deb00b30eebce9b861847389401c6c488e7043e87","observation_id":"1a4eb86a-9415-43e1-ae33-8bbb6c413d8f","resolution":{"observed_at":"2026-08-11T19:10:52.235122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.19976","last_updated":"2025-05-25T05:03:51Z","snapshot_observed_at":"2026-08-16T13:38:42.609308Z","submitted_at":"2024-06-28T15:03:08Z","title":"ScaleBiO: Scalable Bilevel Optimization for LLM Data Reweighting","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.19976","snapshot_observed_at":"2026-08-11T19:10:52.240086Z","title":"Scalebio: Scalable bilevel optimization for llm data reweighting","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.240086Z"},"links":{"cited_paper":"/paper/2406.19976","citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:ede4d66481f5b18ac3dd95a75269c0534562b82b0d646b92ef11cf7687a234f8","observation_id":"a2839503-0acf-4e0a-b55d-8f2763514b04","resolution":{"observed_at":"2026-08-11T19:10:52.240086Z","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-11T19:10:52.245107Z","title":"A fully first-order method for stochastic bilevel optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.245107Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:48cb83072eeab9c684feab58b328cd1fb531c0d658c55c13dc937a9a247e854e","observation_id":"3fb56f0b-d90b-4fcc-aee2-fd306626a22c","resolution":{"observed_at":"2026-08-11T19:10:52.245107Z","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-11T19:10:52.249313Z","title":"A conditional gradient- based method for simple bilevel optimization with convex lower-level problem","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.249313Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:a7a0b342659b47b8be036bf3c867d5d2e2255fbf2cb22f294ac286429c6fe1e9","observation_id":"befdbec5-229b-4aa4-9d93-91c3cda78df9","resolution":{"observed_at":"2026-08-11T19:10:52.249313Z","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-11T19:10:52.253800Z","title":"Darts: Differentiable architecture search","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.253800Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:7b7ca72a9295041999f730f6f1b47f242503ce80a01c04ead0de0ac3993ad9d1","observation_id":"a34d5197-1eb8-43e7-bd28-1cf447dc4cf1","resolution":{"observed_at":"2026-08-11T19:10:52.253800Z","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-11T19:10:52.258011Z","title":"A general stochastic approach to solving problems with hard and soft constraints","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.258011Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:74b11bdc1817f805eb3f58228441fd3874d33a95c699b36bb2bd85ec4c61725c","observation_id":"c76eeb77-ee35-4b5e-b907-fae673b6dd58","resolution":{"observed_at":"2026-08-11T19:10:52.258011Z","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-11T19:10:52.262159Z","title":"An algorithm with optimal dimension-dependence for zero-order nonsmooth nonconvex stochastic optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.262159Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:574f67fa428f7f9d962fdfb4892d7b424732e47f7f21a20190e277eff32009f3","observation_id":"5e75c618-5750-4f87-b3f7-37ab56dcfeef","resolution":{"observed_at":"2026-08-11T19:10:52.262159Z","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-11T19:10:52.266285Z","title":"Stochastic first-and zeroth-order methods for nonconvex stochastic program- ming","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.266285Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:f932398e90533b3889ebd12520bb67d9ec8de4672dbdcc934242545c97c94087","observation_id":"10e48051-f924-46b6-b842-264595a2ccc2","resolution":{"observed_at":"2026-08-11T19:10:52.266285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.05185","last_updated":"2025-01-06T22:56:30Z","snapshot_observed_at":"2026-08-16T15:56:17.662713Z","submitted_at":"2023-02-10T11:30:19Z","title":"On Penalty-based Bilevel Gradient Descent Method","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.05185","snapshot_observed_at":"2026-08-11T19:10:52.270404Z","title":"On penalty-based bilevel gradient descent method","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.270404Z"},"links":{"cited_paper":"/paper/2302.05185","citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:5b4a9a1d08282daef3af5ca6aa734eeb9630fbf444f607dfc05760498cd0ff63","observation_id":"2854534e-0f42-4680-82a1-34c88f10a155","resolution":{"observed_at":"2026-08-11T19:10:52.270404Z","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-11T19:10:52.274861Z","title":"Improved penalty method via doubly stochastic gradients for bilevel hyperparameter optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.274861Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:de3d4792ff63f1807a6af3d83714677c71f6773c51014c91282d334da9853ac4","observation_id":"add83a98-344e-49fe-b7a1-9daf9de9dda8","resolution":{"observed_at":"2026-08-11T19:10:52.274861Z","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-11T19:10:52.278973Z","title":"Convex optimization","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.278973Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:7a4571404cc71226ed4139b506299f773ee4d7527e4c3fe4f7a9377bf74fd578","observation_id":"0b1642bf-c7d0-43ad-9b73-6df2e592da73","resolution":{"observed_at":"2026-08-11T19:10:52.278973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.02032","last_updated":"2023-01-15T04:32:00Z","snapshot_observed_at":"2026-07-06T09:25:36.318996Z","submitted_at":"2020-06-03T04:00:52Z","title":"A Unified Single-loop Alternating Gradient Projection Algorithm for Nonconvex-Concave and Convex-Nonconcave Minimax Problems","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.02032","snapshot_observed_at":"2026-08-11T19:10:52.283877Z","title":"A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.283877Z"},"links":{"cited_paper":"/paper/2006.02032","citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:720da523323159912cd151a23daa575c5731f9f4a32bde250b91d5cee027ef48","observation_id":"62feb05b-f170-438b-8319-15d70eb37edf","resolution":{"observed_at":"2026-08-11T19:10:52.283877Z","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-11T19:10:52.288596Z","title":"Complexities in projection-free stochastic non-convex minimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.288596Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:599d268556c5c5cd45df660426f7690e6104ce2583a125648ab85886a988fa09","observation_id":"22240d80-2a64-4205-8bdc-329d1deaaa4d","resolution":{"observed_at":"2026-08-11T19:10:52.288596Z","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-11T19:10:52.292730Z","title":"Enhancing the resilience of llms against grey-box extractions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.292730Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:adb58b1ff2ee356b89b2dc93f2fe02452534af14f5303e27ac2b9bc14dfb99b0","observation_id":"bc1e3bb3-65aa-498a-8bb4-0aff7ccf6d01","resolution":{"observed_at":"2026-08-11T19:10:52.292730Z","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-11T19:10:52.296823Z","title":"Random gradient-free minimization of convex functions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.296823Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:6a24a6022a3d58279d28511a9499ae73121a36bdc83f3736e81793de9c6772a4","observation_id":"e39f098e-59b8-431f-8503-18b321d2b920","resolution":{"observed_at":"2026-08-11T19:10:52.296823Z","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-11T19:10:52.301308Z","title":"Accelerated zeroth-order method for non-smooth stochastic convex optimization problem with infinite variance","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.301308Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:4132e6a6f1a185dee21fd3155b6800278e517bb69b657a006438cb542f9a8e4e","observation_id":"c1240d61-38d7-42a6-ba24-6a97c5e965dd","resolution":{"observed_at":"2026-08-11T19:10:52.301308Z","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-11T19:10:53.765238Z","title":"Distributionally robust federated averaging","venue":null,"work_id":"63733ee2-a84e-4c5b-8167-05224864030a","year":2020},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.305408Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:eec5f7e43528a335192663cd04e2b4689262e5e22b8c7cbaad156a79f9d6b9e9","observation_id":"1f898507-b49d-4995-ba54-16912c1d3a99","resolution":{"observed_at":"2026-08-11T19:10:53.770461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.750571Z","title":"Robust optimization over multiple domains","venue":null,"work_id":"f18734a6-bfd4-46c7-b02d-850f57e6ab65","year":2019},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.309510Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:dc5f67454341c5ae2456c86e31287434b53bf366124aceaa9aebc3d9566081f5","observation_id":"18db01f0-37ed-4feb-8bb1-18893a931826","resolution":{"observed_at":"2026-08-11T19:10:53.755864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.736149Z","title":"Stochastic composite mirror descent: Optimal bounds with high probabilities","venue":null,"work_id":"f01e8e3b-c944-4e52-b7ba-da727f2826c6","year":2018},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.313591Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:f245d2d40c000a85970c4e7843671a356577c465aa37f54338cc802a9ce53c40","observation_id":"7f1c78f3-fb9f-468e-8d7b-9c184a0bdda6","resolution":{"observed_at":"2026-08-11T19:10:53.740926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.721958Z","title":"Asynchronous stochastic gradient descent with delay compensation","venue":null,"work_id":"acd3c63b-a239-4c8b-9119-264462076cf7","year":2017},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.317674Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:6e76a90cb80afe7db458dcf914339b32409d4a02c3f37cfa02e13f54b90d44d6","observation_id":"97673eae-14ed-4c3e-82b7-4f87aa37961a","resolution":{"observed_at":"2026-08-11T19:10:53.726586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:52.321987Z","title":"Momentum-based variance reduction in non-convex sgd","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.321987Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:b309b39b4c4f162cb82f9a86af717774de8cd70f5ea8812d8c7360a59be3b568","observation_id":"0f07b1fa-770f-49c8-aa03-47cc462e6b4f","resolution":{"observed_at":"2026-08-11T19:10:52.321987Z","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-11T19:10:52.326077Z","title":"Conflict-averse gradient descent for multi-task learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.326077Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:bceb9184a20d44e8b94fab225a15ef53709eec41ce8c1f2184a4886bc560faac","observation_id":"46157436-cc4f-42f7-8731-722ed96dc2f9","resolution":{"observed_at":"2026-08-11T19:10:52.326077Z","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-11T19:10:53.689368Z","title":"Truncated back-propagation for bilevel optimization","venue":null,"work_id":"04241629-1daf-4458-a13a-40ac7d330fdb","year":2019},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.331046Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:6af2d49ec8c76e2f8be76a9a9c145e2bbcbd6fe982eb4f94b27dfe973e794a3f","observation_id":"f81eac78-1ed7-4fbf-813e-766f57c558c1","resolution":{"observed_at":"2026-08-11T19:10:53.693787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.674417Z","title":"Decentralized stochastic bilevel optimization with improved per-iteration complexity","venue":null,"work_id":"b644e720-0bfd-41f6-9407-77a206b167bd","year":2023},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.335822Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:15409239afc6a536718f75ae759bee291d92e421b643869e91056368eb6c43eb","observation_id":"641843ad-7bd0-4a94-89bd-78df95454bb0","resolution":{"observed_at":"2026-08-11T19:10:53.679831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.659998Z","title":"Non-convex bilevel optimization with time-varying objective functions","venue":null,"work_id":"bf29ae0e-a31a-4488-9162-710724117be6","year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.340029Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:79b033ef3e2c0025393f5b56dbc2524e07aad44a424f6e177bfb9d3152c24a0c","observation_id":"ff36d036-0dad-4aaa-a832-5c79754f81ed","resolution":{"observed_at":"2026-08-11T19:10:53.664575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.645591Z","title":"Revisiting zeroth-order optimization for memory-efficient llm fine-tuning: A benchmark","venue":null,"work_id":"ecb9a9c4-bc89-47ea-8454-4f460f41a88f","year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.344844Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:ef3df379e3430c7a47d802939453d36d67115ddf9ed4d4bf7146d12bf5b2b1bb","observation_id":"0539c1b5-b516-43d6-87e0-6a49efc0e3e4","resolution":{"observed_at":"2026-08-11T19:10:53.650101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.629076Z","title":"Subspace selection based prompt tuning with nonconvex nonsmooth black-box optimization","venue":null,"work_id":"ad42ac95-b292-493f-8d8b-8d0aa2984788","year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.348926Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:ca8fa4bf4cf70c41c07e9f80a90be16d2b62973f9aecc8beef10ff44f9b68905","observation_id":"60ffe417-3390-479f-9f70-79422fdadedb","resolution":{"observed_at":"2026-08-11T19:10:53.634567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.614590Z","title":"Optimal rates for zero-order convex optimization: The power of two function evaluations","venue":null,"work_id":"e962ee13-c5ca-4c4b-8779-d3e95550e87e","year":2015},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.353171Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:5f5dd5ecac27f039cf6bbda430419b926f4b584de78d18202c79745429ccb132","observation_id":"40b136e8-984d-4954-88a7-9721feffdd23","resolution":{"observed_at":"2026-08-11T19:10:53.618989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.598538Z","title":"Black-box tuning for language- model-as-a-service","venue":null,"work_id":"d9b73dfb-860b-464b-943f-8599f1a52174","year":2022},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.357549Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:cbc2cb394e82e5b433183b0bbe27a375bee614487aebf7a24d0416d6c124c774","observation_id":"89d8bf18-8c08-4e4a-9ad8-7dde7f40117f","resolution":{"observed_at":"2026-08-11T19:10:53.603958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.583066Z","title":"Fairness-guided few-shot prompting for large language models","venue":null,"work_id":"8d593625-f01a-43de-8dfd-740440d0e898","year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.361763Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:c2c32e2dcb94b8b75cef152ce276641dd47264c79cbe8dead0a07b8aff8cbb92","observation_id":"b6312f70-8ccd-43d1-ae72-9be0442b6c14","resolution":{"observed_at":"2026-08-11T19:10:53.588161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.568931Z","title":"Grammar prompting for domain-specific language generation with large language models","venue":null,"work_id":"91fde6af-3eb3-4f51-8351-7feddc8b344a","year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.366148Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:8dc417a053a7fb6aac6a9c41685ec2948f9a13c8de8690fa2e58cc78ca13fbce","observation_id":"163473f0-3ba3-4333-b45c-e8835ae0f464","resolution":{"observed_at":"2026-08-11T19:10:53.573530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.554247Z","title":"Black-box prompt learning for pre-trained language models","venue":null,"work_id":"ee13ceb2-d4f1-451c-9d16-05032bd0a50e","year":2022},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.370063Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:99cb83f7a0dde01b18825b1183f88355e967290a50df3bb89bb2032f92e4c78b","observation_id":"565d5bd5-28c4-4e5b-9e01-a9ed8eace726","resolution":{"observed_at":"2026-08-11T19:10:53.559059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:52.374209Z","title":"Poisonprompt: Backdoor attack on prompt-based large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.374209Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:4ffbe965b2d857afb9d8f67123be3ddce007bba533c78f406b546ba2ecc3e0b7","observation_id":"f2fdcbe9-ae00-497b-8a61-50c2cc82b891","resolution":{"observed_at":"2026-08-11T19:10:52.374209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-08-09T21:25:20.369782Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-11T19:10:52.378394Z","title":"Qwen technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.378394Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:4b4df7dae30ccd7c97c58f17fd786142c0ee1e5becef178f2ac575d6a247dce2","observation_id":"8e08e1c3-bf9a-418f-b90b-967c268911cb","resolution":{"observed_at":"2026-08-11T19:10:52.378394Z","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-11T19:10:52.382930Z","title":"Glue: A multi-task benchmark and analysis platform for natural language understanding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.382930Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:19f8196e25d82397a42c029be8d9845c617c20cfec6a41a138035286dad70bd9","observation_id":"8e42a5d5-b01f-45f4-931b-e6e3443dc5b3","resolution":{"observed_at":"2026-08-11T19:10:52.382930Z","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-11T19:10:53.521071Z","title":"Discriminative feature alignment: Improving transferability of unsupervised domain adaptation by gaussian-guided latent alignment","venue":null,"work_id":"5ea638c1-45e6-4878-9e33-79adb777db33","year":2021},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.388180Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:4aeb90ce46fd47ad569d440ebaa0ad911bb6cfa946e6212c42bec7a7c8f3822e","observation_id":"c793e8bf-abd5-49bd-8eae-8139099fc72f","resolution":{"observed_at":"2026-08-11T19:10:53.526125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:52.393825Z","title":"Gradient-based learning applied to document recognition","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.393825Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:dfd6fb86115e59f58674e36f018f3725937065ac10626cd086fc1387b14fb92c","observation_id":"df9a19a2-fd6c-4430-82bd-8a9ea6430753","resolution":{"observed_at":"2026-08-11T19:10:52.393825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1708.07747","last_updated":"2017-09-15T21:29:49Z","snapshot_observed_at":"2026-08-13T15:13:33.081929Z","submitted_at":"2017-08-25T14:01:29Z","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.07747","snapshot_observed_at":"2026-08-11T19:10:52.398123Z","title":"Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.398123Z"},"links":{"cited_paper":"/paper/1708.07747","citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:d92a63f868a9902c25d9252d69ee3ce83b4321437ae635c2962f82e644e62c88","observation_id":"f27c5e95-fb1d-41d3-a8e3-73ee46f6ec6b","resolution":{"observed_at":"2026-08-11T19:10:52.398123Z","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-11T19:10:53.495765Z","title":"Cold case: The lost mnist digits","venue":null,"work_id":"c5c0fc87-8f1b-4f96-bed8-400e2aa0d8ce","year":2019},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.402572Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:07d343f2da7947134d3bbee6e4c749cf6fc17effff1589d1eb3d45300a1eeb26","observation_id":"20be34c0-2a01-4f4b-95bd-3a472c06acec","resolution":{"observed_at":"2026-08-11T19:10:53.501228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.480892Z","title":"A primer on zeroth-order optimization in signal processing and machine learning: Principals, recent advances, and applications","venue":null,"work_id":"9f43a5f7-36a5-48cf-8d26-07c5195e3d3a","year":2020},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.406893Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:5b7226091051fa8ca8a5fb499d4b52b3d0928568f84e13a7d7fede58dc565399","observation_id":"9b383205-7306-4fe3-998e-b6136a3c7027","resolution":{"observed_at":"2026-08-11T19:10:53.486108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.466351Z","title":"Using hard constraints for representing soft constraints","venue":null,"work_id":"7ca6939e-6924-4831-919b-0cd9be2afdbe","year":2011},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.411579Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:444340512bb3b79409f01b8b7110cce5ffbecd50675142c5a1f19271068d1a26","observation_id":"fd34abbb-0c55-407c-95ea-83938f5d8bb4","resolution":{"observed_at":"2026-08-11T19:10:53.471639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.451443Z","title":"Combining hard and soft constraints in quantum constraint- satisfaction systems","venue":null,"work_id":"003d94e4-4c7e-41d6-a5b9-98dc5ff78bd0","year":2022},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.416041Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:47715f5bc4b5f55634d807efec32e76b18ed3856a3f3d51588f45f897ab0f0c1","observation_id":"a9ffa79d-36bc-4b0d-ba03-42208ffcab99","resolution":{"observed_at":"2026-08-11T19:10:53.456469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.434986Z","title":"Bilevel optimization: Convergence analysis and enhanced design","venue":null,"work_id":"d243d557-aa6d-4075-a3ab-4b8913a2d6a3","year":2021},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.420514Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:3c0fea0948f00723018cf96bfaecbe677d1365172e5b3e00ac0784fd35ec3391","observation_id":"bffaaca4-b0f9-41c1-a97a-6454edd8a38b","resolution":{"observed_at":"2026-08-11T19:10:53.440419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:52.425458Z","title":"Model-agnostic meta-learning for fast adaptation of deep networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.425458Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:e7c6889e0cccdd8ba14f88b1cb2c617fa12757af1515d702c277fd15f2262801","observation_id":"929f43d3-1f01-4207-942f-ee31d8fd0564","resolution":{"observed_at":"2026-08-11T19:10:52.425458Z","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-11T19:10:52.429948Z","title":"Towards deep learning models resistant to adversarial attacks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.429948Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:ca4754d5da51f8177859132ee35dbc23e4772ff031bd9fc1525eb1fa3d5d0579","observation_id":"ee49a28b-9d09-44cb-bd7d-22a9aba75db9","resolution":{"observed_at":"2026-08-11T19:10:52.429948Z","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-11T19:10:53.399995Z","title":"Revisiting and advancing fast adversarial training through the lens of bi-level optimization","venue":null,"work_id":"1b80e921-00eb-476b-9fd8-b6d6ab76932f","year":2022},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.434144Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:7050cf47de7991239db2254c55afbe4dd4674645e8d963860f3b31d00a3e4bae","observation_id":"95d3da26-dc08-467d-87ee-b0303a81b7e9","resolution":{"observed_at":"2026-08-11T19:10:53.405740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.384825Z","title":"Distributed distributionally robust optimization with non-convex objectives","venue":null,"work_id":"fa02906f-7d3f-4adb-b409-ff44f690085e","year":2022},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.438334Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:dd39962430c1d653910af2c4832a650215d32c671174625ddf8be39324d8d625","observation_id":"a2c4bc43-5e3e-4583-a9a6-9958a21ef20e","resolution":{"observed_at":"2026-08-11T19:10:53.389653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:52.442411Z","title":"Provably faster algorithms for bilevel optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.442411Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:4ce94abf36144ce455d1fe1be6c790d4cbdc05de8c1186b41f18e48e11a4b382","observation_id":"7f7c4393-204e-475c-9f45-81ce97965a42","resolution":{"observed_at":"2026-08-11T19:10:52.442411Z","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-11T19:10:52.446552Z","title":"Bilevel programming for hyperparameter optimization and meta-learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.446552Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:9a42190071560efbb80071b8f0d4872ed58cc539d51f9f5e67675b1742c34f64","observation_id":"20ae0d95-291b-4a4f-95e5-f4ea1d5fa2d5","resolution":{"observed_at":"2026-08-11T19:10:52.446552Z","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-11T19:10:53.350145Z","title":"Investigating bi-level optimization for learning and vision from a unified perspective: A survey and beyond","venue":null,"work_id":"ed92c457-a533-4496-ba10-47d44a1ef727","year":2021},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.450857Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:af094822b6d0fb3d954e2bc3431e6c3ddd5c99b887f7560d256303e46d00b060","observation_id":"c821d092-9333-42a9-a1e5-8cb5db9c49a6","resolution":{"observed_at":"2026-08-11T19:10:53.355376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.336450Z","title":"Self-tuning networks: Bilevel optimization of hyperparameters using structured best-response functions","venue":null,"work_id":"f4c07638-46cb-4f87-adda-b840eb54fae1","year":2018},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.454917Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:c8b2e120d682ef51888c200528c4ccee74c4f4f4048b38d58ed2df4bb39f1bf0","observation_id":"695db97f-a203-40a6-8ffc-a272dd794531","resolution":{"observed_at":"2026-08-11T19:10:53.341215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.322137Z","title":"Timeautoad: Autonomous anomaly detection with self- supervised contrastive loss for multivariate time series","venue":null,"work_id":"4c2352ca-f6c9-43bd-8acd-6a0352bdb599","year":2022},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.459252Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:2792dd574f6d83edd9cff87ef2cf51149d3762b0e8536f14251aca5efb70b7af","observation_id":"d19c0783-471b-4231-b534-07080a5eedc6","resolution":{"observed_at":"2026-08-11T19:10:53.326892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.307521Z","title":"Fedal: Black-box federated knowledge distillation enabled by adversarial learning","venue":null,"work_id":"4ebc6eb9-6790-42d9-a973-b50972c83ccb","year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.463818Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:4ae60a9f1b481653acade760e659149ea254d5c853fb47bf12aa25230050898e","observation_id":"5d462cb2-b08a-466b-bab7-aed47192056a","resolution":{"observed_at":"2026-08-11T19:10:53.312624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.01718","last_updated":"2018-12-03T12:37:31Z","snapshot_observed_at":"2026-08-14T23:13:55.892736Z","submitted_at":"2018-12-03T12:37:31Z","title":"Deep Learning for Classical Japanese Literature","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.01718","snapshot_observed_at":"2026-08-11T19:10:52.468158Z","title":"Deep learning for classical japanese literature","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.468158Z"},"links":{"cited_paper":"/paper/1812.01718","citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:1480ac088031fd0434039ba53059aacd51ec7a13f8665167e53045e368f0e272","observation_id":"af6c0fdd-aec8-4e58-9b93-b740efb8bb90","resolution":{"observed_at":"2026-08-11T19:10:52.468158Z","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-11T19:10:53.293804Z","title":"Adadelay: Delay adaptive distributed stochastic optimization","venue":null,"work_id":"0c07a420-4448-40bc-b428-226667770a5b","year":2016},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.473292Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:6ef2efe96d8c28f20291221d8ea608040960c70c8a300a79ddd24a936682497e","observation_id":"93f8898e-a0da-4f3c-825a-21ed255b05b5","resolution":{"observed_at":"2026-08-11T19:10:53.298064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.12597","last_updated":"2021-05-26T14:54:07Z","snapshot_observed_at":"2026-08-16T18:22:04.032210Z","submitted_at":"2021-05-26T14:54:07Z","title":"Distributed Zeroth-Order Stochastic Optimization in Time-varying Networks","version":1},"cited_work":{"arxiv_id":"2105.12597","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.12597","snapshot_observed_at":"2026-08-11T19:10:52.698404Z","title":"Distributed Zeroth-Order Stochastic Optimization in Time-varying Networks","venue":"math.OC","work_id":"682b7486-2780-4fe7-9c2b-ba8b0dd216b2","year":2021},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.477297Z"},"links":{"cited_paper":"/paper/2105.12597","citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:cb4f6e90c50b4db24e8362de318c85badcece0efaefbf18d3912fd54f56f3a2c","observation_id":"7f104d94-0a9f-4c5c-bbdc-a4cfe3227ba0","resolution":{"observed_at":"2026-08-11T19:10:52.705038Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.280390Z","title":"Projection- free methods for stochastic simple bilevel optimization with convex lower-level problem.Advances in Neural Information Processing Systems, 36, 2024","venue":null,"work_id":"6288f93f-c9f5-4239-ac9c-1fc321640b89","year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.481611Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:149e1113e4fb33527692831b78fe7cae6f1add5e71478462c44af7df00251cd4","observation_id":"4d092559-1342-47af-92a2-c12a229c6064","resolution":{"observed_at":"2026-08-11T19:10:53.285101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.266305Z","title":"signsgd via zeroth-order oracle","venue":null,"work_id":"67732f54-1193-4ce3-a8da-b7bb4019f428","year":2018},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.485604Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:57fa23d32fdefd9dad0052d7d74e6c335eccea045ebf0b061ca7ad5bbeb6190a","observation_id":"3dfd6886-d1e4-4165-914c-af0a17e16e18","resolution":{"observed_at":"2026-08-11T19:10:53.270791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.251555Z","title":"Bome! bilevel optimization made easy: A simple first-order approach","venue":null,"work_id":"91b3bdb8-42bb-46a3-9859-5b0e50c21bda","year":2022},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.489748Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:77206afef00d3de95a4b4db7867926b941279774f595a6b09e0736e638603e1b","observation_id":"7135e7db-5192-4a1e-92d4-94721f80349d","resolution":{"observed_at":"2026-08-11T19:10:53.256189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.237002Z","title":"A novel chattering-free discrete sliding mode controller with disturbance compensation for zinc roasting temperature distribution control","venue":null,"work_id":"6fa9c3c4-8072-49c1-81b6-85cc95aa7988","year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.493857Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:47e529353fc85b18c5dde2952aceb696f1487cec0c6ccf7b82f20cac058e076a","observation_id":"71cab522-8bd3-48ea-bba8-fef0cbd0b8b0","resolution":{"observed_at":"2026-08-11T19:10:53.242224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.222108Z","title":"Decentralized multi-level compositional optimization algorithms with level-independent convergence rate","venue":null,"work_id":"733e31d5-5c43-4e4e-a745-17459292a574","year":2024},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.498517Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:75b0ffb23f82119c5eeeb7d54ca08e51f12e5f1bb98659e73a5375aca55429e1","observation_id":"675f19e5-a81e-4273-ad0a-a68cab53892d","resolution":{"observed_at":"2026-08-11T19:10:53.226906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T19:10:53.207163Z","title":"On the convergence of local stochastic compositional gradient descent with momentum","venue":null,"work_id":"ab463612-088a-43b4-90b6-b61f9cc5510b","year":2022},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.503291Z"},"links":{"citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:c0b1791ba4e913c9fe30045f978c28d2bd982b4dab197e03b2e995323fcd8496","observation_id":"f6e58254-7e82-4beb-a751-739a5f5d296a","resolution":{"observed_at":"2026-08-11T19:10:53.212223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T23:14:54.044184Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":65,"verified_exact":2,"verified_fuzzy":33},"total_outbound_references":128},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 100 of 128 outbound references and 2 inbound Pith citation observations for arXiv:2412.07138."}