{"as_of":"2026-08-09T13:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0e70d28efdc8204e362072c21921e1cb609f8debe1437962f4a8140c3551ab10","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T21:22:14.158126Z","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-06-29T05:43:08.306597Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":{"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":"2302.01421","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.01421","snapshot_observed_at":"2026-06-29T05:43:08.306597Z","title":"Maheshwari, S","venue":null,"work_id":"7b8780ae-ea8e-4564-8e86-a23cbf0a4a03","year":2023},"citing_paper":{"arxiv_id":"2605.30531","last_updated":"2026-05-28T20:08:13Z","snapshot_observed_at":"2026-08-07T17:56:04.136895Z","submitted_at":"2026-05-28T20:08:13Z","title":"Benchmarking Bilevel Derivative-Free Optimization Algorithms","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-29T05:38:35.924564Z"},"links":{"cited_paper":"/paper/2302.01421","citing_paper":"/paper/2605.30531"},"observation_digest":"sha256:1611495a4eb83909803c49c033dc23bdfd82015af327cbe95a50d8a874565c4a","observation_id":"03c78dba-068d-4cd2-92eb-1ee0cb94c986","resolution":{"observed_at":"2026-06-29T05:43:08.308390Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2302.01421/citation-record","integrity":"/paper/2302.01421/integrity","json":"/paper/2302.01421/citation-record.json","paper":"/paper/2302.01421"},"outbound":[],"paper":{"arxiv_id":"2302.01421","last_updated":"2024-03-27T00:38:33Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-05T16:38:37.046485Z","submitted_at":"2023-02-02T21:21:14Z","title":"Follower Agnostic Methods for Stackelberg Games"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2302.01421."}