{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:F7VXWRHZJ54BJOCAICDLMGPGLE","short_pith_number":"pith:F7VXWRHZ","canonical_record":{"source":{"id":"1812.00868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-03T16:25:58Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"7c2daa09592e82cfda8a94654070db4121669f16fd495a86f8cf300900bac003","abstract_canon_sha256":"577afe1c9fe0b688c567a768672408851a69c2979ef8ff86df81ccfa0000ebdb"},"schema_version":"1.0"},"canonical_sha256":"2feb7b44f94f7814b8404086b619e65915bb8222ba04a52cd5529f9dcf54f075","source":{"kind":"arxiv","id":"1812.00868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00868","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00868v1","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00868","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"F7VXWRHZJ54B","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F7VXWRHZJ54BJOCA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F7VXWRHZ","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:F7VXWRHZJ54BJOCAICDLMGPGLE","target":"record","payload":{"canonical_record":{"source":{"id":"1812.00868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-03T16:25:58Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"7c2daa09592e82cfda8a94654070db4121669f16fd495a86f8cf300900bac003","abstract_canon_sha256":"577afe1c9fe0b688c567a768672408851a69c2979ef8ff86df81ccfa0000ebdb"},"schema_version":"1.0"},"canonical_sha256":"2feb7b44f94f7814b8404086b619e65915bb8222ba04a52cd5529f9dcf54f075","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:18.758597Z","signature_b64":"y2FFadG/GLPzmr0ucwIiVGcx+SvXwPbLo9GBnAiYwrBiVCdB+J7MGznQa3Mgw3Ab+avhumZU9o7jiccf5IeiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2feb7b44f94f7814b8404086b619e65915bb8222ba04a52cd5529f9dcf54f075","last_reissued_at":"2026-05-17T23:59:18.758167Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:18.758167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.00868","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-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sq0bSraS5zEZRqjth3L9t+UJlhsGkINWZX6HQYTGLb0qTedeuENxAsI0SDgP/xRmpkkUlQexX0V+9oIUl7QKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:32:47.410292Z"},"content_sha256":"3d21eb492eb18c7869eec1b1c9ec9ac20841a4a17c383edebebb5b1ac474ef9d","schema_version":"1.0","event_id":"sha256:3d21eb492eb18c7869eec1b1c9ec9ac20841a4a17c383edebebb5b1ac474ef9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:F7VXWRHZJ54BJOCAICDLMGPGLE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Collision-Free Multi Robot Trajectory Optimization in Unknown Environments using Decentralized Trajectory Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Govind Aadithya R, Shravan Krishnan, Sivanathan K, Vijay Arvindh","submitted_at":"2018-12-03T16:25:58Z","abstract_excerpt":"Multi robot systems have the potential to be utilized in a variety of applications. In most of the previous works, the trajectory generation for multi robot systems is implemented in known environments. To overcome that we present an online trajectory optimization algorithm that utilizes communication of robots' current states to account to the other robots while using local object based maps for identifying obstacles. Based upon this data, we predict the trajectory expected to be traversed by the robots and utilize that to avoid collisions by formulating regions of free space that the robot c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00868","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-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sR//jt/MNQ7bJLQzciaFQvYSPwGKxb14o4u+gt4/6BtKcCY4PLUItKca0Dn60BeVjdDv3AvUW3RwPe1cSii1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:32:47.410744Z"},"content_sha256":"bdf1b1341be320278b483033a52b6c965330053db49cc608686d6f7c677ba883","schema_version":"1.0","event_id":"sha256:bdf1b1341be320278b483033a52b6c965330053db49cc608686d6f7c677ba883"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7VXWRHZJ54BJOCAICDLMGPGLE/bundle.json","state_url":"https://pith.science/pith/F7VXWRHZJ54BJOCAICDLMGPGLE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7VXWRHZJ54BJOCAICDLMGPGLE/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-08-03T20:32:47Z","links":{"resolver":"https://pith.science/pith/F7VXWRHZJ54BJOCAICDLMGPGLE","bundle":"https://pith.science/pith/F7VXWRHZJ54BJOCAICDLMGPGLE/bundle.json","state":"https://pith.science/pith/F7VXWRHZJ54BJOCAICDLMGPGLE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7VXWRHZJ54BJOCAICDLMGPGLE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:F7VXWRHZJ54BJOCAICDLMGPGLE","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":"577afe1c9fe0b688c567a768672408851a69c2979ef8ff86df81ccfa0000ebdb","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-03T16:25:58Z","title_canon_sha256":"7c2daa09592e82cfda8a94654070db4121669f16fd495a86f8cf300900bac003"},"schema_version":"1.0","source":{"id":"1812.00868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00868","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00868v1","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00868","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"F7VXWRHZJ54B","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F7VXWRHZJ54BJOCA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F7VXWRHZ","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:bdf1b1341be320278b483033a52b6c965330053db49cc608686d6f7c677ba883","target":"graph","created_at":"2026-05-17T23:59:18Z","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":"Multi robot systems have the potential to be utilized in a variety of applications. In most of the previous works, the trajectory generation for multi robot systems is implemented in known environments. To overcome that we present an online trajectory optimization algorithm that utilizes communication of robots' current states to account to the other robots while using local object based maps for identifying obstacles. Based upon this data, we predict the trajectory expected to be traversed by the robots and utilize that to avoid collisions by formulating regions of free space that the robot c","authors_text":"Govind Aadithya R, Shravan Krishnan, Sivanathan K, Vijay Arvindh","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-03T16:25:58Z","title":"Collision-Free Multi Robot Trajectory Optimization in Unknown Environments using Decentralized Trajectory Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00868","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:3d21eb492eb18c7869eec1b1c9ec9ac20841a4a17c383edebebb5b1ac474ef9d","target":"record","created_at":"2026-05-17T23:59:18Z","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":"577afe1c9fe0b688c567a768672408851a69c2979ef8ff86df81ccfa0000ebdb","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-03T16:25:58Z","title_canon_sha256":"7c2daa09592e82cfda8a94654070db4121669f16fd495a86f8cf300900bac003"},"schema_version":"1.0","source":{"id":"1812.00868","kind":"arxiv","version":1}},"canonical_sha256":"2feb7b44f94f7814b8404086b619e65915bb8222ba04a52cd5529f9dcf54f075","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2feb7b44f94f7814b8404086b619e65915bb8222ba04a52cd5529f9dcf54f075","first_computed_at":"2026-05-17T23:59:18.758167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:18.758167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y2FFadG/GLPzmr0ucwIiVGcx+SvXwPbLo9GBnAiYwrBiVCdB+J7MGznQa3Mgw3Ab+avhumZU9o7jiccf5IeiAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:18.758597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.00868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d21eb492eb18c7869eec1b1c9ec9ac20841a4a17c383edebebb5b1ac474ef9d","sha256:bdf1b1341be320278b483033a52b6c965330053db49cc608686d6f7c677ba883"],"state_sha256":"5edb547c6611568d34ba440377339afc12278dc2713835b17d9bdbbbc4d859ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aWGbhkGx0QW1YNUlr/9uPZTvzmWTUKmlkPxNota1xsui5XHM5WnbpvmnjxIvPODIcXyvbmhipcRWkyHkHvC4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T20:32:47.414083Z","bundle_sha256":"c7334f9837cc7d33e9bcb189ee960a4832a1cf9b71905505a8d1a78dcfdf12b0"}}