{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BXAWYC7ADAH6T4CQR34U5GOTPI","short_pith_number":"pith:BXAWYC7A","canonical_record":{"source":{"id":"1910.13463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-10-29T18:10:02Z","cross_cats_sorted":[],"title_canon_sha256":"3bf1662c997fd598d524447da4c43efc4bd8dac626a3110601216930a7a16f7a","abstract_canon_sha256":"6072d4497c384678cabb16255945b8893aab8ad6b1634ca068cd2793f2de912d"},"schema_version":"1.0"},"canonical_sha256":"0dc16c0be0180fe9f0508ef94e99d37a110065d159f6f80566c9ced47bf292d2","source":{"kind":"arxiv","id":"1910.13463","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.13463","created_at":"2026-07-05T00:15:52Z"},{"alias_kind":"arxiv_version","alias_value":"1910.13463v1","created_at":"2026-07-05T00:15:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.13463","created_at":"2026-07-05T00:15:52Z"},{"alias_kind":"pith_short_12","alias_value":"BXAWYC7ADAH6","created_at":"2026-07-05T00:15:52Z"},{"alias_kind":"pith_short_16","alias_value":"BXAWYC7ADAH6T4CQ","created_at":"2026-07-05T00:15:52Z"},{"alias_kind":"pith_short_8","alias_value":"BXAWYC7A","created_at":"2026-07-05T00:15:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BXAWYC7ADAH6T4CQR34U5GOTPI","target":"record","payload":{"canonical_record":{"source":{"id":"1910.13463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-10-29T18:10:02Z","cross_cats_sorted":[],"title_canon_sha256":"3bf1662c997fd598d524447da4c43efc4bd8dac626a3110601216930a7a16f7a","abstract_canon_sha256":"6072d4497c384678cabb16255945b8893aab8ad6b1634ca068cd2793f2de912d"},"schema_version":"1.0"},"canonical_sha256":"0dc16c0be0180fe9f0508ef94e99d37a110065d159f6f80566c9ced47bf292d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:52.040418Z","signature_b64":"OvK3r8+HWZ7IV3zXi9H/r0F8FxppGpPXaDffgfGU/BJSNvL7ZeLcEq4lCamhks1bngjy28IAPo0hu6zExqISDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dc16c0be0180fe9f0508ef94e99d37a110065d159f6f80566c9ced47bf292d2","last_reissued_at":"2026-07-05T00:15:52.040019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:52.040019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.13463","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-07-05T00:15:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+4JoE0gc/5ireD7yKpKwWPI/jvjQAvxK9DsHMytEBG8ZrAsQT4QTrZlofejdLJjuHedw3NRoedoZ7FG3d7rDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:20:34.284979Z"},"content_sha256":"036dca0e0ab32bb5a172c5de083486046bc69904bd99989869e78087df56204b","schema_version":"1.0","event_id":"sha256:036dca0e0ab32bb5a172c5de083486046bc69904bd99989869e78087df56204b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BXAWYC7ADAH6T4CQR34U5GOTPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Scalable Continuous-Time Trajectory Optimization for Multi-Robot Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Govind Aadithya Rajagopalan, Madhavan Shanmugavel, Shravan Krishnan, Sivanathan Kandhasamy","submitted_at":"2019-10-29T18:10:02Z","abstract_excerpt":"Scalable multi-robot transition is essential for ubiquitous adoption of robots. As a step towards it, a computationally efficient decentralized algorithm for continuous-time trajectory optimization in multi-robot scenarios based upon model predictive control is introduced. The robots communicate only their current states and goals rather than sharing their whole trajectory; using this data each robot predicts a continuous-time trajectory for every other robot exploiting optimal control based motion primitives that are corrected for spatial inter-robot interactions using least squares. A non li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.13463","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.13463/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:15:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ENCJKbOoac1Ks/rrrDi+XS4G2Fll4hJS/1HZ0SRkNKym3nelO1oxVYRNTPJfqWGzJFsvBg2hnbHsev5VMjJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:20:34.285357Z"},"content_sha256":"a77fb96bf565ab5709d06edd837b6915e274aff0832a9cad8bdcc2815182d552","schema_version":"1.0","event_id":"sha256:a77fb96bf565ab5709d06edd837b6915e274aff0832a9cad8bdcc2815182d552"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXAWYC7ADAH6T4CQR34U5GOTPI/bundle.json","state_url":"https://pith.science/pith/BXAWYC7ADAH6T4CQR34U5GOTPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXAWYC7ADAH6T4CQR34U5GOTPI/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-07T10:20:34Z","links":{"resolver":"https://pith.science/pith/BXAWYC7ADAH6T4CQR34U5GOTPI","bundle":"https://pith.science/pith/BXAWYC7ADAH6T4CQR34U5GOTPI/bundle.json","state":"https://pith.science/pith/BXAWYC7ADAH6T4CQR34U5GOTPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXAWYC7ADAH6T4CQR34U5GOTPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BXAWYC7ADAH6T4CQR34U5GOTPI","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":"6072d4497c384678cabb16255945b8893aab8ad6b1634ca068cd2793f2de912d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-10-29T18:10:02Z","title_canon_sha256":"3bf1662c997fd598d524447da4c43efc4bd8dac626a3110601216930a7a16f7a"},"schema_version":"1.0","source":{"id":"1910.13463","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.13463","created_at":"2026-07-05T00:15:52Z"},{"alias_kind":"arxiv_version","alias_value":"1910.13463v1","created_at":"2026-07-05T00:15:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.13463","created_at":"2026-07-05T00:15:52Z"},{"alias_kind":"pith_short_12","alias_value":"BXAWYC7ADAH6","created_at":"2026-07-05T00:15:52Z"},{"alias_kind":"pith_short_16","alias_value":"BXAWYC7ADAH6T4CQ","created_at":"2026-07-05T00:15:52Z"},{"alias_kind":"pith_short_8","alias_value":"BXAWYC7A","created_at":"2026-07-05T00:15:52Z"}],"graph_snapshots":[{"event_id":"sha256:a77fb96bf565ab5709d06edd837b6915e274aff0832a9cad8bdcc2815182d552","target":"graph","created_at":"2026-07-05T00:15:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.13463/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Scalable multi-robot transition is essential for ubiquitous adoption of robots. As a step towards it, a computationally efficient decentralized algorithm for continuous-time trajectory optimization in multi-robot scenarios based upon model predictive control is introduced. The robots communicate only their current states and goals rather than sharing their whole trajectory; using this data each robot predicts a continuous-time trajectory for every other robot exploiting optimal control based motion primitives that are corrected for spatial inter-robot interactions using least squares. A non li","authors_text":"Govind Aadithya Rajagopalan, Madhavan Shanmugavel, Shravan Krishnan, Sivanathan Kandhasamy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-10-29T18:10:02Z","title":"Towards Scalable Continuous-Time Trajectory Optimization for Multi-Robot Navigation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.13463","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:036dca0e0ab32bb5a172c5de083486046bc69904bd99989869e78087df56204b","target":"record","created_at":"2026-07-05T00:15:52Z","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":"6072d4497c384678cabb16255945b8893aab8ad6b1634ca068cd2793f2de912d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-10-29T18:10:02Z","title_canon_sha256":"3bf1662c997fd598d524447da4c43efc4bd8dac626a3110601216930a7a16f7a"},"schema_version":"1.0","source":{"id":"1910.13463","kind":"arxiv","version":1}},"canonical_sha256":"0dc16c0be0180fe9f0508ef94e99d37a110065d159f6f80566c9ced47bf292d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0dc16c0be0180fe9f0508ef94e99d37a110065d159f6f80566c9ced47bf292d2","first_computed_at":"2026-07-05T00:15:52.040019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:15:52.040019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OvK3r8+HWZ7IV3zXi9H/r0F8FxppGpPXaDffgfGU/BJSNvL7ZeLcEq4lCamhks1bngjy28IAPo0hu6zExqISDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:15:52.040418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.13463","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:036dca0e0ab32bb5a172c5de083486046bc69904bd99989869e78087df56204b","sha256:a77fb96bf565ab5709d06edd837b6915e274aff0832a9cad8bdcc2815182d552"],"state_sha256":"b1a1e28bc5935b4021212d60ca8c76e9c9624f4abca21591cca2cba85e8430d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bkdSWeWFyD9k4TfGGiKmgi91gGKs5qh+cd/gP1k7dUTHXUBp+d65p0rinlIF3Xs46jYhw6FIOE75kiEVyimHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:20:34.287387Z","bundle_sha256":"9b1ad64b3840ab40185c3c33acee2b0129b707439f3b022d2d18a812b19b6513"}}