{"as_of":"2026-08-09T21:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f4df8203ea1e6bf11c0a8efb38bb52b45e7b548161db7c786eb7af062775a751","coverage":[{"denominator":64,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":64,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:20:08.293574Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.08558/citation-record","integrity":"/paper/2506.08558/integrity","json":"/paper/2506.08558/citation-record.json","paper":"/paper/2506.08558"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.669035Z","title":null,"venue":null,"work_id":"4833e6e0-9ce5-4856-8db5-0bfb6651a6ec","year":2010},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.911805Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:d517e741df83dfa6bcae9d0d0d322c160fda5d37663dc84cf857b7b17c1268da","observation_id":"9c21aedd-8c61-4f97-9806-b142cd4a8984","resolution":{"observed_at":"2026-08-07T05:20:09.675025Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.00051","last_updated":"2021-05-09T19:49:46Z","snapshot_observed_at":"2026-07-06T09:43:35.929296Z","submitted_at":"2020-07-31T19:37:59Z","title":"On the Convergence of SGD with Biased Gradients","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.00051","snapshot_observed_at":"2026-08-07T05:20:07.917254Z","title":"and Stich, S","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.917254Z"},"links":{"cited_paper":"/paper/2008.00051","citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:a4a823c27a66a026cae0b891b76bba39d097c38fd3f0daf70856a49fd633b68d","observation_id":"dfd23108-f78d-4794-86c6-2cd50b394b1b","resolution":{"observed_at":"2026-08-07T05:20:07.917254Z","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-07T05:20:09.652372Z","title":null,"venue":null,"work_id":"67cd8e00-13ea-48bb-9f4c-4e1cc2408577","year":2013},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.922324Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:fc2ab62f69bafce079be16ed42be922aabd37e78f8dd4f035de01794a514092d","observation_id":"33cc5986-ad72-4655-a72e-bfe21fec15ab","resolution":{"observed_at":"2026-08-07T05:20:09.658413Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.638190Z","title":"and Sviridenko, M","venue":null,"work_id":"e3c09a5f-5fe6-4a80-992e-3c326d244926","year":2021},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.927376Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:16c5aa24e4cb746a761c8da4db9102b6107759fc777d6eddb912dc71769e2317","observation_id":"5bbb1c19-c78f-470e-8ee3-9fad3e4337ab","resolution":{"observed_at":"2026-08-07T05:20:09.642775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.623673Z","title":"and Sviridenko, M","venue":null,"work_id":"84d08135-73ec-4c4f-ab5e-67d2dc6d50c2","year":2022},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.932810Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:99e37d25dad302b6f0f218ceb02e93903c010a1e411721a59d1ee24b6cbe7859","observation_id":"a07736be-708b-4c53-9940-af0cea4ee689","resolution":{"observed_at":"2026-08-07T05:20:09.628381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.607415Z","title":"and Ghadimi, S","venue":null,"work_id":"beb95558-c512-4392-9096-12d236fd3389","year":2018},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.937834Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:220c0f71b96f363bd0d3342ba269c56372c3dedbcb732c5893c32f92d7e9870c","observation_id":"0e5f26ba-f245-4331-8243-7d5deedea7f7","resolution":{"observed_at":"2026-08-07T05:20:09.612594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.592059Z","title":"H., Bolte, J., and Teboulle, M","venue":null,"work_id":"fe3f253f-c3cb-43b0-b533-ab8e25dc7ebe","year":2017},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.943491Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:43b5f400309dd848279b0b4f46e01c38225b8f60785c359fc0fcab2d6e76b48e","observation_id":"d5791b3f-c220-416d-92e9-ef36856988ec","resolution":{"observed_at":"2026-08-07T05:20:09.597434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.576628Z","title":"H., Bolte, J., Chen, J., Teboulle, M., and Wang, X","venue":null,"work_id":"4359043d-ca86-4567-990e-2496e3ea4348","year":2019},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.948937Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:458cc7eb23c2cc180f962142816e1f5eed70257b26080c4cc8e0406f8c0388c3","observation_id":"04721ccd-9b15-4a08-8669-ed2c3b9cfcb1","resolution":{"observed_at":"2026-08-07T05:20:09.581869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.558885Z","title":"and Hallak, N","venue":null,"work_id":"60441120-8f55-4b25-843e-be4bfd9eed27","year":2016},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.953938Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:c83a65c7fff5b047e023e46ed997b783669895ffdc5641db78bdcae012941a27","observation_id":"a49aeef4-ef73-483e-a165-c2e742a12fba","resolution":{"observed_at":"2026-08-07T05:20:09.563763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.539136Z","title":"S., Cao, L., Choromanski, K., and Scheinberg, K","venue":null,"work_id":"29fe500b-881c-4d7d-8199-cbdbae56d38d","year":2021},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.959730Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:e100c4d7ec81a866b5cfd757f3296ee002285a7e523784a272a37646a8b135f0","observation_id":"0ba443a4-4d1d-4abc-8cf9-9ee880b13f8e","resolution":{"observed_at":"2026-08-07T05:20:09.545935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.522505Z","title":"Multinomial logistic regression algorithm","venue":null,"work_id":"1bfcae52-d1df-4ba3-9639-45d7b93adace","year":1992},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.964421Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:9e11fdce9d4b69121493478861f190f273af9313cdbe900631d451535714d82b","observation_id":"c66b4f0d-bbe1-4c11-a621-024c54a3fb50","resolution":{"observed_at":"2026-08-07T05:20:09.527517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.506033Z","title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems","venue":null,"work_id":"5dd92ce2-bff0-4845-9d89-8de3a9da5686","year":2014},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.970696Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:bee525ea41864ccc1cfa33a21bb927baf59704cc3bdafa57ec126a840cbc0dd1","observation_id":"32b39f6d-2db2-4e7d-9c19-47321f20ebeb","resolution":{"observed_at":"2026-08-07T05:20:09.511357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.491063Z","title":"I., Csetnek, E","venue":null,"work_id":"ecb04ff1-054b-47a8-b85c-9fa25b12305b","year":2016},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.976484Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:cbe327821dffaa65be640e1fe5f2ebe1d6a5979e79c2cb1bd1e43ceeb12964a3","observation_id":"e35a98cd-0879-496b-a33a-e57a8ea00036","resolution":{"observed_at":"2026-08-07T05:20:09.495959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.474803Z","title":"Sparse and stable markowitz portfolios","venue":null,"work_id":"fd0371cb-8fcf-4546-8eab-62d2a2b95001","year":2009},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.981786Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:edad101dac987b1dc5ba54fdcd2fb84c0a8f9674eeb37e2ac9dfe0962847ca88","observation_id":"4f47c340-9d4f-4226-81b1-f4a19cf0356d","resolution":{"observed_at":"2026-08-07T05:20:09.479581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.459464Z","title":null,"venue":null,"work_id":"ef939bb6-933a-4aac-ba15-8e12faa78034","year":2015},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.987532Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:247a5e8dfaefff53089c7d5421b5feb2afa8bfd3aa8075a787c3ee85d2e52d10","observation_id":"89c6993c-d8c0-4926-a127-835ab26d7402","resolution":{"observed_at":"2026-08-07T05:20:09.464869Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.443963Z","title":"A zeroth-order block coordinate descent algorithm for huge-scale black-box optimization","venue":null,"work_id":"c5d4009f-9ba9-4c6e-85c4-6106844003ba","year":2021},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.993371Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:f002395dac1040d6d6d6d1c891327d0298730336d0d537ab57ff19dab51e2ea8","observation_id":"c04a3d6c-2613-4182-af01-6a41d33ad9e5","resolution":{"observed_at":"2026-08-07T05:20:09.448809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.424584Z","title":"Zeroth-order regularized optimization (zoro): Approximately sparse gradients and adaptive sampling","venue":null,"work_id":"6e93312f-123f-4a5c-afe0-1f5ff58ed9d4","year":2022},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:07.999527Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:5bf61190acfd4c7b629038c15c9cdc6d514cf1df25822f65415af26d9016b426","observation_id":"31e82235-f483-46d0-a5c7-06b983c278db","resolution":{"observed_at":"2026-08-07T05:20:09.431234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.409528Z","title":"and Lin, C.-J","venue":null,"work_id":"e2876197-2d39-4337-98d8-1f33c37352b3","year":2011},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.004870Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:61ce7784283cc426831565c781e3f6569d73779d9a75a1fad1c96ee9d4b1ba69","observation_id":"b1e92300-1991-437f-ae45-fdeed084d2f3","resolution":{"observed_at":"2026-08-07T05:20:09.414340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.08247","last_updated":"2022-09-28T05:04:16Z","snapshot_observed_at":"2026-07-06T13:53:17.867762Z","submitted_at":"2022-09-17T05:01:58Z","title":"Gradient Properties of Hard Thresholding Operator","version":2},"cited_work":{"arxiv_id":"2209.08247","doi":null,"metadata_source":"pith","pith_arxiv_id":"2209.08247","snapshot_observed_at":"2026-08-07T05:20:08.649426Z","title":"Gradient Properties of Hard Thresholding Operator","venue":"math.OC","work_id":"fb7ba27f-3fe1-4fb5-9c76-c827e1d0f9c6","year":2022},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.011164Z"},"links":{"cited_paper":"/paper/2209.08247","citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:bd118420c53e55adcd85f85ac470b172e9aa6cffc67f405de637654dfba43d14","observation_id":"c4c150a0-092c-4fe5-8d1b-df9570fb39aa","resolution":{"observed_at":"2026-08-07T05:20:08.658497Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.00799","last_updated":"2024-01-29T03:36:26Z","snapshot_observed_at":"2026-07-06T13:37:22.319940Z","submitted_at":"2022-08-01T12:32:14Z","title":"An interior proximal gradient method for nonconvex optimization","version":2},"cited_work":{"arxiv_id":"2208.00799","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.00799","snapshot_observed_at":"2026-08-07T05:20:08.617231Z","title":"An interior proximal gradient method for nonconvex optimization","venue":"math.OC","work_id":"197f6584-22c4-4078-8f00-e56c1aa2fde8","year":2022},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.016290Z"},"links":{"cited_paper":"/paper/2208.00799","citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:a10261fe27aaa0bc1c9938edea564778c6d50235d97703c64e4f705d85b3acdc","observation_id":"2701a8aa-cea1-49b5-b3ca-1a6d24fdccc2","resolution":{"observed_at":"2026-08-07T05:20:08.625460Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.394327Z","title":"Zeroth-order hard-thresholding: Gradient error vs","venue":null,"work_id":"952e7e03-cb59-471d-bd81-910041e83f76","year":2022},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.022751Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:232492e530aacae3a2bfe03ac6edcdf755fc119628ae154d75e079ff303eb97f","observation_id":"23b228bc-5677-4e3f-990b-00eb7f568f05","resolution":{"observed_at":"2026-08-07T05:20:09.399572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.379234Z","title":"J., and Uppal, R","venue":null,"work_id":"76358342-18c6-4bd1-85ff-05678b7a68a9","year":2009},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.028319Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:df40b443a2db43d87915e206843f67a415500e0a280bc340ec4b446418311944","observation_id":"d66e1c30-a2f3-41d3-8493-84cf0b885858","resolution":{"observed_at":"2026-08-07T05:20:09.383999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.363133Z","title":"and Rauhut, H","venue":null,"work_id":"23d05de1-ed9a-40d9-889c-c6de038270e9","year":2013},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.034133Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:d4f2917515868eb5fd5325bcb5921706417da41691b58f89bb2432ed68f1c1f8","observation_id":"2036b096-ac19-4f6d-ba0d-9d39c68a3ad6","resolution":{"observed_at":"2026-08-07T05:20:09.368734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.348739Z","title":"and Ha, W","venue":null,"work_id":"ef514486-20d9-405a-be0b-e7b7fea55e7d","year":2018},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.040137Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:f2ac3aa2331e10fcf7358a2e73d6550ae36122c325ada4c7cc166fa2df2c0282","observation_id":"aafacb93-9eb7-428f-b489-38df62440098","resolution":{"observed_at":"2026-08-07T05:20:09.353287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.334531Z","title":"Splitting methods with variable metric for kurdyka ojasiewicz functions and general convergence rates","venue":null,"work_id":"68a07e47-b977-4a8d-8045-8f2b6d697bdf","year":2014},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.046123Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:4aa759a46b6c6a326968e2da6b55f99a9e55053dd964a6930cbdd01e2169629b","observation_id":"e290c45e-7056-4117-bb68-83ee673b10cb","resolution":{"observed_at":"2026-08-07T05:20:09.339399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.319538Z","title":"Gradientless descent: High-dimensional zeroth-order optimization","venue":null,"work_id":"f86759d8-70bf-428b-a8a4-cf705e1eedf1","year":2019},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.053461Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:e39555d71bf5c2748e1ec0979153b4ce52f1ec0f56fcb0b7583c47b9d980c5af","observation_id":"dcdcfb3b-95f5-48b2-8f80-8ab0e6b57418","resolution":{"observed_at":"2026-08-07T05:20:09.324509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.303600Z","title":"K., Arablouei, R., and Werner, S","venue":null,"work_id":"56fb1e5d-1a75-4db8-ba30-b4dea893298d","year":2021},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.062577Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:d9bff08bce420abfa311ea0e75004b16c890c2efcfc217b016c94dfff748e86f","observation_id":"7ded8f2d-1e85-451e-87ed-c9a1993919cc","resolution":{"observed_at":"2026-08-07T05:20:09.308989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.287484Z","title":"Inexact proximal gradient methods for non-convex and non-smooth optimization","venue":null,"work_id":"389a7efa-6952-4ad8-960d-8a508b09e3f7","year":2018},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.071164Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:0762feb71e9b6814f13eebc8bd021bbd72b3eaf7adfc7a178c1d1b6376bfa9fb","observation_id":"d60b1f02-baa7-41b2-b063-c8aa2a30ad23","resolution":{"observed_at":"2026-08-07T05:20:09.293399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.271487Z","title":null,"venue":null,"work_id":"9babf643-9609-4bd5-9d12-a6327e91fc5a","year":2002},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.077387Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:fb673afb380404db97e25fd7ec99f89316a114d4a9d618d5fe42298ecec02966","observation_id":"358ad462-8619-4d2d-aa1e-4fdefead0b5c","resolution":{"observed_at":"2026-08-07T05:20:09.276468Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.249299Z","title":"On iterative hard thresholding methods for high-dimensional m-estimation","venue":null,"work_id":"6f5afb08-2c9d-41ab-92e7-e953a6981967","year":2014},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.083409Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:30d238446f8764b653f71c65c5e5f48ae1206492a70e270aabaee97e6094bc88","observation_id":"2ae99378-4bd9-4fe1-af85-cb8cddc7a8ec","resolution":{"observed_at":"2026-08-07T05:20:09.255378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1209.2434","last_updated":"2012-09-11T20:37:02Z","snapshot_observed_at":"2026-07-06T02:55:24.800852Z","submitted_at":"2012-09-11T20:37:02Z","title":"Query Complexity of Derivative-Free Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1209.2434","snapshot_observed_at":"2026-08-07T05:20:08.087898Z","title":"G., Nowak, R","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.087898Z"},"links":{"cited_paper":"/paper/1209.2434","citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:ed3b851cdc63765e274867b35a8dcbe3e47ba226d89bc70d5c38a81b3346220a","observation_id":"822deb38-d06e-4884-94bc-dbf76009875e","resolution":{"observed_at":"2026-08-07T05:20:08.087898Z","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-07T05:20:09.229840Z","title":"Sparse projections onto the simplex","venue":null,"work_id":"401d3610-6ccb-4a19-9b81-2fdb63adad4a","year":2013},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.093759Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:e4a79d95914c0a935ef9ac5eecd6b7d76c8730e4ce3bfa50e4246a60a27d2504","observation_id":"7f7cce79-c794-4df5-b084-af206780f17a","resolution":{"observed_at":"2026-08-07T05:20:09.235050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.212613Z","title":"and Lin, Z","venue":null,"work_id":"fabe2a61-2272-4d21-8f5a-8f875b0a3bb0","year":2015},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.099259Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:b1f8e8d6c5fbda1a22c26f7188f3f7b4245387e260bece493b406ad9ef8e78b4","observation_id":"a4ec99c3-18d0-4aed-a66f-ed7e29cb8890","resolution":{"observed_at":"2026-08-07T05:20:09.219062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1605.02711","last_updated":"2017-12-23T17:54:03Z","snapshot_observed_at":"2026-07-06T04:55:39.926609Z","submitted_at":"2016-05-09T19:44:17Z","title":"Nonconvex Sparse Learning via Stochastic Optimization with Progressive Variance Reduction","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.02711","snapshot_observed_at":"2026-08-07T05:20:08.104722Z","title":"Nonconvex sparse learning via stochastic optimization with progressive variance reduction","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.104722Z"},"links":{"cited_paper":"/paper/1605.02711","citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:2fcdaec97c61e901cc300adccb0467c32efeababb9650fc5b7c61052dca2e7c6","observation_id":"046b6d65-9e73-4461-bcc5-3a033a378b0c","resolution":{"observed_at":"2026-08-07T05:20:08.104722Z","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-07T05:20:09.193247Z","title":"and Foygel Barber, R","venue":null,"work_id":"be81569c-b453-412b-a801-00fb92920678","year":2020},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.110458Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:718528faeb6fadd24ebbdeb67809740357d731770413883bff0f822ebecee73b","observation_id":"9a707600-5194-4d3d-84d6-c38a8a86ca63","resolution":{"observed_at":"2026-08-07T05:20:09.199391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.11283","last_updated":"2022-02-07T03:55:28Z","snapshot_observed_at":"2026-08-09T20:58:21.412714Z","submitted_at":"2021-04-22T18:56:17Z","title":"A Dimension-Insensitive Algorithm for Stochastic Zeroth-Order Optimization","version":3},"cited_work":{"arxiv_id":"2104.11283","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.11283","snapshot_observed_at":"2026-08-07T05:20:08.508796Z","title":"A Dimension-Insensitive Algorithm for Stochastic Zeroth-Order Optimization","venue":"math.OC","work_id":"f0bb7040-16e4-4359-ae3b-9d484746a105","year":2021},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.119586Z"},"links":{"cited_paper":"/paper/2104.11283","citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:51e1c259c5364ce357610de4b198a1fda0cbf90b521d02cf2047b82a30ffc2f9","observation_id":"b043240d-7038-4a15-9d84-04a426899a54","resolution":{"observed_at":"2026-08-07T05:20:08.516623Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.10367","last_updated":"2018-06-07T17:02:19Z","snapshot_observed_at":"2026-08-02T03:28:22.443332Z","submitted_at":"2018-05-25T21:18:19Z","title":"Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.10367","snapshot_observed_at":"2026-08-07T05:20:08.125460Z","title":"Zeroth-order stochastic variance reduction for nonconvex optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.125460Z"},"links":{"cited_paper":"/paper/1805.10367","citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:ee80ff12032651b5de31e52c2af1aed0659e60cf2977ccb5f66a549dfac04fb4","observation_id":"d09ea88f-cbdb-4d83-96c4-bd67f5e2e796","resolution":{"observed_at":"2026-08-07T05:20:08.125460Z","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-07T05:20:09.170580Z","title":"O., and Varshney, P","venue":null,"work_id":"57f52b7c-17b5-436d-a612-a848de202f43","year":2020},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.130924Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:03ac3f744014833d83763a8799813fcad9ed10a8b3503e867edfa0b802e14c2f","observation_id":"25abb214-8b9e-4870-b4ef-f9fcae06c9aa","resolution":{"observed_at":"2026-08-07T05:20:09.176470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.153383Z","title":"and Wainwright, M","venue":null,"work_id":"61b4ec37-8f5d-4abf-9b05-86f74ff34802","year":2013},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.137067Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:8eb017c3559cc41bac8ab936d9a22fed45c919e793e0baecc142c3f9e19a7608","observation_id":"6980e940-5ceb-4261-b1a0-67156132c7ed","resolution":{"observed_at":"2026-08-07T05:20:09.158047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1509.08581","last_updated":"2015-11-29T18:47:57Z","snapshot_observed_at":"2026-07-06T04:31:21.604999Z","submitted_at":"2015-09-29T03:39:01Z","title":"Optimization over Sparse Symmetric Sets via a Nonmonotone Projected Gradient Method","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1509.08581","snapshot_observed_at":"2026-08-07T05:20:08.142408Z","title":"Optimization over sparse symmetric sets via a nonmonotone projected gradient method","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.142408Z"},"links":{"cited_paper":"/paper/1509.08581","citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:990706afbf78b2f52520ed903bd1a95358ce34f3903b268bc611a5cc51e2f7bb","observation_id":"8830cce9-1edb-4754-9cfa-4c6635b63901","resolution":{"observed_at":"2026-08-07T05:20:08.142408Z","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-07T05:20:09.136527Z","title":null,"venue":null,"work_id":"8aed7e66-d9f4-42c0-aa70-2c5f3b02b230","year":2023},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.148670Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:2d296b729634978fd3cad9d71392153ddaaabf3cc9dbdf44d34493fdf4e869fe","observation_id":"7d047ddc-7cf2-4006-b81a-f1a5742dc734","resolution":{"observed_at":"2026-08-07T05:20:09.141636Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.118206Z","title":"Random reshuffling: Simple analysis with vast improvements","venue":null,"work_id":"18ca9175-0221-4e8f-bba6-ef0236348abf","year":2020},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.154120Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:fe40cac8e76f1230f2d6ba7caae7920edce7cf94254a51d40b3b14b9dcd7b727","observation_id":"8ce32611-5698-4119-90fd-3f8db5cfdea4","resolution":{"observed_at":"2026-08-07T05:20:09.124019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.102008Z","title":"J., and Ravikumar, P","venue":null,"work_id":"bc01bfbd-554a-4306-9d99-572c93b8846b","year":2009},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.161230Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:4f630af8a636bf185079c6437404348d989fca86aca0f507caeb4118e433d9c3","observation_id":"7968aeb9-c125-48a0-8ab3-578df0b9456a","resolution":{"observed_at":"2026-08-07T05:20:09.106554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.081872Z","title":"Introductory lectures on convex optimization: A basic course, volume 87","venue":null,"work_id":"01db5854-aa32-462e-9689-a3f38e39d7f3","year":2003},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.168236Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:e1055602ae3d242bafce19d312286f12768f874821772c942cb6d562543fec40","observation_id":"14d1cad6-5b5e-491d-9108-c58cb41b2206","resolution":{"observed_at":"2026-08-07T05:20:09.088887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.062119Z","title":"and Spokoiny, V","venue":null,"work_id":"3d99cdaa-53e3-45ba-b4fd-bc8810534909","year":2017},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.173483Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:82ad15bb287bec1b417c3c3d3a9940aad0d17130d22948f29606727a6b2428e8","observation_id":"5145af16-ecb2-4643-8658-dddd49fad686","resolution":{"observed_at":"2026-08-07T05:20:09.068830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.041081Z","title":null,"venue":null,"work_id":"9e89d7a8-4fb8-4b21-b0ea-0094c1e9db59","year":2018},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.179262Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:0fdb70266f8f03289d0b05db4e02fd3e5687aba0fbeb484f3512880f81489fc4","observation_id":"3f24aa86-579a-4af6-902f-55284af0ae64","resolution":{"observed_at":"2026-08-07T05:20:09.047050Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:09.020396Z","title":"Linear convergence of stochastic iterative greedy algorithms with sparse constraints","venue":null,"work_id":"d321966f-e6a1-4eee-963e-dc0a353d9353","year":2017},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.191270Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:ec2ef41a1f650b48ccbe7ddb4a74906cdea6ea763cd3b16b4866d5b03ad3a383","observation_id":"f5bc737d-416a-4528-9ace-42672eef7861","resolution":{"observed_at":"2026-08-07T05:20:09.026397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.13944","last_updated":"2024-07-15T05:27:38Z","snapshot_observed_at":"2026-08-09T04:21:52.102750Z","submitted_at":"2024-01-25T04:56:55Z","title":"Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization","version":2},"cited_work":{"arxiv_id":"2401.13944","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.13944","snapshot_observed_at":"2026-08-07T05:20:08.420167Z","title":"Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization","venue":"math.OC","work_id":"9b2fd474-8ae8-4d9b-8dc9-46d52d039ff6","year":2024},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.196992Z"},"links":{"cited_paper":"/paper/2401.13944","citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:e6249bde58273e0494f0900521811c498b9d9ae88e9783ceab5f504e2b5e667a","observation_id":"813db31e-38fd-488a-80a5-747b34011092","resolution":{"observed_at":"2026-08-07T05:20:08.428225Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:08.996417Z","title":"A convergent iterative hard thresholding for nonnegative sparsity optimization","venue":null,"work_id":"8b979342-8bb5-4174-881f-b8a789d45e5a","year":2017},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.202952Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:cb5cf7ced68cc60644fd304ae5b5523f00732e815b83c5d706ece9c50d0b3278","observation_id":"07d86d28-ac17-430b-bc54-3e781a548929","resolution":{"observed_at":"2026-08-07T05:20:09.002944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:08.973042Z","title":"Ac/dc: Alternating compressed/decompressed training of deep neural networks","venue":null,"work_id":"30435e9d-ae47-420d-9f14-c7a2f82411b4","year":2021},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.208712Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:56043a7195d22e31d19f0644654fcf89e4f9b213df87b6a571058f74c6205db6","observation_id":"8985c376-aae9-4887-ba77-d5d64a22f2af","resolution":{"observed_at":"2026-08-07T05:20:08.981390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:08.944928Z","title":"and Li, P","venue":null,"work_id":"97bd3560-f4a7-401a-a8bf-8337c20736fb","year":2017},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.215989Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:5f5cf092fcc806adaf8ad5c326633cf2ba93017136bdb6a9521330bc1889d897","observation_id":"30b860d6-33a0-4022-a29b-b0ce11e689c8","resolution":{"observed_at":"2026-08-07T05:20:08.952430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.04458","last_updated":"2020-11-10T11:11:28Z","snapshot_observed_at":"2026-08-09T21:24:50.078064Z","submitted_at":"2018-06-12T12:16:54Z","title":"Sparse Stochastic Zeroth-Order Optimization with an Application to Bandit Structured Prediction","version":3},"cited_work":{"arxiv_id":"1806.04458","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.04458","snapshot_observed_at":"2026-08-07T05:20:08.387876Z","title":"Sparse Stochastic Zeroth-Order Optimization with an Application to Bandit Structured Prediction","venue":"stat.ML","work_id":"b6f6bce9-fbe2-4938-9a9f-b14e5ac55299","year":2018},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.222150Z"},"links":{"cited_paper":"/paper/1806.04458","citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:f5f6d04bc31b191fd464098e9b9b27dacf8cfe7579b4eee0274dc0576453854b","observation_id":"54626963-4b6a-4282-8981-47fe1d324b0a","resolution":{"observed_at":"2026-08-07T05:20:08.394541Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:08.922500Z","title":"Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios","venue":null,"work_id":"42084e8c-2b29-48fe-a29c-dfaf5fcb78c9","year":2013},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.227559Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:f029c3534db00fa4786b6df3a5f9fe669b7fdb602265a1c12694f5f2ff0aca07","observation_id":"e32cf2f1-0259-4564-9865-7b014e7f2eb5","resolution":{"observed_at":"2026-08-07T05:20:08.929557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:08.899184Z","title":"J., Jordan, M","venue":null,"work_id":"e5f99d2a-19c8-41f8-b28b-0716e8b9c5c2","year":2008},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.233512Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:e38d47a51c35aa9ba4ac2305955aa4672cc9ac0fb79af82a5e4c7125e87b0fed","observation_id":"f5ec4cb8-7427-43e0-ba1b-c7690e1bca72","resolution":{"observed_at":"2026-08-07T05:20:08.904735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:08.876897Z","title":"Stochastic zeroth-order optimization in high dimensions","venue":null,"work_id":"7d078b20-e4a7-40a1-af09-aad652efb326","year":2018},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.239431Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:754d4ecc6dfbf92f29e9228c1aacfb91d5deb22170706518432483cadd7af5cd","observation_id":"ad39b8d6-d067-4318-8627-87c19d7e1266","resolution":{"observed_at":"2026-08-07T05:20:08.882888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:08.850906Z","title":"Non-asymptotic analysis of stochastic methods for non-smooth non-convex regularized problems","venue":null,"work_id":"1fa6426d-e8eb-490a-a4ba-c22f80ab04f0","year":2019},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.244544Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:63f9c8427b5b91592c6423974df660ba35ee925b572c8f02fd5ab9bb50b6c0ed","observation_id":"248ef0ed-a8fa-4d54-9815-85746cd90dcd","resolution":{"observed_at":"2026-08-07T05:20:08.858590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:08.832386Z","title":"Stochastic optimization for dc functions and non-smooth non-convex regularizers with non-asymptotic convergence","venue":null,"work_id":"2c36cdd2-12a2-4f37-9c99-09c48838ac6a","year":2019},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.249936Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:6761987c31096e900f0d9479be9f9111eec7f4276ccacdcf832556cb407398fb","observation_id":"1f837ae0-de56-4931-9547-17227b1648f6","resolution":{"observed_at":"2026-08-07T05:20:08.838480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.10499","last_updated":"2024-09-25T16:41:55Z","snapshot_observed_at":"2026-07-06T15:18:03.563300Z","submitted_at":"2023-04-20T17:39:24Z","title":"Projective Proximal Gradient Descent for A Class of Nonconvex Nonsmooth Optimization Problems: Fast Convergence Without Kurdyka-Lojasiewicz (KL) Property","version":2},"cited_work":{"arxiv_id":"2304.10499","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.10499","snapshot_observed_at":"2026-08-07T05:20:08.348273Z","title":"Projective Proximal Gradient Descent for A Class of Nonconvex Nonsmooth Optimization Problems: Fast Convergence Without Kurdyka-Lojasiewicz (KL) Property","venue":"math.OC","work_id":"3d51c906-1337-42a1-8e37-e5dcbfb5574a","year":2023},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.256597Z"},"links":{"cited_paper":"/paper/2304.10499","citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:c75949e04180e580aef5fc559b4be18be1f7d0af8e978f1552c2e9d796a1340e","observation_id":"32b590f8-870c-47c1-84c3-a28b655777df","resolution":{"observed_at":"2026-08-07T05:20:08.357050Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:08.814410Z","title":"and Yu, J","venue":null,"work_id":"b533a25e-88a6-41bd-a597-cfd78caed6c0","year":2020},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.262861Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:6a1785e6a80bdcd1056c648d4d68ad1ea4474dc5e762bd0fb7b95899f0ca72ff","observation_id":"8280a537-813a-4103-857c-f50e95942b8b","resolution":{"observed_at":"2026-08-07T05:20:08.819173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:08.793014Z","title":"Gradient hard thresholding pursuit","venue":null,"work_id":"717ba9ff-8836-40df-b81d-06752fa53fd9","year":2017},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.269485Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:07c4f4c781cf15c6f1ce4310c4780faec4ebf419b2036c07591de3081d6017fc","observation_id":"d7a62435-e6db-405b-a030-b4d970f4085f","resolution":{"observed_at":"2026-08-07T05:20:08.801318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:08.764633Z","title":"Zeroth-order optimization with weak dimension dependency","venue":null,"work_id":"c86ed398-2b0c-4eb4-a877-69c752c36b37","year":2023},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.274920Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:90e2451841b05d4d4333712307995fc2b33feab988d3e0338a5f6e28bcf6aeb4","observation_id":"229a28e6-f140-4682-b0f0-6363f15d27f0","resolution":{"observed_at":"2026-08-07T05:20:08.775655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:08.733611Z","title":"Desirable companion for vertical federated learning: New zeroth-order gradient based algorithm","venue":null,"work_id":"a7b1b4ff-3c75-44f0-9a14-ee432d3fffb7","year":2021},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.281690Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:396c57d2d7de8680244e28a3c8ba54a21cdb11235a9800f3d9e7624cbcd8c3e3","observation_id":"84bbadba-206b-437d-b4c0-77d854bac7b3","resolution":{"observed_at":"2026-08-07T05:20:08.749895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:08.713226Z","title":"Efficient stochastic gradient hard thresholding","venue":null,"work_id":"182aaeaf-a6ad-4d9f-965f-99f4363b92cd","year":2018},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.287311Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:83821739557dd30798308a81fddcfc38030053b474eae762e7bf878b19a14c91","observation_id":"14d0337e-66a2-4899-8b85-b53943ceb51c","resolution":{"observed_at":"2026-08-07T05:20:08.719013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:20:08.293574Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.293574Z"},"links":{"citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:be969556601f1c5c356082cf9f894bc72d27d8904d16d0f26131981e559f0d24","observation_id":"2b7cdeee-dec9-4764-95da-9ffcd3412fe3","resolution":{"observed_at":"2026-08-07T05:20:08.293574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees"},"reference_resolution":{"displayed":64,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":6,"verified_fuzzy":46},"total_outbound_references":64},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 64 of 64 outbound references and 0 inbound Pith citation observations for arXiv:2506.08558."}