{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:72MAJYYUYE4UDEW7LOIM5E3Q6C","short_pith_number":"pith:72MAJYYU","canonical_record":{"source":{"id":"1901.02577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-09T01:32:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b1814370ab9467955100baafb0741e796ea73a4ed4a4fd9041d9a380535cc4a4","abstract_canon_sha256":"1f13091304607b71743ec907aa6035ef274a5e1d156a5333e4cf212c007e43a0"},"schema_version":"1.0"},"canonical_sha256":"fe9804e314c1394192df5b90ce9370f0be3fea1eab131400e2871ae83b3632cb","source":{"kind":"arxiv","id":"1901.02577","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02577","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02577v1","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02577","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"pith_short_12","alias_value":"72MAJYYUYE4U","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"72MAJYYUYE4UDEW7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"72MAJYYU","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:72MAJYYUYE4UDEW7LOIM5E3Q6C","target":"record","payload":{"canonical_record":{"source":{"id":"1901.02577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-09T01:32:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b1814370ab9467955100baafb0741e796ea73a4ed4a4fd9041d9a380535cc4a4","abstract_canon_sha256":"1f13091304607b71743ec907aa6035ef274a5e1d156a5333e4cf212c007e43a0"},"schema_version":"1.0"},"canonical_sha256":"fe9804e314c1394192df5b90ce9370f0be3fea1eab131400e2871ae83b3632cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:40.095335Z","signature_b64":"jWeQsoX23OhZ26L9AmMM93LGhr6pZ9iBl/C2lgNk6VM6RZqWQmlqcrpKpifaoCsio303ircZcDXo2Q7CpqsfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe9804e314c1394192df5b90ce9370f0be3fea1eab131400e2871ae83b3632cb","last_reissued_at":"2026-05-17T23:56:40.094613Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:40.094613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.02577","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9178gP0yK/ixscL3TYcppBqsysAXWAIzxc1t7e11++ppwsxuSFII6z8SgN9d9MKf7pAnxAMnHe2uhL5clisACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:00:39.288717Z"},"content_sha256":"b11fd1f6dd0bfee74e81c4943b41000dc4b8a5160463fea3f64beb981a170cab","schema_version":"1.0","event_id":"sha256:b11fd1f6dd0bfee74e81c4943b41000dc4b8a5160463fea3f64beb981a170cab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:72MAJYYUYE4UDEW7LOIM5E3Q6C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust and Adaptive Planning under Model Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Apoorva Sharma, James Harrison, Marco Pavone, Matthew Tsao","submitted_at":"2019-01-09T01:32:43Z","abstract_excerpt":"Planning under model uncertainty is a fundamental problem across many applications of decision making and learning. In this paper, we propose the Robust Adaptive Monte Carlo Planning (RAMCP) algorithm, which allows computation of risk-sensitive Bayes-adaptive policies that optimally trade off exploration, exploitation, and robustness. RAMCP formulates the risk-sensitive planning problem as a two-player zero-sum game, in which an adversary perturbs the agent's belief over the models. We introduce two versions of the RAMCP algorithm. The first, RAMCP-F, converges to an optimal risk-sensitive pol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02577","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a83xhzFAnoHq3gs2xOKS2Flr2UF0womB9KD60qW0DojdrRtLP+WWJtQC00baYYF+H5LV/59yNVuUlUL8/QEsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:00:39.289350Z"},"content_sha256":"2fcf51d1958d9fcafa43d1e4964b5c4747c411ce0f3d9d26d5dd85f80d082017","schema_version":"1.0","event_id":"sha256:2fcf51d1958d9fcafa43d1e4964b5c4747c411ce0f3d9d26d5dd85f80d082017"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72MAJYYUYE4UDEW7LOIM5E3Q6C/bundle.json","state_url":"https://pith.science/pith/72MAJYYUYE4UDEW7LOIM5E3Q6C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72MAJYYUYE4UDEW7LOIM5E3Q6C/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T03:00:39Z","links":{"resolver":"https://pith.science/pith/72MAJYYUYE4UDEW7LOIM5E3Q6C","bundle":"https://pith.science/pith/72MAJYYUYE4UDEW7LOIM5E3Q6C/bundle.json","state":"https://pith.science/pith/72MAJYYUYE4UDEW7LOIM5E3Q6C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72MAJYYUYE4UDEW7LOIM5E3Q6C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:72MAJYYUYE4UDEW7LOIM5E3Q6C","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1f13091304607b71743ec907aa6035ef274a5e1d156a5333e4cf212c007e43a0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-09T01:32:43Z","title_canon_sha256":"b1814370ab9467955100baafb0741e796ea73a4ed4a4fd9041d9a380535cc4a4"},"schema_version":"1.0","source":{"id":"1901.02577","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02577","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02577v1","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02577","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"pith_short_12","alias_value":"72MAJYYUYE4U","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"72MAJYYUYE4UDEW7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"72MAJYYU","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:2fcf51d1958d9fcafa43d1e4964b5c4747c411ce0f3d9d26d5dd85f80d082017","target":"graph","created_at":"2026-05-17T23:56:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Planning under model uncertainty is a fundamental problem across many applications of decision making and learning. In this paper, we propose the Robust Adaptive Monte Carlo Planning (RAMCP) algorithm, which allows computation of risk-sensitive Bayes-adaptive policies that optimally trade off exploration, exploitation, and robustness. RAMCP formulates the risk-sensitive planning problem as a two-player zero-sum game, in which an adversary perturbs the agent's belief over the models. We introduce two versions of the RAMCP algorithm. The first, RAMCP-F, converges to an optimal risk-sensitive pol","authors_text":"Apoorva Sharma, James Harrison, Marco Pavone, Matthew Tsao","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-09T01:32:43Z","title":"Robust and Adaptive Planning under Model Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02577","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b11fd1f6dd0bfee74e81c4943b41000dc4b8a5160463fea3f64beb981a170cab","target":"record","created_at":"2026-05-17T23:56:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1f13091304607b71743ec907aa6035ef274a5e1d156a5333e4cf212c007e43a0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-09T01:32:43Z","title_canon_sha256":"b1814370ab9467955100baafb0741e796ea73a4ed4a4fd9041d9a380535cc4a4"},"schema_version":"1.0","source":{"id":"1901.02577","kind":"arxiv","version":1}},"canonical_sha256":"fe9804e314c1394192df5b90ce9370f0be3fea1eab131400e2871ae83b3632cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe9804e314c1394192df5b90ce9370f0be3fea1eab131400e2871ae83b3632cb","first_computed_at":"2026-05-17T23:56:40.094613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:40.094613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jWeQsoX23OhZ26L9AmMM93LGhr6pZ9iBl/C2lgNk6VM6RZqWQmlqcrpKpifaoCsio303ircZcDXo2Q7CpqsfBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:40.095335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02577","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b11fd1f6dd0bfee74e81c4943b41000dc4b8a5160463fea3f64beb981a170cab","sha256:2fcf51d1958d9fcafa43d1e4964b5c4747c411ce0f3d9d26d5dd85f80d082017"],"state_sha256":"288e78a7b9c82915c58caaddeecd36110198092137480b47021608b2b8d7801e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2/vO5af8MAWBBaH7yqdRyymuD8fo0c2jW2MqshcR4+bFaOkYUprZ/SSleniKxubsjIwmRgcLYzumsaCtqXLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:00:39.291718Z","bundle_sha256":"9358e10ea5ba5c6adafc9a5f7fa66d6415ee0f63e4c8cb999807ed8da1ecfa6a"}}