{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:Q2IBZJ3Y6TXTUSRQ65X6VKEN4R","short_pith_number":"pith:Q2IBZJ3Y","canonical_record":{"source":{"id":"2407.17373","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-24T15:51:46Z","cross_cats_sorted":[],"title_canon_sha256":"38dd0b8ea06b54c155e0d08a6f0d978bf1ce0b8305b4342dc315cf8ff85ede6b","abstract_canon_sha256":"71f490d2f0aaa0bc8ba7a4e13db3012a13bf46cbb2e8ac690fff85ee1dd32872"},"schema_version":"1.0"},"canonical_sha256":"86901ca778f4ef3a4a30f76feaa88de47f666404da82782b16b918ec72555ca0","source":{"kind":"arxiv","id":"2407.17373","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.17373","created_at":"2026-07-05T08:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"2407.17373v1","created_at":"2026-07-05T08:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.17373","created_at":"2026-07-05T08:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"Q2IBZJ3Y6TXT","created_at":"2026-07-05T08:48:07Z"},{"alias_kind":"pith_short_16","alias_value":"Q2IBZJ3Y6TXTUSRQ","created_at":"2026-07-05T08:48:07Z"},{"alias_kind":"pith_short_8","alias_value":"Q2IBZJ3Y","created_at":"2026-07-05T08:48:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:Q2IBZJ3Y6TXTUSRQ65X6VKEN4R","target":"record","payload":{"canonical_record":{"source":{"id":"2407.17373","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-24T15:51:46Z","cross_cats_sorted":[],"title_canon_sha256":"38dd0b8ea06b54c155e0d08a6f0d978bf1ce0b8305b4342dc315cf8ff85ede6b","abstract_canon_sha256":"71f490d2f0aaa0bc8ba7a4e13db3012a13bf46cbb2e8ac690fff85ee1dd32872"},"schema_version":"1.0"},"canonical_sha256":"86901ca778f4ef3a4a30f76feaa88de47f666404da82782b16b918ec72555ca0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:48:07.435938Z","signature_b64":"Oie+8u2b4J6RCBXnLJh9RZVnzYa2kBcVcdaAMzUQN8NntELqN3cDfk4/0jwu0/bDoPteAoESR69my9ctLY75BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86901ca778f4ef3a4a30f76feaa88de47f666404da82782b16b918ec72555ca0","last_reissued_at":"2026-07-05T08:48:07.435494Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:48:07.435494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.17373","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-05T08:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x5CbrEFUliaHz/5rhAlTftvxhTW0ygyLqZDREzEsmiAmSaEsER9+78Dq8dVYFQs/uGR37u7LEEqTfp6k9T98DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:32:44.394932Z"},"content_sha256":"6520c37862818245fd1308ff916f6e9b159a6b7e373869e45bc1c060e977ff3b","schema_version":"1.0","event_id":"sha256:6520c37862818245fd1308ff916f6e9b159a6b7e373869e45bc1c060e977ff3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:Q2IBZJ3Y6TXTUSRQ65X6VKEN4R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A particle consensus approach to solving nonconvex-nonconcave min-max problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Giacomo Borghi, Hui Huang, Jinniao Qiu","submitted_at":"2024-07-24T15:51:46Z","abstract_excerpt":"We propose a zero-order optimization method for sequential min-max problems based on two populations of interacting particles. The systems are coupled so that one population aims to solve the inner maximization problem, while the other aims to solve the outer minimization problem. The dynamics are characterized by a consensus-type interaction with additional stochasticity to promote exploration of the objective landscape. Without relying on convexity or concavity assumptions, we establish theoretical convergence guarantees of the algorithm via a suitable mean-field approximation of the particl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.17373","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/2407.17373/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-05T08:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qeMvc8bdv103Bl+V8RCbPx/gim4QEjE0Nyn27nDZ6iCYpx8QOcW54rC3i82X5LnZjCzM6n5d2ZQ2vGe0cM4JCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:32:44.395485Z"},"content_sha256":"a86e235d2224a20ef0817816ad85e799003a01a9091eade30e4f0dd8df927573","schema_version":"1.0","event_id":"sha256:a86e235d2224a20ef0817816ad85e799003a01a9091eade30e4f0dd8df927573"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2IBZJ3Y6TXTUSRQ65X6VKEN4R/bundle.json","state_url":"https://pith.science/pith/Q2IBZJ3Y6TXTUSRQ65X6VKEN4R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2IBZJ3Y6TXTUSRQ65X6VKEN4R/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-08-10T14:32:44Z","links":{"resolver":"https://pith.science/pith/Q2IBZJ3Y6TXTUSRQ65X6VKEN4R","bundle":"https://pith.science/pith/Q2IBZJ3Y6TXTUSRQ65X6VKEN4R/bundle.json","state":"https://pith.science/pith/Q2IBZJ3Y6TXTUSRQ65X6VKEN4R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2IBZJ3Y6TXTUSRQ65X6VKEN4R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Q2IBZJ3Y6TXTUSRQ65X6VKEN4R","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":"71f490d2f0aaa0bc8ba7a4e13db3012a13bf46cbb2e8ac690fff85ee1dd32872","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-24T15:51:46Z","title_canon_sha256":"38dd0b8ea06b54c155e0d08a6f0d978bf1ce0b8305b4342dc315cf8ff85ede6b"},"schema_version":"1.0","source":{"id":"2407.17373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.17373","created_at":"2026-07-05T08:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"2407.17373v1","created_at":"2026-07-05T08:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.17373","created_at":"2026-07-05T08:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"Q2IBZJ3Y6TXT","created_at":"2026-07-05T08:48:07Z"},{"alias_kind":"pith_short_16","alias_value":"Q2IBZJ3Y6TXTUSRQ","created_at":"2026-07-05T08:48:07Z"},{"alias_kind":"pith_short_8","alias_value":"Q2IBZJ3Y","created_at":"2026-07-05T08:48:07Z"}],"graph_snapshots":[{"event_id":"sha256:a86e235d2224a20ef0817816ad85e799003a01a9091eade30e4f0dd8df927573","target":"graph","created_at":"2026-07-05T08:48:07Z","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/2407.17373/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a zero-order optimization method for sequential min-max problems based on two populations of interacting particles. The systems are coupled so that one population aims to solve the inner maximization problem, while the other aims to solve the outer minimization problem. The dynamics are characterized by a consensus-type interaction with additional stochasticity to promote exploration of the objective landscape. Without relying on convexity or concavity assumptions, we establish theoretical convergence guarantees of the algorithm via a suitable mean-field approximation of the particl","authors_text":"Giacomo Borghi, Hui Huang, Jinniao Qiu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-24T15:51:46Z","title":"A particle consensus approach to solving nonconvex-nonconcave min-max problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.17373","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:6520c37862818245fd1308ff916f6e9b159a6b7e373869e45bc1c060e977ff3b","target":"record","created_at":"2026-07-05T08:48:07Z","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":"71f490d2f0aaa0bc8ba7a4e13db3012a13bf46cbb2e8ac690fff85ee1dd32872","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-24T15:51:46Z","title_canon_sha256":"38dd0b8ea06b54c155e0d08a6f0d978bf1ce0b8305b4342dc315cf8ff85ede6b"},"schema_version":"1.0","source":{"id":"2407.17373","kind":"arxiv","version":1}},"canonical_sha256":"86901ca778f4ef3a4a30f76feaa88de47f666404da82782b16b918ec72555ca0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86901ca778f4ef3a4a30f76feaa88de47f666404da82782b16b918ec72555ca0","first_computed_at":"2026-07-05T08:48:07.435494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:48:07.435494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oie+8u2b4J6RCBXnLJh9RZVnzYa2kBcVcdaAMzUQN8NntELqN3cDfk4/0jwu0/bDoPteAoESR69my9ctLY75BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:48:07.435938Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.17373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6520c37862818245fd1308ff916f6e9b159a6b7e373869e45bc1c060e977ff3b","sha256:a86e235d2224a20ef0817816ad85e799003a01a9091eade30e4f0dd8df927573"],"state_sha256":"d5fe58156a45572611c0bb5db299e348d66e254f51fdd0fc2e7c732a8536cfe1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GkwpY21tN5JZ6PGVQx/OZ5Od+dEWl63RC7l2meOifmLGHQzqkdYYIlity6UEYApmS4TW3Vq6H+xTS0alUZKuCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T14:32:44.400825Z","bundle_sha256":"2dd9e6d0eef2a52ee0ce5212a648841b1fb140ad53a0ebb39ccdd9ffeef67dca"}}