{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GSEE74DG3273NQUQ4FKKWFPMXI","short_pith_number":"pith:GSEE74DG","schema_version":"1.0","canonical_sha256":"34884ff066debfb6c290e154ab15ecba2f7c07a6ecbcc5ab4197036803258072","source":{"kind":"arxiv","id":"2211.15737","version":1},"attestation_state":"computed","paper":{"title":"Consensus-Based Optimization for Multi-Objective Problems: A Multi-Swarm Approach","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Claudia Totzeck, Kathrin Klamroth, Michael Stiglmayr","submitted_at":"2022-11-28T19:36:55Z","abstract_excerpt":"We propose a multi-swarm approach to approximate the Pareto front of general multi-objective optimization problems that is based on the Consensus-based Optimization method (CBO). The algorithm is motivated step by step beginning with a simple extension of CBO based on fixed scalarization weights. To overcome the issue of choosing the weights we propose an adaptive weight strategy in the second modelling step. The modelling process is concluded with the incorporation of a penalty strategy that avoids clusters along the Pareto front and a diffusion term that prevents collapsing swarms. Altogethe"},"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":"2211.15737","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2022-11-28T19:36:55Z","cross_cats_sorted":[],"title_canon_sha256":"751b12c4dec0171c80a40e2bb64f2bc51ed345436f7c316a9ecc5c3a672a4a80","abstract_canon_sha256":"0593e5b44a30eee668f1cda02fe0e073a6f63c52e1b45583acad784f39a681f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:20:17.543330Z","signature_b64":"Ozzx4KAYlsGptxrKsVWjxOHjuIyxllRm+Yo4B8CTB+VHxMMjX65lAEHD7bEEGp353syFg38MGIyqo8OEDuNbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34884ff066debfb6c290e154ab15ecba2f7c07a6ecbcc5ab4197036803258072","last_reissued_at":"2026-07-05T05:20:17.542909Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:20:17.542909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consensus-Based Optimization for Multi-Objective Problems: A Multi-Swarm Approach","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Claudia Totzeck, Kathrin Klamroth, Michael Stiglmayr","submitted_at":"2022-11-28T19:36:55Z","abstract_excerpt":"We propose a multi-swarm approach to approximate the Pareto front of general multi-objective optimization problems that is based on the Consensus-based Optimization method (CBO). The algorithm is motivated step by step beginning with a simple extension of CBO based on fixed scalarization weights. To overcome the issue of choosing the weights we propose an adaptive weight strategy in the second modelling step. The modelling process is concluded with the incorporation of a penalty strategy that avoids clusters along the Pareto front and a diffusion term that prevents collapsing swarms. Altogethe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.15737","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/2211.15737/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":"2211.15737","created_at":"2026-07-05T05:20:17.542973+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.15737v1","created_at":"2026-07-05T05:20:17.542973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.15737","created_at":"2026-07-05T05:20:17.542973+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSEE74DG3273","created_at":"2026-07-05T05:20:17.542973+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSEE74DG3273NQUQ","created_at":"2026-07-05T05:20:17.542973+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSEE74DG","created_at":"2026-07-05T05:20:17.542973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2310.16610","citing_title":"Consensus-Based Optimization with Truncated Noise","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GSEE74DG3273NQUQ4FKKWFPMXI","json":"https://pith.science/pith/GSEE74DG3273NQUQ4FKKWFPMXI.json","graph_json":"https://pith.science/api/pith-number/GSEE74DG3273NQUQ4FKKWFPMXI/graph.json","events_json":"https://pith.science/api/pith-number/GSEE74DG3273NQUQ4FKKWFPMXI/events.json","paper":"https://pith.science/paper/GSEE74DG"},"agent_actions":{"view_html":"https://pith.science/pith/GSEE74DG3273NQUQ4FKKWFPMXI","download_json":"https://pith.science/pith/GSEE74DG3273NQUQ4FKKWFPMXI.json","view_paper":"https://pith.science/paper/GSEE74DG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.15737&json=true","fetch_graph":"https://pith.science/api/pith-number/GSEE74DG3273NQUQ4FKKWFPMXI/graph.json","fetch_events":"https://pith.science/api/pith-number/GSEE74DG3273NQUQ4FKKWFPMXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSEE74DG3273NQUQ4FKKWFPMXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSEE74DG3273NQUQ4FKKWFPMXI/action/storage_attestation","attest_author":"https://pith.science/pith/GSEE74DG3273NQUQ4FKKWFPMXI/action/author_attestation","sign_citation":"https://pith.science/pith/GSEE74DG3273NQUQ4FKKWFPMXI/action/citation_signature","submit_replication":"https://pith.science/pith/GSEE74DG3273NQUQ4FKKWFPMXI/action/replication_record"}},"created_at":"2026-07-05T05:20:17.542973+00:00","updated_at":"2026-07-05T05:20:17.542973+00:00"}