{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VVM7KISJNKPY4JVB2KFICWYI3I","short_pith_number":"pith:VVM7KISJ","canonical_record":{"source":{"id":"1410.8673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-31T08:59:15Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"f9f4ad082d1c254fa92710c01fb8599bfa2f1bf2e2dc303f64aedad5ed288096","abstract_canon_sha256":"c6680b8dbf1b0e8281bbcfbb599e85599574456b44ffd43e2b87ef82cd68d7ca"},"schema_version":"1.0"},"canonical_sha256":"ad59f522496a9f8e26a1d28a815b08da307c5be980edbd0e375d6374761ff27c","source":{"kind":"arxiv","id":"1410.8673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8673","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8673v1","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8673","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"VVM7KISJNKPY","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VVM7KISJNKPY4JVB","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VVM7KISJ","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VVM7KISJNKPY4JVB2KFICWYI3I","target":"record","payload":{"canonical_record":{"source":{"id":"1410.8673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-31T08:59:15Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"f9f4ad082d1c254fa92710c01fb8599bfa2f1bf2e2dc303f64aedad5ed288096","abstract_canon_sha256":"c6680b8dbf1b0e8281bbcfbb599e85599574456b44ffd43e2b87ef82cd68d7ca"},"schema_version":"1.0"},"canonical_sha256":"ad59f522496a9f8e26a1d28a815b08da307c5be980edbd0e375d6374761ff27c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:53.969616Z","signature_b64":"Y8+1LeaFVaen7fcj5R+yu2UCLt+rd5FpAj2/z+Y2lfoDm1zs3FkiQ9SG7pd2Z++V99KRd8kxdnIDG+jIyugeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad59f522496a9f8e26a1d28a815b08da307c5be980edbd0e375d6374761ff27c","last_reissued_at":"2026-05-18T02:38:53.969184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:53.969184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.8673","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-18T02:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t7j6uf7fqn+RMN8tlH5BBji+vbMcvdFbfSR5qKtBLi94/RT24L/qZEhRr1jUzzXOFhXdpQj33Pc1R8JTLIoxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:27:44.977798Z"},"content_sha256":"73e0e7217fa95847a271cbfdc0ac3c154ef78d08666bc1464d8b8686b3312a43","schema_version":"1.0","event_id":"sha256:73e0e7217fa95847a271cbfdc0ac3c154ef78d08666bc1464d8b8686b3312a43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VVM7KISJNKPY4JVB2KFICWYI3I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication-Free Multi-Agent Control under Local Temporal Tasks and Relative-Distance Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.MA","authors_text":"Dimos V. Dimarogonas, Jana Tumova, Meng Guo","submitted_at":"2014-10-31T08:59:15Z","abstract_excerpt":"We propose a distributed control and coordination strategy for multi-agent systems where each agent has a local task specified as a Linear Temporal Logic (LTL) formula and at the same time is subject to relative-distance constraints with its neighboring agents. The local tasks capture the temporal requirements on individual agents' behaviors, while the relative-distance constraints impose requirements on the collective motion of the whole team. The proposed solution relies only on relative-state measurements among the neighboring agents without the need for explicit information exchange. It is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8673","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-18T02:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/trq/13CD8Gz00MwDbJcS3/9DBY7WlW9OY+3CSROEPYMAdjtLXnqergmQVKqVg+RDcJ0gh9Cl3YUg49A713kBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:27:44.978148Z"},"content_sha256":"183fb74251318f5e4e90564a16ea14a114f508494e33e76b86c78c8a84d1a2f1","schema_version":"1.0","event_id":"sha256:183fb74251318f5e4e90564a16ea14a114f508494e33e76b86c78c8a84d1a2f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VVM7KISJNKPY4JVB2KFICWYI3I/bundle.json","state_url":"https://pith.science/pith/VVM7KISJNKPY4JVB2KFICWYI3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VVM7KISJNKPY4JVB2KFICWYI3I/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-01T10:27:44Z","links":{"resolver":"https://pith.science/pith/VVM7KISJNKPY4JVB2KFICWYI3I","bundle":"https://pith.science/pith/VVM7KISJNKPY4JVB2KFICWYI3I/bundle.json","state":"https://pith.science/pith/VVM7KISJNKPY4JVB2KFICWYI3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VVM7KISJNKPY4JVB2KFICWYI3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VVM7KISJNKPY4JVB2KFICWYI3I","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":"c6680b8dbf1b0e8281bbcfbb599e85599574456b44ffd43e2b87ef82cd68d7ca","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-31T08:59:15Z","title_canon_sha256":"f9f4ad082d1c254fa92710c01fb8599bfa2f1bf2e2dc303f64aedad5ed288096"},"schema_version":"1.0","source":{"id":"1410.8673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8673","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8673v1","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8673","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"VVM7KISJNKPY","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VVM7KISJNKPY4JVB","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VVM7KISJ","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:183fb74251318f5e4e90564a16ea14a114f508494e33e76b86c78c8a84d1a2f1","target":"graph","created_at":"2026-05-18T02:38:53Z","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 propose a distributed control and coordination strategy for multi-agent systems where each agent has a local task specified as a Linear Temporal Logic (LTL) formula and at the same time is subject to relative-distance constraints with its neighboring agents. The local tasks capture the temporal requirements on individual agents' behaviors, while the relative-distance constraints impose requirements on the collective motion of the whole team. The proposed solution relies only on relative-state measurements among the neighboring agents without the need for explicit information exchange. It is","authors_text":"Dimos V. Dimarogonas, Jana Tumova, Meng Guo","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-31T08:59:15Z","title":"Communication-Free Multi-Agent Control under Local Temporal Tasks and Relative-Distance Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8673","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:73e0e7217fa95847a271cbfdc0ac3c154ef78d08666bc1464d8b8686b3312a43","target":"record","created_at":"2026-05-18T02:38:53Z","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":"c6680b8dbf1b0e8281bbcfbb599e85599574456b44ffd43e2b87ef82cd68d7ca","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-10-31T08:59:15Z","title_canon_sha256":"f9f4ad082d1c254fa92710c01fb8599bfa2f1bf2e2dc303f64aedad5ed288096"},"schema_version":"1.0","source":{"id":"1410.8673","kind":"arxiv","version":1}},"canonical_sha256":"ad59f522496a9f8e26a1d28a815b08da307c5be980edbd0e375d6374761ff27c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad59f522496a9f8e26a1d28a815b08da307c5be980edbd0e375d6374761ff27c","first_computed_at":"2026-05-18T02:38:53.969184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:53.969184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y8+1LeaFVaen7fcj5R+yu2UCLt+rd5FpAj2/z+Y2lfoDm1zs3FkiQ9SG7pd2Z++V99KRd8kxdnIDG+jIyugeAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:53.969616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73e0e7217fa95847a271cbfdc0ac3c154ef78d08666bc1464d8b8686b3312a43","sha256:183fb74251318f5e4e90564a16ea14a114f508494e33e76b86c78c8a84d1a2f1"],"state_sha256":"92c80cfe910d91d89a10ce4409a64ac1b1a4b43e6b5c370bbcfa1bd81ac9ace0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KpmNUqe5qSzwyDkHDYldjs0PJXPRb2+TD3rRacHcCfj6aeWoBVLXN+S+pTYeWNOzUQFo8Tc1qcvVCjRDPquEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:27:44.980131Z","bundle_sha256":"43f54f92faf565575a2f8a01368ef10ee50f5758226eb15615de2309daf5400a"}}