{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:K6B2L7EU6FOGGHZKDG6BUWNORW","short_pith_number":"pith:K6B2L7EU","canonical_record":{"source":{"id":"1901.07487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-22T17:53:01Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d173199e305aa9bac81ebd064c4f2da6626e1b78314d3ddd94792cb596ed0e1e","abstract_canon_sha256":"12bc9b8c317d78724df510055fbd5019672bc8c779bbd3d0ea5e930fa91e9508"},"schema_version":"1.0"},"canonical_sha256":"5783a5fc94f15c631f2a19bc1a59ae8daa5ce568f24f945746430e86718cdefa","source":{"kind":"arxiv","id":"1901.07487","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07487","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07487v1","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07487","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"pith_short_12","alias_value":"K6B2L7EU6FOG","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"K6B2L7EU6FOGGHZK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"K6B2L7EU","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:K6B2L7EU6FOGGHZKDG6BUWNORW","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-22T17:53:01Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d173199e305aa9bac81ebd064c4f2da6626e1b78314d3ddd94792cb596ed0e1e","abstract_canon_sha256":"12bc9b8c317d78724df510055fbd5019672bc8c779bbd3d0ea5e930fa91e9508"},"schema_version":"1.0"},"canonical_sha256":"5783a5fc94f15c631f2a19bc1a59ae8daa5ce568f24f945746430e86718cdefa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:44.650454Z","signature_b64":"WPLmMxF59qHByQsm2tWXHGEqhKGaxyVX9la2uk+Dh1R+Tt16Leor2Mw3kpeYuvrZ6+KEDlQWFNpff5Kh6+T0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5783a5fc94f15c631f2a19bc1a59ae8daa5ce568f24f945746430e86718cdefa","last_reissued_at":"2026-05-17T23:55:44.649696Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:44.649696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07487","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-05-17T23:55:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6jfmzaNM6w/KpGKugV6cYj1VNcCRN4nA1uU5UOYluwGBKs5Vr1CEt6MeOyXysGDuPpPXEvd+nI4Ue0XqkqOxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:25:20.811404Z"},"content_sha256":"a191ebe576beedce6375b47972200dff57b39d4a5400fc93f846ef555b638df2","schema_version":"1.0","event_id":"sha256:a191ebe576beedce6375b47972200dff57b39d4a5400fc93f846ef555b638df2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:K6B2L7EU6FOGGHZKDG6BUWNORW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Asymptotic Analysis of Fractional Langevin Monte Carlo for Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Ga\\\"el Richard, Thanh Huy Nguyen, Umut \\c{S}im\\c{s}ekli","submitted_at":"2019-01-22T17:53:01Z","abstract_excerpt":"Recent studies on diffusion-based sampling methods have shown that Langevin Monte Carlo (LMC) algorithms can be beneficial for non-convex optimization, and rigorous theoretical guarantees have been proven for both asymptotic and finite-time regimes. Algorithmically, LMC-based algorithms resemble the well-known gradient descent (GD) algorithm, where the GD recursion is perturbed by an additive Gaussian noise whose variance has a particular form. Fractional Langevin Monte Carlo (FLMC) is a recently proposed extension of LMC, where the Gaussian noise is replaced by a heavy-tailed {\\alpha}-stable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07487","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":""},"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-05-17T23:55:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vv83Guhn8TOm4zTCoKOcA+z8xg+Jnu1qNVxyRjoL20gL31aljA1B0a1oasikqbB/Ix5uux+7VgW/G9ImKJaFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:25:20.811760Z"},"content_sha256":"09d01c3748dbd8b501debd56566f44b8c4bb4b8409b8e13cad1c18fb891d2f9f","schema_version":"1.0","event_id":"sha256:09d01c3748dbd8b501debd56566f44b8c4bb4b8409b8e13cad1c18fb891d2f9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6B2L7EU6FOGGHZKDG6BUWNORW/bundle.json","state_url":"https://pith.science/pith/K6B2L7EU6FOGGHZKDG6BUWNORW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6B2L7EU6FOGGHZKDG6BUWNORW/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-05-28T07:25:20Z","links":{"resolver":"https://pith.science/pith/K6B2L7EU6FOGGHZKDG6BUWNORW","bundle":"https://pith.science/pith/K6B2L7EU6FOGGHZKDG6BUWNORW/bundle.json","state":"https://pith.science/pith/K6B2L7EU6FOGGHZKDG6BUWNORW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6B2L7EU6FOGGHZKDG6BUWNORW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:K6B2L7EU6FOGGHZKDG6BUWNORW","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":"12bc9b8c317d78724df510055fbd5019672bc8c779bbd3d0ea5e930fa91e9508","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-22T17:53:01Z","title_canon_sha256":"d173199e305aa9bac81ebd064c4f2da6626e1b78314d3ddd94792cb596ed0e1e"},"schema_version":"1.0","source":{"id":"1901.07487","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07487","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07487v1","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07487","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"pith_short_12","alias_value":"K6B2L7EU6FOG","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"K6B2L7EU6FOGGHZK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"K6B2L7EU","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:09d01c3748dbd8b501debd56566f44b8c4bb4b8409b8e13cad1c18fb891d2f9f","target":"graph","created_at":"2026-05-17T23:55:44Z","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"},"paper":{"abstract_excerpt":"Recent studies on diffusion-based sampling methods have shown that Langevin Monte Carlo (LMC) algorithms can be beneficial for non-convex optimization, and rigorous theoretical guarantees have been proven for both asymptotic and finite-time regimes. Algorithmically, LMC-based algorithms resemble the well-known gradient descent (GD) algorithm, where the GD recursion is perturbed by an additive Gaussian noise whose variance has a particular form. Fractional Langevin Monte Carlo (FLMC) is a recently proposed extension of LMC, where the Gaussian noise is replaced by a heavy-tailed {\\alpha}-stable ","authors_text":"Ga\\\"el Richard, Thanh Huy Nguyen, Umut \\c{S}im\\c{s}ekli","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-22T17:53:01Z","title":"Non-Asymptotic Analysis of Fractional Langevin Monte Carlo for Non-Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07487","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:a191ebe576beedce6375b47972200dff57b39d4a5400fc93f846ef555b638df2","target":"record","created_at":"2026-05-17T23:55:44Z","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":"12bc9b8c317d78724df510055fbd5019672bc8c779bbd3d0ea5e930fa91e9508","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-22T17:53:01Z","title_canon_sha256":"d173199e305aa9bac81ebd064c4f2da6626e1b78314d3ddd94792cb596ed0e1e"},"schema_version":"1.0","source":{"id":"1901.07487","kind":"arxiv","version":1}},"canonical_sha256":"5783a5fc94f15c631f2a19bc1a59ae8daa5ce568f24f945746430e86718cdefa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5783a5fc94f15c631f2a19bc1a59ae8daa5ce568f24f945746430e86718cdefa","first_computed_at":"2026-05-17T23:55:44.649696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:44.649696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WPLmMxF59qHByQsm2tWXHGEqhKGaxyVX9la2uk+Dh1R+Tt16Leor2Mw3kpeYuvrZ6+KEDlQWFNpff5Kh6+T0AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:44.650454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07487","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a191ebe576beedce6375b47972200dff57b39d4a5400fc93f846ef555b638df2","sha256:09d01c3748dbd8b501debd56566f44b8c4bb4b8409b8e13cad1c18fb891d2f9f"],"state_sha256":"80e741386704c6002717b9e26663dd29eeb7e3c99a47314553f0ffa74224fae9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nry2WG9LkK3QZfXM1Iuwvit8P9WhIAqp+sWuEh9W5DT3c0bQbenBrUhqNguxiCcIb9RgdtVy9xuNuBMLMRt0Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:25:20.813754Z","bundle_sha256":"b9340981ad222e1bae6135d57c5762141f3b299d22a19e8a11ddd0e183a0f13b"}}