{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:OG3J7YNT6A5TR5RTVAT6RAJALV","short_pith_number":"pith:OG3J7YNT","canonical_record":{"source":{"id":"2205.04422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-05-09T17:03:06Z","cross_cats_sorted":[],"title_canon_sha256":"7b664392f16af83a745de36baa5cf082f5f3dadc2512a37b3c46bc3d8fd2782f","abstract_canon_sha256":"f8c1df8b5af612b5f91e420c975f4c8f63e08d353ab9a076004866a3367d3df0"},"schema_version":"1.0"},"canonical_sha256":"71b69fe1b3f03b38f633a827e881205d7e31ca0273effc0bd6a026284c27a870","source":{"kind":"arxiv","id":"2205.04422","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.04422","created_at":"2026-07-05T04:21:24Z"},{"alias_kind":"arxiv_version","alias_value":"2205.04422v1","created_at":"2026-07-05T04:21:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.04422","created_at":"2026-07-05T04:21:24Z"},{"alias_kind":"pith_short_12","alias_value":"OG3J7YNT6A5T","created_at":"2026-07-05T04:21:24Z"},{"alias_kind":"pith_short_16","alias_value":"OG3J7YNT6A5TR5RT","created_at":"2026-07-05T04:21:24Z"},{"alias_kind":"pith_short_8","alias_value":"OG3J7YNT","created_at":"2026-07-05T04:21:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:OG3J7YNT6A5TR5RTVAT6RAJALV","target":"record","payload":{"canonical_record":{"source":{"id":"2205.04422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-05-09T17:03:06Z","cross_cats_sorted":[],"title_canon_sha256":"7b664392f16af83a745de36baa5cf082f5f3dadc2512a37b3c46bc3d8fd2782f","abstract_canon_sha256":"f8c1df8b5af612b5f91e420c975f4c8f63e08d353ab9a076004866a3367d3df0"},"schema_version":"1.0"},"canonical_sha256":"71b69fe1b3f03b38f633a827e881205d7e31ca0273effc0bd6a026284c27a870","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:21:24.710456Z","signature_b64":"g/S9kJAkT+IRZ275f+69892+VVrGl48JEVFMNhHA8iIH+q6eQhzc7ZTCpoNN9sUNBcVwmmoEb5Xoce4DMcfHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71b69fe1b3f03b38f633a827e881205d7e31ca0273effc0bd6a026284c27a870","last_reissued_at":"2026-07-05T04:21:24.709947Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:21:24.709947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.04422","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-05T04:21:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jVhPfZ90nTmhfRC5wit3+3P458fqafWsBautm8Wbddnl2j5ZBV0zg+i6hqSwYRldK738NzJlEJWdfe2Ebk3ABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T18:47:07.609174Z"},"content_sha256":"e2f8a3b239eebe93475fd8baadff6d61958d4ab7231fe08fd346466eeec4957d","schema_version":"1.0","event_id":"sha256:e2f8a3b239eebe93475fd8baadff6d61958d4ab7231fe08fd346466eeec4957d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:OG3J7YNT6A5TR5RTVAT6RAJALV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Motion Planning around Obstacles with Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"David von Wrangel, Mark Petersen, Russ Tedrake, Tobia Marcucci","submitted_at":"2022-05-09T17:03:06Z","abstract_excerpt":"Trajectory optimization offers mature tools for motion planning in high-dimensional spaces under dynamic constraints. However, when facing complex configuration spaces, cluttered with obstacles, roboticists typically fall back to sampling-based planners that struggle in very high dimensions and with continuous differential constraints. Indeed, obstacles are the source of many textbook examples of problematic nonconvexities in the trajectory-optimization problem. Here we show that convex optimization can, in fact, be used to reliably plan trajectories around obstacles. Specifically, we consider"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.04422","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/2205.04422/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-05T04:21:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bcww3V/JSrzGrbeYDNr36IVYJ4FAF5OfBSos4zXkLJMmtfl3sC6obcwEFhwd7WJRxxE4uHXY9JBvwR+fAa+7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T18:47:07.610107Z"},"content_sha256":"5624b53c5c04c7f6eb700aac0ad801184372e5fe19add38f3649b0f33431ed57","schema_version":"1.0","event_id":"sha256:5624b53c5c04c7f6eb700aac0ad801184372e5fe19add38f3649b0f33431ed57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OG3J7YNT6A5TR5RTVAT6RAJALV/bundle.json","state_url":"https://pith.science/pith/OG3J7YNT6A5TR5RTVAT6RAJALV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OG3J7YNT6A5TR5RTVAT6RAJALV/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-04T18:47:07Z","links":{"resolver":"https://pith.science/pith/OG3J7YNT6A5TR5RTVAT6RAJALV","bundle":"https://pith.science/pith/OG3J7YNT6A5TR5RTVAT6RAJALV/bundle.json","state":"https://pith.science/pith/OG3J7YNT6A5TR5RTVAT6RAJALV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OG3J7YNT6A5TR5RTVAT6RAJALV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:OG3J7YNT6A5TR5RTVAT6RAJALV","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":"f8c1df8b5af612b5f91e420c975f4c8f63e08d353ab9a076004866a3367d3df0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-05-09T17:03:06Z","title_canon_sha256":"7b664392f16af83a745de36baa5cf082f5f3dadc2512a37b3c46bc3d8fd2782f"},"schema_version":"1.0","source":{"id":"2205.04422","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.04422","created_at":"2026-07-05T04:21:24Z"},{"alias_kind":"arxiv_version","alias_value":"2205.04422v1","created_at":"2026-07-05T04:21:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.04422","created_at":"2026-07-05T04:21:24Z"},{"alias_kind":"pith_short_12","alias_value":"OG3J7YNT6A5T","created_at":"2026-07-05T04:21:24Z"},{"alias_kind":"pith_short_16","alias_value":"OG3J7YNT6A5TR5RT","created_at":"2026-07-05T04:21:24Z"},{"alias_kind":"pith_short_8","alias_value":"OG3J7YNT","created_at":"2026-07-05T04:21:24Z"}],"graph_snapshots":[{"event_id":"sha256:5624b53c5c04c7f6eb700aac0ad801184372e5fe19add38f3649b0f33431ed57","target":"graph","created_at":"2026-07-05T04:21:24Z","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/2205.04422/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Trajectory optimization offers mature tools for motion planning in high-dimensional spaces under dynamic constraints. However, when facing complex configuration spaces, cluttered with obstacles, roboticists typically fall back to sampling-based planners that struggle in very high dimensions and with continuous differential constraints. Indeed, obstacles are the source of many textbook examples of problematic nonconvexities in the trajectory-optimization problem. Here we show that convex optimization can, in fact, be used to reliably plan trajectories around obstacles. Specifically, we consider","authors_text":"David von Wrangel, Mark Petersen, Russ Tedrake, Tobia Marcucci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-05-09T17:03:06Z","title":"Motion Planning around Obstacles with Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.04422","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:e2f8a3b239eebe93475fd8baadff6d61958d4ab7231fe08fd346466eeec4957d","target":"record","created_at":"2026-07-05T04:21:24Z","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":"f8c1df8b5af612b5f91e420c975f4c8f63e08d353ab9a076004866a3367d3df0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-05-09T17:03:06Z","title_canon_sha256":"7b664392f16af83a745de36baa5cf082f5f3dadc2512a37b3c46bc3d8fd2782f"},"schema_version":"1.0","source":{"id":"2205.04422","kind":"arxiv","version":1}},"canonical_sha256":"71b69fe1b3f03b38f633a827e881205d7e31ca0273effc0bd6a026284c27a870","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71b69fe1b3f03b38f633a827e881205d7e31ca0273effc0bd6a026284c27a870","first_computed_at":"2026-07-05T04:21:24.709947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:21:24.709947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g/S9kJAkT+IRZ275f+69892+VVrGl48JEVFMNhHA8iIH+q6eQhzc7ZTCpoNN9sUNBcVwmmoEb5Xoce4DMcfHDw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:21:24.710456Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.04422","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2f8a3b239eebe93475fd8baadff6d61958d4ab7231fe08fd346466eeec4957d","sha256:5624b53c5c04c7f6eb700aac0ad801184372e5fe19add38f3649b0f33431ed57"],"state_sha256":"1ac98e95cf919527eaa9db35d3e066b836db8029bd52122124e5a7ffa1d540be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0m1dg5+OQTQ6v8oxQPXdCdzU4lOQhSkFJyKMpTfZh6yvm3qR4F4Aq4EN2SrG3he/BRwBC8KN+mAWQD9rh00fAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T18:47:07.615871Z","bundle_sha256":"8ab14603a7a09ca4a55741ab25ef83802618043261b35a273d6e876a913c2e8f"}}