{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KW3X635GVEOAGEFHG2WFQHBKJQ","short_pith_number":"pith:KW3X635G","canonical_record":{"source":{"id":"1905.04020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-05-10T09:06:50Z","cross_cats_sorted":[],"title_canon_sha256":"2500a79f72fcdff4535b060a964701b361e6e344eefe23ebf00d5f60d80ea00a","abstract_canon_sha256":"1e31d52edc94b74655c65c452e07aafbdb773b1c00519737325e35dcb3ec217c"},"schema_version":"1.0"},"canonical_sha256":"55b77f6fa6a91c0310a736ac581c2a4c2219f29a91ab83652520ada126583bd5","source":{"kind":"arxiv","id":"1905.04020","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04020","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04020v1","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04020","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"pith_short_12","alias_value":"KW3X635GVEOA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KW3X635GVEOAGEFH","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KW3X635G","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KW3X635GVEOAGEFHG2WFQHBKJQ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-05-10T09:06:50Z","cross_cats_sorted":[],"title_canon_sha256":"2500a79f72fcdff4535b060a964701b361e6e344eefe23ebf00d5f60d80ea00a","abstract_canon_sha256":"1e31d52edc94b74655c65c452e07aafbdb773b1c00519737325e35dcb3ec217c"},"schema_version":"1.0"},"canonical_sha256":"55b77f6fa6a91c0310a736ac581c2a4c2219f29a91ab83652520ada126583bd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:34.851013Z","signature_b64":"+azViuwg/IQOHWmvdL909/uFVamF8XpI9QToAcVEUcmoR6+R/4ItDz5rJgYoBzHA0HAihRcbh6XvUHAEx2mgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55b77f6fa6a91c0310a736ac581c2a4c2219f29a91ab83652520ada126583bd5","last_reissued_at":"2026-05-17T23:46:34.850394Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:34.850394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04020","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:46:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y0TSS2Sp6FClVh1/lsBblnT54xxjVSlPCx/Rsdr1sq/YRRMmStYflhBfJrjMEtivsuQUq1EUeXKVKDt0HgemDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:54:19.875220Z"},"content_sha256":"191a30302aeb27331553ed0640184d3a3e20c71f91748dc9fee86b07eb0d124e","schema_version":"1.0","event_id":"sha256:191a30302aeb27331553ed0640184d3a3e20c71f91748dc9fee86b07eb0d124e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KW3X635GVEOAGEFHG2WFQHBKJQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory Bounded Open-Loop Planning in Large POMDPs using Thompson Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Claudia Linnhoff-Popien, Kyrill Schmid, Lenz Belzner, Marie Kiermeier, Markus Friedrich, Thomy Phan","submitted_at":"2019-05-10T09:06:50Z","abstract_excerpt":"State-of-the-art approaches to partially observable planning like POMCP are based on stochastic tree search. While these approaches are computationally efficient, they may still construct search trees of considerable size, which could limit the performance due to restricted memory resources. In this paper, we propose Partially Observable Stacked Thompson Sampling (POSTS), a memory bounded approach to open-loop planning in large POMDPs, which optimizes a fixed size stack of Thompson Sampling bandits. We empirically evaluate POSTS in four large benchmark problems and compare its performance with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04020","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:46:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UyzG2koa73ajUQ19e+Tu23ScavaMD5NOsrUdt7npxzldaLqsSRproLJvwTmv/VvqYFOROpGgp2u5Miy5qVv3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:54:19.875909Z"},"content_sha256":"2f72c8c21c0e559305e8dcfab2039fd7f6637d63613a884e24e82fac3ac3b6f3","schema_version":"1.0","event_id":"sha256:2f72c8c21c0e559305e8dcfab2039fd7f6637d63613a884e24e82fac3ac3b6f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KW3X635GVEOAGEFHG2WFQHBKJQ/bundle.json","state_url":"https://pith.science/pith/KW3X635GVEOAGEFHG2WFQHBKJQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KW3X635GVEOAGEFHG2WFQHBKJQ/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-05-25T19:54:19Z","links":{"resolver":"https://pith.science/pith/KW3X635GVEOAGEFHG2WFQHBKJQ","bundle":"https://pith.science/pith/KW3X635GVEOAGEFHG2WFQHBKJQ/bundle.json","state":"https://pith.science/pith/KW3X635GVEOAGEFHG2WFQHBKJQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KW3X635GVEOAGEFHG2WFQHBKJQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KW3X635GVEOAGEFHG2WFQHBKJQ","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":"1e31d52edc94b74655c65c452e07aafbdb773b1c00519737325e35dcb3ec217c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-05-10T09:06:50Z","title_canon_sha256":"2500a79f72fcdff4535b060a964701b361e6e344eefe23ebf00d5f60d80ea00a"},"schema_version":"1.0","source":{"id":"1905.04020","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04020","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04020v1","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04020","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"pith_short_12","alias_value":"KW3X635GVEOA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KW3X635GVEOAGEFH","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KW3X635G","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:2f72c8c21c0e559305e8dcfab2039fd7f6637d63613a884e24e82fac3ac3b6f3","target":"graph","created_at":"2026-05-17T23:46:34Z","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":"State-of-the-art approaches to partially observable planning like POMCP are based on stochastic tree search. While these approaches are computationally efficient, they may still construct search trees of considerable size, which could limit the performance due to restricted memory resources. In this paper, we propose Partially Observable Stacked Thompson Sampling (POSTS), a memory bounded approach to open-loop planning in large POMDPs, which optimizes a fixed size stack of Thompson Sampling bandits. We empirically evaluate POSTS in four large benchmark problems and compare its performance with","authors_text":"Claudia Linnhoff-Popien, Kyrill Schmid, Lenz Belzner, Marie Kiermeier, Markus Friedrich, Thomy Phan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-05-10T09:06:50Z","title":"Memory Bounded Open-Loop Planning in Large POMDPs using Thompson Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04020","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:191a30302aeb27331553ed0640184d3a3e20c71f91748dc9fee86b07eb0d124e","target":"record","created_at":"2026-05-17T23:46:34Z","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":"1e31d52edc94b74655c65c452e07aafbdb773b1c00519737325e35dcb3ec217c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-05-10T09:06:50Z","title_canon_sha256":"2500a79f72fcdff4535b060a964701b361e6e344eefe23ebf00d5f60d80ea00a"},"schema_version":"1.0","source":{"id":"1905.04020","kind":"arxiv","version":1}},"canonical_sha256":"55b77f6fa6a91c0310a736ac581c2a4c2219f29a91ab83652520ada126583bd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55b77f6fa6a91c0310a736ac581c2a4c2219f29a91ab83652520ada126583bd5","first_computed_at":"2026-05-17T23:46:34.850394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:34.850394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+azViuwg/IQOHWmvdL909/uFVamF8XpI9QToAcVEUcmoR6+R/4ItDz5rJgYoBzHA0HAihRcbh6XvUHAEx2mgCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:34.851013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04020","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:191a30302aeb27331553ed0640184d3a3e20c71f91748dc9fee86b07eb0d124e","sha256:2f72c8c21c0e559305e8dcfab2039fd7f6637d63613a884e24e82fac3ac3b6f3"],"state_sha256":"d48176c41065d8ddf0ff17900a0629321926246f67b3874a6f5624b06408fcf9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SvLCXAl2/8e/ze7BlpUgpczM7ncOtxNLEZpzhNy98Yp8tGciiPdU/ISk7lKMPuqzQ4RtYGnbCyM+hgXQoko9Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:54:19.879397Z","bundle_sha256":"09720bf2d9ecb57ee13355252f92e762832f77dc4d8aa7465cde6d33a9277db2"}}