{"as_of":"2026-08-11T04:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f4bc489aeea714c242afc806872c6a05064f6de7bf48d2d49ce79726c40dfa2b","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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-08-09T21:20:17.984868Z","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-03T23:19:03.748424Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.08576","last_updated":"2024-10-12T02:29:23Z","snapshot_observed_at":"2026-08-10T22:21:43.304483Z","submitted_at":"2024-02-13T16:24:57Z","title":"Regret Minimization in Stackelberg Games with Side Information","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.08576","snapshot_observed_at":"2026-08-09T21:20:17.984868Z","title":"Regret minimization in stackelberg games with side information","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.19144","last_updated":"2025-08-15T15:15:38Z","snapshot_observed_at":"2026-08-10T07:47:07.430671Z","submitted_at":"2025-01-31T13:58:16Z","title":"Prediction-Aware Learning in Multi-Agent Systems","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-09T21:20:17.984868Z"},"links":{"cited_paper":"/paper/2402.08576","citing_paper":"/paper/2501.19144"},"observation_digest":"sha256:087042eb45c9e29e0c7d6ca0f65183b559c5ddcadf9607278c7c79c3f0ec0ce4","observation_id":"8695b47e-d384-4148-8487-8cf3e85dece5","resolution":{"observed_at":"2026-08-09T21:20:17.984868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08576","last_updated":"2024-10-12T02:29:23Z","snapshot_observed_at":"2026-08-10T22:21:43.304483Z","submitted_at":"2024-02-13T16:24:57Z","title":"Regret Minimization in Stackelberg Games with Side Information","version":4},"cited_work":{"arxiv_id":"2402.08576","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.08576","snapshot_observed_at":"2026-07-03T23:19:03.748424Z","title":"Regret minimization in stackelberg games with side information","venue":null,"work_id":"f8564da3-ffde-4693-a250-422fd8f2204d","year":2024},"citing_paper":{"arxiv_id":"2502.00204","last_updated":"2026-05-01T19:29:50Z","snapshot_observed_at":"2026-07-06T20:29:21.568793Z","submitted_at":"2025-01-31T22:40:57Z","title":"Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-23T03:36:04.980758Z"},"links":{"cited_paper":"/paper/2402.08576","citing_paper":"/paper/2502.00204"},"observation_digest":"sha256:069edb553aec6d3d198468d710a4f9abe4bc265a69333ea58dbd5ccc2edf1cca","observation_id":"0141ccf7-6a38-4970-afb0-573b32ca125c","resolution":{"observed_at":"2026-05-23T03:37:27.773074Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08576","last_updated":"2024-10-12T02:29:23Z","snapshot_observed_at":"2026-08-10T22:21:43.304483Z","submitted_at":"2024-02-13T16:24:57Z","title":"Regret Minimization in Stackelberg Games with Side Information","version":4},"cited_work":{"arxiv_id":"2402.08576","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.08576","snapshot_observed_at":"2026-07-03T23:19:03.748424Z","title":"Regret minimization in stackelberg games with side information","venue":null,"work_id":"f8564da3-ffde-4693-a250-422fd8f2204d","year":2024},"citing_paper":{"arxiv_id":"2606.17415","last_updated":"2026-06-16T01:56:10Z","snapshot_observed_at":"2026-08-06T09:54:50.106057Z","submitted_at":"2026-06-16T01:56:10Z","title":"Pure or Unstable: A Generic Dichotomy for Strong Stackelberg Commitments","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T22:31:02.219689Z"},"links":{"cited_paper":"/paper/2402.08576","citing_paper":"/paper/2606.17415"},"observation_digest":"sha256:d4f44526bae3f5ab0c2350db730f629c025017365741a2c262b8025cf5cac9a0","observation_id":"9512e9f7-2921-45e3-94ae-2e9fa397b57b","resolution":{"observed_at":"2026-07-03T23:19:03.751219Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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/2402.08576/citation-record","integrity":"/paper/2402.08576/integrity","json":"/paper/2402.08576/citation-record.json","paper":"/paper/2402.08576"},"outbound":[],"paper":{"arxiv_id":"2402.08576","last_updated":"2024-10-12T02:29:23Z","latest_version":4,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-10T22:21:43.304483Z","submitted_at":"2024-02-13T16:24:57Z","title":"Regret Minimization in Stackelberg Games with Side Information"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2402.08576."}