{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:UP366MSZCA4HC6QS3PEPBXLRQ6","short_pith_number":"pith:UP366MSZ","canonical_record":{"source":{"id":"2203.16384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-30T15:14:55Z","cross_cats_sorted":[],"title_canon_sha256":"55de6ae06a49029ce48d9706991903ffc1e6ba5dfa439f20c639bbe36b74fbbe","abstract_canon_sha256":"8c012b3a1d3df0ff69917d8165951af66965f5614bb33853bdd43a3048284738"},"schema_version":"1.0"},"canonical_sha256":"a3f7ef32591038717a12dbc8f0dd7187929cc4415d41ee208db7931e92caf2d5","source":{"kind":"arxiv","id":"2203.16384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.16384","created_at":"2026-07-05T04:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"2203.16384v1","created_at":"2026-07-05T04:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.16384","created_at":"2026-07-05T04:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"UP366MSZCA4H","created_at":"2026-07-05T04:10:10Z"},{"alias_kind":"pith_short_16","alias_value":"UP366MSZCA4HC6QS","created_at":"2026-07-05T04:10:10Z"},{"alias_kind":"pith_short_8","alias_value":"UP366MSZ","created_at":"2026-07-05T04:10:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:UP366MSZCA4HC6QS3PEPBXLRQ6","target":"record","payload":{"canonical_record":{"source":{"id":"2203.16384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-30T15:14:55Z","cross_cats_sorted":[],"title_canon_sha256":"55de6ae06a49029ce48d9706991903ffc1e6ba5dfa439f20c639bbe36b74fbbe","abstract_canon_sha256":"8c012b3a1d3df0ff69917d8165951af66965f5614bb33853bdd43a3048284738"},"schema_version":"1.0"},"canonical_sha256":"a3f7ef32591038717a12dbc8f0dd7187929cc4415d41ee208db7931e92caf2d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:10:10.285619Z","signature_b64":"d923Q5fMO0KnToxDrR0p6T+0qLz8jcez7WdvMnR4tuE4jJP8LuPTRk+ygJUU/uucgP/VhMkWMQmDVY/TFYBuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3f7ef32591038717a12dbc8f0dd7187929cc4415d41ee208db7931e92caf2d5","last_reissued_at":"2026-07-05T04:10:10.285260Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:10:10.285260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.16384","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:10:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xihx52f/WdlioUmoq65apa2o4/wFMn9ZWBw7IQ0KdJrIyqZXdo1jFpGJNgg/EXo1+7cYiwupF24Uz7T2TdJGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T11:03:04.352817Z"},"content_sha256":"7790ffe2037c7db3a85a47c6be4b52cc7757b6b2649413949c8568279d249258","schema_version":"1.0","event_id":"sha256:7790ffe2037c7db3a85a47c6be4b52cc7757b6b2649413949c8568279d249258"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:UP366MSZCA4HC6QS3PEPBXLRQ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A consensus-based algorithm for multi-objective optimization and its mean-field description","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Giacomo Borghi, Lorenzo Pareschi, Michael Herty","submitted_at":"2022-03-30T15:14:55Z","abstract_excerpt":"We present a multi-agent algorithm for multi-objective optimization problems, which extends the class of consensus-based optimization methods and relies on a scalarization strategy. The optimization is achieved by a set of interacting agents exploring the search space and attempting to solve all scalar sub-problems simultaneously. We show that those dynamics are described by a mean-field model, which is suitable for a theoretical analysis of the algorithm convergence. Numerical results show the validity of the proposed method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.16384","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/2203.16384/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:10:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Th6n1UXZjoYDm9L5jJw8RIwPSXyjyWIR2hbMsrL4q4a9y7M2z8Li4tecwLCaPSPnR+1G0cyBV5cIJ3efPff5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T11:03:04.353186Z"},"content_sha256":"a154b09809c2b921fbfb53f0f5e90df0c1b342d4703c246349e4fbc6e7802c3a","schema_version":"1.0","event_id":"sha256:a154b09809c2b921fbfb53f0f5e90df0c1b342d4703c246349e4fbc6e7802c3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UP366MSZCA4HC6QS3PEPBXLRQ6/bundle.json","state_url":"https://pith.science/pith/UP366MSZCA4HC6QS3PEPBXLRQ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UP366MSZCA4HC6QS3PEPBXLRQ6/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-07-18T11:03:04Z","links":{"resolver":"https://pith.science/pith/UP366MSZCA4HC6QS3PEPBXLRQ6","bundle":"https://pith.science/pith/UP366MSZCA4HC6QS3PEPBXLRQ6/bundle.json","state":"https://pith.science/pith/UP366MSZCA4HC6QS3PEPBXLRQ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UP366MSZCA4HC6QS3PEPBXLRQ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:UP366MSZCA4HC6QS3PEPBXLRQ6","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":"8c012b3a1d3df0ff69917d8165951af66965f5614bb33853bdd43a3048284738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-30T15:14:55Z","title_canon_sha256":"55de6ae06a49029ce48d9706991903ffc1e6ba5dfa439f20c639bbe36b74fbbe"},"schema_version":"1.0","source":{"id":"2203.16384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.16384","created_at":"2026-07-05T04:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"2203.16384v1","created_at":"2026-07-05T04:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.16384","created_at":"2026-07-05T04:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"UP366MSZCA4H","created_at":"2026-07-05T04:10:10Z"},{"alias_kind":"pith_short_16","alias_value":"UP366MSZCA4HC6QS","created_at":"2026-07-05T04:10:10Z"},{"alias_kind":"pith_short_8","alias_value":"UP366MSZ","created_at":"2026-07-05T04:10:10Z"}],"graph_snapshots":[{"event_id":"sha256:a154b09809c2b921fbfb53f0f5e90df0c1b342d4703c246349e4fbc6e7802c3a","target":"graph","created_at":"2026-07-05T04:10:10Z","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/2203.16384/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a multi-agent algorithm for multi-objective optimization problems, which extends the class of consensus-based optimization methods and relies on a scalarization strategy. The optimization is achieved by a set of interacting agents exploring the search space and attempting to solve all scalar sub-problems simultaneously. We show that those dynamics are described by a mean-field model, which is suitable for a theoretical analysis of the algorithm convergence. Numerical results show the validity of the proposed method.","authors_text":"Giacomo Borghi, Lorenzo Pareschi, Michael Herty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-30T15:14:55Z","title":"A consensus-based algorithm for multi-objective optimization and its mean-field description"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.16384","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:7790ffe2037c7db3a85a47c6be4b52cc7757b6b2649413949c8568279d249258","target":"record","created_at":"2026-07-05T04:10:10Z","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":"8c012b3a1d3df0ff69917d8165951af66965f5614bb33853bdd43a3048284738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-30T15:14:55Z","title_canon_sha256":"55de6ae06a49029ce48d9706991903ffc1e6ba5dfa439f20c639bbe36b74fbbe"},"schema_version":"1.0","source":{"id":"2203.16384","kind":"arxiv","version":1}},"canonical_sha256":"a3f7ef32591038717a12dbc8f0dd7187929cc4415d41ee208db7931e92caf2d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3f7ef32591038717a12dbc8f0dd7187929cc4415d41ee208db7931e92caf2d5","first_computed_at":"2026-07-05T04:10:10.285260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:10:10.285260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d923Q5fMO0KnToxDrR0p6T+0qLz8jcez7WdvMnR4tuE4jJP8LuPTRk+ygJUU/uucgP/VhMkWMQmDVY/TFYBuBg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:10:10.285619Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.16384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7790ffe2037c7db3a85a47c6be4b52cc7757b6b2649413949c8568279d249258","sha256:a154b09809c2b921fbfb53f0f5e90df0c1b342d4703c246349e4fbc6e7802c3a"],"state_sha256":"98eed5b0f80f6c3d1ed212a09c1d83e224cde00721dfbe1f06a95a52e27a826f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uivzekqM752zblQxpV3MLeCXBUWY0eK/+J8O5RgYKXdnVfXk/wueG6SRTLjDdB2XVJKggMOsxXGsERq52eTWCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T11:03:04.355865Z","bundle_sha256":"00787888e4014b4bfbff7b017dadbb819854316766d119712511e65df8e908c4"}}