{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CH7IDKUJ6QWECULX7RYQOAW4A7","short_pith_number":"pith:CH7IDKUJ","schema_version":"1.0","canonical_sha256":"11fe81aa89f42c415177fc710702dc07feeca3b97ca80e78d87670bb5dc12207","source":{"kind":"arxiv","id":"1212.2502","version":1},"attestation_state":"computed","paper":{"title":"Optimal Limited Contingency Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David Smith, Nicolas Meuleau","submitted_at":"2012-10-19T15:07:02Z","abstract_excerpt":"For a given problem, the optimal Markov policy can be considerred as a     conditional or contingent plan containing a (potentially large) number of     branches. Unfortunately, there are applications where it is desirable to     strictly limit the number of decision points and branches in a plan. For     example, it may be that plans must later undergo more detailed simulation to     verify correctness and safety, or that they must be simple enough to be     understood and analyzed by humans. As a result, it may be necessary to limit     consideration to plans with only a small number of bran"},"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":"1212.2502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:07:02Z","cross_cats_sorted":[],"title_canon_sha256":"1c6ac841b12e5c60cb173e1f63fa0a3721c7b8710f925eec4cf39dc9acd79981","abstract_canon_sha256":"d1189cd60fdf426ec7369f2ba7abafa170c0b568aa3d5ca1cd6d56fb86ac5900"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:44.501668Z","signature_b64":"FwkrBCHpkIhiACnQQrt1XGz3WVEOZt6zvecRw2RQOZm6iH4j4C3SZjIoE9H/ZzHI2MVpTef1F2WYY6DeJlZSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11fe81aa89f42c415177fc710702dc07feeca3b97ca80e78d87670bb5dc12207","last_reissued_at":"2026-05-18T03:38:44.500963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:44.500963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Limited Contingency Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David Smith, Nicolas Meuleau","submitted_at":"2012-10-19T15:07:02Z","abstract_excerpt":"For a given problem, the optimal Markov policy can be considerred as a     conditional or contingent plan containing a (potentially large) number of     branches. Unfortunately, there are applications where it is desirable to     strictly limit the number of decision points and branches in a plan. For     example, it may be that plans must later undergo more detailed simulation to     verify correctness and safety, or that they must be simple enough to be     understood and analyzed by humans. As a result, it may be necessary to limit     consideration to plans with only a small number of bran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2502","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":"1212.2502","created_at":"2026-05-18T03:38:44.501087+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.2502v1","created_at":"2026-05-18T03:38:44.501087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2502","created_at":"2026-05-18T03:38:44.501087+00:00"},{"alias_kind":"pith_short_12","alias_value":"CH7IDKUJ6QWE","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CH7IDKUJ6QWECULX","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CH7IDKUJ","created_at":"2026-05-18T12:27:01.376967+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/CH7IDKUJ6QWECULX7RYQOAW4A7","json":"https://pith.science/pith/CH7IDKUJ6QWECULX7RYQOAW4A7.json","graph_json":"https://pith.science/api/pith-number/CH7IDKUJ6QWECULX7RYQOAW4A7/graph.json","events_json":"https://pith.science/api/pith-number/CH7IDKUJ6QWECULX7RYQOAW4A7/events.json","paper":"https://pith.science/paper/CH7IDKUJ"},"agent_actions":{"view_html":"https://pith.science/pith/CH7IDKUJ6QWECULX7RYQOAW4A7","download_json":"https://pith.science/pith/CH7IDKUJ6QWECULX7RYQOAW4A7.json","view_paper":"https://pith.science/paper/CH7IDKUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.2502&json=true","fetch_graph":"https://pith.science/api/pith-number/CH7IDKUJ6QWECULX7RYQOAW4A7/graph.json","fetch_events":"https://pith.science/api/pith-number/CH7IDKUJ6QWECULX7RYQOAW4A7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CH7IDKUJ6QWECULX7RYQOAW4A7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CH7IDKUJ6QWECULX7RYQOAW4A7/action/storage_attestation","attest_author":"https://pith.science/pith/CH7IDKUJ6QWECULX7RYQOAW4A7/action/author_attestation","sign_citation":"https://pith.science/pith/CH7IDKUJ6QWECULX7RYQOAW4A7/action/citation_signature","submit_replication":"https://pith.science/pith/CH7IDKUJ6QWECULX7RYQOAW4A7/action/replication_record"}},"created_at":"2026-05-18T03:38:44.501087+00:00","updated_at":"2026-05-18T03:38:44.501087+00:00"}