{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SGG6MY7ALMK2AB6MVCG6NAXEDR","short_pith_number":"pith:SGG6MY7A","schema_version":"1.0","canonical_sha256":"918de663e05b15a007cca88de682e41c680d9efeaef6991b31cb8cb456c5db9d","source":{"kind":"arxiv","id":"1907.09673","version":1},"attestation_state":"computed","paper":{"title":"Multilevel Monte-Carlo for Solving POMDPs Online","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alberto Elfes, Hanna Kurniawati, Marcus Hoerger","submitted_at":"2019-07-23T03:13:23Z","abstract_excerpt":"Planning under partial obervability is essential for autonomous robots. A principled way to address such planning problems is the Partially Observable Markov Decision Process (POMDP). Although solving POMDPs is computationally intractable, substantial advancements have been achieved in developing approximate POMDP solvers in the past two decades. However, computing robust solutions for systems with complex dynamics remain challenging. Most on-line solvers rely on a large number of forward-simulations and standard Monte-Carlo methods to compute the expected outcomes of actions the robot can per"},"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":"1907.09673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-07-23T03:13:23Z","cross_cats_sorted":[],"title_canon_sha256":"7e422891a368858a6bbabaf06ea710361dff9d3be98a1fa89da483b588141711","abstract_canon_sha256":"f31d65fd63fa2d1ead8592f32015b1b10aa3b4c2ceb889beb5fa599d5284b3f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:50.433558Z","signature_b64":"cvErKcnM7JeA77P/Wfi5F4/+8uxq7xdMe7ZxZx+0R//UNHO3w5F7QpXbB0pHzW3SWW23dD5e/4+oBhb4EV+oBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"918de663e05b15a007cca88de682e41c680d9efeaef6991b31cb8cb456c5db9d","last_reissued_at":"2026-05-17T23:39:50.432849Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:50.432849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multilevel Monte-Carlo for Solving POMDPs Online","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alberto Elfes, Hanna Kurniawati, Marcus Hoerger","submitted_at":"2019-07-23T03:13:23Z","abstract_excerpt":"Planning under partial obervability is essential for autonomous robots. A principled way to address such planning problems is the Partially Observable Markov Decision Process (POMDP). Although solving POMDPs is computationally intractable, substantial advancements have been achieved in developing approximate POMDP solvers in the past two decades. However, computing robust solutions for systems with complex dynamics remain challenging. Most on-line solvers rely on a large number of forward-simulations and standard Monte-Carlo methods to compute the expected outcomes of actions the robot can per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09673","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":"1907.09673","created_at":"2026-05-17T23:39:50.432963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09673v1","created_at":"2026-05-17T23:39:50.432963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09673","created_at":"2026-05-17T23:39:50.432963+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGG6MY7ALMK2","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGG6MY7ALMK2AB6M","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGG6MY7A","created_at":"2026-05-18T12:33:27.125529+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/SGG6MY7ALMK2AB6MVCG6NAXEDR","json":"https://pith.science/pith/SGG6MY7ALMK2AB6MVCG6NAXEDR.json","graph_json":"https://pith.science/api/pith-number/SGG6MY7ALMK2AB6MVCG6NAXEDR/graph.json","events_json":"https://pith.science/api/pith-number/SGG6MY7ALMK2AB6MVCG6NAXEDR/events.json","paper":"https://pith.science/paper/SGG6MY7A"},"agent_actions":{"view_html":"https://pith.science/pith/SGG6MY7ALMK2AB6MVCG6NAXEDR","download_json":"https://pith.science/pith/SGG6MY7ALMK2AB6MVCG6NAXEDR.json","view_paper":"https://pith.science/paper/SGG6MY7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09673&json=true","fetch_graph":"https://pith.science/api/pith-number/SGG6MY7ALMK2AB6MVCG6NAXEDR/graph.json","fetch_events":"https://pith.science/api/pith-number/SGG6MY7ALMK2AB6MVCG6NAXEDR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGG6MY7ALMK2AB6MVCG6NAXEDR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGG6MY7ALMK2AB6MVCG6NAXEDR/action/storage_attestation","attest_author":"https://pith.science/pith/SGG6MY7ALMK2AB6MVCG6NAXEDR/action/author_attestation","sign_citation":"https://pith.science/pith/SGG6MY7ALMK2AB6MVCG6NAXEDR/action/citation_signature","submit_replication":"https://pith.science/pith/SGG6MY7ALMK2AB6MVCG6NAXEDR/action/replication_record"}},"created_at":"2026-05-17T23:39:50.432963+00:00","updated_at":"2026-05-17T23:39:50.432963+00:00"}