{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PKDBBIDAJRJSRULX56H2XGB3DL","short_pith_number":"pith:PKDBBIDA","schema_version":"1.0","canonical_sha256":"7a8610a0604c5328d177ef8fab983b1aeffde381d16fad37ab9437112fde9b37","source":{"kind":"arxiv","id":"2511.00870","version":2},"attestation_state":"computed","paper":{"title":"A Distributed Plug-and-Play MCMC Algorithm for High-Dimensional Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","eess.SP"],"primary_cat":"stat.ME","authors_text":"Audrey Repetti, Maxime Bouton, Pierre-Antoine Thouvenin, Pierre Chainais","submitted_at":"2025-11-02T09:41:55Z","abstract_excerpt":"Markov Chain Monte Carlo (MCMC) algorithms are standard approaches to solve imaging inverse problems and quantify estimation uncertainties, a key requirement in absence of ground-truth data. To improve estimation quality, Plug-and-Play MCMC algorithms, such as PnP-ULA, have been recently developed to accommodate priors encoded by a denoising neural network. Designing scalable samplers for high-dimensional imaging inverse problems remains a challenge: drawing and storing high-dimensional samples can be prohibitive, especially for high-resolution images. To address this issue, this work proposes"},"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":"2511.00870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-11-02T09:41:55Z","cross_cats_sorted":["cs.DC","eess.SP"],"title_canon_sha256":"7103dd2c7cca4fa803cf899e0562f48973a969add40b5f08b2236589568a1b88","abstract_canon_sha256":"1ab2ecf23a1e46d9022bcf1cf18467eb6d1bd87a4cf466aa93f7004ea2fa29d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:28.319734Z","signature_b64":"aicApvKoEVqGp3VXpAQ69s4ZNe1ZD7B9/Q/PcYCvfnMEu0cMyFxOrK4IH81ruwXyyfl/6r0gahBqlcKw+rjpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a8610a0604c5328d177ef8fab983b1aeffde381d16fad37ab9437112fde9b37","last_reissued_at":"2026-06-30T01:17:28.318965Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:28.318965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Distributed Plug-and-Play MCMC Algorithm for High-Dimensional Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","eess.SP"],"primary_cat":"stat.ME","authors_text":"Audrey Repetti, Maxime Bouton, Pierre-Antoine Thouvenin, Pierre Chainais","submitted_at":"2025-11-02T09:41:55Z","abstract_excerpt":"Markov Chain Monte Carlo (MCMC) algorithms are standard approaches to solve imaging inverse problems and quantify estimation uncertainties, a key requirement in absence of ground-truth data. To improve estimation quality, Plug-and-Play MCMC algorithms, such as PnP-ULA, have been recently developed to accommodate priors encoded by a denoising neural network. Designing scalable samplers for high-dimensional imaging inverse problems remains a challenge: drawing and storing high-dimensional samples can be prohibitive, especially for high-resolution images. To address this issue, this work proposes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.00870","kind":"arxiv","version":2},"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/2511.00870/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":"2511.00870","created_at":"2026-06-30T01:17:28.319064+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.00870v2","created_at":"2026-06-30T01:17:28.319064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.00870","created_at":"2026-06-30T01:17:28.319064+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKDBBIDAJRJS","created_at":"2026-06-30T01:17:28.319064+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKDBBIDAJRJSRULX","created_at":"2026-06-30T01:17:28.319064+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKDBBIDA","created_at":"2026-06-30T01:17:28.319064+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PKDBBIDAJRJSRULX56H2XGB3DL","json":"https://pith.science/pith/PKDBBIDAJRJSRULX56H2XGB3DL.json","graph_json":"https://pith.science/api/pith-number/PKDBBIDAJRJSRULX56H2XGB3DL/graph.json","events_json":"https://pith.science/api/pith-number/PKDBBIDAJRJSRULX56H2XGB3DL/events.json","paper":"https://pith.science/paper/PKDBBIDA"},"agent_actions":{"view_html":"https://pith.science/pith/PKDBBIDAJRJSRULX56H2XGB3DL","download_json":"https://pith.science/pith/PKDBBIDAJRJSRULX56H2XGB3DL.json","view_paper":"https://pith.science/paper/PKDBBIDA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.00870&json=true","fetch_graph":"https://pith.science/api/pith-number/PKDBBIDAJRJSRULX56H2XGB3DL/graph.json","fetch_events":"https://pith.science/api/pith-number/PKDBBIDAJRJSRULX56H2XGB3DL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKDBBIDAJRJSRULX56H2XGB3DL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKDBBIDAJRJSRULX56H2XGB3DL/action/storage_attestation","attest_author":"https://pith.science/pith/PKDBBIDAJRJSRULX56H2XGB3DL/action/author_attestation","sign_citation":"https://pith.science/pith/PKDBBIDAJRJSRULX56H2XGB3DL/action/citation_signature","submit_replication":"https://pith.science/pith/PKDBBIDAJRJSRULX56H2XGB3DL/action/replication_record"}},"created_at":"2026-06-30T01:17:28.319064+00:00","updated_at":"2026-06-30T01:17:28.319064+00:00"}