{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JCYVTKURAYIDYD7MWHEVHZ2JP3","short_pith_number":"pith:JCYVTKUR","schema_version":"1.0","canonical_sha256":"48b159aa9106103c0fecb1c953e7497ecef6ecaa5f926ade036618e2e1da1459","source":{"kind":"arxiv","id":"2402.08576","version":4},"attestation_state":"computed","paper":{"title":"Regret Minimization in Stackelberg Games with Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Keegan Harris, Maria-Florina Balcan, Zhiwei Steven Wu","submitted_at":"2024-02-13T16:24:57Z","abstract_excerpt":"Algorithms for playing in Stackelberg games have been deployed in real-world domains including airport security, anti-poaching efforts, and cyber-crime prevention. However, these algorithms often fail to take into consideration the additional information available to each player (e.g. traffic patterns, weather conditions, network congestion), which may significantly affect both players' optimal strategies. We formalize such settings as Stackelberg games with side information, in which both players observe an external context before playing. The leader commits to a (context-dependent) strategy,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2402.08576","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-02-13T16:24:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d6e40f6b7eb1fbf130fb77e88601bee55252cde5107ebd3547abb1ee380ed78b","abstract_canon_sha256":"5533751db079000c4337d72f44b27ac7fd7603749a18c1cf290749bcf76b86ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:26.404537Z","signature_b64":"OlJA0w7xA6ijYwOpqRz5xG4WilY1ElMWanaKhleewiseEUys98gX/RT1gl/3tP91xApZLusDIAP4PogisNxVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48b159aa9106103c0fecb1c953e7497ecef6ecaa5f926ade036618e2e1da1459","last_reissued_at":"2026-07-05T09:19:26.404008Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:26.404008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regret Minimization in Stackelberg Games with Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Keegan Harris, Maria-Florina Balcan, Zhiwei Steven Wu","submitted_at":"2024-02-13T16:24:57Z","abstract_excerpt":"Algorithms for playing in Stackelberg games have been deployed in real-world domains including airport security, anti-poaching efforts, and cyber-crime prevention. However, these algorithms often fail to take into consideration the additional information available to each player (e.g. traffic patterns, weather conditions, network congestion), which may significantly affect both players' optimal strategies. We formalize such settings as Stackelberg games with side information, in which both players observe an external context before playing. The leader commits to a (context-dependent) strategy,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08576","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.08576/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.08576","created_at":"2026-07-05T09:19:26.404066+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.08576v4","created_at":"2026-07-05T09:19:26.404066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08576","created_at":"2026-07-05T09:19:26.404066+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCYVTKURAYID","created_at":"2026-07-05T09:19:26.404066+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCYVTKURAYIDYD7M","created_at":"2026-07-05T09:19:26.404066+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCYVTKUR","created_at":"2026-07-05T09:19:26.404066+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17415","citing_title":"Pure or Unstable: A Generic Dichotomy for Strong Stackelberg Commitments","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2502.00204","citing_title":"Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JCYVTKURAYIDYD7MWHEVHZ2JP3","json":"https://pith.science/pith/JCYVTKURAYIDYD7MWHEVHZ2JP3.json","graph_json":"https://pith.science/api/pith-number/JCYVTKURAYIDYD7MWHEVHZ2JP3/graph.json","events_json":"https://pith.science/api/pith-number/JCYVTKURAYIDYD7MWHEVHZ2JP3/events.json","paper":"https://pith.science/paper/JCYVTKUR"},"agent_actions":{"view_html":"https://pith.science/pith/JCYVTKURAYIDYD7MWHEVHZ2JP3","download_json":"https://pith.science/pith/JCYVTKURAYIDYD7MWHEVHZ2JP3.json","view_paper":"https://pith.science/paper/JCYVTKUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.08576&json=true","fetch_graph":"https://pith.science/api/pith-number/JCYVTKURAYIDYD7MWHEVHZ2JP3/graph.json","fetch_events":"https://pith.science/api/pith-number/JCYVTKURAYIDYD7MWHEVHZ2JP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCYVTKURAYIDYD7MWHEVHZ2JP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCYVTKURAYIDYD7MWHEVHZ2JP3/action/storage_attestation","attest_author":"https://pith.science/pith/JCYVTKURAYIDYD7MWHEVHZ2JP3/action/author_attestation","sign_citation":"https://pith.science/pith/JCYVTKURAYIDYD7MWHEVHZ2JP3/action/citation_signature","submit_replication":"https://pith.science/pith/JCYVTKURAYIDYD7MWHEVHZ2JP3/action/replication_record"}},"created_at":"2026-07-05T09:19:26.404066+00:00","updated_at":"2026-07-05T09:19:26.404066+00:00"}