{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YGR4YORGR3FPYNBEPZ2YW55WZE","short_pith_number":"pith:YGR4YORG","canonical_record":{"source":{"id":"1402.2708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-02-12T00:38:05Z","cross_cats_sorted":["cs.GT","cs.SY","math.OC"],"title_canon_sha256":"d2adb988630e083e9b8cb7849b003d47ecbc933f9cb8aba24410c48cd19d2e4c","abstract_canon_sha256":"ea6c364890a5268ee0700d041ca13cdb37084ac779445a488a1a4c44fb26dcd3"},"schema_version":"1.0"},"canonical_sha256":"c1a3cc3a268ecafc34247e758b77b6c9232171f217db5d6abf34e5953986fa15","source":{"kind":"arxiv","id":"1402.2708","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2708","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2708v2","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2708","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"YGR4YORGR3FP","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YGR4YORGR3FPYNBE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YGR4YORG","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YGR4YORGR3FPYNBEPZ2YW55WZE","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-02-12T00:38:05Z","cross_cats_sorted":["cs.GT","cs.SY","math.OC"],"title_canon_sha256":"d2adb988630e083e9b8cb7849b003d47ecbc933f9cb8aba24410c48cd19d2e4c","abstract_canon_sha256":"ea6c364890a5268ee0700d041ca13cdb37084ac779445a488a1a4c44fb26dcd3"},"schema_version":"1.0"},"canonical_sha256":"c1a3cc3a268ecafc34247e758b77b6c9232171f217db5d6abf34e5953986fa15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:56.203309Z","signature_b64":"O1wLm1vHbZOMmWE8o5U3qDObS3sNvaMaUeh8DgBBVFv2aDGucOxaG3E1ObOiNiaG/jav0UW7uCHG8gsfYZqwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1a3cc3a268ecafc34247e758b77b6c9232171f217db5d6abf34e5953986fa15","last_reissued_at":"2026-05-18T02:58:56.202754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:56.202754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2708","source_version":2,"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:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsYc7XakFP0Vx1LyeqUPo7TzzA1PDPREFnONT/p/PdsT03H97GyIsjYM45sXCSriBtF83350WgZDGBOu7KiFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:22:14.153469Z"},"content_sha256":"ea93f10e57e6ae7b8575a3051525cea88e4c40bf1edf621b1491744e287e868a","schema_version":"1.0","event_id":"sha256:ea93f10e57e6ae7b8575a3051525cea88e4c40bf1edf621b1491744e287e868a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YGR4YORGR3FPYNBEPZ2YW55WZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Game theoretic controller synthesis for multi-robot motion planning Part I : Trajectory based algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.SY","math.OC"],"primary_cat":"cs.MA","authors_text":"Emilio Frazzoli, Michael Otte, Minghui Zhu, Pratik Chaudhari","submitted_at":"2014-02-12T00:38:05Z","abstract_excerpt":"We consider a class of multi-robot motion planning problems where each robot is associated with multiple objectives and decoupled task specifications. The problems are formulated as an open-loop non-cooperative differential game. A distributed anytime algorithm is proposed to compute a Nash equilibrium of the game. The following properties are proven: (i) the algorithm asymptotically converges to the set of Nash equilibrium; (ii) for scalar cost functionals, the price of stability equals one; (iii) for the worst case, the computational complexity and communication cost are linear in the robot "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2708","kind":"arxiv","version":2},"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:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VGUdX/gz3yMscXgGSuFQ39Z//NAZ6iL0Te2X5kc3XRsTnelgCA6zLqdpioYu/TMpIrLqyx4wnl3bpSaVpzkOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:22:14.153821Z"},"content_sha256":"5e65bf3032245c3093224008c6540cf26a5815df4c9f18074321b2ee26155c8f","schema_version":"1.0","event_id":"sha256:5e65bf3032245c3093224008c6540cf26a5815df4c9f18074321b2ee26155c8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YGR4YORGR3FPYNBEPZ2YW55WZE/bundle.json","state_url":"https://pith.science/pith/YGR4YORGR3FPYNBEPZ2YW55WZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YGR4YORGR3FPYNBEPZ2YW55WZE/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-21T14:22:14Z","links":{"resolver":"https://pith.science/pith/YGR4YORGR3FPYNBEPZ2YW55WZE","bundle":"https://pith.science/pith/YGR4YORGR3FPYNBEPZ2YW55WZE/bundle.json","state":"https://pith.science/pith/YGR4YORGR3FPYNBEPZ2YW55WZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YGR4YORGR3FPYNBEPZ2YW55WZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YGR4YORGR3FPYNBEPZ2YW55WZE","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":"ea6c364890a5268ee0700d041ca13cdb37084ac779445a488a1a4c44fb26dcd3","cross_cats_sorted":["cs.GT","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-02-12T00:38:05Z","title_canon_sha256":"d2adb988630e083e9b8cb7849b003d47ecbc933f9cb8aba24410c48cd19d2e4c"},"schema_version":"1.0","source":{"id":"1402.2708","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2708","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2708v2","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2708","created_at":"2026-05-18T02:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"YGR4YORGR3FP","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YGR4YORGR3FPYNBE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YGR4YORG","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:5e65bf3032245c3093224008c6540cf26a5815df4c9f18074321b2ee26155c8f","target":"graph","created_at":"2026-05-18T02:58:56Z","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 a class of multi-robot motion planning problems where each robot is associated with multiple objectives and decoupled task specifications. The problems are formulated as an open-loop non-cooperative differential game. A distributed anytime algorithm is proposed to compute a Nash equilibrium of the game. The following properties are proven: (i) the algorithm asymptotically converges to the set of Nash equilibrium; (ii) for scalar cost functionals, the price of stability equals one; (iii) for the worst case, the computational complexity and communication cost are linear in the robot ","authors_text":"Emilio Frazzoli, Michael Otte, Minghui Zhu, Pratik Chaudhari","cross_cats":["cs.GT","cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-02-12T00:38:05Z","title":"Game theoretic controller synthesis for multi-robot motion planning Part I : Trajectory based algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2708","kind":"arxiv","version":2},"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:ea93f10e57e6ae7b8575a3051525cea88e4c40bf1edf621b1491744e287e868a","target":"record","created_at":"2026-05-18T02:58:56Z","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":"ea6c364890a5268ee0700d041ca13cdb37084ac779445a488a1a4c44fb26dcd3","cross_cats_sorted":["cs.GT","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-02-12T00:38:05Z","title_canon_sha256":"d2adb988630e083e9b8cb7849b003d47ecbc933f9cb8aba24410c48cd19d2e4c"},"schema_version":"1.0","source":{"id":"1402.2708","kind":"arxiv","version":2}},"canonical_sha256":"c1a3cc3a268ecafc34247e758b77b6c9232171f217db5d6abf34e5953986fa15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1a3cc3a268ecafc34247e758b77b6c9232171f217db5d6abf34e5953986fa15","first_computed_at":"2026-05-18T02:58:56.202754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:56.202754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O1wLm1vHbZOMmWE8o5U3qDObS3sNvaMaUeh8DgBBVFv2aDGucOxaG3E1ObOiNiaG/jav0UW7uCHG8gsfYZqwDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:56.203309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2708","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea93f10e57e6ae7b8575a3051525cea88e4c40bf1edf621b1491744e287e868a","sha256:5e65bf3032245c3093224008c6540cf26a5815df4c9f18074321b2ee26155c8f"],"state_sha256":"2d0874528434848ab45062ecd7d41453ed2da4040b6b223ecac9c766d8c98be1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"znktEqml2zvE0YuPKoTqvfZ/eq0c7GcDwSP+W6+0C5cA8Sl38felBH/CUK1db7eGO8h+VGarz6FDFI9OIyaIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T14:22:14.155887Z","bundle_sha256":"8a737af34b90b714f018f0e020256d632da3cc66a7becc5df0f66a42b6f37376"}}