{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:B67Y7VLNKKJDWCYQUEEZCHIW3V","short_pith_number":"pith:B67Y7VLN","canonical_record":{"source":{"id":"2201.11404","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-01-27T09:41:59Z","cross_cats_sorted":[],"title_canon_sha256":"d6cd006f437c8f0f4c89bf879e2c8150b76e8d7191c06af62bc11ed3e5ac92c0","abstract_canon_sha256":"3e547f2c4e2b56c7659ef71f8b8bf2c4dd089ed031ba4476f109545ee56b0b78"},"schema_version":"1.0"},"canonical_sha256":"0fbf8fd56d52923b0b10a109911d16dd4162d1ae2bda3394bd4f63d96f49964f","source":{"kind":"arxiv","id":"2201.11404","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.11404","created_at":"2026-07-05T05:24:35Z"},{"alias_kind":"arxiv_version","alias_value":"2201.11404v2","created_at":"2026-07-05T05:24:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.11404","created_at":"2026-07-05T05:24:35Z"},{"alias_kind":"pith_short_12","alias_value":"B67Y7VLNKKJD","created_at":"2026-07-05T05:24:35Z"},{"alias_kind":"pith_short_16","alias_value":"B67Y7VLNKKJDWCYQ","created_at":"2026-07-05T05:24:35Z"},{"alias_kind":"pith_short_8","alias_value":"B67Y7VLN","created_at":"2026-07-05T05:24:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:B67Y7VLNKKJDWCYQUEEZCHIW3V","target":"record","payload":{"canonical_record":{"source":{"id":"2201.11404","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-01-27T09:41:59Z","cross_cats_sorted":[],"title_canon_sha256":"d6cd006f437c8f0f4c89bf879e2c8150b76e8d7191c06af62bc11ed3e5ac92c0","abstract_canon_sha256":"3e547f2c4e2b56c7659ef71f8b8bf2c4dd089ed031ba4476f109545ee56b0b78"},"schema_version":"1.0"},"canonical_sha256":"0fbf8fd56d52923b0b10a109911d16dd4162d1ae2bda3394bd4f63d96f49964f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:24:35.215242Z","signature_b64":"cHY6my1LolPMLAx6jm/s/o92p1mzsPiC6CSdCV4DTKbR/ZdD0+iDYPFcVIyvp/ka3syLaKeF+eFo9zgkyaaGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fbf8fd56d52923b0b10a109911d16dd4162d1ae2bda3394bd4f63d96f49964f","last_reissued_at":"2026-07-05T05:24:35.214762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:24:35.214762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.11404","source_version":2,"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-07-05T05:24:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DDBaT/bMSCxHK87Yt78jRfO6ldhMv+pW78ulgXwnnL/2w5yHaQyNJjcW0WGPutjipsKV+R3+wgQtHWg8ICZABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T06:32:04.234396Z"},"content_sha256":"33603745275d7de92cb61495b5c7b6a17822076a309a5c7619ef40d1dabae0f5","schema_version":"1.0","event_id":"sha256:33603745275d7de92cb61495b5c7b6a17822076a309a5c7619ef40d1dabae0f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:B67Y7VLNKKJDWCYQUEEZCHIW3V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Planning in POMDPs with Self-Improving Simulators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Frans A. Oliehoek, Hendrik Baier, Jinke He, Michael Kaisers, Miguel Suau","submitted_at":"2022-01-27T09:41:59Z","abstract_excerpt":"How can we plan efficiently in a large and complex environment when the time budget is limited? Given the original simulator of the environment, which may be computationally very demanding, we propose to learn online an approximate but much faster simulator that improves over time. To plan reliably and efficiently while the approximate simulator is learning, we develop a method that adaptively decides which simulator to use for every simulation, based on a statistic that measures the accuracy of the approximate simulator. This allows us to use the approximate simulator to replace the original "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.11404","kind":"arxiv","version":2},"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/2201.11404/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"},"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-07-05T05:24:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2xC0tct4YV7d9olPtJBJxy2LH+eBbrOkf2XQSkhv1KspWkaf+PtizjlvyxEz9W8ajC6b5jy4qpOnKYTGk6uDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T06:32:04.234771Z"},"content_sha256":"8f79ff9b3f8d4cda0ee7693b85cde1b0ebc3880f4aceff7444898d0d205fec4d","schema_version":"1.0","event_id":"sha256:8f79ff9b3f8d4cda0ee7693b85cde1b0ebc3880f4aceff7444898d0d205fec4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B67Y7VLNKKJDWCYQUEEZCHIW3V/bundle.json","state_url":"https://pith.science/pith/B67Y7VLNKKJDWCYQUEEZCHIW3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B67Y7VLNKKJDWCYQUEEZCHIW3V/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-08-20T06:32:04Z","links":{"resolver":"https://pith.science/pith/B67Y7VLNKKJDWCYQUEEZCHIW3V","bundle":"https://pith.science/pith/B67Y7VLNKKJDWCYQUEEZCHIW3V/bundle.json","state":"https://pith.science/pith/B67Y7VLNKKJDWCYQUEEZCHIW3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B67Y7VLNKKJDWCYQUEEZCHIW3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:B67Y7VLNKKJDWCYQUEEZCHIW3V","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":"3e547f2c4e2b56c7659ef71f8b8bf2c4dd089ed031ba4476f109545ee56b0b78","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-01-27T09:41:59Z","title_canon_sha256":"d6cd006f437c8f0f4c89bf879e2c8150b76e8d7191c06af62bc11ed3e5ac92c0"},"schema_version":"1.0","source":{"id":"2201.11404","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.11404","created_at":"2026-07-05T05:24:35Z"},{"alias_kind":"arxiv_version","alias_value":"2201.11404v2","created_at":"2026-07-05T05:24:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.11404","created_at":"2026-07-05T05:24:35Z"},{"alias_kind":"pith_short_12","alias_value":"B67Y7VLNKKJD","created_at":"2026-07-05T05:24:35Z"},{"alias_kind":"pith_short_16","alias_value":"B67Y7VLNKKJDWCYQ","created_at":"2026-07-05T05:24:35Z"},{"alias_kind":"pith_short_8","alias_value":"B67Y7VLN","created_at":"2026-07-05T05:24:35Z"}],"graph_snapshots":[{"event_id":"sha256:8f79ff9b3f8d4cda0ee7693b85cde1b0ebc3880f4aceff7444898d0d205fec4d","target":"graph","created_at":"2026-07-05T05:24:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2201.11404/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"How can we plan efficiently in a large and complex environment when the time budget is limited? Given the original simulator of the environment, which may be computationally very demanding, we propose to learn online an approximate but much faster simulator that improves over time. To plan reliably and efficiently while the approximate simulator is learning, we develop a method that adaptively decides which simulator to use for every simulation, based on a statistic that measures the accuracy of the approximate simulator. This allows us to use the approximate simulator to replace the original ","authors_text":"Frans A. Oliehoek, Hendrik Baier, Jinke He, Michael Kaisers, Miguel Suau","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-01-27T09:41:59Z","title":"Online Planning in POMDPs with Self-Improving Simulators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.11404","kind":"arxiv","version":2},"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:33603745275d7de92cb61495b5c7b6a17822076a309a5c7619ef40d1dabae0f5","target":"record","created_at":"2026-07-05T05:24:35Z","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":"3e547f2c4e2b56c7659ef71f8b8bf2c4dd089ed031ba4476f109545ee56b0b78","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-01-27T09:41:59Z","title_canon_sha256":"d6cd006f437c8f0f4c89bf879e2c8150b76e8d7191c06af62bc11ed3e5ac92c0"},"schema_version":"1.0","source":{"id":"2201.11404","kind":"arxiv","version":2}},"canonical_sha256":"0fbf8fd56d52923b0b10a109911d16dd4162d1ae2bda3394bd4f63d96f49964f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fbf8fd56d52923b0b10a109911d16dd4162d1ae2bda3394bd4f63d96f49964f","first_computed_at":"2026-07-05T05:24:35.214762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:24:35.214762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cHY6my1LolPMLAx6jm/s/o92p1mzsPiC6CSdCV4DTKbR/ZdD0+iDYPFcVIyvp/ka3syLaKeF+eFo9zgkyaaGBw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:24:35.215242Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.11404","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33603745275d7de92cb61495b5c7b6a17822076a309a5c7619ef40d1dabae0f5","sha256:8f79ff9b3f8d4cda0ee7693b85cde1b0ebc3880f4aceff7444898d0d205fec4d"],"state_sha256":"9cfad7144b7c24fc9c9e1a40a5b1b3e801017b0af1eb20089ce7a731e65e25e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qxdZE1YRkz4gH7pDwm/jd6lni1w9uJBE0WAvZl4InkSxmohNSaSFvh3aznGTRytB3NdyYMGtZO4at1YipnD6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T06:32:04.237471Z","bundle_sha256":"575ac50725349c030c9589ad5a1436d6e51b6516dd0617b0e8aa013bee6c606f"}}