{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XJS7BGHYKPCCZACLJNEOVKTDSZ","short_pith_number":"pith:XJS7BGHY","schema_version":"1.0","canonical_sha256":"ba65f098f853c42c804b4b48eaaa63965fffbbf8ad54248912501ebdd802df03","source":{"kind":"arxiv","id":"1708.03871","version":1},"attestation_state":"computed","paper":{"title":"A Game-Theoretic Analysis of the Off-Switch Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Elliot Catt, Marcus Hutter, Mikael B\\\"o\\\"ors, Tobias W\\\"angberg, Tom Everitt","submitted_at":"2017-08-13T07:54:00Z","abstract_excerpt":"The off-switch game is a game theoretic model of a highly intelligent robot interacting with a human. In the original paper by Hadfield-Menell et al. (2016), the analysis is not fully game-theoretic as the human is modelled as an irrational player, and the robot's best action is only calculated under unrealistic normality and soft-max assumptions. In this paper, we make the analysis fully game theoretic, by modelling the human as a rational player with a random utility function. As a consequence, we are able to easily calculate the robot's best action for arbitrary belief and irrationality ass"},"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":"1708.03871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-08-13T07:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"d3bf872d70df68b29310f8b59d53d051d67757247f33240b0a2741491a7661b0","abstract_canon_sha256":"07a9496dd0a1b3d703e9ad1afd68db2353a3d6fdc94e32693de57f63d06848e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:07.656587Z","signature_b64":"sF+ZHYFE1Xf3emBeKQpf9WVK5z7K7p8tRgtkDf9/G18Cs/4Z4QGCxHZi7zvvKYN/q6tfvoXkFWtwgCnavEoIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba65f098f853c42c804b4b48eaaa63965fffbbf8ad54248912501ebdd802df03","last_reissued_at":"2026-05-18T00:38:07.656011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:07.656011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Game-Theoretic Analysis of the Off-Switch Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Elliot Catt, Marcus Hutter, Mikael B\\\"o\\\"ors, Tobias W\\\"angberg, Tom Everitt","submitted_at":"2017-08-13T07:54:00Z","abstract_excerpt":"The off-switch game is a game theoretic model of a highly intelligent robot interacting with a human. In the original paper by Hadfield-Menell et al. (2016), the analysis is not fully game-theoretic as the human is modelled as an irrational player, and the robot's best action is only calculated under unrealistic normality and soft-max assumptions. In this paper, we make the analysis fully game theoretic, by modelling the human as a rational player with a random utility function. As a consequence, we are able to easily calculate the robot's best action for arbitrary belief and irrationality ass"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03871","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":""},"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":"1708.03871","created_at":"2026-05-18T00:38:07.656107+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.03871v1","created_at":"2026-05-18T00:38:07.656107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03871","created_at":"2026-05-18T00:38:07.656107+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJS7BGHYKPCC","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJS7BGHYKPCCZACL","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJS7BGHY","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2407.00805","citing_title":"Towards Shutdownable Agents via Stochastic Choice","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2604.17502","citing_title":"Towards Shutdownable Agents: Generalizing Stochastic Choice in RL Agents and LLMs","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XJS7BGHYKPCCZACLJNEOVKTDSZ","json":"https://pith.science/pith/XJS7BGHYKPCCZACLJNEOVKTDSZ.json","graph_json":"https://pith.science/api/pith-number/XJS7BGHYKPCCZACLJNEOVKTDSZ/graph.json","events_json":"https://pith.science/api/pith-number/XJS7BGHYKPCCZACLJNEOVKTDSZ/events.json","paper":"https://pith.science/paper/XJS7BGHY"},"agent_actions":{"view_html":"https://pith.science/pith/XJS7BGHYKPCCZACLJNEOVKTDSZ","download_json":"https://pith.science/pith/XJS7BGHYKPCCZACLJNEOVKTDSZ.json","view_paper":"https://pith.science/paper/XJS7BGHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.03871&json=true","fetch_graph":"https://pith.science/api/pith-number/XJS7BGHYKPCCZACLJNEOVKTDSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/XJS7BGHYKPCCZACLJNEOVKTDSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJS7BGHYKPCCZACLJNEOVKTDSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJS7BGHYKPCCZACLJNEOVKTDSZ/action/storage_attestation","attest_author":"https://pith.science/pith/XJS7BGHYKPCCZACLJNEOVKTDSZ/action/author_attestation","sign_citation":"https://pith.science/pith/XJS7BGHYKPCCZACLJNEOVKTDSZ/action/citation_signature","submit_replication":"https://pith.science/pith/XJS7BGHYKPCCZACLJNEOVKTDSZ/action/replication_record"}},"created_at":"2026-05-18T00:38:07.656107+00:00","updated_at":"2026-05-18T00:38:07.656107+00:00"}