{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MGMT4DUOTTVUA7FBKK7KYZQFF7","short_pith_number":"pith:MGMT4DUO","schema_version":"1.0","canonical_sha256":"61993e0e8e9ceb407ca152beac66052fffd3e35bc04d41792ef359c9082ab123","source":{"kind":"arxiv","id":"1508.04145","version":1},"attestation_state":"computed","paper":{"title":"Reflective Oracles: A Foundation for Classical Game Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Benja Fallenstein, Jessica Taylor, Paul F. Christiano","submitted_at":"2015-08-17T20:08:37Z","abstract_excerpt":"Classical game theory treats players as special---a description of a game contains a full, explicit enumeration of all players---even though in the real world, \"players\" are no more fundamentally special than rocks or clouds. It isn't trivial to find a decision-theoretic foundation for game theory in which an agent's coplayers are a non-distinguished part of the agent's environment. Attempts to model both players and the environment as Turing machines, for example, fail for standard diagonalization reasons.\n  In this paper, we introduce a \"reflective\" type of oracle, which is able to answer qu"},"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":"1508.04145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-08-17T20:08:37Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"9ffd39e7a28a000f6b734990e1bc598aca4643af366bbc17499539d45b48311f","abstract_canon_sha256":"e84448b02fb523b13c0f23ed9cf8d9c243bd2882298878dc755eeb6b34a15b9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:06.165179Z","signature_b64":"KW5APs01PUfjAWj/l+IpoX6trjP0BBEtMY90I/Z3+5LEt4Ln3ZLUNCe/Uaq01b63BMNWBHFe8hbD5AOdrhs9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61993e0e8e9ceb407ca152beac66052fffd3e35bc04d41792ef359c9082ab123","last_reissued_at":"2026-05-18T01:35:06.164475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:06.164475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reflective Oracles: A Foundation for Classical Game Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Benja Fallenstein, Jessica Taylor, Paul F. Christiano","submitted_at":"2015-08-17T20:08:37Z","abstract_excerpt":"Classical game theory treats players as special---a description of a game contains a full, explicit enumeration of all players---even though in the real world, \"players\" are no more fundamentally special than rocks or clouds. It isn't trivial to find a decision-theoretic foundation for game theory in which an agent's coplayers are a non-distinguished part of the agent's environment. Attempts to model both players and the environment as Turing machines, for example, fail for standard diagonalization reasons.\n  In this paper, we introduce a \"reflective\" type of oracle, which is able to answer qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04145","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":"1508.04145","created_at":"2026-05-18T01:35:06.164586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.04145v1","created_at":"2026-05-18T01:35:06.164586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04145","created_at":"2026-05-18T01:35:06.164586+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGMT4DUOTTVU","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGMT4DUOTTVUA7FB","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGMT4DUO","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.17882","citing_title":"Formalizing Embeddedness Failures in Universal Artificial Intelligence","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MGMT4DUOTTVUA7FBKK7KYZQFF7","json":"https://pith.science/pith/MGMT4DUOTTVUA7FBKK7KYZQFF7.json","graph_json":"https://pith.science/api/pith-number/MGMT4DUOTTVUA7FBKK7KYZQFF7/graph.json","events_json":"https://pith.science/api/pith-number/MGMT4DUOTTVUA7FBKK7KYZQFF7/events.json","paper":"https://pith.science/paper/MGMT4DUO"},"agent_actions":{"view_html":"https://pith.science/pith/MGMT4DUOTTVUA7FBKK7KYZQFF7","download_json":"https://pith.science/pith/MGMT4DUOTTVUA7FBKK7KYZQFF7.json","view_paper":"https://pith.science/paper/MGMT4DUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.04145&json=true","fetch_graph":"https://pith.science/api/pith-number/MGMT4DUOTTVUA7FBKK7KYZQFF7/graph.json","fetch_events":"https://pith.science/api/pith-number/MGMT4DUOTTVUA7FBKK7KYZQFF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGMT4DUOTTVUA7FBKK7KYZQFF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGMT4DUOTTVUA7FBKK7KYZQFF7/action/storage_attestation","attest_author":"https://pith.science/pith/MGMT4DUOTTVUA7FBKK7KYZQFF7/action/author_attestation","sign_citation":"https://pith.science/pith/MGMT4DUOTTVUA7FBKK7KYZQFF7/action/citation_signature","submit_replication":"https://pith.science/pith/MGMT4DUOTTVUA7FBKK7KYZQFF7/action/replication_record"}},"created_at":"2026-05-18T01:35:06.164586+00:00","updated_at":"2026-05-18T01:35:06.164586+00:00"}