{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OLTI2WJRENZFAPIPHLZRTEXJIB","short_pith_number":"pith:OLTI2WJR","schema_version":"1.0","canonical_sha256":"72e68d59312372503d0f3af31992e940508bfdff35865932be2b19191dcec428","source":{"kind":"arxiv","id":"1612.07059","version":1},"attestation_state":"computed","paper":{"title":"ARES: Adaptive Receding-Horizon Synthesis of Optimal Plans","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"cs.AI","authors_text":"Anna Lukina, Ashish Tiwari, Christian Hirsch, Ezio Bartocci, Junxing Yang, Lukas Esterle, Radu Grosu, Scott A. Smolka","submitted_at":"2016-12-21T11:16:50Z","abstract_excerpt":"We introduce ARES, an efficient approximation algorithm for generating optimal plans (action sequences) that take an initial state of a Markov Decision Process (MDP) to a state whose cost is below a specified (convergence) threshold. ARES uses Particle Swarm Optimization, with adaptive sizing for both the receding horizon and the particle swarm. Inspired by Importance Splitting, the length of the horizon and the number of particles are chosen such that at least one particle reaches a next-level state, that is, a state where the cost decreases by a required delta from the previous-level state. "},"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":"1612.07059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-21T11:16:50Z","cross_cats_sorted":["cs.MA","cs.SY"],"title_canon_sha256":"560ef7b4769b9cc1c7d650f4e93f74842e7ec5965a88f7bcc7a37b12c9061382","abstract_canon_sha256":"379262824ac862c940de9f9a35f9d46bc69ab8b9605ed49a86c6cfe02b7b3e38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:14.763950Z","signature_b64":"LW63QxrX7CcP+FLft0D6jKiSbqzCEbH5JCykhrb78Lfo6IvX3VL2lvzK2CxAwTYY3M3XkduHoTJuB4tJgafVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72e68d59312372503d0f3af31992e940508bfdff35865932be2b19191dcec428","last_reissued_at":"2026-05-18T00:54:14.763475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:14.763475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ARES: Adaptive Receding-Horizon Synthesis of Optimal Plans","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY"],"primary_cat":"cs.AI","authors_text":"Anna Lukina, Ashish Tiwari, Christian Hirsch, Ezio Bartocci, Junxing Yang, Lukas Esterle, Radu Grosu, Scott A. Smolka","submitted_at":"2016-12-21T11:16:50Z","abstract_excerpt":"We introduce ARES, an efficient approximation algorithm for generating optimal plans (action sequences) that take an initial state of a Markov Decision Process (MDP) to a state whose cost is below a specified (convergence) threshold. ARES uses Particle Swarm Optimization, with adaptive sizing for both the receding horizon and the particle swarm. Inspired by Importance Splitting, the length of the horizon and the number of particles are chosen such that at least one particle reaches a next-level state, that is, a state where the cost decreases by a required delta from the previous-level state. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07059","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":"1612.07059","created_at":"2026-05-18T00:54:14.763536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07059v1","created_at":"2026-05-18T00:54:14.763536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07059","created_at":"2026-05-18T00:54:14.763536+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLTI2WJRENZF","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLTI2WJRENZFAPIP","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLTI2WJR","created_at":"2026-05-18T12:30:36.002864+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/OLTI2WJRENZFAPIPHLZRTEXJIB","json":"https://pith.science/pith/OLTI2WJRENZFAPIPHLZRTEXJIB.json","graph_json":"https://pith.science/api/pith-number/OLTI2WJRENZFAPIPHLZRTEXJIB/graph.json","events_json":"https://pith.science/api/pith-number/OLTI2WJRENZFAPIPHLZRTEXJIB/events.json","paper":"https://pith.science/paper/OLTI2WJR"},"agent_actions":{"view_html":"https://pith.science/pith/OLTI2WJRENZFAPIPHLZRTEXJIB","download_json":"https://pith.science/pith/OLTI2WJRENZFAPIPHLZRTEXJIB.json","view_paper":"https://pith.science/paper/OLTI2WJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07059&json=true","fetch_graph":"https://pith.science/api/pith-number/OLTI2WJRENZFAPIPHLZRTEXJIB/graph.json","fetch_events":"https://pith.science/api/pith-number/OLTI2WJRENZFAPIPHLZRTEXJIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLTI2WJRENZFAPIPHLZRTEXJIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLTI2WJRENZFAPIPHLZRTEXJIB/action/storage_attestation","attest_author":"https://pith.science/pith/OLTI2WJRENZFAPIPHLZRTEXJIB/action/author_attestation","sign_citation":"https://pith.science/pith/OLTI2WJRENZFAPIPHLZRTEXJIB/action/citation_signature","submit_replication":"https://pith.science/pith/OLTI2WJRENZFAPIPHLZRTEXJIB/action/replication_record"}},"created_at":"2026-05-18T00:54:14.763536+00:00","updated_at":"2026-05-18T00:54:14.763536+00:00"}