{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:E2WTNEP7A7IGDWCV4WLRLT3PQ2","short_pith_number":"pith:E2WTNEP7","canonical_record":{"source":{"id":"2202.01009","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-02T13:07:09Z","cross_cats_sorted":[],"title_canon_sha256":"36015867eeb216947cc23cc4c2f74463108a2e0fb8c066b376f4d8ccaaa4d7a1","abstract_canon_sha256":"cb9718ec0060d5ae099f92a87f29f94c62af296f9c7f8b023b71fcacdab55df6"},"schema_version":"1.0"},"canonical_sha256":"26ad3691ff07d061d855e59715cf6f86b72b30cdd27a8baacc6cd2e208621061","source":{"kind":"arxiv","id":"2202.01009","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.01009","created_at":"2026-07-05T04:47:40Z"},{"alias_kind":"arxiv_version","alias_value":"2202.01009v3","created_at":"2026-07-05T04:47:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.01009","created_at":"2026-07-05T04:47:40Z"},{"alias_kind":"pith_short_12","alias_value":"E2WTNEP7A7IG","created_at":"2026-07-05T04:47:40Z"},{"alias_kind":"pith_short_16","alias_value":"E2WTNEP7A7IGDWCV","created_at":"2026-07-05T04:47:40Z"},{"alias_kind":"pith_short_8","alias_value":"E2WTNEP7","created_at":"2026-07-05T04:47:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:E2WTNEP7A7IGDWCV4WLRLT3PQ2","target":"record","payload":{"canonical_record":{"source":{"id":"2202.01009","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-02T13:07:09Z","cross_cats_sorted":[],"title_canon_sha256":"36015867eeb216947cc23cc4c2f74463108a2e0fb8c066b376f4d8ccaaa4d7a1","abstract_canon_sha256":"cb9718ec0060d5ae099f92a87f29f94c62af296f9c7f8b023b71fcacdab55df6"},"schema_version":"1.0"},"canonical_sha256":"26ad3691ff07d061d855e59715cf6f86b72b30cdd27a8baacc6cd2e208621061","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:47:40.317651Z","signature_b64":"zCyS8K7TqOfQR8rQURR7JtqT3JmSGhkUMnpeluFUvbK1MeL1rflsNxXa55gSeZ+tcr0GaudJA9etQI21MC2YBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26ad3691ff07d061d855e59715cf6f86b72b30cdd27a8baacc6cd2e208621061","last_reissued_at":"2026-07-05T04:47:40.317204Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:47:40.317204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.01009","source_version":3,"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:47:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5BjUoP95UBbsUywmx/3UyjnQHfeJC+ECz8O3NnuxxauEMe6tyhK/J84dugN8/8NTYqyjXh5wmGfoU9HMGj/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:12:10.000303Z"},"content_sha256":"02541e7d1557d119fcb9f73f85fd4732ed5e8bbd1612ce29a965351192c98785","schema_version":"1.0","event_id":"sha256:02541e7d1557d119fcb9f73f85fd4732ed5e8bbd1612ce29a965351192c98785"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:E2WTNEP7A7IGDWCV4WLRLT3PQ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mean-Field Langevin Dynamics: Exponential Convergence and Annealing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"L\\'ena\\\"ic Chizat","submitted_at":"2022-02-02T13:07:09Z","abstract_excerpt":"Noisy particle gradient descent (NPGD) is an algorithm to minimize convex functions over the space of measures that include an entropy term. In the many-particle limit, this algorithm is described by a Mean-Field Langevin dynamics - a generalization of the Langevin dynamics with a non-linear drift - which is our main object of study. Previous work have shown its convergence to the unique minimizer via non-quantitative arguments. We prove that this dynamics converges at an exponential rate, under the assumption that a certain family of Log-Sobolev inequalities holds. This assumption holds for i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.01009","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/2202.01009/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:47:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36yooQPAhCyxKOypXpfce8r+u23YndAnQDyWW220+RRSBjaOJMyDtG2V6NjPaeW6+Gb2frzKZY7m9VBh1tvdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:12:10.000795Z"},"content_sha256":"3db8492200c6e0e5917ff84be25340e16b14b5285c0bf6af80db687555780499","schema_version":"1.0","event_id":"sha256:3db8492200c6e0e5917ff84be25340e16b14b5285c0bf6af80db687555780499"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2WTNEP7A7IGDWCV4WLRLT3PQ2/bundle.json","state_url":"https://pith.science/pith/E2WTNEP7A7IGDWCV4WLRLT3PQ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2WTNEP7A7IGDWCV4WLRLT3PQ2/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-09T04:12:10Z","links":{"resolver":"https://pith.science/pith/E2WTNEP7A7IGDWCV4WLRLT3PQ2","bundle":"https://pith.science/pith/E2WTNEP7A7IGDWCV4WLRLT3PQ2/bundle.json","state":"https://pith.science/pith/E2WTNEP7A7IGDWCV4WLRLT3PQ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2WTNEP7A7IGDWCV4WLRLT3PQ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:E2WTNEP7A7IGDWCV4WLRLT3PQ2","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":"cb9718ec0060d5ae099f92a87f29f94c62af296f9c7f8b023b71fcacdab55df6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-02T13:07:09Z","title_canon_sha256":"36015867eeb216947cc23cc4c2f74463108a2e0fb8c066b376f4d8ccaaa4d7a1"},"schema_version":"1.0","source":{"id":"2202.01009","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.01009","created_at":"2026-07-05T04:47:40Z"},{"alias_kind":"arxiv_version","alias_value":"2202.01009v3","created_at":"2026-07-05T04:47:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.01009","created_at":"2026-07-05T04:47:40Z"},{"alias_kind":"pith_short_12","alias_value":"E2WTNEP7A7IG","created_at":"2026-07-05T04:47:40Z"},{"alias_kind":"pith_short_16","alias_value":"E2WTNEP7A7IGDWCV","created_at":"2026-07-05T04:47:40Z"},{"alias_kind":"pith_short_8","alias_value":"E2WTNEP7","created_at":"2026-07-05T04:47:40Z"}],"graph_snapshots":[{"event_id":"sha256:3db8492200c6e0e5917ff84be25340e16b14b5285c0bf6af80db687555780499","target":"graph","created_at":"2026-07-05T04:47:40Z","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/2202.01009/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Noisy particle gradient descent (NPGD) is an algorithm to minimize convex functions over the space of measures that include an entropy term. In the many-particle limit, this algorithm is described by a Mean-Field Langevin dynamics - a generalization of the Langevin dynamics with a non-linear drift - which is our main object of study. Previous work have shown its convergence to the unique minimizer via non-quantitative arguments. We prove that this dynamics converges at an exponential rate, under the assumption that a certain family of Log-Sobolev inequalities holds. This assumption holds for i","authors_text":"L\\'ena\\\"ic Chizat","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-02T13:07:09Z","title":"Mean-Field Langevin Dynamics: Exponential Convergence and Annealing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.01009","kind":"arxiv","version":3},"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:02541e7d1557d119fcb9f73f85fd4732ed5e8bbd1612ce29a965351192c98785","target":"record","created_at":"2026-07-05T04:47:40Z","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":"cb9718ec0060d5ae099f92a87f29f94c62af296f9c7f8b023b71fcacdab55df6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-02T13:07:09Z","title_canon_sha256":"36015867eeb216947cc23cc4c2f74463108a2e0fb8c066b376f4d8ccaaa4d7a1"},"schema_version":"1.0","source":{"id":"2202.01009","kind":"arxiv","version":3}},"canonical_sha256":"26ad3691ff07d061d855e59715cf6f86b72b30cdd27a8baacc6cd2e208621061","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26ad3691ff07d061d855e59715cf6f86b72b30cdd27a8baacc6cd2e208621061","first_computed_at":"2026-07-05T04:47:40.317204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:47:40.317204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zCyS8K7TqOfQR8rQURR7JtqT3JmSGhkUMnpeluFUvbK1MeL1rflsNxXa55gSeZ+tcr0GaudJA9etQI21MC2YBA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:47:40.317651Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.01009","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02541e7d1557d119fcb9f73f85fd4732ed5e8bbd1612ce29a965351192c98785","sha256:3db8492200c6e0e5917ff84be25340e16b14b5285c0bf6af80db687555780499"],"state_sha256":"9c00f9ddd567ff6805bd1ee9e91e0a92a3cff6aef9b8f3fc144eda1e26ff8652"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NMf9gf5LMOw3y4Jg3eLzyPNJRbelw/xiYEcaIB3nFd7MEsvMKr+pcGHdGiUXdQOi1VhoJKIIN24+YAo7PgZGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T04:12:10.004261Z","bundle_sha256":"61698b91f11ad59937acb3b419a3d0a2e0a9b657af8d9826c3cb782b18ddbcc2"}}