{"as_of":"2026-08-09T23:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fdeb43a12dc9648a3dfeef3872417e41e5538f8990f4bee4f9f14083d2b02eb5","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T21:22:14.195148Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T14:21:43.409685Z","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-03T13:38:19.160441Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"cited_work":{"arxiv_id":"2509.08161","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.08161","snapshot_observed_at":"2026-07-03T13:38:19.160441Z","title":"Finding a multiple follower stackelberg equilibrium: A fully first-order method","venue":null,"work_id":"a61391c0-eb83-4dc0-8c34-3400d02e0d6f","year":2025},"citing_paper":{"arxiv_id":"2604.04394","last_updated":"2026-04-06T03:48:42Z","snapshot_observed_at":"2026-08-02T09:04:25.615806Z","submitted_at":"2026-04-06T03:48:42Z","title":"Finite-Time Analysis of Q-Value Iteration for General-Sum Stackelberg Games","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T19:49:31.844061Z"},"links":{"cited_paper":"/paper/2509.08161","citing_paper":"/paper/2604.04394"},"observation_digest":"sha256:aaa6023d82adeb4765eaa8a4337f0c48b9717a96aeee493987135ff2901b312b","observation_id":"85af0787-279b-45df-8279-ad77cb0ca59c","resolution":{"observed_at":"2026-05-10T22:30:50.049355Z","resolver_source":"arxiv_id","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":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"cited_work":{"arxiv_id":"2509.08161","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.08161","snapshot_observed_at":"2026-07-03T13:38:19.160441Z","title":"Finding a multiple follower stackelberg equilibrium: A fully first-order method","venue":null,"work_id":"a61391c0-eb83-4dc0-8c34-3400d02e0d6f","year":2025},"citing_paper":{"arxiv_id":"2606.10226","last_updated":"2026-06-08T22:34:31Z","snapshot_observed_at":"2026-08-07T16:34:03.420248Z","submitted_at":"2026-06-08T22:34:31Z","title":"Continuity of VaR and Continuous Differentiability of CVaR under Decision-Dependent Losses","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-06-27T14:21:43.409685Z"},"links":{"cited_paper":"/paper/2509.08161","citing_paper":"/paper/2606.10226"},"observation_digest":"sha256:6a6179d6df2336d1ad7b292e5d76d388960d303d2f6c16b3d1a856cc7778a17d","observation_id":"f7e64261-61c4-4cdd-a8f1-78c602250fe3","resolution":{"observed_at":"2026-07-03T03:57:38.626266Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"cited_work":{"arxiv_id":"2509.08161","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.08161","snapshot_observed_at":"2026-07-03T13:38:19.160441Z","title":"Finding a multiple follower stackelberg equilibrium: A fully first-order method","venue":null,"work_id":"a61391c0-eb83-4dc0-8c34-3400d02e0d6f","year":2025},"citing_paper":{"arxiv_id":"2606.12167","last_updated":"2026-07-23T15:22:51Z","snapshot_observed_at":"2026-08-06T14:00:39.669703Z","submitted_at":"2026-06-10T14:54:51Z","title":"Shared Infrastructure Investment and Pricing: Stackelberg Equilibria in Risk-Aware Take-or-Pay Contracts","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-06-27T07:46:16.042529Z"},"links":{"cited_paper":"/paper/2509.08161","citing_paper":"/paper/2606.12167"},"observation_digest":"sha256:4a59abd8a45243faa0eeb012c2dee6cb8c68726adcbfe8b174de4f731c446df6","observation_id":"568ce321-3347-459a-a74c-d92d6d8bd634","resolution":{"observed_at":"2026-07-03T13:38:19.162524Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2509.08161/citation-record","integrity":"/paper/2509.08161/integrity","json":"/paper/2509.08161/citation-record.json","paper":"/paper/2509.08161"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:22:14.027819Z","title":"Differentiable convex optimization layers","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.027819Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:af616c0b00748d6c710d297102ff70669b65f37f63e51292a5e5e72c971fba5f","observation_id":"09749d3d-4b6f-4fe6-b6b7-61bfb44332e0","resolution":{"observed_at":"2026-08-04T21:22:14.027819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:22:14.032836Z","title":"Optnet: Differentiable optimization as a layer in neural networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.032836Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:77a5309a974410cb093347d51b08c7f55455a511313c4922d9426999b0ae5092","observation_id":"066e6031-7b78-4cd2-8baf-93c3684c098c","resolution":{"observed_at":"2026-08-04T21:22:14.032836Z","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-04T21:22:14.947184Z","title":"Stackelberg security games (ssg) basics and application overview","venue":null,"work_id":"497ca56e-9fe3-4139-9b3c-bc447f6ea06e","year":2017},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.038180Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:19a01a8e3d8658c133c1f2bd388b1236d57d4e55a77cc6a13666cf4029b1ed6a","observation_id":"13c4458f-d679-4134-b431-9ea337e83f06","resolution":{"observed_at":"2026-08-04T21:22:14.952028Z","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-04T21:22:14.931786Z","title":"Sample-efficient learning of stackelberg equilibria in general-sum games","venue":null,"work_id":"c1429f60-886f-404c-8599-a2fa7925c4d4","year":2021},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.043530Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:122bfe263f2c66cf3b5c8549cb6f420c40f02aa396bd3ba640495a758361e8f9","observation_id":"51a823f3-4667-466a-b1c5-7f5698f4d599","resolution":{"observed_at":"2026-08-04T21:22:14.936339Z","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-04T21:22:14.914819Z","title":"Ba s ar and R","venue":null,"work_id":"97aa65ad-111f-426c-a20f-48ba48fe7476","year":2002},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.048421Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:eb1527cd9ad5c57c6284db39cd310e528f76b9c3f1ef1ca6cf22b98788305fd0","observation_id":"b668cb3f-e675-4de7-be50-ed10faa8f5b3","resolution":{"observed_at":"2026-08-04T21:22:14.920840Z","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-04T21:22:14.898817Z","title":"On Stackelberg--Nash Equilibria in Bilevel Optimization Games, pages 27--51","venue":null,"work_id":"81608713-3a6f-42b2-8e70-cb5330ffc3f6","year":2020},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.053128Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:cd9dc5a62f5dee89255d5a23e6d50366338620afb44f347e5b4887c58db5daaf","observation_id":"321475d3-3d66-41e9-9295-1ad2bfc4b25d","resolution":{"observed_at":"2026-08-04T21:22:14.903311Z","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-04T21:22:14.883827Z","title":"Doubly optimal no-regret learning in monotone games","venue":null,"work_id":"4ba94b9c-7454-4507-8e79-f278d9e77d0a","year":2023},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.058576Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:4d160bf26255157d4d14438c23e569da581fa5b5052a53ce1283d7d7527f121f","observation_id":"fd49172d-7cbb-409e-a943-a827a1d34ad1","resolution":{"observed_at":"2026-08-04T21:22:14.888468Z","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-04T21:22:14.868750Z","title":"Near-optimal nonconvex-strongly-convex bilevel optimization with fully first-order oracles","venue":null,"work_id":"a5f31c56-b8de-4d23-aea5-b9313705986c","year":2025},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.063088Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:0232a9a4d15dd0cd5b9692a2e7917e69d740581aff0a4ed099bff62a9b9d9ddc","observation_id":"3fcc6500-6262-4423-9c00-d85034c6566c","resolution":{"observed_at":"2026-08-04T21:22:14.873381Z","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-04T21:22:14.852800Z","title":"Finite--Dimensional Variational Inequalities and Complementarity Problems, volume 1 of Springer Series in Operations Research and Financial Engineering","venue":null,"work_id":"4e5b337a-fb79-4544-97ee-4252567dd9a0","year":2003},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.067496Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:2c135a68dd2afa7ecb66729fdbd9fdd8c0f61dda64b3b3f920a4b50ca500ff95","observation_id":"b811e213-238c-495d-b210-ae68ce815790","resolution":{"observed_at":"2026-08-04T21:22:14.857926Z","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":"1906.01217","last_updated":"2019-11-06T23:31:48Z","snapshot_observed_at":"2026-07-06T07:57:43.002430Z","submitted_at":"2019-06-04T06:27:34Z","title":"Convergence of Learning Dynamics in Stackelberg Games","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.01217","snapshot_observed_at":"2026-08-04T21:22:14.071688Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.071688Z"},"links":{"cited_paper":"/paper/1906.01217","citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:3fbb9e701c9309d53d21106b906dd1439c0ba4d35c5eaee10c645833fb216563","observation_id":"2782d914-a3d3-4fc8-9b2b-3e640db6e1b0","resolution":{"observed_at":"2026-08-04T21:22:14.071688Z","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-04T21:22:14.835568Z","title":"Implicit learning dynamics in stackelberg games: Equilibria and convergence","venue":null,"work_id":"cefa4bd7-1530-45cc-b214-8ea5ebbd3c84","year":2020},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.076366Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:212be4555de4fe14de5d7f57ed0a87c88da5a8701b3467f4e302d9f4baf02864","observation_id":"4f09e040-5266-4ed0-a950-5292ea3590f3","resolution":{"observed_at":"2026-08-04T21:22:14.840395Z","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-04T21:22:14.820136Z","title":"Continuous-time convergence rates in potential and monotone games","venue":null,"work_id":"f7176889-8efd-4eaa-bc2c-22591ead484a","year":2022},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.081694Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:54e8ca32d15c96a9d6e70515defefbe74ec49f732256bd3081dfd8d11fe16b1a","observation_id":"7f02feea-687f-451e-b559-b74738d75a22","resolution":{"observed_at":"2026-08-04T21:22:14.825234Z","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-04T21:22:14.677712Z","title":"Oracles & followers: Stackelberg equilibria in deep multi-agent reinforcement learning","venue":null,"work_id":"c107a962-26cc-4c6e-bdd1-9cf925817792","year":2023},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.086210Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:f1bdee8dc3bf12d4675bc43da88f2adbd13536b0591f9b402a1d148137b7f521","observation_id":"5a0a139b-bb74-459e-a93d-1abfcfcc4c0e","resolution":{"observed_at":"2026-08-04T21:22:14.808150Z","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":"1802.02246","last_updated":"2018-02-06T22:10:14Z","snapshot_observed_at":"2026-07-06T06:22:08.261855Z","submitted_at":"2018-02-06T22:10:14Z","title":"Approximation Methods for Bilevel Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.02246","snapshot_observed_at":"2026-08-04T21:22:14.091678Z","title":"Approximation methods for bilevel programming, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.091678Z"},"links":{"cited_paper":"/paper/1802.02246","citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:961bf2b3789093639d2b4f9361998d69ed7eb55ba48ed04a6d35f57748791a52","observation_id":"f4735e7d-c00e-4d40-92d6-f36937e9f3ed","resolution":{"observed_at":"2026-08-04T21:22:14.091678Z","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-04T21:22:14.660540Z","title":"Zero-sum stochastic stackelberg games","venue":null,"work_id":"a2546286-ea3e-4f4f-b835-3a4c613fb3bb","year":2022},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.096476Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:ad94e22026763cb0a0b45b3a851121f274756eb122612055ae5611ce373ff208","observation_id":"09782ba1-63a8-4187-ab3f-3ba3ae3daa30","resolution":{"observed_at":"2026-08-04T21:22:14.665572Z","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-04T21:22:14.643998Z","title":"Convex-concave zero-sum markov stackelberg games","venue":null,"work_id":"ecd7ba75-7b39-4ae5-9364-804a89b6da20","year":2023},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.101548Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:d5c3354f69cd7cbc220d4c6124dbce05d941a43f0a9702c4d66f373c8f1c9e47","observation_id":"966bcaf6-5fa3-4d34-99fb-aed3dfe2940a","resolution":{"observed_at":"2026-08-04T21:22:14.648512Z","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-04T21:22:14.627914Z","title":"Tight last-iterate convergence rates for no-regret learning in multi-player games","venue":null,"work_id":"0e4f9cca-e64a-4278-89db-d770a61ea928","year":2020},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.105782Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:333c52f002ab63ccab8df1bd08e0188b53da79e73f012cffbae0e2790596b1ce","observation_id":"2260012b-723f-490b-9697-61af16293b35","resolution":{"observed_at":"2026-08-04T21:22:14.632648Z","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-04T21:22:14.610486Z","title":"Hierarchical game theory for system-optimal control: Applications of reverse stackelberg games in regulating marketing channels and traffic routing","venue":null,"work_id":"85d1757c-ed29-4be1-9cf6-f84359eb4ec0","year":2017},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.110310Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:fabc08b28c52319875fdf88799a02788ed96ba90a390b16cacde948c598285d5","observation_id":"9932f43c-9949-4582-999e-fc6c09a67785","resolution":{"observed_at":"2026-08-04T21:22:14.615784Z","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-04T21:22:14.591648Z","title":"A double oracle algorithm for zero-sum security games on graphs","venue":null,"work_id":"74d59610-eecd-46d6-95c9-e9af820f4f12","year":2011},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.115681Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:d638d1478e912a7d10c66f411032ec384fab6be9151487a7028037c2ff0e8200","observation_id":"ca02500b-c203-4896-82ba-aacc36c326ca","resolution":{"observed_at":"2026-08-04T21:22:14.596965Z","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-04T21:22:14.122426Z","title":"Bilevel optimization: Convergence analysis and enhanced design","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.122426Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:3d9d92adf67496cb26aab8e5037b41ff478475263c8f6c7fbc54e4189a510dbe","observation_id":"58d5f3b1-8b85-4e0d-87c3-4dcc944073e5","resolution":{"observed_at":"2026-08-04T21:22:14.122426Z","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-04T21:22:14.561722Z","title":"A fully first-order method for stochastic bilevel optimization","venue":null,"work_id":"cda7b13a-3822-4d8f-8808-dda7913a297d","year":2023},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.127212Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:7a5b5c64e608c5076be5861dff5dcb5ebd09f24c2e21e101e47b5fa5c3dcdb66","observation_id":"7be1a25e-04bb-4c2c-8cb5-9c75f42f3a28","resolution":{"observed_at":"2026-08-04T21:22:14.567605Z","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-04T21:22:14.544402Z","title":"End-to-end learning and intervention in games","venue":null,"work_id":"f0490766-5a74-4a1d-a612-d0d94b744cf1","year":2020},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.131739Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:c3fac405039b404ab6c47c23c722b2425a9ecb5c0e911401c2e2ac3dc5808667","observation_id":"4c8dc0ad-d610-4526-8219-6a84d0d6bd7e","resolution":{"observed_at":"2026-08-04T21:22:14.549607Z","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-04T21:22:14.526144Z","title":"A review of dynamic stackelberg game models","venue":null,"work_id":"145df27a-85ff-41a4-8324-0c0f8109e3b6","year":2017},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.136284Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:77cfae5718ab5bdf3f0a7125634c46feebc5f6510e773ff9dfe23b00e1dfe637","observation_id":"3a45d4a0-4dfd-4a5c-a284-480cb2fa5043","resolution":{"observed_at":"2026-08-04T21:22:14.531213Z","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":"2106.04663","last_updated":"2022-06-27T16:04:54Z","snapshot_observed_at":"2026-08-05T10:35:34.707985Z","submitted_at":"2021-06-08T20:07:17Z","title":"Solving Structured Hierarchical Games Using Differential Backward Induction","version":4},"cited_work":{"arxiv_id":"2106.04663","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.04663","snapshot_observed_at":"2026-08-04T21:22:14.310643Z","title":"Solving Structured Hierarchical Games Using Differential Backward Induction","venue":"cs.GT","work_id":"2bbfd687-3fe3-4eda-bd42-4c697e57b143","year":2021},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.140443Z"},"links":{"cited_paper":"/paper/2106.04663","citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:e5488098674dcab1e7b5474f80c5eb54ff7c6fcffe0b49565c2fda7b7e5ce850","observation_id":"fc7c2e1b-2c0c-460f-af97-24a7c5a582d8","resolution":{"observed_at":"2026-08-04T21:22:14.318044Z","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-04T21:22:14.509734Z","title":"Finite-time last-iterate convergence for multi-agent learning in games","venue":null,"work_id":"86982579-f8f7-430e-9cef-d04e2b7afe69","year":2020},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.145148Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:94ae6db79b39bd8bf9080ad8a360e766ab5bca48653031f910a82280bfb31f16","observation_id":"3b8b70b6-03de-45e0-b7fd-3bc83fb0e0d8","resolution":{"observed_at":"2026-08-04T21:22:14.514581Z","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-04T21:22:14.490996Z","title":"Bome! bilevel optimization made easy: A simple first-order approach","venue":null,"work_id":"4dccdcd5-adde-4c37-a99d-cfcba03a207c","year":2022},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.149293Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:824900fd51faed378ca5139d2be9bc4b411f9f8a4f8bdea025645c8101f5bd0a","observation_id":"51b334ca-f8b5-41de-93c7-2748a2800105","resolution":{"observed_at":"2026-08-04T21:22:14.497346Z","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-04T21:22:14.473882Z","title":"First-order penalty methods for bilevel optimization","venue":null,"work_id":"cf36e504-ced1-48fe-a2e6-c8155e40353c","year":1937},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.153612Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:54a9ec7dc988fcb52e4ff75fb713ffe6ee1a010fae1d5edd966c93f996cbc289","observation_id":"959c249a-8a4e-4318-81da-de67f5f7447d","resolution":{"observed_at":"2026-08-04T21:22:14.479124Z","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":"2302.01421","last_updated":"2024-03-27T00:38:33Z","snapshot_observed_at":"2026-08-05T16:38:37.046485Z","submitted_at":"2023-02-02T21:21:14Z","title":"Follower Agnostic Methods for Stackelberg Games","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.01421","snapshot_observed_at":"2026-08-04T21:22:14.158126Z","title":"Shankar Sasty, Lillian Ratliff, and Eric Mazumdar","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.158126Z"},"links":{"cited_paper":"/paper/2302.01421","citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:1bb366f4bf3f5a6e0c350cd094b3e0cdddf3a7e1aa07e2cf27a18d8bcde8f251","observation_id":"46f61541-d176-4da4-bd70-0e3390cea36a","resolution":{"observed_at":"2026-08-04T21:22:14.158126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:22:14.162895Z","title":"Learning in games with continuous action sets and unknown payoff functions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.162895Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:1e5e7fa5fdb9dc156743ebc1f5514b9cebdd7de96cf951a59743560e72462ed8","observation_id":"1a0cb2b8-9c6a-4483-88d9-74c8a1e3fb07","resolution":{"observed_at":"2026-08-04T21:22:14.162895Z","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-04T21:22:14.443190Z","title":"Learning nash equilibria in monotone games","venue":null,"work_id":"22023476-b35c-4087-971e-325b38dffd62","year":2019},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.167380Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:d18b697acdde8588d7d01c136339f06789b3645e2c997eb32b79e748d1d521d5","observation_id":"3ecbed37-c2ad-4147-9afb-e06c1626c6a8","resolution":{"observed_at":"2026-08-04T21:22:14.448203Z","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-04T21:22:14.426350Z","title":"Reiter, and Milind Tambe","venue":null,"work_id":"5d2f85a7-bfca-4be4-b822-2bfa814b621b","year":2022},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.171512Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:a10bf2bb0510538dee19d7de20ef6d267433f58c2e1e2b23552403ead23bafca","observation_id":"bafeb654-92c2-4b6f-8ea7-fc30f56068be","resolution":{"observed_at":"2026-08-04T21:22:14.431464Z","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-04T21:22:14.408781Z","title":"Alternating projected sgd for equality-constrained bilevel optimization","venue":null,"work_id":"8117c4b9-de4c-4e4c-9660-dd8f42201c26","year":2023},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.175970Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:1562b5ebb0f58d73514167a84b30c8d6157337624405c99a2271c53fe66f43bb","observation_id":"e709d45b-946b-41d5-8ae8-9cd03bbea116","resolution":{"observed_at":"2026-08-04T21:22:14.414061Z","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-04T21:22:14.392417Z","title":"A one-leader multi-follower bayesian-stackelberg game for anti-jamming transmission in uav communication networks","venue":null,"work_id":"15e1917b-8913-443f-ae61-42a221155b22","year":2018},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.180380Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:a0a8f846eee824ed1ee363be4dbd7e24782d1d50ed30b518e050e147f23c0df7","observation_id":"0028a5f7-ede8-4324-a3ae-d2f792ae89bd","resolution":{"observed_at":"2026-08-04T21:22:14.397499Z","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":"2307.00126","last_updated":"2023-06-30T20:36:44Z","snapshot_observed_at":"2026-08-02T11:39:52.136579Z","submitted_at":"2023-06-30T20:36:44Z","title":"Accelerating Inexact HyperGradient Descent for Bilevel Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.00126","snapshot_observed_at":"2026-08-04T21:22:14.185484Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.185484Z"},"links":{"cited_paper":"/paper/2307.00126","citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:83b0454d3f9073d28533d2d9f8d9f8e01e09a4b82f78628abbcde726231f2520","observation_id":"2b0f3ca7-1b23-47c6-9f5e-3d53a4b91603","resolution":{"observed_at":"2026-08-04T21:22:14.185484Z","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-04T21:22:14.372838Z","title":"Multi-agent reinforcement learning: A selective overview of theories and algorithms","venue":null,"work_id":"1ccbff8b-704a-4d7c-b7dc-0eb63cb54d30","year":2021},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.190419Z"},"links":{"citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:ce8492e176e384c5665e23c1cd56bb2987ce36640c448c1011e6da6e534efb8e","observation_id":"9de132d5-e62c-4090-a733-4393837c8a6c","resolution":{"observed_at":"2026-08-04T21:22:14.379152Z","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":"2308.00788","last_updated":"2023-12-20T20:30:24Z","snapshot_observed_at":"2026-07-06T16:01:26.276862Z","submitted_at":"2023-08-01T18:59:07Z","title":"An Introduction to Bi-level Optimization: Foundations and Applications in Signal Processing and Machine Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.00788","snapshot_observed_at":"2026-08-04T21:22:14.195148Z","title":"An introduction to bi-level optimization: Foundations and applications in signal processing and machine learning, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.195148Z"},"links":{"cited_paper":"/paper/2308.00788","citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:338fe2381e4ab01bb4fd2a43620d0b64a697f09b4abc5f804c61d34d98bbe098","observation_id":"2b8b2e3c-fd41-43d3-b82b-4cba562abeee","resolution":{"observed_at":"2026-08-04T21:22:14.195148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":26},"total_outbound_references":36},"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 36 of 36 outbound references and 3 inbound Pith citation observations for arXiv:2509.08161."}