{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SGKESNOBBYFWHYEDLWL5ZENNHS","short_pith_number":"pith:SGKESNOB","canonical_record":{"source":{"id":"1611.03067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-09T20:11:31Z","cross_cats_sorted":[],"title_canon_sha256":"2d374319067e6549e61417963990e37e14172cad47d7b98eed9a8e362210a25c","abstract_canon_sha256":"5ac4b0226af954eafda9bc80b06aff99c2958b442c77d599e3271113929d67cc"},"schema_version":"1.0"},"canonical_sha256":"91944935c10e0b63e0835d97dc91ad3caa14074295c90b2353d08d3529ec598f","source":{"kind":"arxiv","id":"1611.03067","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03067","created_at":"2026-05-18T00:59:42Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03067v1","created_at":"2026-05-18T00:59:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03067","created_at":"2026-05-18T00:59:42Z"},{"alias_kind":"pith_short_12","alias_value":"SGKESNOBBYFW","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SGKESNOBBYFWHYED","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SGKESNOB","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SGKESNOBBYFWHYEDLWL5ZENNHS","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-09T20:11:31Z","cross_cats_sorted":[],"title_canon_sha256":"2d374319067e6549e61417963990e37e14172cad47d7b98eed9a8e362210a25c","abstract_canon_sha256":"5ac4b0226af954eafda9bc80b06aff99c2958b442c77d599e3271113929d67cc"},"schema_version":"1.0"},"canonical_sha256":"91944935c10e0b63e0835d97dc91ad3caa14074295c90b2353d08d3529ec598f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:42.690139Z","signature_b64":"9WJR4SHVPfUEGVN5ZM2evNGTf9w5t+TSR9ECv6rq/zKBrcdUq2OSeEQ2Y5GMjIr/cinOPCRcM5xM1UrpGuL6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91944935c10e0b63e0835d97dc91ad3caa14074295c90b2353d08d3529ec598f","last_reissued_at":"2026-05-18T00:59:42.689567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:42.689567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03067","source_version":1,"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-18T00:59:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EeN+pV0Iswi98luzfhIc+q3VMUEgIPpd3YcspFDmnRQrwqvDT5eOhFzCOuuFyVEzQ28CSbcw3ZQbyKjWWP69Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:43:45.954613Z"},"content_sha256":"3c8a022baa86a1fc5de1b7b386dcd2b89d41adb2dd1a9295e3cde61d89804fc5","schema_version":"1.0","event_id":"sha256:3c8a022baa86a1fc5de1b7b386dcd2b89d41adb2dd1a9295e3cde61d89804fc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SGKESNOBBYFWHYEDLWL5ZENNHS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Abstractions for Interconnected Multi-Agent Control Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dimitris Boskos, Dimos V. Dimarogonas","submitted_at":"2016-11-09T20:11:31Z","abstract_excerpt":"In this report, we aim at the development of an online abstraction framework for multi-agent systems under coupled constraints. The motion capabilities of each agent are abstracted through a finite state transition system in order to capture reachability properties of the coupled multi-agent system over a finite time horizon in a decentralized manner. In the first part of this work, we define online abstractions by discretizing an overapproximation of the agents' reachable sets over the horizon. Then, sufficient conditions relating the discretization and the agent's dynamics properties are pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03067","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"},"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-18T00:59:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q7WcSBBftXpXqXGYCZ6Hr+LGfY42B0SFABMXhj6raXgkYK2JOLifb6XZzp6cydMfbF4b2nXrwZsIBjbKuXg1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:43:45.954953Z"},"content_sha256":"db297a1d45b61a41e0680da10ac565c33dc8918231a5fff6f0c98e37b5a3aec2","schema_version":"1.0","event_id":"sha256:db297a1d45b61a41e0680da10ac565c33dc8918231a5fff6f0c98e37b5a3aec2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGKESNOBBYFWHYEDLWL5ZENNHS/bundle.json","state_url":"https://pith.science/pith/SGKESNOBBYFWHYEDLWL5ZENNHS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGKESNOBBYFWHYEDLWL5ZENNHS/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-06-01T13:43:45Z","links":{"resolver":"https://pith.science/pith/SGKESNOBBYFWHYEDLWL5ZENNHS","bundle":"https://pith.science/pith/SGKESNOBBYFWHYEDLWL5ZENNHS/bundle.json","state":"https://pith.science/pith/SGKESNOBBYFWHYEDLWL5ZENNHS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGKESNOBBYFWHYEDLWL5ZENNHS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SGKESNOBBYFWHYEDLWL5ZENNHS","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":"5ac4b0226af954eafda9bc80b06aff99c2958b442c77d599e3271113929d67cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-09T20:11:31Z","title_canon_sha256":"2d374319067e6549e61417963990e37e14172cad47d7b98eed9a8e362210a25c"},"schema_version":"1.0","source":{"id":"1611.03067","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03067","created_at":"2026-05-18T00:59:42Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03067v1","created_at":"2026-05-18T00:59:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03067","created_at":"2026-05-18T00:59:42Z"},{"alias_kind":"pith_short_12","alias_value":"SGKESNOBBYFW","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SGKESNOBBYFWHYED","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SGKESNOB","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:db297a1d45b61a41e0680da10ac565c33dc8918231a5fff6f0c98e37b5a3aec2","target":"graph","created_at":"2026-05-18T00:59:42Z","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":"In this report, we aim at the development of an online abstraction framework for multi-agent systems under coupled constraints. The motion capabilities of each agent are abstracted through a finite state transition system in order to capture reachability properties of the coupled multi-agent system over a finite time horizon in a decentralized manner. In the first part of this work, we define online abstractions by discretizing an overapproximation of the agents' reachable sets over the horizon. Then, sufficient conditions relating the discretization and the agent's dynamics properties are pro","authors_text":"Dimitris Boskos, Dimos V. Dimarogonas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-09T20:11:31Z","title":"Online Abstractions for Interconnected Multi-Agent Control Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03067","kind":"arxiv","version":1},"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:3c8a022baa86a1fc5de1b7b386dcd2b89d41adb2dd1a9295e3cde61d89804fc5","target":"record","created_at":"2026-05-18T00:59:42Z","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":"5ac4b0226af954eafda9bc80b06aff99c2958b442c77d599e3271113929d67cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-09T20:11:31Z","title_canon_sha256":"2d374319067e6549e61417963990e37e14172cad47d7b98eed9a8e362210a25c"},"schema_version":"1.0","source":{"id":"1611.03067","kind":"arxiv","version":1}},"canonical_sha256":"91944935c10e0b63e0835d97dc91ad3caa14074295c90b2353d08d3529ec598f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91944935c10e0b63e0835d97dc91ad3caa14074295c90b2353d08d3529ec598f","first_computed_at":"2026-05-18T00:59:42.689567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:42.689567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9WJR4SHVPfUEGVN5ZM2evNGTf9w5t+TSR9ECv6rq/zKBrcdUq2OSeEQ2Y5GMjIr/cinOPCRcM5xM1UrpGuL6DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:42.690139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03067","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c8a022baa86a1fc5de1b7b386dcd2b89d41adb2dd1a9295e3cde61d89804fc5","sha256:db297a1d45b61a41e0680da10ac565c33dc8918231a5fff6f0c98e37b5a3aec2"],"state_sha256":"842672ea814c88d81265e334c4f733c61d5a758f7e88e303e7225dd5a78b760b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJnW4D8fMkJIkEzdTQTU6bQa5sDvW49jaRP6LDjfxypN7D/d2BoLXHdsxCTx2++EUaaU9tXqYz07F/dR+ZruBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:43:45.956810Z","bundle_sha256":"3d1af7ed9a8cbf85fe219333d2042e80e2c8b98d2498cceb52832c2c42c32ad7"}}