{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Q5C6FAFAWH43ES5D6CYCPG473K","short_pith_number":"pith:Q5C6FAFA","schema_version":"1.0","canonical_sha256":"8745e280a0b1f9b24ba3f0b0279b9fdab496bd69076c9bb8bcfd84dfc0d583d7","source":{"kind":"arxiv","id":"1203.3474","version":1},"attestation_state":"computed","paper":{"title":"Distribution over Beliefs for Memory Bounded Dec-POMDP Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Francois Charpillet, Gabriel Corona","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"We propose a new point-based method for approximate planning in Dec-POMDP which outperforms the state-of-the-art approaches in terms of solution quality. It uses a heuristic estimation of the prior probability of beliefs to choose a bounded number of policy trees: this choice is formulated as a combinatorial optimisation problem minimising the error induced by pruning."},"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":"1203.3474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"19735d2e283dcf124703c21c460fe357c8e65cb1d5140c8cc74ac7d292f111fb","abstract_canon_sha256":"ad9989f5da59462406c7e4e3a509019af3674c53a902997152176388fc59dbac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:00.457978Z","signature_b64":"BKJlezpIgnOBpGlCKyZ1bG0TG2IamwblzFq5BadtITj4jQ8lT7ouopCf1iLCb8Y/16qdjcF3/ccPAtsc3k0nCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8745e280a0b1f9b24ba3f0b0279b9fdab496bd69076c9bb8bcfd84dfc0d583d7","last_reissued_at":"2026-05-18T04:00:00.457437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:00.457437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distribution over Beliefs for Memory Bounded Dec-POMDP Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Francois Charpillet, Gabriel Corona","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"We propose a new point-based method for approximate planning in Dec-POMDP which outperforms the state-of-the-art approaches in terms of solution quality. It uses a heuristic estimation of the prior probability of beliefs to choose a bounded number of policy trees: this choice is formulated as a combinatorial optimisation problem minimising the error induced by pruning."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3474","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":"1203.3474","created_at":"2026-05-18T04:00:00.457530+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.3474v1","created_at":"2026-05-18T04:00:00.457530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3474","created_at":"2026-05-18T04:00:00.457530+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5C6FAFAWH43","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5C6FAFAWH43ES5D","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5C6FAFA","created_at":"2026-05-18T12:27:18.751474+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/Q5C6FAFAWH43ES5D6CYCPG473K","json":"https://pith.science/pith/Q5C6FAFAWH43ES5D6CYCPG473K.json","graph_json":"https://pith.science/api/pith-number/Q5C6FAFAWH43ES5D6CYCPG473K/graph.json","events_json":"https://pith.science/api/pith-number/Q5C6FAFAWH43ES5D6CYCPG473K/events.json","paper":"https://pith.science/paper/Q5C6FAFA"},"agent_actions":{"view_html":"https://pith.science/pith/Q5C6FAFAWH43ES5D6CYCPG473K","download_json":"https://pith.science/pith/Q5C6FAFAWH43ES5D6CYCPG473K.json","view_paper":"https://pith.science/paper/Q5C6FAFA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.3474&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5C6FAFAWH43ES5D6CYCPG473K/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5C6FAFAWH43ES5D6CYCPG473K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5C6FAFAWH43ES5D6CYCPG473K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5C6FAFAWH43ES5D6CYCPG473K/action/storage_attestation","attest_author":"https://pith.science/pith/Q5C6FAFAWH43ES5D6CYCPG473K/action/author_attestation","sign_citation":"https://pith.science/pith/Q5C6FAFAWH43ES5D6CYCPG473K/action/citation_signature","submit_replication":"https://pith.science/pith/Q5C6FAFAWH43ES5D6CYCPG473K/action/replication_record"}},"created_at":"2026-05-18T04:00:00.457530+00:00","updated_at":"2026-05-18T04:00:00.457530+00:00"}