{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:U5GTAHLMHQC2IS5DDSLR2FE4DD","short_pith_number":"pith:U5GTAHLM","schema_version":"1.0","canonical_sha256":"a74d301d6c3c05a44ba31c971d149c18dbc3830245c0f7ae25f49cd7657e314e","source":{"kind":"arxiv","id":"2507.04646","version":1},"attestation_state":"computed","paper":{"title":"Feature-Based Belief Aggregation for Partially Observable Markov Decision Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Dimitri Bertsekas, Kim Hammar, Yuchao Li","submitted_at":"2025-07-07T03:59:31Z","abstract_excerpt":"We consider a finite-state partially observable Markov decision problem (POMDP) with an infinite horizon and a discounted cost, and we propose a new method for computing a cost function approximation that is based on features and aggregation. In particular, using the classical belief-space formulation, we construct a related Markov decision problem (MDP) by first aggregating the unobservable states into feature states, and then introducing representative beliefs over these feature states. This two-stage aggregation approach facilitates the use of dynamic programming methods for solving the agg"},"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":"2507.04646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-07-07T03:59:31Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"a25df6fdca6f6bbde1aff6b9272682d20b7d02031298e64628404bbbe45c8107","abstract_canon_sha256":"bd1ce0246b0721c23623b47591000facb2037bcd0699f37f06451572dc828f25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:51.420903Z","signature_b64":"ryNxtmycuF9YQ0JmMNaHsd552hqIRLRnxlfbGTNt4PbkiRD91jQQ6CIfwnqWhEDMrccTxeUR4AMEL/TTPuLHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a74d301d6c3c05a44ba31c971d149c18dbc3830245c0f7ae25f49cd7657e314e","last_reissued_at":"2026-07-05T11:32:51.420416Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:51.420416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feature-Based Belief Aggregation for Partially Observable Markov Decision Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Dimitri Bertsekas, Kim Hammar, Yuchao Li","submitted_at":"2025-07-07T03:59:31Z","abstract_excerpt":"We consider a finite-state partially observable Markov decision problem (POMDP) with an infinite horizon and a discounted cost, and we propose a new method for computing a cost function approximation that is based on features and aggregation. In particular, using the classical belief-space formulation, we construct a related Markov decision problem (MDP) by first aggregating the unobservable states into feature states, and then introducing representative beliefs over these feature states. This two-stage aggregation approach facilitates the use of dynamic programming methods for solving the agg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04646","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.04646/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":"2507.04646","created_at":"2026-07-05T11:32:51.420476+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.04646v1","created_at":"2026-07-05T11:32:51.420476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04646","created_at":"2026-07-05T11:32:51.420476+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5GTAHLMHQC2","created_at":"2026-07-05T11:32:51.420476+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5GTAHLMHQC2IS5D","created_at":"2026-07-05T11:32:51.420476+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5GTAHLM","created_at":"2026-07-05T11:32:51.420476+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2507.15163","citing_title":"Adaptive Network Security Policies via Belief Aggregation and Rollout","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U5GTAHLMHQC2IS5DDSLR2FE4DD","json":"https://pith.science/pith/U5GTAHLMHQC2IS5DDSLR2FE4DD.json","graph_json":"https://pith.science/api/pith-number/U5GTAHLMHQC2IS5DDSLR2FE4DD/graph.json","events_json":"https://pith.science/api/pith-number/U5GTAHLMHQC2IS5DDSLR2FE4DD/events.json","paper":"https://pith.science/paper/U5GTAHLM"},"agent_actions":{"view_html":"https://pith.science/pith/U5GTAHLMHQC2IS5DDSLR2FE4DD","download_json":"https://pith.science/pith/U5GTAHLMHQC2IS5DDSLR2FE4DD.json","view_paper":"https://pith.science/paper/U5GTAHLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.04646&json=true","fetch_graph":"https://pith.science/api/pith-number/U5GTAHLMHQC2IS5DDSLR2FE4DD/graph.json","fetch_events":"https://pith.science/api/pith-number/U5GTAHLMHQC2IS5DDSLR2FE4DD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5GTAHLMHQC2IS5DDSLR2FE4DD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5GTAHLMHQC2IS5DDSLR2FE4DD/action/storage_attestation","attest_author":"https://pith.science/pith/U5GTAHLMHQC2IS5DDSLR2FE4DD/action/author_attestation","sign_citation":"https://pith.science/pith/U5GTAHLMHQC2IS5DDSLR2FE4DD/action/citation_signature","submit_replication":"https://pith.science/pith/U5GTAHLMHQC2IS5DDSLR2FE4DD/action/replication_record"}},"created_at":"2026-07-05T11:32:51.420476+00:00","updated_at":"2026-07-05T11:32:51.420476+00:00"}