{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4BYSRMT3FJFIEJPVR6G4L5KMAO","short_pith_number":"pith:4BYSRMT3","canonical_record":{"source":{"id":"1812.11135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-28T17:59:44Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"6cf85e7c7a87d669241fe675698c65f61bd381d6c253115efd7634c182df7e13","abstract_canon_sha256":"f3954c19dde6f62678e15ebb20f028ef53a45ba6ce55d8384d5755fc0d83e1d6"},"schema_version":"1.0"},"canonical_sha256":"e07128b27b2a4a8225f58f8dc5f54c0387381ea7d7308b9c67f6f3a62e897918","source":{"kind":"arxiv","id":"1812.11135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11135","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11135v1","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11135","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"pith_short_12","alias_value":"4BYSRMT3FJFI","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4BYSRMT3FJFIEJPV","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4BYSRMT3","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4BYSRMT3FJFIEJPVR6G4L5KMAO","target":"record","payload":{"canonical_record":{"source":{"id":"1812.11135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-28T17:59:44Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"6cf85e7c7a87d669241fe675698c65f61bd381d6c253115efd7634c182df7e13","abstract_canon_sha256":"f3954c19dde6f62678e15ebb20f028ef53a45ba6ce55d8384d5755fc0d83e1d6"},"schema_version":"1.0"},"canonical_sha256":"e07128b27b2a4a8225f58f8dc5f54c0387381ea7d7308b9c67f6f3a62e897918","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:16.260285Z","signature_b64":"J+Y2ShrDl5oVLDuu7rhfub1EFdv/di28cGEfflOO2kh8MCzDgPPsanFhS7fx6178IyrTC7j/JOHXq2foBUyQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e07128b27b2a4a8225f58f8dc5f54c0387381ea7d7308b9c67f6f3a62e897918","last_reissued_at":"2026-05-17T23:57:16.259904Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:16.259904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.11135","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:57:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"idTJkjm9E8OEUL/UzadqBVzgiFd/hWsu+O6g/PSIuRIcrH16DcjIHyxlyXc2ZLWsJGVHJVa6FQZto6zd5KNaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T22:11:52.026222Z"},"content_sha256":"e4cf4f4c942edc378cfb5bdd955c64d819fc4602315e5ec63619a7704000907c","schema_version":"1.0","event_id":"sha256:e4cf4f4c942edc378cfb5bdd955c64d819fc4602315e5ec63619a7704000907c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4BYSRMT3FJFIEJPVR6G4L5KMAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Decentralized Receding Horizon Trajectory Optimization for Multi-Robot systems","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-28T17:59:44Z","abstract_excerpt":"A novel decentralised trajectory generation algorithm for Multi Agent systems is presented. Multi-robot systems have the capacity to transform lives in a variety of fields. But, trajectory generation for multi-robot systems is still in its nascent stage and limited to heavily controlled environments. To overcome that, an online trajectory optimization algorithm that generates collision-free trajectories for robots, when given initial state and desired end pose, is proposed. It utilizes a simple method for obstacle detection, local shape based maps for obstacles and communication of robots' cur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11135","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:57:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C5afbia/a0YNZGcIqQYNleeqd8rXXIanqAZb9iTU/W58bFlHcOA1hXeZ+t1MIYXQJ5SETjwhWKGcCCVixOynAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T22:11:52.026592Z"},"content_sha256":"d9ea997b26df47aef8dd27f78aa5d2de108ae3371925ca3d74d54468997ffed3","schema_version":"1.0","event_id":"sha256:d9ea997b26df47aef8dd27f78aa5d2de108ae3371925ca3d74d54468997ffed3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO/bundle.json","state_url":"https://pith.science/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO/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-07-21T22:11:52Z","links":{"resolver":"https://pith.science/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO","bundle":"https://pith.science/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO/bundle.json","state":"https://pith.science/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BYSRMT3FJFIEJPVR6G4L5KMAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4BYSRMT3FJFIEJPVR6G4L5KMAO","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":"f3954c19dde6f62678e15ebb20f028ef53a45ba6ce55d8384d5755fc0d83e1d6","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-28T17:59:44Z","title_canon_sha256":"6cf85e7c7a87d669241fe675698c65f61bd381d6c253115efd7634c182df7e13"},"schema_version":"1.0","source":{"id":"1812.11135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11135","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11135v1","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11135","created_at":"2026-05-17T23:57:16Z"},{"alias_kind":"pith_short_12","alias_value":"4BYSRMT3FJFI","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4BYSRMT3FJFIEJPV","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4BYSRMT3","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:d9ea997b26df47aef8dd27f78aa5d2de108ae3371925ca3d74d54468997ffed3","target":"graph","created_at":"2026-05-17T23:57:16Z","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":"A novel decentralised trajectory generation algorithm for Multi Agent systems is presented. Multi-robot systems have the capacity to transform lives in a variety of fields. But, trajectory generation for multi-robot systems is still in its nascent stage and limited to heavily controlled environments. To overcome that, an online trajectory optimization algorithm that generates collision-free trajectories for robots, when given initial state and desired end pose, is proposed. It utilizes a simple method for obstacle detection, local shape based maps for obstacles and communication of robots' cur","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-28T17:59:44Z","title":"Online Decentralized Receding Horizon Trajectory Optimization for Multi-Robot systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11135","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:e4cf4f4c942edc378cfb5bdd955c64d819fc4602315e5ec63619a7704000907c","target":"record","created_at":"2026-05-17T23:57:16Z","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":"f3954c19dde6f62678e15ebb20f028ef53a45ba6ce55d8384d5755fc0d83e1d6","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-12-28T17:59:44Z","title_canon_sha256":"6cf85e7c7a87d669241fe675698c65f61bd381d6c253115efd7634c182df7e13"},"schema_version":"1.0","source":{"id":"1812.11135","kind":"arxiv","version":1}},"canonical_sha256":"e07128b27b2a4a8225f58f8dc5f54c0387381ea7d7308b9c67f6f3a62e897918","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e07128b27b2a4a8225f58f8dc5f54c0387381ea7d7308b9c67f6f3a62e897918","first_computed_at":"2026-05-17T23:57:16.259904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:16.259904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J+Y2ShrDl5oVLDuu7rhfub1EFdv/di28cGEfflOO2kh8MCzDgPPsanFhS7fx6178IyrTC7j/JOHXq2foBUyQBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:16.260285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.11135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4cf4f4c942edc378cfb5bdd955c64d819fc4602315e5ec63619a7704000907c","sha256:d9ea997b26df47aef8dd27f78aa5d2de108ae3371925ca3d74d54468997ffed3"],"state_sha256":"e2132a927b7f144728657e7b2fa966bedf07b08f0ff5ad031ce480c34f8741df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1V/WolH1woDcjTWF/lOGC2ecN4G2mjuDWk3Fs2+v4O0+UCKS0E7UoA24BI49hHAdhuxxlqTijxIGFTesBWPhDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-21T22:11:52.029049Z","bundle_sha256":"19389bc6eace65a56d9023b810bfb18eca065ee23dba223f122792ebebdc807c"}}