{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:6IRY77FKBD3BSUMS4YO6S76V66","short_pith_number":"pith:6IRY77FK","canonical_record":{"source":{"id":"2409.17079","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-25T16:44:53Z","cross_cats_sorted":[],"title_canon_sha256":"d90ced0fc800195b6e50dfbe42a8b93404605cd2fa42c515042477281721595e","abstract_canon_sha256":"be48354c35dbb44f77b53bf9fa9ef6be3379b845be9ac3d4f4b5e4e1f6643d5a"},"schema_version":"1.0"},"canonical_sha256":"f2238ffcaa08f6195192e61de97fd5f789e321313be978e1406b978ce93c8560","source":{"kind":"arxiv","id":"2409.17079","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.17079","created_at":"2026-07-05T09:11:43Z"},{"alias_kind":"arxiv_version","alias_value":"2409.17079v1","created_at":"2026-07-05T09:11:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.17079","created_at":"2026-07-05T09:11:43Z"},{"alias_kind":"pith_short_12","alias_value":"6IRY77FKBD3B","created_at":"2026-07-05T09:11:43Z"},{"alias_kind":"pith_short_16","alias_value":"6IRY77FKBD3BSUMS","created_at":"2026-07-05T09:11:43Z"},{"alias_kind":"pith_short_8","alias_value":"6IRY77FK","created_at":"2026-07-05T09:11:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:6IRY77FKBD3BSUMS4YO6S76V66","target":"record","payload":{"canonical_record":{"source":{"id":"2409.17079","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-25T16:44:53Z","cross_cats_sorted":[],"title_canon_sha256":"d90ced0fc800195b6e50dfbe42a8b93404605cd2fa42c515042477281721595e","abstract_canon_sha256":"be48354c35dbb44f77b53bf9fa9ef6be3379b845be9ac3d4f4b5e4e1f6643d5a"},"schema_version":"1.0"},"canonical_sha256":"f2238ffcaa08f6195192e61de97fd5f789e321313be978e1406b978ce93c8560","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:11:43.427655Z","signature_b64":"c1ddf1tnvCcosCvud+QgGmrZvCvIs6ms1S5Z6LWzlCDVHCljkSWQ7JnP0LvsenZA0opVt1u6g7oHsh7d9ORjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2238ffcaa08f6195192e61de97fd5f789e321313be978e1406b978ce93c8560","last_reissued_at":"2026-07-05T09:11:43.427194Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:11:43.427194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.17079","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-05T09:11:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fnXDbE5N0INR3+06+Dyq8KTVdQoHuuxSwyB3bGMM7/dJysPZ/ses7dOrA52teX41fQ+jvvq/a1TUjR3xNDy3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:50:48.124681Z"},"content_sha256":"b472dde7b7c571476a9f1508e10442dfac4a81a9d7c757f2c483983921888662","schema_version":"1.0","event_id":"sha256:b472dde7b7c571476a9f1508e10442dfac4a81a9d7c757f2c483983921888662"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:6IRY77FKBD3BSUMS4YO6S76V66","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Collision-free time-optimal path parameterization for multi-robot teams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Igor Spasojevic, Katherine Mao, Malakhi Hopkins, M. Ani Hsieh, Vijay Kumar","submitted_at":"2024-09-25T16:44:53Z","abstract_excerpt":"Coordinating the motion of multiple robots in cluttered environments remains a computationally challenging task. We study the problem of minimizing the execution time of a set of geometric paths by a team of robots with state-dependent actuation constraints. We propose a Time-Optimal Path Parameterization (TOPP) algorithm for multiple car-like agents, where the modulation of the timing of every robot along its assigned path is employed to ensure collision avoidance and dynamic feasibility. This is achieved through the use of a priority queue to determine the order of trajectory execution for e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.17079","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/2409.17079/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-05T09:11:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kpGobJ40Cv6WKjxPMA6YdXPqdTRD+v7M1vFxNfP7meSb7tm4SUQtOJ53UaYbB+xvrXzh5XNRx3iQx+a3pWUcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:50:48.125602Z"},"content_sha256":"a3a1ad9f8906e248d6fbe8e4cf9b6725d39815a6d56c331e2d3551032b6411e8","schema_version":"1.0","event_id":"sha256:a3a1ad9f8906e248d6fbe8e4cf9b6725d39815a6d56c331e2d3551032b6411e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6IRY77FKBD3BSUMS4YO6S76V66/bundle.json","state_url":"https://pith.science/pith/6IRY77FKBD3BSUMS4YO6S76V66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6IRY77FKBD3BSUMS4YO6S76V66/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-06T11:50:48Z","links":{"resolver":"https://pith.science/pith/6IRY77FKBD3BSUMS4YO6S76V66","bundle":"https://pith.science/pith/6IRY77FKBD3BSUMS4YO6S76V66/bundle.json","state":"https://pith.science/pith/6IRY77FKBD3BSUMS4YO6S76V66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6IRY77FKBD3BSUMS4YO6S76V66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6IRY77FKBD3BSUMS4YO6S76V66","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":"be48354c35dbb44f77b53bf9fa9ef6be3379b845be9ac3d4f4b5e4e1f6643d5a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-25T16:44:53Z","title_canon_sha256":"d90ced0fc800195b6e50dfbe42a8b93404605cd2fa42c515042477281721595e"},"schema_version":"1.0","source":{"id":"2409.17079","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.17079","created_at":"2026-07-05T09:11:43Z"},{"alias_kind":"arxiv_version","alias_value":"2409.17079v1","created_at":"2026-07-05T09:11:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.17079","created_at":"2026-07-05T09:11:43Z"},{"alias_kind":"pith_short_12","alias_value":"6IRY77FKBD3B","created_at":"2026-07-05T09:11:43Z"},{"alias_kind":"pith_short_16","alias_value":"6IRY77FKBD3BSUMS","created_at":"2026-07-05T09:11:43Z"},{"alias_kind":"pith_short_8","alias_value":"6IRY77FK","created_at":"2026-07-05T09:11:43Z"}],"graph_snapshots":[{"event_id":"sha256:a3a1ad9f8906e248d6fbe8e4cf9b6725d39815a6d56c331e2d3551032b6411e8","target":"graph","created_at":"2026-07-05T09:11:43Z","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/2409.17079/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Coordinating the motion of multiple robots in cluttered environments remains a computationally challenging task. We study the problem of minimizing the execution time of a set of geometric paths by a team of robots with state-dependent actuation constraints. We propose a Time-Optimal Path Parameterization (TOPP) algorithm for multiple car-like agents, where the modulation of the timing of every robot along its assigned path is employed to ensure collision avoidance and dynamic feasibility. This is achieved through the use of a priority queue to determine the order of trajectory execution for e","authors_text":"Igor Spasojevic, Katherine Mao, Malakhi Hopkins, M. Ani Hsieh, Vijay Kumar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-25T16:44:53Z","title":"Collision-free time-optimal path parameterization for multi-robot teams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.17079","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:b472dde7b7c571476a9f1508e10442dfac4a81a9d7c757f2c483983921888662","target":"record","created_at":"2026-07-05T09:11:43Z","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":"be48354c35dbb44f77b53bf9fa9ef6be3379b845be9ac3d4f4b5e4e1f6643d5a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-25T16:44:53Z","title_canon_sha256":"d90ced0fc800195b6e50dfbe42a8b93404605cd2fa42c515042477281721595e"},"schema_version":"1.0","source":{"id":"2409.17079","kind":"arxiv","version":1}},"canonical_sha256":"f2238ffcaa08f6195192e61de97fd5f789e321313be978e1406b978ce93c8560","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2238ffcaa08f6195192e61de97fd5f789e321313be978e1406b978ce93c8560","first_computed_at":"2026-07-05T09:11:43.427194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:11:43.427194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c1ddf1tnvCcosCvud+QgGmrZvCvIs6ms1S5Z6LWzlCDVHCljkSWQ7JnP0LvsenZA0opVt1u6g7oHsh7d9ORjDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:11:43.427655Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.17079","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b472dde7b7c571476a9f1508e10442dfac4a81a9d7c757f2c483983921888662","sha256:a3a1ad9f8906e248d6fbe8e4cf9b6725d39815a6d56c331e2d3551032b6411e8"],"state_sha256":"5fe58218b5983d18e318f293e50df194ad21922b1afcadc6fbb0bbda31e9c532"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ST3tyVA+qPVJ2EK90NIFfAxwbWurfr/kpvuv1wUO8F5aXv6q4Op13ZEBR3F8CHGUzrCBkhVkxMYcMLrS1VzCCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T11:50:48.132440Z","bundle_sha256":"8c17f8134f86a7b43d13a1508532d35d9ef7879ef554fd692e8fb956e534b99f"}}