{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3TZ5GAM5KKEEVACMYJ2HSRAKWQ","short_pith_number":"pith:3TZ5GAM5","canonical_record":{"source":{"id":"2606.00737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-30T14:09:14Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d8fff01d3829c75df1b8baa9826b59e8b931ea74d3cee2b3191a5adea71a3a11","abstract_canon_sha256":"ad5950bff9d007545f2cf1e3112b62df6c76b180d0db2144ee03c7e0ae9ea0e1"},"schema_version":"1.0"},"canonical_sha256":"dcf3d3019d52884a804cc27479440ab416b47500bf60be2c8097ddf7703cff4b","source":{"kind":"arxiv","id":"2606.00737","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00737","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00737v1","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00737","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"pith_short_12","alias_value":"3TZ5GAM5KKEE","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"pith_short_16","alias_value":"3TZ5GAM5KKEEVACM","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"pith_short_8","alias_value":"3TZ5GAM5","created_at":"2026-06-02T01:04:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3TZ5GAM5KKEEVACMYJ2HSRAKWQ","target":"record","payload":{"canonical_record":{"source":{"id":"2606.00737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-30T14:09:14Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d8fff01d3829c75df1b8baa9826b59e8b931ea74d3cee2b3191a5adea71a3a11","abstract_canon_sha256":"ad5950bff9d007545f2cf1e3112b62df6c76b180d0db2144ee03c7e0ae9ea0e1"},"schema_version":"1.0"},"canonical_sha256":"dcf3d3019d52884a804cc27479440ab416b47500bf60be2c8097ddf7703cff4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:04.215719Z","signature_b64":"+xxB6CX/v8vw7zZ0Yvj9c6Dv/OP9kUBkux9doRxPmy4Kot3v6lXE2oMkSyshrq9ejjl69Skm51+5JBcSadXdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcf3d3019d52884a804cc27479440ab416b47500bf60be2c8097ddf7703cff4b","last_reissued_at":"2026-06-02T01:04:04.215311Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:04.215311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.00737","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-06-02T01:04:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocEdktYVVngot6tI2jKczBrKIdw4ZSGULVsKpz20/hjARa7kKuG0y42TXnKg5cJVZFA7pgzeuvEc5kY+XNpsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:00:28.061172Z"},"content_sha256":"76fa29d7751141ccf92efd6cd525eb3969112b6007b532299001918fb3e83c68","schema_version":"1.0","event_id":"sha256:76fa29d7751141ccf92efd6cd525eb3969112b6007b532299001918fb3e83c68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3TZ5GAM5KKEEVACMYJ2HSRAKWQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond Pure Sampling: Hybrid Optimization Mechanisms for Non-Convex Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Akash Ratheesh, Evangelos A. Theodorou, Minchan Jung, Yuichiro Aoyama","submitted_at":"2026-05-30T14:09:14Z","abstract_excerpt":"This paper investigates the optimization mechanisms of non-convex Model Predictive Control (MPC) using the Maximum Entropy Differential Dynamic Programming (ME-DDP) framework. Navigating non-convex cost landscapes induced by nonlinear dynamics, multiple obstacles, etc. remains a fundamental challenge in robotics, where gradient-based methods frequently converge to suboptimal local minima. We demonstrate a dual-step optimization mechanism designed to overcome these traps. (1) an initial phase of using DDP to exploit the gradient of the cost landscape, followed by (2) disruption of the optimizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00737","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/2606.00737/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-06-02T01:04:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nImxTxYLvaQ2Ua2rf7WRuubrBQfv1iID8KTedhDecxx8EIpEJVWJbWLRL0cV/EHiM1i6Xh9SlqptAmLXRIiLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:00:28.061557Z"},"content_sha256":"a3ba8d06c29d87e876a315a486c0bc92469bd1dcfa939632c97d9292283a6b6d","schema_version":"1.0","event_id":"sha256:a3ba8d06c29d87e876a315a486c0bc92469bd1dcfa939632c97d9292283a6b6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3TZ5GAM5KKEEVACMYJ2HSRAKWQ/bundle.json","state_url":"https://pith.science/pith/3TZ5GAM5KKEEVACMYJ2HSRAKWQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3TZ5GAM5KKEEVACMYJ2HSRAKWQ/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-06-27T12:00:28Z","links":{"resolver":"https://pith.science/pith/3TZ5GAM5KKEEVACMYJ2HSRAKWQ","bundle":"https://pith.science/pith/3TZ5GAM5KKEEVACMYJ2HSRAKWQ/bundle.json","state":"https://pith.science/pith/3TZ5GAM5KKEEVACMYJ2HSRAKWQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3TZ5GAM5KKEEVACMYJ2HSRAKWQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3TZ5GAM5KKEEVACMYJ2HSRAKWQ","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":"ad5950bff9d007545f2cf1e3112b62df6c76b180d0db2144ee03c7e0ae9ea0e1","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-30T14:09:14Z","title_canon_sha256":"d8fff01d3829c75df1b8baa9826b59e8b931ea74d3cee2b3191a5adea71a3a11"},"schema_version":"1.0","source":{"id":"2606.00737","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00737","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00737v1","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00737","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"pith_short_12","alias_value":"3TZ5GAM5KKEE","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"pith_short_16","alias_value":"3TZ5GAM5KKEEVACM","created_at":"2026-06-02T01:04:04Z"},{"alias_kind":"pith_short_8","alias_value":"3TZ5GAM5","created_at":"2026-06-02T01:04:04Z"}],"graph_snapshots":[{"event_id":"sha256:a3ba8d06c29d87e876a315a486c0bc92469bd1dcfa939632c97d9292283a6b6d","target":"graph","created_at":"2026-06-02T01:04:04Z","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/2606.00737/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper investigates the optimization mechanisms of non-convex Model Predictive Control (MPC) using the Maximum Entropy Differential Dynamic Programming (ME-DDP) framework. Navigating non-convex cost landscapes induced by nonlinear dynamics, multiple obstacles, etc. remains a fundamental challenge in robotics, where gradient-based methods frequently converge to suboptimal local minima. We demonstrate a dual-step optimization mechanism designed to overcome these traps. (1) an initial phase of using DDP to exploit the gradient of the cost landscape, followed by (2) disruption of the optimizat","authors_text":"Akash Ratheesh, Evangelos A. Theodorou, Minchan Jung, Yuichiro Aoyama","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-30T14:09:14Z","title":"Beyond Pure Sampling: Hybrid Optimization Mechanisms for Non-Convex Model Predictive Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00737","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:76fa29d7751141ccf92efd6cd525eb3969112b6007b532299001918fb3e83c68","target":"record","created_at":"2026-06-02T01:04:04Z","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":"ad5950bff9d007545f2cf1e3112b62df6c76b180d0db2144ee03c7e0ae9ea0e1","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-30T14:09:14Z","title_canon_sha256":"d8fff01d3829c75df1b8baa9826b59e8b931ea74d3cee2b3191a5adea71a3a11"},"schema_version":"1.0","source":{"id":"2606.00737","kind":"arxiv","version":1}},"canonical_sha256":"dcf3d3019d52884a804cc27479440ab416b47500bf60be2c8097ddf7703cff4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcf3d3019d52884a804cc27479440ab416b47500bf60be2c8097ddf7703cff4b","first_computed_at":"2026-06-02T01:04:04.215311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:04:04.215311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+xxB6CX/v8vw7zZ0Yvj9c6Dv/OP9kUBkux9doRxPmy4Kot3v6lXE2oMkSyshrq9ejjl69Skm51+5JBcSadXdAw==","signature_status":"signed_v1","signed_at":"2026-06-02T01:04:04.215719Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.00737","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76fa29d7751141ccf92efd6cd525eb3969112b6007b532299001918fb3e83c68","sha256:a3ba8d06c29d87e876a315a486c0bc92469bd1dcfa939632c97d9292283a6b6d"],"state_sha256":"09c5a13a7495fa84bbec041354abad030891ffd083855bc379204aa653cb0059"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LI7DqVyOohnc8Fq8ARKKFjmUkAK1sU+Cf3FMs6sQTyUdC3Ft0bRoq6Y1HmBZMWe582ptymRLqYTJLjC1TNlIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:00:28.063704Z","bundle_sha256":"30080a78538dad4e1d392012a621be378e9af34874bd77ad09129d5a468ccf4d"}}