{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WGT4KOUTNG26ISQYNHCK5OC6R5","short_pith_number":"pith:WGT4KOUT","schema_version":"1.0","canonical_sha256":"b1a7c53a9369b5e44a1869c4aeb85e8f4b2f922e1a431653ba3998585079c0f7","source":{"kind":"arxiv","id":"2501.10306","version":3},"attestation_state":"computed","paper":{"title":"Micro-Macro Decomposition of Particle Swarm Optimization Methods","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael Herty, Sara Veneruso","submitted_at":"2025-01-17T16:59:08Z","abstract_excerpt":"Solving non-convex minimization problems using multi-particle metaheuristic derivative-free optimization methods is still an active area of research. Popular methods are Particle Swarm Optimization (PSO) methods, that iteratively update a population of particles according to dynamics inspired by social interactions between individuals. We present a modification to include constrained minimization problems using exact penalization. Additionally, we utilize the hierarchical structure of PSO to introduce a micro-macro decomposition of the algorithm. The probability density of particles is written"},"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":"2501.10306","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-17T16:59:08Z","cross_cats_sorted":[],"title_canon_sha256":"debf8c5f9b2e1666af6cbce68ebb742723efecc4d483657cf0bcb47983ea756f","abstract_canon_sha256":"0287d4992f26fdbc009126a92533ed68588f67d4e37149741057b4b829e10b54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:43.350465Z","signature_b64":"aSOlaN22fegpoFV0WoFvoVt2UHhxSPa8mc/Dkm5/3Q15bISYjM+n16KN1akIIpP0xbibs+DaPXeHp4veqrJCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1a7c53a9369b5e44a1869c4aeb85e8f4b2f922e1a431653ba3998585079c0f7","last_reissued_at":"2026-07-05T11:56:43.350020Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:43.350020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Micro-Macro Decomposition of Particle Swarm Optimization Methods","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael Herty, Sara Veneruso","submitted_at":"2025-01-17T16:59:08Z","abstract_excerpt":"Solving non-convex minimization problems using multi-particle metaheuristic derivative-free optimization methods is still an active area of research. Popular methods are Particle Swarm Optimization (PSO) methods, that iteratively update a population of particles according to dynamics inspired by social interactions between individuals. We present a modification to include constrained minimization problems using exact penalization. Additionally, we utilize the hierarchical structure of PSO to introduce a micro-macro decomposition of the algorithm. The probability density of particles is written"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10306","kind":"arxiv","version":3},"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/2501.10306/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":"2501.10306","created_at":"2026-07-05T11:56:43.350078+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.10306v3","created_at":"2026-07-05T11:56:43.350078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10306","created_at":"2026-07-05T11:56:43.350078+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGT4KOUTNG26","created_at":"2026-07-05T11:56:43.350078+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGT4KOUTNG26ISQY","created_at":"2026-07-05T11:56:43.350078+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGT4KOUT","created_at":"2026-07-05T11:56:43.350078+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.24048","citing_title":"Consensus-based optimization for closed-box adversarial attacks and a connection to evolution strategies","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WGT4KOUTNG26ISQYNHCK5OC6R5","json":"https://pith.science/pith/WGT4KOUTNG26ISQYNHCK5OC6R5.json","graph_json":"https://pith.science/api/pith-number/WGT4KOUTNG26ISQYNHCK5OC6R5/graph.json","events_json":"https://pith.science/api/pith-number/WGT4KOUTNG26ISQYNHCK5OC6R5/events.json","paper":"https://pith.science/paper/WGT4KOUT"},"agent_actions":{"view_html":"https://pith.science/pith/WGT4KOUTNG26ISQYNHCK5OC6R5","download_json":"https://pith.science/pith/WGT4KOUTNG26ISQYNHCK5OC6R5.json","view_paper":"https://pith.science/paper/WGT4KOUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.10306&json=true","fetch_graph":"https://pith.science/api/pith-number/WGT4KOUTNG26ISQYNHCK5OC6R5/graph.json","fetch_events":"https://pith.science/api/pith-number/WGT4KOUTNG26ISQYNHCK5OC6R5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGT4KOUTNG26ISQYNHCK5OC6R5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGT4KOUTNG26ISQYNHCK5OC6R5/action/storage_attestation","attest_author":"https://pith.science/pith/WGT4KOUTNG26ISQYNHCK5OC6R5/action/author_attestation","sign_citation":"https://pith.science/pith/WGT4KOUTNG26ISQYNHCK5OC6R5/action/citation_signature","submit_replication":"https://pith.science/pith/WGT4KOUTNG26ISQYNHCK5OC6R5/action/replication_record"}},"created_at":"2026-07-05T11:56:43.350078+00:00","updated_at":"2026-07-05T11:56:43.350078+00:00"}