{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Q5G6VDBKLNTUP56TH25CSFJOR4","short_pith_number":"pith:Q5G6VDBK","schema_version":"1.0","canonical_sha256":"874dea8c2a5b6747f7d33eba29152e8f0b756a0f342b2cb6bcd9836f46badb7a","source":{"kind":"arxiv","id":"2310.20054","version":2},"attestation_state":"computed","paper":{"title":"Constrained Hierarchical Monte Carlo Belief-State Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Anthony Corso, Arec Jamgochian, Hugo Buurmeijer, Kyle H. Wray, Mykel J. Kochenderfer","submitted_at":"2023-10-30T22:16:53Z","abstract_excerpt":"Optimal plans in Constrained Partially Observable Markov Decision Processes (CPOMDPs) maximize reward objectives while satisfying hard cost constraints, generalizing safe planning under state and transition uncertainty. Unfortunately, online CPOMDP planning is extremely difficult in large or continuous problem domains. In many large robotic domains, hierarchical decomposition can simplify planning by using tools for low-level control given high-level action primitives (options). We introduce Constrained Options Belief Tree Search (COBeTS) to leverage this hierarchy and scale online search-base"},"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":"2310.20054","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-10-30T22:16:53Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"20af83e4a5fbb8a03427570f2269c3aa2e8c6cb77be77e60e7de6fb32237d1a5","abstract_canon_sha256":"721bb3e7b6f80d0b115fba72fcea5739e5908600f379d56398c610379a1972ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:49:15.672676Z","signature_b64":"ORR3ulOKJmrG7dDVU8W+yRyn29Gi2GhtIDbxYZbqB6ybyQDBKWA/MO5uGoETIxTO6yluphJ/FTyKRUzEjorUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"874dea8c2a5b6747f7d33eba29152e8f0b756a0f342b2cb6bcd9836f46badb7a","last_reissued_at":"2026-07-05T07:49:15.672254Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:49:15.672254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Hierarchical Monte Carlo Belief-State Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Anthony Corso, Arec Jamgochian, Hugo Buurmeijer, Kyle H. Wray, Mykel J. Kochenderfer","submitted_at":"2023-10-30T22:16:53Z","abstract_excerpt":"Optimal plans in Constrained Partially Observable Markov Decision Processes (CPOMDPs) maximize reward objectives while satisfying hard cost constraints, generalizing safe planning under state and transition uncertainty. Unfortunately, online CPOMDP planning is extremely difficult in large or continuous problem domains. In many large robotic domains, hierarchical decomposition can simplify planning by using tools for low-level control given high-level action primitives (options). We introduce Constrained Options Belief Tree Search (COBeTS) to leverage this hierarchy and scale online search-base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.20054","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/2310.20054/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2310.20054","created_at":"2026-07-05T07:49:15.672322+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.20054v2","created_at":"2026-07-05T07:49:15.672322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.20054","created_at":"2026-07-05T07:49:15.672322+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5G6VDBKLNTU","created_at":"2026-07-05T07:49:15.672322+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5G6VDBKLNTUP56T","created_at":"2026-07-05T07:49:15.672322+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5G6VDBK","created_at":"2026-07-05T07:49:15.672322+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/Q5G6VDBKLNTUP56TH25CSFJOR4","json":"https://pith.science/pith/Q5G6VDBKLNTUP56TH25CSFJOR4.json","graph_json":"https://pith.science/api/pith-number/Q5G6VDBKLNTUP56TH25CSFJOR4/graph.json","events_json":"https://pith.science/api/pith-number/Q5G6VDBKLNTUP56TH25CSFJOR4/events.json","paper":"https://pith.science/paper/Q5G6VDBK"},"agent_actions":{"view_html":"https://pith.science/pith/Q5G6VDBKLNTUP56TH25CSFJOR4","download_json":"https://pith.science/pith/Q5G6VDBKLNTUP56TH25CSFJOR4.json","view_paper":"https://pith.science/paper/Q5G6VDBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.20054&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5G6VDBKLNTUP56TH25CSFJOR4/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5G6VDBKLNTUP56TH25CSFJOR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5G6VDBKLNTUP56TH25CSFJOR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5G6VDBKLNTUP56TH25CSFJOR4/action/storage_attestation","attest_author":"https://pith.science/pith/Q5G6VDBKLNTUP56TH25CSFJOR4/action/author_attestation","sign_citation":"https://pith.science/pith/Q5G6VDBKLNTUP56TH25CSFJOR4/action/citation_signature","submit_replication":"https://pith.science/pith/Q5G6VDBKLNTUP56TH25CSFJOR4/action/replication_record"}},"created_at":"2026-07-05T07:49:15.672322+00:00","updated_at":"2026-07-05T07:49:15.672322+00:00"}