{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OSNSYJXJHGKFRG7IQCYLVOBPKD","short_pith_number":"pith:OSNSYJXJ","schema_version":"1.0","canonical_sha256":"749b2c26e93994589be880b0bab82f50e7cb2d1b16f4162772d852dade5de200","source":{"kind":"arxiv","id":"1805.07929","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Neighborhood Resizing for Stochastic Reachability in Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.SY","authors_text":"Anna Lukina, Ashish Tiwari, Radu Grosu, Scott A. Smolka","submitted_at":"2018-05-21T07:50:13Z","abstract_excerpt":"We present DAMPC, a distributed, adaptive-horizon and adaptive-neighborhood algorithm for solving the stochastic reachability problem in multi-agent systems, in particular flocking modeled as a Markov decision process. At each time step, every agent calls a centralized, adaptive-horizon model-predictive control (AMPC) algorithm to obtain an optimal solution for its local neighborhood. Second, the agents derive the flock-wide optimal solution through a sequence of consensus rounds. Third, the neighborhood is adaptively resized using a flock-wide, cost-based Lyapunov function V. This way DAMPC i"},"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":"1805.07929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-05-21T07:50:13Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"fc7dd0ddb750d825d9e356853260f555845acf852f14f5d9faf8e736af6abd4a","abstract_canon_sha256":"d800419b2a048ef409ccc1ebc085d192f04f17881eda845ba007f69d9dd70aa7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:32.127031Z","signature_b64":"3rtZIoCh01jlmxFpjSBEf8XqoGKlK8de6/7QohcQuiTn/9diaXZQ28V8Jo9tQr42ympWZLMWqEMbuYTj+mOOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"749b2c26e93994589be880b0bab82f50e7cb2d1b16f4162772d852dade5de200","last_reissued_at":"2026-05-18T00:15:32.126214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:32.126214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Neighborhood Resizing for Stochastic Reachability in Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.SY","authors_text":"Anna Lukina, Ashish Tiwari, Radu Grosu, Scott A. Smolka","submitted_at":"2018-05-21T07:50:13Z","abstract_excerpt":"We present DAMPC, a distributed, adaptive-horizon and adaptive-neighborhood algorithm for solving the stochastic reachability problem in multi-agent systems, in particular flocking modeled as a Markov decision process. At each time step, every agent calls a centralized, adaptive-horizon model-predictive control (AMPC) algorithm to obtain an optimal solution for its local neighborhood. Second, the agents derive the flock-wide optimal solution through a sequence of consensus rounds. Third, the neighborhood is adaptively resized using a flock-wide, cost-based Lyapunov function V. This way DAMPC i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07929","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":"1805.07929","created_at":"2026-05-18T00:15:32.126337+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07929v1","created_at":"2026-05-18T00:15:32.126337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07929","created_at":"2026-05-18T00:15:32.126337+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSNSYJXJHGKF","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSNSYJXJHGKFRG7I","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSNSYJXJ","created_at":"2026-05-18T12:32:43.782077+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/OSNSYJXJHGKFRG7IQCYLVOBPKD","json":"https://pith.science/pith/OSNSYJXJHGKFRG7IQCYLVOBPKD.json","graph_json":"https://pith.science/api/pith-number/OSNSYJXJHGKFRG7IQCYLVOBPKD/graph.json","events_json":"https://pith.science/api/pith-number/OSNSYJXJHGKFRG7IQCYLVOBPKD/events.json","paper":"https://pith.science/paper/OSNSYJXJ"},"agent_actions":{"view_html":"https://pith.science/pith/OSNSYJXJHGKFRG7IQCYLVOBPKD","download_json":"https://pith.science/pith/OSNSYJXJHGKFRG7IQCYLVOBPKD.json","view_paper":"https://pith.science/paper/OSNSYJXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07929&json=true","fetch_graph":"https://pith.science/api/pith-number/OSNSYJXJHGKFRG7IQCYLVOBPKD/graph.json","fetch_events":"https://pith.science/api/pith-number/OSNSYJXJHGKFRG7IQCYLVOBPKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSNSYJXJHGKFRG7IQCYLVOBPKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSNSYJXJHGKFRG7IQCYLVOBPKD/action/storage_attestation","attest_author":"https://pith.science/pith/OSNSYJXJHGKFRG7IQCYLVOBPKD/action/author_attestation","sign_citation":"https://pith.science/pith/OSNSYJXJHGKFRG7IQCYLVOBPKD/action/citation_signature","submit_replication":"https://pith.science/pith/OSNSYJXJHGKFRG7IQCYLVOBPKD/action/replication_record"}},"created_at":"2026-05-18T00:15:32.126337+00:00","updated_at":"2026-05-18T00:15:32.126337+00:00"}