{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DVZKPY4IGG5DGTBSQPJWNPFIOP","short_pith_number":"pith:DVZKPY4I","schema_version":"1.0","canonical_sha256":"1d72a7e38831ba334c3283d366bca873d54b287612bdc6600eb3edb99ef13ae3","source":{"kind":"arxiv","id":"1106.2657","version":1},"attestation_state":"computed","paper":{"title":"I Don't Want to Think About it Now:Decision Theory With Costly Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Joseph Y. Halpern, Rafael Pass","submitted_at":"2011-06-14T09:52:38Z","abstract_excerpt":"Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility, doing so might present serious computational problems. Moreover, computing the outcome of a given act might be difficult. In a companion paper we develop a framework for game theory with costly computation, where the objects of choice are Turing machines. Here we apply that framework to decision theory. We show how well-known phenomena like first-impression-matters biases (i.e., people tend to put more weight on evid"},"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":"1106.2657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-06-14T09:52:38Z","cross_cats_sorted":[],"title_canon_sha256":"d9ed20787360aff6adb39a084c946624c908b7f148dd87e2d981deb9a7fd303e","abstract_canon_sha256":"d10e2b7a6cbc6b84ca6e264210cdb747136ac452d5b9221ff5ea8fd28c2b766b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:04.364625Z","signature_b64":"G6Hbq2EIcAPL/a4GEUkseAFEsoJgukERllCRMpEZhPWnEe3QGUwb5w3DFFXjHcLvwKYwPS1PABxMbEJehTCKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d72a7e38831ba334c3283d366bca873d54b287612bdc6600eb3edb99ef13ae3","last_reissued_at":"2026-05-18T04:20:04.364157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:04.364157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"I Don't Want to Think About it Now:Decision Theory With Costly Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Joseph Y. Halpern, Rafael Pass","submitted_at":"2011-06-14T09:52:38Z","abstract_excerpt":"Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility, doing so might present serious computational problems. Moreover, computing the outcome of a given act might be difficult. In a companion paper we develop a framework for game theory with costly computation, where the objects of choice are Turing machines. Here we apply that framework to decision theory. We show how well-known phenomena like first-impression-matters biases (i.e., people tend to put more weight on evid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2657","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":"1106.2657","created_at":"2026-05-18T04:20:04.364219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.2657v1","created_at":"2026-05-18T04:20:04.364219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2657","created_at":"2026-05-18T04:20:04.364219+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVZKPY4IGG5D","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVZKPY4IGG5DGTBS","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVZKPY4I","created_at":"2026-05-18T12:26:26.731475+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/DVZKPY4IGG5DGTBSQPJWNPFIOP","json":"https://pith.science/pith/DVZKPY4IGG5DGTBSQPJWNPFIOP.json","graph_json":"https://pith.science/api/pith-number/DVZKPY4IGG5DGTBSQPJWNPFIOP/graph.json","events_json":"https://pith.science/api/pith-number/DVZKPY4IGG5DGTBSQPJWNPFIOP/events.json","paper":"https://pith.science/paper/DVZKPY4I"},"agent_actions":{"view_html":"https://pith.science/pith/DVZKPY4IGG5DGTBSQPJWNPFIOP","download_json":"https://pith.science/pith/DVZKPY4IGG5DGTBSQPJWNPFIOP.json","view_paper":"https://pith.science/paper/DVZKPY4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.2657&json=true","fetch_graph":"https://pith.science/api/pith-number/DVZKPY4IGG5DGTBSQPJWNPFIOP/graph.json","fetch_events":"https://pith.science/api/pith-number/DVZKPY4IGG5DGTBSQPJWNPFIOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVZKPY4IGG5DGTBSQPJWNPFIOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVZKPY4IGG5DGTBSQPJWNPFIOP/action/storage_attestation","attest_author":"https://pith.science/pith/DVZKPY4IGG5DGTBSQPJWNPFIOP/action/author_attestation","sign_citation":"https://pith.science/pith/DVZKPY4IGG5DGTBSQPJWNPFIOP/action/citation_signature","submit_replication":"https://pith.science/pith/DVZKPY4IGG5DGTBSQPJWNPFIOP/action/replication_record"}},"created_at":"2026-05-18T04:20:04.364219+00:00","updated_at":"2026-05-18T04:20:04.364219+00:00"}