{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:QE65X73Z5ZV2I2AEQXV7KQQZAI","short_pith_number":"pith:QE65X73Z","canonical_record":{"source":{"id":"2401.06021","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-01-11T16:32:11Z","cross_cats_sorted":[],"title_canon_sha256":"00c20cc93c4745dfe3fea408d94364de140cd6be3f12aacd10ab63d4c25a9804","abstract_canon_sha256":"a6a4e3a42ace42464f3256463b19bdf49c135e8cabc7af1f2e76b401f31544cf"},"schema_version":"1.0"},"canonical_sha256":"813ddbff79ee6ba4680485ebf54219023f6d8b8c0a43238897c9c67bf1d223de","source":{"kind":"arxiv","id":"2401.06021","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.06021","created_at":"2026-07-05T09:15:54Z"},{"alias_kind":"arxiv_version","alias_value":"2401.06021v2","created_at":"2026-07-05T09:15:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.06021","created_at":"2026-07-05T09:15:54Z"},{"alias_kind":"pith_short_12","alias_value":"QE65X73Z5ZV2","created_at":"2026-07-05T09:15:54Z"},{"alias_kind":"pith_short_16","alias_value":"QE65X73Z5ZV2I2AE","created_at":"2026-07-05T09:15:54Z"},{"alias_kind":"pith_short_8","alias_value":"QE65X73Z","created_at":"2026-07-05T09:15:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:QE65X73Z5ZV2I2AEQXV7KQQZAI","target":"record","payload":{"canonical_record":{"source":{"id":"2401.06021","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-01-11T16:32:11Z","cross_cats_sorted":[],"title_canon_sha256":"00c20cc93c4745dfe3fea408d94364de140cd6be3f12aacd10ab63d4c25a9804","abstract_canon_sha256":"a6a4e3a42ace42464f3256463b19bdf49c135e8cabc7af1f2e76b401f31544cf"},"schema_version":"1.0"},"canonical_sha256":"813ddbff79ee6ba4680485ebf54219023f6d8b8c0a43238897c9c67bf1d223de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:54.417398Z","signature_b64":"LuN8hZvfuKRDgPS2hMZowzpxyTDS57U8lQyqSwHovFKA/kV2jnUI1TogeAx13PieBhlWM0QHEMcr48ZH4HmIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"813ddbff79ee6ba4680485ebf54219023f6d8b8c0a43238897c9c67bf1d223de","last_reissued_at":"2026-07-05T09:15:54.416895Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:54.416895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.06021","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-07-05T09:15:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOAadRB1Mcg887qWcHOGexFLma4M7Ulore88tXTufIrEywq63HGMT+f9DuUd8OiQSeD78usXD5IPQQ6vXE5gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:18:38.296305Z"},"content_sha256":"b9726fc494d5424958925705afbe3b2156b28f6b1a7852c5137cf916518d5aec","schema_version":"1.0","event_id":"sha256:b9726fc494d5424958925705afbe3b2156b28f6b1a7852c5137cf916518d5aec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:QE65X73Z5ZV2I2AEQXV7KQQZAI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topology-Driven Parallel Trajectory Optimization in Dynamic Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dariu M. Gavrila, Javier Alonso-Mora, Laura Ferranti, Oscar de Groot","submitted_at":"2024-01-11T16:32:11Z","abstract_excerpt":"Ground robots navigating in complex, dynamic environments must compute collision-free trajectories to avoid obstacles safely and efficiently. Nonconvex optimization is a popular method to compute a trajectory in real-time. However, these methods often converge to locally optimal solutions and frequently switch between different local minima, leading to inefficient and unsafe robot motion. In this work, We propose a novel topology-driven trajectory optimization strategy for dynamic environments that plans multiple distinct evasive trajectories to enhance the robot's behavior and efficiency. A g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.06021","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.06021/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:15:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jSBUTNPgxFNzps+gjhV441o3V3ksGzTheHIdZ6TBKoa6zBWx7hEuxHch1Ah6mi5K+AOfpbD19MPIij7oUjNIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:18:38.296849Z"},"content_sha256":"bde6a5ac5ba20e272ce470bc1e060b27c94606c9fb83b3841e582e665a338d15","schema_version":"1.0","event_id":"sha256:bde6a5ac5ba20e272ce470bc1e060b27c94606c9fb83b3841e582e665a338d15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI/bundle.json","state_url":"https://pith.science/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI/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-17T17:18:38Z","links":{"resolver":"https://pith.science/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI","bundle":"https://pith.science/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI/bundle.json","state":"https://pith.science/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QE65X73Z5ZV2I2AEQXV7KQQZAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QE65X73Z5ZV2I2AEQXV7KQQZAI","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":"a6a4e3a42ace42464f3256463b19bdf49c135e8cabc7af1f2e76b401f31544cf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-01-11T16:32:11Z","title_canon_sha256":"00c20cc93c4745dfe3fea408d94364de140cd6be3f12aacd10ab63d4c25a9804"},"schema_version":"1.0","source":{"id":"2401.06021","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.06021","created_at":"2026-07-05T09:15:54Z"},{"alias_kind":"arxiv_version","alias_value":"2401.06021v2","created_at":"2026-07-05T09:15:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.06021","created_at":"2026-07-05T09:15:54Z"},{"alias_kind":"pith_short_12","alias_value":"QE65X73Z5ZV2","created_at":"2026-07-05T09:15:54Z"},{"alias_kind":"pith_short_16","alias_value":"QE65X73Z5ZV2I2AE","created_at":"2026-07-05T09:15:54Z"},{"alias_kind":"pith_short_8","alias_value":"QE65X73Z","created_at":"2026-07-05T09:15:54Z"}],"graph_snapshots":[{"event_id":"sha256:bde6a5ac5ba20e272ce470bc1e060b27c94606c9fb83b3841e582e665a338d15","target":"graph","created_at":"2026-07-05T09:15:54Z","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/2401.06021/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ground robots navigating in complex, dynamic environments must compute collision-free trajectories to avoid obstacles safely and efficiently. Nonconvex optimization is a popular method to compute a trajectory in real-time. However, these methods often converge to locally optimal solutions and frequently switch between different local minima, leading to inefficient and unsafe robot motion. In this work, We propose a novel topology-driven trajectory optimization strategy for dynamic environments that plans multiple distinct evasive trajectories to enhance the robot's behavior and efficiency. A g","authors_text":"Dariu M. Gavrila, Javier Alonso-Mora, Laura Ferranti, Oscar de Groot","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-01-11T16:32:11Z","title":"Topology-Driven Parallel Trajectory Optimization in Dynamic Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.06021","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:b9726fc494d5424958925705afbe3b2156b28f6b1a7852c5137cf916518d5aec","target":"record","created_at":"2026-07-05T09:15:54Z","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":"a6a4e3a42ace42464f3256463b19bdf49c135e8cabc7af1f2e76b401f31544cf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-01-11T16:32:11Z","title_canon_sha256":"00c20cc93c4745dfe3fea408d94364de140cd6be3f12aacd10ab63d4c25a9804"},"schema_version":"1.0","source":{"id":"2401.06021","kind":"arxiv","version":2}},"canonical_sha256":"813ddbff79ee6ba4680485ebf54219023f6d8b8c0a43238897c9c67bf1d223de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"813ddbff79ee6ba4680485ebf54219023f6d8b8c0a43238897c9c67bf1d223de","first_computed_at":"2026-07-05T09:15:54.416895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:15:54.416895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LuN8hZvfuKRDgPS2hMZowzpxyTDS57U8lQyqSwHovFKA/kV2jnUI1TogeAx13PieBhlWM0QHEMcr48ZH4HmIAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:15:54.417398Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.06021","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9726fc494d5424958925705afbe3b2156b28f6b1a7852c5137cf916518d5aec","sha256:bde6a5ac5ba20e272ce470bc1e060b27c94606c9fb83b3841e582e665a338d15"],"state_sha256":"8c40a0b9f0737691bb048fedec8f76b7231cc346f55a57ec29d3eb42c01f0317"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FxppbA9o/QlzQbm9PDE62DH+/Y2xjHsxxGN4YQVnYPQQd2kqp5pCcPwqgRM2UKnr4YMWO/UFawq5WYceDciaCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T17:18:38.303743Z","bundle_sha256":"b132a4d80356098d36ff0a6ed58ce4d3df416bb7ec810e3a4f5f3cbef0c63185"}}