{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CZAZHNTMQ4KA2PT3YH5S334P34","short_pith_number":"pith:CZAZHNTM","canonical_record":{"source":{"id":"1104.5384","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-04-28T13:19:17Z","cross_cats_sorted":["cs.MA","math.OC"],"title_canon_sha256":"5b486fd201a3fc2222176b341d9aae9e7fd94f53cb9ad623fdaae3e69ce4e700","abstract_canon_sha256":"f3ac1938af925b39ffcfbdbe452d81f46e94080a761ff2e7faf299f1e0408754"},"schema_version":"1.0"},"canonical_sha256":"164193b66c87140d3e7bc1fb2def8fdf236af371dfa29eb7880ccaad30de4fe9","source":{"kind":"arxiv","id":"1104.5384","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5384","created_at":"2026-05-18T04:15:28Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5384v3","created_at":"2026-05-18T04:15:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5384","created_at":"2026-05-18T04:15:28Z"},{"alias_kind":"pith_short_12","alias_value":"CZAZHNTMQ4KA","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CZAZHNTMQ4KA2PT3","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CZAZHNTM","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CZAZHNTMQ4KA2PT3YH5S334P34","target":"record","payload":{"canonical_record":{"source":{"id":"1104.5384","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-04-28T13:19:17Z","cross_cats_sorted":["cs.MA","math.OC"],"title_canon_sha256":"5b486fd201a3fc2222176b341d9aae9e7fd94f53cb9ad623fdaae3e69ce4e700","abstract_canon_sha256":"f3ac1938af925b39ffcfbdbe452d81f46e94080a761ff2e7faf299f1e0408754"},"schema_version":"1.0"},"canonical_sha256":"164193b66c87140d3e7bc1fb2def8fdf236af371dfa29eb7880ccaad30de4fe9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:28.121115Z","signature_b64":"nLNiZPJDBmfCftcc83sBKw++ky9uxDIQxGH1odePUMv9W8CYA/39B7ICE6rGB33+cq8u4Xwdv8H4H7sK+QQdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"164193b66c87140d3e7bc1fb2def8fdf236af371dfa29eb7880ccaad30de4fe9","last_reissued_at":"2026-05-18T04:15:28.120371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:28.120371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.5384","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:15:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aWuqwtbPTF6a1WKKioYUAXRnbigo1MJ+AJwjumGKpQbqe+56P0S3C7fyGsZLAsYTTrPAqYI/xtzQBpRxIpKTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:30:30.960990Z"},"content_sha256":"510db279513aaf8c550e735e433b323288501077384fd23949ab8b5cf5b29844","schema_version":"1.0","event_id":"sha256:510db279513aaf8c550e735e433b323288501077384fd23949ab8b5cf5b29844"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CZAZHNTMQ4KA2PT3YH5S334P34","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chance-constrained Model Predictive Control for Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","math.OC"],"primary_cat":"cs.SY","authors_text":"Daniel Lyons, Jan-P. Calliess, Uwe D. Hanebeck","submitted_at":"2011-04-28T13:19:17Z","abstract_excerpt":"We consider stochastic model predictive control of a multi-agent systems with constraints on the probabilities of inter-agent collisions. We first study a sample-based approximation of the collision probabilities and use this approximation to formulate constraints for the stochastic control problem. This approximation will converge as the number of samples goes to infinity, however, the complexity of the resulting control problem is so high that this approach proves unsuitable for control under real-time requirements. To alleviate the computational burden we propose a second approach that uses"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5384","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:15:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3hS97NzFpL1IBb5LUtt3VOjZXzbSMJLRWd+Y9drKdztKy7GjvHAJAQupozzQAlJZ96NarLmAgKNbQoPj+qklCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:30:30.961678Z"},"content_sha256":"9e6fe1847a88fc246eab021484b1bfe0365bb64807725189c125691333961453","schema_version":"1.0","event_id":"sha256:9e6fe1847a88fc246eab021484b1bfe0365bb64807725189c125691333961453"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZAZHNTMQ4KA2PT3YH5S334P34/bundle.json","state_url":"https://pith.science/pith/CZAZHNTMQ4KA2PT3YH5S334P34/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZAZHNTMQ4KA2PT3YH5S334P34/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T18:30:30Z","links":{"resolver":"https://pith.science/pith/CZAZHNTMQ4KA2PT3YH5S334P34","bundle":"https://pith.science/pith/CZAZHNTMQ4KA2PT3YH5S334P34/bundle.json","state":"https://pith.science/pith/CZAZHNTMQ4KA2PT3YH5S334P34/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZAZHNTMQ4KA2PT3YH5S334P34/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CZAZHNTMQ4KA2PT3YH5S334P34","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f3ac1938af925b39ffcfbdbe452d81f46e94080a761ff2e7faf299f1e0408754","cross_cats_sorted":["cs.MA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-04-28T13:19:17Z","title_canon_sha256":"5b486fd201a3fc2222176b341d9aae9e7fd94f53cb9ad623fdaae3e69ce4e700"},"schema_version":"1.0","source":{"id":"1104.5384","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5384","created_at":"2026-05-18T04:15:28Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5384v3","created_at":"2026-05-18T04:15:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5384","created_at":"2026-05-18T04:15:28Z"},{"alias_kind":"pith_short_12","alias_value":"CZAZHNTMQ4KA","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CZAZHNTMQ4KA2PT3","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CZAZHNTM","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:9e6fe1847a88fc246eab021484b1bfe0365bb64807725189c125691333961453","target":"graph","created_at":"2026-05-18T04:15:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider stochastic model predictive control of a multi-agent systems with constraints on the probabilities of inter-agent collisions. We first study a sample-based approximation of the collision probabilities and use this approximation to formulate constraints for the stochastic control problem. This approximation will converge as the number of samples goes to infinity, however, the complexity of the resulting control problem is so high that this approach proves unsuitable for control under real-time requirements. To alleviate the computational burden we propose a second approach that uses","authors_text":"Daniel Lyons, Jan-P. Calliess, Uwe D. Hanebeck","cross_cats":["cs.MA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-04-28T13:19:17Z","title":"Chance-constrained Model Predictive Control for Multi-Agent Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5384","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:510db279513aaf8c550e735e433b323288501077384fd23949ab8b5cf5b29844","target":"record","created_at":"2026-05-18T04:15:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f3ac1938af925b39ffcfbdbe452d81f46e94080a761ff2e7faf299f1e0408754","cross_cats_sorted":["cs.MA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-04-28T13:19:17Z","title_canon_sha256":"5b486fd201a3fc2222176b341d9aae9e7fd94f53cb9ad623fdaae3e69ce4e700"},"schema_version":"1.0","source":{"id":"1104.5384","kind":"arxiv","version":3}},"canonical_sha256":"164193b66c87140d3e7bc1fb2def8fdf236af371dfa29eb7880ccaad30de4fe9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"164193b66c87140d3e7bc1fb2def8fdf236af371dfa29eb7880ccaad30de4fe9","first_computed_at":"2026-05-18T04:15:28.120371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:28.120371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nLNiZPJDBmfCftcc83sBKw++ky9uxDIQxGH1odePUMv9W8CYA/39B7ICE6rGB33+cq8u4Xwdv8H4H7sK+QQdBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:28.121115Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.5384","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:510db279513aaf8c550e735e433b323288501077384fd23949ab8b5cf5b29844","sha256:9e6fe1847a88fc246eab021484b1bfe0365bb64807725189c125691333961453"],"state_sha256":"b3aad334c067d8bbde99a8914796b79b4e22b743aaed0aa81653d8db6b160830"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N7m/qst5S9AH0xcHibjgBhKPIgo8OllwujnsDttnzd1OZ+QC8SrKYxblbGbqMw0sOCBp46/UqMhg8jKLN3KKDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:30:30.965125Z","bundle_sha256":"4d026891c8e38697792116b530830403e954cc790a84d55d013c592b79ebd6d4"}}