{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AN6OJ652RR7DDJM6ZMK6XEDK2P","short_pith_number":"pith:AN6OJ652","schema_version":"1.0","canonical_sha256":"037ce4fbba8c7e31a59ecb15eb906ad3e6c4e892d9dc24bb26d501f1dfedd031","source":{"kind":"arxiv","id":"1908.08641","version":1},"attestation_state":"computed","paper":{"title":"Stackelberg Punishment and Bully-Proofing Autonomous Vehicles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.HC","authors_text":"Aansh Shah, Aaron Zhang, Jacob Beck, Jerome Ramos, Joshua D. Fishman, Jun Ki Lee, Matt Cooper, Michael Gillett, Michael L. Littman, Zo\\\"e Papakipos","submitted_at":"2019-08-23T02:29:17Z","abstract_excerpt":"Mutually beneficial behavior in repeated games can be enforced via the threat of punishment, as enshrined in game theory's well-known \"folk theorem.\" There is a cost, however, to a player for generating these disincentives. In this work, we seek to minimize this cost by computing a \"Stackelberg punishment,\" in which the player selects a behavior that sufficiently punishes the other player while maximizing its own score under the assumption that the other player will adopt a best response. This idea generalizes the concept of a Stackelberg equilibrium. Known efficient algorithms for computing a"},"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":"1908.08641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2019-08-23T02:29:17Z","cross_cats_sorted":["cs.AI","cs.GT"],"title_canon_sha256":"fcfc7cc1adbf0f913f50756e91f3cae3018b51bd80dec93ad8adb4fb51d22934","abstract_canon_sha256":"3c0daf83e5abbfbf495ac1fc844faa1380b5d55c49da7d29f202ecabcd04b105"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:16.459166Z","signature_b64":"MqU0c5MpAqNzobbGCaka7ETTCqgDLd/r5GwKipxbvjLETYlCOuX9itWkUI8EP/w67P9jDPOr3QeEEbO9bgy9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"037ce4fbba8c7e31a59ecb15eb906ad3e6c4e892d9dc24bb26d501f1dfedd031","last_reissued_at":"2026-07-04T23:59:16.458757Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:16.458757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stackelberg Punishment and Bully-Proofing Autonomous Vehicles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.HC","authors_text":"Aansh Shah, Aaron Zhang, Jacob Beck, Jerome Ramos, Joshua D. Fishman, Jun Ki Lee, Matt Cooper, Michael Gillett, Michael L. Littman, Zo\\\"e Papakipos","submitted_at":"2019-08-23T02:29:17Z","abstract_excerpt":"Mutually beneficial behavior in repeated games can be enforced via the threat of punishment, as enshrined in game theory's well-known \"folk theorem.\" There is a cost, however, to a player for generating these disincentives. In this work, we seek to minimize this cost by computing a \"Stackelberg punishment,\" in which the player selects a behavior that sufficiently punishes the other player while maximizing its own score under the assumption that the other player will adopt a best response. This idea generalizes the concept of a Stackelberg equilibrium. Known efficient algorithms for computing a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08641","kind":"arxiv","version":1},"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/1908.08641/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":"1908.08641","created_at":"2026-07-04T23:59:16.458816+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08641v1","created_at":"2026-07-04T23:59:16.458816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08641","created_at":"2026-07-04T23:59:16.458816+00:00"},{"alias_kind":"pith_short_12","alias_value":"AN6OJ652RR7D","created_at":"2026-07-04T23:59:16.458816+00:00"},{"alias_kind":"pith_short_16","alias_value":"AN6OJ652RR7DDJM6","created_at":"2026-07-04T23:59:16.458816+00:00"},{"alias_kind":"pith_short_8","alias_value":"AN6OJ652","created_at":"2026-07-04T23:59:16.458816+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AN6OJ652RR7DDJM6ZMK6XEDK2P","json":"https://pith.science/pith/AN6OJ652RR7DDJM6ZMK6XEDK2P.json","graph_json":"https://pith.science/api/pith-number/AN6OJ652RR7DDJM6ZMK6XEDK2P/graph.json","events_json":"https://pith.science/api/pith-number/AN6OJ652RR7DDJM6ZMK6XEDK2P/events.json","paper":"https://pith.science/paper/AN6OJ652"},"agent_actions":{"view_html":"https://pith.science/pith/AN6OJ652RR7DDJM6ZMK6XEDK2P","download_json":"https://pith.science/pith/AN6OJ652RR7DDJM6ZMK6XEDK2P.json","view_paper":"https://pith.science/paper/AN6OJ652","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08641&json=true","fetch_graph":"https://pith.science/api/pith-number/AN6OJ652RR7DDJM6ZMK6XEDK2P/graph.json","fetch_events":"https://pith.science/api/pith-number/AN6OJ652RR7DDJM6ZMK6XEDK2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AN6OJ652RR7DDJM6ZMK6XEDK2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AN6OJ652RR7DDJM6ZMK6XEDK2P/action/storage_attestation","attest_author":"https://pith.science/pith/AN6OJ652RR7DDJM6ZMK6XEDK2P/action/author_attestation","sign_citation":"https://pith.science/pith/AN6OJ652RR7DDJM6ZMK6XEDK2P/action/citation_signature","submit_replication":"https://pith.science/pith/AN6OJ652RR7DDJM6ZMK6XEDK2P/action/replication_record"}},"created_at":"2026-07-04T23:59:16.458816+00:00","updated_at":"2026-07-04T23:59:16.458816+00:00"}