{"as_of":"2026-08-10T19:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5d68b6a7a03d86ff8a355b5d483be4522310e834b7daf29ae6805bae81b7a521","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:47:16.002675Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T21:49:06.576081Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T19:56:11.610637Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"cited_work":{"arxiv_id":"2506.07290","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.07290","snapshot_observed_at":"2026-07-01T19:56:11.610637Z","title":"Stochastic moving an- chor algorithms and a Popov’s scheme with moving anchor.arXiv preprint arXiv:2506.07290,","venue":null,"work_id":"824f5956-9fce-4dea-8dc0-759d25dd6f49","year":null},"citing_paper":{"arxiv_id":"2605.30905","last_updated":"2026-05-29T06:41:23Z","snapshot_observed_at":"2026-08-02T14:00:05.600925Z","submitted_at":"2026-05-29T06:41:23Z","title":"A Unifying View of Anchoring via Operator-Side Tikhonov Regularization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T21:49:06.576081Z"},"links":{"cited_paper":"/paper/2506.07290","citing_paper":"/paper/2605.30905"},"observation_digest":"sha256:6ebe51c072939c0b8423cda389f49df3629775d33900df892ecd63184ea66741","observation_id":"099e1cfc-3147-47f6-bd7d-531e2ad45319","resolution":{"observed_at":"2026-07-01T19:56:11.612371Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.07290/citation-record","integrity":"/paper/2506.07290/integrity","json":"/paper/2506.07290/citation-record.json","paper":"/paper/2506.07290"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.12359","last_updated":"2025-06-01T16:32:24Z","snapshot_observed_at":"2026-08-05T14:30:10.114589Z","submitted_at":"2023-08-23T18:04:18Z","title":"Moving Anchor Extragradient Methods For Smooth Structured Minimax Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12359","snapshot_observed_at":"2026-08-07T05:47:13.607909Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:13.607909Z"},"links":{"cited_paper":"/paper/2308.12359","citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:47a5a206fd51a8e079f8338caf1912b498fb434b06e5c0810b3f240a85d13593","observation_id":"1b69cb3a-112f-4ca9-a21d-04666a330e21","resolution":{"observed_at":"2026-08-07T05:47:13.607909Z","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:47:21.350825Z","title":"2863–2873","venue":null,"work_id":"e3cc8ce7-fb74-43ea-9f1f-72797e8cd744","year":2020},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:13.643826Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:c5027e7a12bb03b4a65ead0731be365dcdce08a82dd4d46c3c8f27256dc2ebf9","observation_id":"b1aea171-8402-4920-9e79-4ad470ce1a33","resolution":{"observed_at":"2026-08-07T05:47:21.423134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:21.199897Z","title":"2482–2508","venue":null,"work_id":"9c02eb61-2fbc-4255-83bb-d5188874a2c4","year":2023},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:13.681073Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:f81015b38f38ed5b8bf7a14037b760f6c3ff3ddeb76d0bcc371fada1fa019cca","observation_id":"f363d02e-85ae-4335-a995-ca555030ed8f","resolution":{"observed_at":"2026-08-07T05:47:21.276845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:21.051583Z","title":null,"venue":null,"work_id":"f4480804-2a8f-41b5-8d81-2647ee89db12","year":2022},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:13.728863Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:334fdeb97b4ebd9e1e59742bfc2a9eef11baa55e5fbebfe74349ef5d1495d434","observation_id":"862f7e60-7839-41a8-8d3e-529d05e730f3","resolution":{"observed_at":"2026-08-07T05:47:21.113414Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:20.772653Z","title":null,"venue":null,"work_id":"0094d3fb-6213-418a-9fa8-4b4997f5efaa","year":2019},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:13.784351Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:ef089c40554e951fa11436dc8f0ce7f96c1718fcdcbffe37b936af7c8546e673","observation_id":"67988389-632f-4c7a-b4a0-efa9c523cf3a","resolution":{"observed_at":"2026-08-07T05:47:20.888737Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:13.820420Z","title":"4, 1779–1814","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:13.820420Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:0687161657cd4af04bec10f9aac85485fccf4995b50582def67d02279fed3ed4","observation_id":"452a66be-4590-462d-94b7-04fe6865d605","resolution":{"observed_at":"2026-08-07T05:47:13.820420Z","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:47:20.472948Z","title":"2, 1221–1248","venue":null,"work_id":"0a5df68f-340b-41e1-8627-ee6eaedff1ee","year":2015},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:13.870719Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:ac181ba951dcda0dd2eacf2097051533aa2049c0036e4b053b8fc502682c093e","observation_id":"3123e441-7257-4bbd-b9bf-e19db71dbff7","resolution":{"observed_at":"2026-08-07T05:47:20.593536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:20.086404Z","title":null,"venue":null,"work_id":"06c931d8-8b72-4295-a106-fd84b1291939","year":2017},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:13.909892Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:b45c85763fb6c3bb9b0d31806c4243e02f62c6d77c8ed096a30453edf6cba324","observation_id":"11e31141-0936-47ac-8fab-e7c5f7d71ad7","resolution":{"observed_at":"2026-08-07T05:47:20.318693Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:19.901401Z","title":"1428– 1451","venue":null,"work_id":"6d793a37-a609-4ba4-82c7-1bcc482497e6","year":2020},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:13.945497Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:e4babb95c51fcc395bd8d96326f6b436c709d6f5332ac9a0ab6d5638c4ac6682","observation_id":"3c67959f-2430-4e70-b334-634c6d045a43","resolution":{"observed_at":"2026-08-07T05:47:19.965043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:19.749014Z","title":"1049– 1058","venue":null,"work_id":"5ddd2f80-ee1e-4a42-bc17-236420ca7b45","year":2017},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:13.981039Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:0914092e2cb19ca2377610c0e76fe0b81122bb7cbf1e5b0d192e6dc3a083c050","observation_id":"7ed9c458-c5f3-46c2-bdde-b7aee0421303","resolution":{"observed_at":"2026-08-07T05:47:19.793956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:19.624821Z","title":null,"venue":null,"work_id":"c8ea7d00-bd6e-4997-a55b-21478e0cead4","year":2020},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.040885Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:edb93fbf7d37e365531b0388a666bd492dfc3bc30a02c01f5168cf88a16c11ad","observation_id":"3ff3fa36-11dc-42ed-894d-24c02d1ffaf7","resolution":{"observed_at":"2026-08-07T05:47:19.683128Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:14.111233Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.111233Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:6c28cb20dbfdcfdf211ec646a997ed97b54b805d770da917e31a5819b5dc5363","observation_id":"5de2dff5-928b-4115-a9ad-38379962d9b2","resolution":{"observed_at":"2026-08-07T05:47:14.111233Z","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:47:19.467828Z","title":null,"venue":null,"work_id":"d56fb02b-b06d-40a3-a030-9a2be78ec7e7","year":2014},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.141706Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:2fdc2e13dd325421315518002e29b71c18f57ec8ec5a11bc56f3e585a3c09b64","observation_id":"f20f2f4e-9b51-4bb2-ad2c-98340bb2d951","resolution":{"observed_at":"2026-08-07T05:47:19.539680Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:19.329690Z","title":"7865–7901","venue":null,"work_id":"37dd6a22-c428-4221-a507-19a1b1076747","year":2022},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.198982Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:b133e6bdb1d4900a1e3af118239a0fc1f37a76fc69af4e0a4a78a9a084b83cd5","observation_id":"de860088-78c2-4984-83c3-96fddea1ef09","resolution":{"observed_at":"2026-08-07T05:47:19.396797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:19.187808Z","title":"11614–11641","venue":null,"work_id":"b9dab0ef-cd42-4731-af01-9d22726e11b5","year":2023},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.264036Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:b7b412024ed865ea8e2fcf639609f6db293534845a7ac4cc156b6ac43bb473f6","observation_id":"442213ec-5d2a-4e4e-a16c-4cc735732582","resolution":{"observed_at":"2026-08-07T05:47:19.274635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:19.041510Z","title":"6, 957–961","venue":null,"work_id":"cd16038d-d762-495c-9608-c435d005a7b8","year":1967},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.292448Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:3e2129ddec6c946f41322b05dc418f4a90561138368213fa7b1df52f4f726fe0","observation_id":"aba76785-e6b7-4e15-becc-297bd84b3791","resolution":{"observed_at":"2026-08-07T05:47:19.097094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:18.884561Z","title":"Wallach, H","venue":null,"work_id":"3beef31f-9bf5-4922-a8b9-5c05b49b0e87","year":2019},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.351581Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:4847bff25f399200f5e5e16a1f09ec80b4b38cd0999e6e8f813723d70fb7eda2","observation_id":"4cc694fd-66e4-45af-9ce3-f97403da1a97","resolution":{"observed_at":"2026-08-07T05:47:18.966110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:18.698557Z","title":null,"venue":null,"work_id":"1c6fdab7-2792-4d57-8b3d-7b9db8f72fea","year":1976},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.407738Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:6c31dee4924c7afaf29520b97e8e264035c2095f98f0342fe238db9bbba9f9ee","observation_id":"3a755f75-38c1-4bf1-a16a-f6ea474c6d0a","resolution":{"observed_at":"2026-08-07T05:47:18.753118Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:18.557101Z","title":"Ryu,Accelerating value iteration with anchoring, Thirty-seventh Conference on Neural Information Processing Systems, 2023","venue":null,"work_id":"329ed775-67ea-4cbb-8bb3-2872a3e1dd29","year":2023},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.451422Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:9e9ba23e38856dc1258382ee4064c67953ba5a338d5be36451668853f301dac7","observation_id":"edf239ba-90d4-421f-859e-4cb1c3756175","resolution":{"observed_at":"2026-08-07T05:47:18.629438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:18.387433Z","title":null,"venue":null,"work_id":"ca37c68d-31c0-461d-9c2e-15cabf1395d2","year":2021},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.515372Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:d4b5e6b5c2cc7c08e6cab0fecf83a93bee10bd8ea6fee135d58521212b022a25","observation_id":"d4e8feed-ce5e-4427-875d-891b05bb1220","resolution":{"observed_at":"2026-08-07T05:47:18.503425Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.15042","last_updated":"2022-06-09T12:58:31Z","snapshot_observed_at":"2026-07-06T11:14:24.508408Z","submitted_at":"2021-05-31T15:28:04Z","title":"Semi-Anchored Multi-Step Gradient Descent Ascent Method for Structured Nonconvex-Nonconcave Composite Minimax Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.15042","snapshot_observed_at":"2026-08-07T05:47:14.565066Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.565066Z"},"links":{"cited_paper":"/paper/2105.15042","citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:97771e87b1cb75360931d9ac184f69c3fd263b0948f99d17bf41352a00da6757","observation_id":"e19fe064-fbdb-4c6d-896c-3544e368b4f0","resolution":{"observed_at":"2026-08-07T05:47:14.565066Z","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:47:18.244389Z","title":"9793–9826","venue":null,"work_id":"6400743f-0de8-492b-bbf5-6f7153ec65d2","year":2022},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.611866Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:3c7c3fec8ca341ea4298cb16ddce50cf63155b6b579527908e1c07393187f90f","observation_id":"894c2007-2079-4656-b11f-46a03280087b","resolution":{"observed_at":"2026-08-07T05:47:18.308552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:18.050415Z","title":"2, 405–418","venue":null,"work_id":"d7f6b809-48e1-4bac-a609-cd422bbcd71e","year":2021},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.679864Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:635e7a41f89e05e7a78f56583becfeacc2e688cedc7b087c79605bda8e381605","observation_id":"579296c4-2482-49b9-b677-c233b55a5a52","resolution":{"observed_at":"2026-08-07T05:47:18.142151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.11940","last_updated":"2020-12-25T02:17:20Z","snapshot_observed_at":"2026-07-06T08:47:04.896612Z","submitted_at":"2019-12-26T22:10:10Z","title":"Towards Better Understanding of Adaptive Gradient Algorithms in Generative Adversarial Nets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.11940","snapshot_observed_at":"2026-08-07T05:47:14.769655Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.769655Z"},"links":{"cited_paper":"/paper/1912.11940","citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:68c79eb84081c482909b9c4a63d83ba95ff3810dc34abbe6f1044a973a8ca827","observation_id":"0f4fedf4-c9c9-48c7-98fb-1eacf8313006","resolution":{"observed_at":"2026-08-07T05:47:14.769655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.06083","last_updated":"2019-09-04T18:53:10Z","snapshot_observed_at":"2026-08-07T14:27:46.872660Z","submitted_at":"2017-06-19T17:53:11Z","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.06083","snapshot_observed_at":"2026-08-07T05:47:14.816406Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.816406Z"},"links":{"cited_paper":"/paper/1706.06083","citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:cafd235dd24d2072d97353a034372f818008a60cc1a79c4c0f59f668d36b428a","observation_id":"7aeb9b34-8e72-4233-963f-fe1bc3b7b1a1","resolution":{"observed_at":"2026-08-07T05:47:14.816406Z","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:47:17.911474Z","title":"Malitsky,Projected reflected gradient methods for monotone variational inequalities, SIAM Journal on Optimization25(2015), no","venue":null,"work_id":"7e68ffdb-6809-4b13-9515-eb428674146b","year":2015},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:14.957857Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:944eb8b7f3a26b1db1056441ca5fa97efb1eab9787cf9fa2f605f5767cbde310","observation_id":"2df1b0ac-b6ce-4ee8-b324-ac50a2489103","resolution":{"observed_at":"2026-08-07T05:47:17.978543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:17.722606Z","title":"269, 1983, pp","venue":null,"work_id":"12f8ef9c-e998-428b-ac7b-9c388abd43a6","year":1983},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:15.063251Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:f0b7f9fe8baf2d8f54ee74bed51b0cb1a5f289b21ae985792e3786dce5f3c7d1","observation_id":"b8791e93-18f3-4997-bfa5-f74302f77b24","resolution":{"observed_at":"2026-08-07T05:47:17.830559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:17.555495Z","title":null,"venue":null,"work_id":"74ea7fd4-45f2-47c0-93b8-b908ac92be71","year":2024},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:15.071783Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:d2548a5d3bcdca8bf08361dacb48a9604ac9ed286d538f157b0079cae40014bf","observation_id":"48324347-69db-40ee-8fe8-6ff7a75e02d5","resolution":{"observed_at":"2026-08-07T05:47:17.616527Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:17.363316Z","title":null,"venue":null,"work_id":"6b7b9e9b-6692-4652-b42e-b50b6142b95d","year":1980},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:15.129832Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:e775f037badfff975f1936bc0cf9edd97b241ec9084196aeee9ff108e1cac798","observation_id":"05d4523c-7138-40e6-84ee-aff1b1fd554f","resolution":{"observed_at":"2026-08-07T05:47:17.453106Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:17.226990Z","title":null,"venue":null,"work_id":"ac824ed1-cc22-40d0-8608-0e6867e793cc","year":2019},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:15.258343Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:943c027c98c1a8bd483f9de6cbaeddeb176c7fadcce8209b0311c0e00a19ed22","observation_id":"2cdf95a0-2b52-4e82-87d9-5e15c26dc27f","resolution":{"observed_at":"2026-08-07T05:47:17.288700Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:17.098111Z","title":"Suh, Jisun Park, and Ernest K","venue":null,"work_id":"6f710c5b-1607-4115-b377-50ac9f44363e","year":2023},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:15.345932Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:ccb95e86ee80cbb3405afb7e7fc9edcf89dad8555203b9fdad5a0ec4db43e1d6","observation_id":"b843d300-de92-4f3b-a881-e233da56e78f","resolution":{"observed_at":"2026-08-07T05:47:17.150525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.04869","last_updated":"2026-04-15T13:06:22Z","snapshot_observed_at":"2026-08-02T23:44:37.601446Z","submitted_at":"2022-03-09T16:45:10Z","title":"From Halpern's Fixed-Point Iterations to Nesterov's Accelerated Interpretations for Root-Finding Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.04869","snapshot_observed_at":"2026-08-07T05:47:15.451311Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:15.451311Z"},"links":{"cited_paper":"/paper/2203.04869","citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:fe64eb5c482bc312d937538f87a6a189adbc112493e44d0bd12942a56b6ffcc2","observation_id":"309b1262-c5ae-4751-a865-2f11df8b39b3","resolution":{"observed_at":"2026-08-07T05:47:15.451311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.08150","last_updated":"2021-12-06T22:01:02Z","snapshot_observed_at":"2026-08-10T16:55:34.203350Z","submitted_at":"2021-10-15T15:26:32Z","title":"Halpern-Type Accelerated and Splitting Algorithms For Monotone Inclusions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.08150","snapshot_observed_at":"2026-08-07T05:47:15.538009Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:15.538009Z"},"links":{"cited_paper":"/paper/2110.08150","citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:81d7ec0e03498297c88e7a86b2c16c4f41ac9746de8a2fc6f0cef60f72b313a4","observation_id":"2964f29e-8679-4705-acd1-7aa58ecb74b1","resolution":{"observed_at":"2026-08-07T05:47:15.538009Z","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:47:16.930587Z","title":"3, 1943–1967","venue":null,"work_id":"9df0c509-cc62-434c-97b0-d6316ef6ab54","year":2023},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:15.603796Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:13d644905cff0328cadb98845798ca6e3a9f5b12c134ad4b5b65d33dd857c355","observation_id":"61a41a9a-a7dc-47b1-856f-0952415afd23","resolution":{"observed_at":"2026-08-07T05:47:16.992835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:16.799102Z","title":"Suh, and Ernest K","venue":null,"work_id":"ab36fd20-7b85-444e-8b72-8f8c6b3341d7","year":2024},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:15.746247Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:5c5aca304c8dc66b4555b52e32d0e35bc07f1615e0230506cd6aeb11ec056c9a","observation_id":"a66844aa-605f-4814-a495-bc16f8ddc832","resolution":{"observed_at":"2026-08-07T05:47:16.879882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:16.677435Z","title":null,"venue":null,"work_id":"9390e7ce-0229-4a7b-8082-2f5fa37be87a","year":2021},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:15.848320Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:e69404e82c824eb5cc2110a2a56ac2bc1184596da3b2de9f88ebd99085850f98","observation_id":"755f9915-1b6d-4ec7-8ac8-0a17b46cfd52","resolution":{"observed_at":"2026-08-07T05:47:16.705825Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:16.567862Z","title":"Ryu,Accelerated minimax algorithms flock together, SIAM Journal on Op- timization35(2025), no","venue":null,"work_id":"f8f993d7-a13e-4850-8a58-aad311288074","year":2025},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:15.913632Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:2ce1263610b5e9073f954b6eba50ee45ccf3ff42afbaecc9d1aa323d5fa62baa","observation_id":"2b2d4707-f6ee-4202-9482-ac046d99ab28","resolution":{"observed_at":"2026-08-07T05:47:16.631756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:47:16.435692Z","title":null,"venue":null,"work_id":"bcf305fe-d1a0-4d0a-b356-ed71ce7706a3","year":2023},"citing_paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T05:47:16.002675Z"},"links":{"citing_paper":"/paper/2506.07290"},"observation_digest":"sha256:999254c6f59433f211a13904cc8fa3d14288832175f7a9df6dbb9158444b8a56","observation_id":"cb54b202-0617-437b-bb97-4f9a47dc2a04","resolution":{"observed_at":"2026-08-07T05:47:16.507191Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.07290","last_updated":"2025-06-08T21:28:45Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-08T08:59:22.555330Z","submitted_at":"2025-06-08T21:28:45Z","title":"Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":18},"total_outbound_references":38},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 1 inbound Pith citation observation for arXiv:2506.07290."}