{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BO2OFIJGDOTTLHTQ5CCNQ3FZLH","short_pith_number":"pith:BO2OFIJG","schema_version":"1.0","canonical_sha256":"0bb4e2a1261ba7359e70e884d86cb959f5b03ecbe7389952947e2a27d57ea40b","source":{"kind":"arxiv","id":"2602.06868","version":2},"attestation_state":"computed","paper":{"title":"Consensus-based optimization (CBO): Towards Global Optimality in Robotics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Armand Jordana, Jalal Etesami, Majid Khadiv, Massimo Fornasier, Xudong Sun","submitted_at":"2026-02-06T16:55:10Z","abstract_excerpt":"Zero-order optimization has recently received significant attention for designing optimal trajectories and policies for robotic systems. However, most existing methods (e.g., MPPI, CEM, and CMA-ES) are local in nature, as they rely on gradient estimation. In this paper, we introduce consensus-based optimization (CBO) to robotics, which is guaranteed to converge to a global optimum under mild assumptions. We provide theoretical analysis and illustrative examples that give intuition into the fundamental differences between CBO and existing methods. To demonstrate the scalability of CBO for robot"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2602.06868","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-02-06T16:55:10Z","cross_cats_sorted":[],"title_canon_sha256":"c4f73b8ccdc6af4523c41ebf23eb272d504f94f1c2d4dc7e6968921cebf301b2","abstract_canon_sha256":"bae9ae887cd5feeecccfdbf3445f2d702facd4aee897f8dfde2b35cb6dac0ee6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:32.850838Z","signature_b64":"V6+WceSXw6mFXat7lDtcY3bfnOBB3Lxm8yd2UZbgBKc7jB8AKZFwTH6XLGO5BJInZ13UuipYaJnW7cksSZhcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bb4e2a1261ba7359e70e884d86cb959f5b03ecbe7389952947e2a27d57ea40b","last_reissued_at":"2026-06-11T01:10:32.849828Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:32.849828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consensus-based optimization (CBO): Towards Global Optimality in Robotics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Armand Jordana, Jalal Etesami, Majid Khadiv, Massimo Fornasier, Xudong Sun","submitted_at":"2026-02-06T16:55:10Z","abstract_excerpt":"Zero-order optimization has recently received significant attention for designing optimal trajectories and policies for robotic systems. However, most existing methods (e.g., MPPI, CEM, and CMA-ES) are local in nature, as they rely on gradient estimation. In this paper, we introduce consensus-based optimization (CBO) to robotics, which is guaranteed to converge to a global optimum under mild assumptions. We provide theoretical analysis and illustrative examples that give intuition into the fundamental differences between CBO and existing methods. To demonstrate the scalability of CBO for robot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.06868","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/2602.06868/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2602.06868","created_at":"2026-06-11T01:10:32.849982+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.06868v2","created_at":"2026-06-11T01:10:32.849982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.06868","created_at":"2026-06-11T01:10:32.849982+00:00"},{"alias_kind":"pith_short_12","alias_value":"BO2OFIJGDOTT","created_at":"2026-06-11T01:10:32.849982+00:00"},{"alias_kind":"pith_short_16","alias_value":"BO2OFIJGDOTTLHTQ","created_at":"2026-06-11T01:10:32.849982+00:00"},{"alias_kind":"pith_short_8","alias_value":"BO2OFIJG","created_at":"2026-06-11T01:10:32.849982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19667","citing_title":"Convergence of Consensus-Based Particle Methods for Nonconvex Bi-Level Optimization","ref_index":180,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BO2OFIJGDOTTLHTQ5CCNQ3FZLH","json":"https://pith.science/pith/BO2OFIJGDOTTLHTQ5CCNQ3FZLH.json","graph_json":"https://pith.science/api/pith-number/BO2OFIJGDOTTLHTQ5CCNQ3FZLH/graph.json","events_json":"https://pith.science/api/pith-number/BO2OFIJGDOTTLHTQ5CCNQ3FZLH/events.json","paper":"https://pith.science/paper/BO2OFIJG"},"agent_actions":{"view_html":"https://pith.science/pith/BO2OFIJGDOTTLHTQ5CCNQ3FZLH","download_json":"https://pith.science/pith/BO2OFIJGDOTTLHTQ5CCNQ3FZLH.json","view_paper":"https://pith.science/paper/BO2OFIJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.06868&json=true","fetch_graph":"https://pith.science/api/pith-number/BO2OFIJGDOTTLHTQ5CCNQ3FZLH/graph.json","fetch_events":"https://pith.science/api/pith-number/BO2OFIJGDOTTLHTQ5CCNQ3FZLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BO2OFIJGDOTTLHTQ5CCNQ3FZLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BO2OFIJGDOTTLHTQ5CCNQ3FZLH/action/storage_attestation","attest_author":"https://pith.science/pith/BO2OFIJGDOTTLHTQ5CCNQ3FZLH/action/author_attestation","sign_citation":"https://pith.science/pith/BO2OFIJGDOTTLHTQ5CCNQ3FZLH/action/citation_signature","submit_replication":"https://pith.science/pith/BO2OFIJGDOTTLHTQ5CCNQ3FZLH/action/replication_record"}},"created_at":"2026-06-11T01:10:32.849982+00:00","updated_at":"2026-06-11T01:10:32.849982+00:00"}