{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:4LJVWVZ2ZS7GDPA5I246OXVR35","short_pith_number":"pith:4LJVWVZ2","schema_version":"1.0","canonical_sha256":"e2d35b573accbe61bc1d46b9e75eb1df4de4050f87858cf7f9b8c86266de1af7","source":{"kind":"arxiv","id":"2209.12644","version":2},"attestation_state":"computed","paper":{"title":"FORESEE: Prediction with Expansion-Compression Unscented Transform for Online Policy Optimization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Dimitra Panagou, Hardik Parwana","submitted_at":"2022-09-26T12:47:08Z","abstract_excerpt":"Propagating state distributions through a generic, uncertain nonlinear dynamical model is known to be intractable and usually begets numerical or analytical approximations. We introduce a method for state prediction, called the Expansion-Compression Unscented Transform, and use it to solve a class of online policy optimization problems. Our proposed algorithm propagates a finite number of sigma points through a state-dependent distribution, which dictates an increase in the number of sigma points at each time step to represent the resulting distribution; this is what we call the expansion oper"},"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":"2209.12644","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2022-09-26T12:47:08Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY","math.OC"],"title_canon_sha256":"2d03aaa4fe57569bc6b52caeea5a8fa49a6e50f0c3d080d5ef2e8f3213f10a56","abstract_canon_sha256":"136e22125e1c04948fefabf71d3704a9bea7d2acb7bb7d20995d4e6eb12b32f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:39:56.604413Z","signature_b64":"Fm5lVQb8Jxy9W2kKssqs9GRJU2ZWj6fDd8MQNLvw/4zK/8wVyaFba5FTOx2q4GRTVXlFIdZiyz3takdvKNrrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2d35b573accbe61bc1d46b9e75eb1df4de4050f87858cf7f9b8c86266de1af7","last_reissued_at":"2026-07-05T07:39:56.604013Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:39:56.604013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FORESEE: Prediction with Expansion-Compression Unscented Transform for Online Policy Optimization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Dimitra Panagou, Hardik Parwana","submitted_at":"2022-09-26T12:47:08Z","abstract_excerpt":"Propagating state distributions through a generic, uncertain nonlinear dynamical model is known to be intractable and usually begets numerical or analytical approximations. We introduce a method for state prediction, called the Expansion-Compression Unscented Transform, and use it to solve a class of online policy optimization problems. Our proposed algorithm propagates a finite number of sigma points through a state-dependent distribution, which dictates an increase in the number of sigma points at each time step to represent the resulting distribution; this is what we call the expansion oper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.12644","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/2209.12644/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":"2209.12644","created_at":"2026-07-05T07:39:56.604067+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.12644v2","created_at":"2026-07-05T07:39:56.604067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.12644","created_at":"2026-07-05T07:39:56.604067+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LJVWVZ2ZS7G","created_at":"2026-07-05T07:39:56.604067+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LJVWVZ2ZS7GDPA5","created_at":"2026-07-05T07:39:56.604067+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LJVWVZ2","created_at":"2026-07-05T07:39:56.604067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.09198","citing_title":"Risk-aware MPPI for Stochastic Hybrid Systems","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4LJVWVZ2ZS7GDPA5I246OXVR35","json":"https://pith.science/pith/4LJVWVZ2ZS7GDPA5I246OXVR35.json","graph_json":"https://pith.science/api/pith-number/4LJVWVZ2ZS7GDPA5I246OXVR35/graph.json","events_json":"https://pith.science/api/pith-number/4LJVWVZ2ZS7GDPA5I246OXVR35/events.json","paper":"https://pith.science/paper/4LJVWVZ2"},"agent_actions":{"view_html":"https://pith.science/pith/4LJVWVZ2ZS7GDPA5I246OXVR35","download_json":"https://pith.science/pith/4LJVWVZ2ZS7GDPA5I246OXVR35.json","view_paper":"https://pith.science/paper/4LJVWVZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.12644&json=true","fetch_graph":"https://pith.science/api/pith-number/4LJVWVZ2ZS7GDPA5I246OXVR35/graph.json","fetch_events":"https://pith.science/api/pith-number/4LJVWVZ2ZS7GDPA5I246OXVR35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LJVWVZ2ZS7GDPA5I246OXVR35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LJVWVZ2ZS7GDPA5I246OXVR35/action/storage_attestation","attest_author":"https://pith.science/pith/4LJVWVZ2ZS7GDPA5I246OXVR35/action/author_attestation","sign_citation":"https://pith.science/pith/4LJVWVZ2ZS7GDPA5I246OXVR35/action/citation_signature","submit_replication":"https://pith.science/pith/4LJVWVZ2ZS7GDPA5I246OXVR35/action/replication_record"}},"created_at":"2026-07-05T07:39:56.604067+00:00","updated_at":"2026-07-05T07:39:56.604067+00:00"}