{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DLZGRUAILG4S2RL3OIHJJFPRCQ","short_pith_number":"pith:DLZGRUAI","schema_version":"1.0","canonical_sha256":"1af268d00859b92d457b720e9495f1143bae86094f6ecacf26724189e606c58d","source":{"kind":"arxiv","id":"2102.00834","version":1},"attestation_state":"computed","paper":{"title":"Counterfactual Planning in AGI Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Koen Holtman","submitted_at":"2021-01-29T13:44:14Z","abstract_excerpt":"We present counterfactual planning as a design approach for creating a range of safety mechanisms that can be applied in hypothetical future AI systems which have Artificial General Intelligence.\n  The key step in counterfactual planning is to use an AGI machine learning system to construct a counterfactual world model, designed to be different from the real world the system is in. A counterfactual planning agent determines the action that best maximizes expected utility in this counterfactual planning world, and then performs the same action in the real world.\n  We use counterfactual planning"},"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":"2102.00834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-01-29T13:44:14Z","cross_cats_sorted":[],"title_canon_sha256":"a6bc38abd972c61997bb06ce59902881e7b998821288c1370a962bb90b2a915e","abstract_canon_sha256":"dc3c8c2e3d1fad5eca6cb4aebd303753ec0d4030f163d01bfded1b0f65350bb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:11:15.617751Z","signature_b64":"IvMT6gJu2iHPsindWFmUOMThjQCC+5TnJ7vGHxmN+Hm0OcFe572WRIasPlpsX7MHi9+EQUU+NWsxaHC5ijwQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1af268d00859b92d457b720e9495f1143bae86094f6ecacf26724189e606c58d","last_reissued_at":"2026-07-05T02:11:15.617271Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:11:15.617271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counterfactual Planning in AGI Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Koen Holtman","submitted_at":"2021-01-29T13:44:14Z","abstract_excerpt":"We present counterfactual planning as a design approach for creating a range of safety mechanisms that can be applied in hypothetical future AI systems which have Artificial General Intelligence.\n  The key step in counterfactual planning is to use an AGI machine learning system to construct a counterfactual world model, designed to be different from the real world the system is in. A counterfactual planning agent determines the action that best maximizes expected utility in this counterfactual planning world, and then performs the same action in the real world.\n  We use counterfactual planning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.00834","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/2102.00834/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":"2102.00834","created_at":"2026-07-05T02:11:15.617338+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.00834v1","created_at":"2026-07-05T02:11:15.617338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.00834","created_at":"2026-07-05T02:11:15.617338+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLZGRUAILG4S","created_at":"2026-07-05T02:11:15.617338+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLZGRUAILG4S2RL3","created_at":"2026-07-05T02:11:15.617338+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLZGRUAI","created_at":"2026-07-05T02:11:15.617338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.08496","citing_title":"LLaPa: A Vision-Language Model Framework for Counterfactual-Aware Procedural Planning","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DLZGRUAILG4S2RL3OIHJJFPRCQ","json":"https://pith.science/pith/DLZGRUAILG4S2RL3OIHJJFPRCQ.json","graph_json":"https://pith.science/api/pith-number/DLZGRUAILG4S2RL3OIHJJFPRCQ/graph.json","events_json":"https://pith.science/api/pith-number/DLZGRUAILG4S2RL3OIHJJFPRCQ/events.json","paper":"https://pith.science/paper/DLZGRUAI"},"agent_actions":{"view_html":"https://pith.science/pith/DLZGRUAILG4S2RL3OIHJJFPRCQ","download_json":"https://pith.science/pith/DLZGRUAILG4S2RL3OIHJJFPRCQ.json","view_paper":"https://pith.science/paper/DLZGRUAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.00834&json=true","fetch_graph":"https://pith.science/api/pith-number/DLZGRUAILG4S2RL3OIHJJFPRCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DLZGRUAILG4S2RL3OIHJJFPRCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLZGRUAILG4S2RL3OIHJJFPRCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLZGRUAILG4S2RL3OIHJJFPRCQ/action/storage_attestation","attest_author":"https://pith.science/pith/DLZGRUAILG4S2RL3OIHJJFPRCQ/action/author_attestation","sign_citation":"https://pith.science/pith/DLZGRUAILG4S2RL3OIHJJFPRCQ/action/citation_signature","submit_replication":"https://pith.science/pith/DLZGRUAILG4S2RL3OIHJJFPRCQ/action/replication_record"}},"created_at":"2026-07-05T02:11:15.617338+00:00","updated_at":"2026-07-05T02:11:15.617338+00:00"}