{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TFQGJTCZPND7QCLU2UFES3ED4V","short_pith_number":"pith:TFQGJTCZ","schema_version":"1.0","canonical_sha256":"996064cc597b47f80974d50a496c83e545fa123a02ec1d237d1f4d00052c9c53","source":{"kind":"arxiv","id":"2411.10588","version":4},"attestation_state":"computed","paper":{"title":"A dataset of questions on decision-theoretic reasoning in Newcomb-like problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Caspar Oesterheld, Emery Cooper, Ethan Perez, Linh Chi Nguyen, Miles Kodama","submitted_at":"2024-11-15T21:19:04Z","abstract_excerpt":"We introduce a dataset of natural-language questions in the decision theory of so-called Newcomb-like problems. Newcomb-like problems include, for instance, decision problems in which an agent interacts with a similar other agent, and thus has to reason about the fact that the other agent will likely reason in similar ways. Evaluating LLM reasoning about Newcomb-like problems is important because interactions between foundation-model-based agents will often be Newcomb-like. Some ways of reasoning about Newcomb-like problems may allow for greater cooperation between models.\n  Our dataset contai"},"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":"2411.10588","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-11-15T21:19:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"eb6087f241f5d2ed713dfc72f9e0c15cba77063123aa952ec6e28b0978b21a92","abstract_canon_sha256":"6f6d71e7cd66644f100b2afe07f524c0efeb98ff6e7b9203287a3d55bb5aa12f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:38.237768Z","signature_b64":"bBLzheyqktaXigW/xSLgPbC+bZDsN/tjNdt1TijaSOCnv+SZc+aT7r5Qcs9FH04omSxXcj+FJ4T92M+J30zjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"996064cc597b47f80974d50a496c83e545fa123a02ec1d237d1f4d00052c9c53","last_reissued_at":"2026-07-05T11:21:38.237242Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:38.237242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A dataset of questions on decision-theoretic reasoning in Newcomb-like problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Caspar Oesterheld, Emery Cooper, Ethan Perez, Linh Chi Nguyen, Miles Kodama","submitted_at":"2024-11-15T21:19:04Z","abstract_excerpt":"We introduce a dataset of natural-language questions in the decision theory of so-called Newcomb-like problems. Newcomb-like problems include, for instance, decision problems in which an agent interacts with a similar other agent, and thus has to reason about the fact that the other agent will likely reason in similar ways. Evaluating LLM reasoning about Newcomb-like problems is important because interactions between foundation-model-based agents will often be Newcomb-like. Some ways of reasoning about Newcomb-like problems may allow for greater cooperation between models.\n  Our dataset contai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10588","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/2411.10588/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":"2411.10588","created_at":"2026-07-05T11:21:38.237310+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.10588v4","created_at":"2026-07-05T11:21:38.237310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10588","created_at":"2026-07-05T11:21:38.237310+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFQGJTCZPND7","created_at":"2026-07-05T11:21:38.237310+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFQGJTCZPND7QCLU","created_at":"2026-07-05T11:21:38.237310+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFQGJTCZ","created_at":"2026-07-05T11:21:38.237310+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03958","citing_title":"A game theory for foundation models shows new paths to rational cooperation through similarity inference","ref_index":57,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TFQGJTCZPND7QCLU2UFES3ED4V","json":"https://pith.science/pith/TFQGJTCZPND7QCLU2UFES3ED4V.json","graph_json":"https://pith.science/api/pith-number/TFQGJTCZPND7QCLU2UFES3ED4V/graph.json","events_json":"https://pith.science/api/pith-number/TFQGJTCZPND7QCLU2UFES3ED4V/events.json","paper":"https://pith.science/paper/TFQGJTCZ"},"agent_actions":{"view_html":"https://pith.science/pith/TFQGJTCZPND7QCLU2UFES3ED4V","download_json":"https://pith.science/pith/TFQGJTCZPND7QCLU2UFES3ED4V.json","view_paper":"https://pith.science/paper/TFQGJTCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.10588&json=true","fetch_graph":"https://pith.science/api/pith-number/TFQGJTCZPND7QCLU2UFES3ED4V/graph.json","fetch_events":"https://pith.science/api/pith-number/TFQGJTCZPND7QCLU2UFES3ED4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFQGJTCZPND7QCLU2UFES3ED4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFQGJTCZPND7QCLU2UFES3ED4V/action/storage_attestation","attest_author":"https://pith.science/pith/TFQGJTCZPND7QCLU2UFES3ED4V/action/author_attestation","sign_citation":"https://pith.science/pith/TFQGJTCZPND7QCLU2UFES3ED4V/action/citation_signature","submit_replication":"https://pith.science/pith/TFQGJTCZPND7QCLU2UFES3ED4V/action/replication_record"}},"created_at":"2026-07-05T11:21:38.237310+00:00","updated_at":"2026-07-05T11:21:38.237310+00:00"}