{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JKW7KHCAPY65HBYHU2QNYVZNM5","short_pith_number":"pith:JKW7KHCA","schema_version":"1.0","canonical_sha256":"4aadf51c407e3dd38707a6a0dc572d676e5ec8de71bdfbca979214b9c3fd80a0","source":{"kind":"arxiv","id":"2607.10205","version":1},"attestation_state":"computed","paper":{"title":"Exploiting Structure with Anisotropic Consensus-Based Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Konstantin Riedl, Sabrina Bonandin, Sara Veneruso","submitted_at":"2026-07-11T08:32:48Z","abstract_excerpt":"Anisotropic consensus-based optimization (CBO), a multi-agent metaheuristic derivative-free optimization method, which reliably finds global minima of nonsmooth and nonconvex objective functions while being amenable to rigorous theoretical analysis, automatically detects and exploits additively separable structures of high-dimensional objective functions. This enables the algorithm to mitigate the curse of dimensionality where the objective function decomposes additively into lower-dimensional components. In this paper, we show this property proving that the computational complexity of anisotr"},"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":"2607.10205","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-11T08:32:48Z","cross_cats_sorted":[],"title_canon_sha256":"ed03897effe0b712e7ba4b6789cdd2acc7f17e6202390a7b488f2fb9153f05ad","abstract_canon_sha256":"af94864cee3a890572bd0368bcbbbed914e45ea8746fa084acaec65ef8a4b299"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:20:30.620116Z","signature_b64":"UsvgzlhPFBaYg8BbixecplFkwjB92CCPq6UTzV0+nuxb2eq0Ic/QW1b98fUqgJFxMxdGqXIwjJeKD2rmf0KvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aadf51c407e3dd38707a6a0dc572d676e5ec8de71bdfbca979214b9c3fd80a0","last_reissued_at":"2026-07-14T01:20:30.619238Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:20:30.619238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Structure with Anisotropic Consensus-Based Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Konstantin Riedl, Sabrina Bonandin, Sara Veneruso","submitted_at":"2026-07-11T08:32:48Z","abstract_excerpt":"Anisotropic consensus-based optimization (CBO), a multi-agent metaheuristic derivative-free optimization method, which reliably finds global minima of nonsmooth and nonconvex objective functions while being amenable to rigorous theoretical analysis, automatically detects and exploits additively separable structures of high-dimensional objective functions. This enables the algorithm to mitigate the curse of dimensionality where the objective function decomposes additively into lower-dimensional components. In this paper, we show this property proving that the computational complexity of anisotr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10205","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/2607.10205/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":"2607.10205","created_at":"2026-07-14T01:20:30.619701+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.10205v1","created_at":"2026-07-14T01:20:30.619701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10205","created_at":"2026-07-14T01:20:30.619701+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKW7KHCAPY65","created_at":"2026-07-14T01:20:30.619701+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKW7KHCAPY65HBYH","created_at":"2026-07-14T01:20:30.619701+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKW7KHCA","created_at":"2026-07-14T01:20:30.619701+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JKW7KHCAPY65HBYHU2QNYVZNM5","json":"https://pith.science/pith/JKW7KHCAPY65HBYHU2QNYVZNM5.json","graph_json":"https://pith.science/api/pith-number/JKW7KHCAPY65HBYHU2QNYVZNM5/graph.json","events_json":"https://pith.science/api/pith-number/JKW7KHCAPY65HBYHU2QNYVZNM5/events.json","paper":"https://pith.science/paper/JKW7KHCA"},"agent_actions":{"view_html":"https://pith.science/pith/JKW7KHCAPY65HBYHU2QNYVZNM5","download_json":"https://pith.science/pith/JKW7KHCAPY65HBYHU2QNYVZNM5.json","view_paper":"https://pith.science/paper/JKW7KHCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.10205&json=true","fetch_graph":"https://pith.science/api/pith-number/JKW7KHCAPY65HBYHU2QNYVZNM5/graph.json","fetch_events":"https://pith.science/api/pith-number/JKW7KHCAPY65HBYHU2QNYVZNM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKW7KHCAPY65HBYHU2QNYVZNM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKW7KHCAPY65HBYHU2QNYVZNM5/action/storage_attestation","attest_author":"https://pith.science/pith/JKW7KHCAPY65HBYHU2QNYVZNM5/action/author_attestation","sign_citation":"https://pith.science/pith/JKW7KHCAPY65HBYHU2QNYVZNM5/action/citation_signature","submit_replication":"https://pith.science/pith/JKW7KHCAPY65HBYHU2QNYVZNM5/action/replication_record"}},"created_at":"2026-07-14T01:20:30.619701+00:00","updated_at":"2026-07-14T01:20:30.619701+00:00"}