{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PKDBBIDAJRJSRULX56H2XGB3DL","short_pith_number":"pith:PKDBBIDA","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"},"canonical_sha256":"7a8610a0604c5328d177ef8fab983b1aeffde381d16fad37ab9437112fde9b37","source":{"kind":"arxiv","id":"2511.00870","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.00870","created_at":"2026-06-30T01:17:28Z"},{"alias_kind":"arxiv_version","alias_value":"2511.00870v2","created_at":"2026-06-30T01:17:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.00870","created_at":"2026-06-30T01:17:28Z"},{"alias_kind":"pith_short_12","alias_value":"PKDBBIDAJRJS","created_at":"2026-06-30T01:17:28Z"},{"alias_kind":"pith_short_16","alias_value":"PKDBBIDAJRJSRULX","created_at":"2026-06-30T01:17:28Z"},{"alias_kind":"pith_short_8","alias_value":"PKDBBIDA","created_at":"2026-06-30T01:17:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PKDBBIDAJRJSRULX56H2XGB3DL","target":"record","payload":{"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"},"canonical_sha256":"7a8610a0604c5328d177ef8fab983b1aeffde381d16fad37ab9437112fde9b37","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"},"source_kind":"arxiv","source_id":"2511.00870","source_version":2,"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-06-30T01:17:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5zhlaSQCAx99oLGm9ieCelyO8/PcKo7yHccNjQJ+OS+rWdWgFAiSpHsehjFJrOfz6yFT0xgKvFFlgSe6KUTzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:23:28.693113Z"},"content_sha256":"7abc2e65633c73b4c50ce63db32b899f2cc29e759ea252b392b8a14eb693ff12","schema_version":"1.0","event_id":"sha256:7abc2e65633c73b4c50ce63db32b899f2cc29e759ea252b392b8a14eb693ff12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PKDBBIDAJRJSRULX56H2XGB3DL","target":"graph","payload":{"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"},"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-06-30T01:17:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pSmbrGicvjk6BMxbvvv85MvBz9a+U5An6RY5WjDacC2Wyw9cvWXom7Nl+D2JzhHDHai9hWDelwjetl/yJxN7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:23:28.694006Z"},"content_sha256":"8d3e56e3c26d26bb704dc1c2977afec795c28b8b51ea9fe72943dc77fdd2d905","schema_version":"1.0","event_id":"sha256:8d3e56e3c26d26bb704dc1c2977afec795c28b8b51ea9fe72943dc77fdd2d905"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PKDBBIDAJRJSRULX56H2XGB3DL/bundle.json","state_url":"https://pith.science/pith/PKDBBIDAJRJSRULX56H2XGB3DL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PKDBBIDAJRJSRULX56H2XGB3DL/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-10T19:23:28Z","links":{"resolver":"https://pith.science/pith/PKDBBIDAJRJSRULX56H2XGB3DL","bundle":"https://pith.science/pith/PKDBBIDAJRJSRULX56H2XGB3DL/bundle.json","state":"https://pith.science/pith/PKDBBIDAJRJSRULX56H2XGB3DL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PKDBBIDAJRJSRULX56H2XGB3DL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PKDBBIDAJRJSRULX56H2XGB3DL","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":"1ab2ecf23a1e46d9022bcf1cf18467eb6d1bd87a4cf466aa93f7004ea2fa29d0","cross_cats_sorted":["cs.DC","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-11-02T09:41:55Z","title_canon_sha256":"7103dd2c7cca4fa803cf899e0562f48973a969add40b5f08b2236589568a1b88"},"schema_version":"1.0","source":{"id":"2511.00870","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.00870","created_at":"2026-06-30T01:17:28Z"},{"alias_kind":"arxiv_version","alias_value":"2511.00870v2","created_at":"2026-06-30T01:17:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.00870","created_at":"2026-06-30T01:17:28Z"},{"alias_kind":"pith_short_12","alias_value":"PKDBBIDAJRJS","created_at":"2026-06-30T01:17:28Z"},{"alias_kind":"pith_short_16","alias_value":"PKDBBIDAJRJSRULX","created_at":"2026-06-30T01:17:28Z"},{"alias_kind":"pith_short_8","alias_value":"PKDBBIDA","created_at":"2026-06-30T01:17:28Z"}],"graph_snapshots":[{"event_id":"sha256:8d3e56e3c26d26bb704dc1c2977afec795c28b8b51ea9fe72943dc77fdd2d905","target":"graph","created_at":"2026-06-30T01:17:28Z","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/2511.00870/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Audrey Repetti, Maxime Bouton, Pierre-Antoine Thouvenin, Pierre Chainais","cross_cats":["cs.DC","eess.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-11-02T09:41:55Z","title":"A Distributed Plug-and-Play MCMC Algorithm for High-Dimensional Inverse Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.00870","kind":"arxiv","version":2},"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:7abc2e65633c73b4c50ce63db32b899f2cc29e759ea252b392b8a14eb693ff12","target":"record","created_at":"2026-06-30T01:17:28Z","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":"1ab2ecf23a1e46d9022bcf1cf18467eb6d1bd87a4cf466aa93f7004ea2fa29d0","cross_cats_sorted":["cs.DC","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-11-02T09:41:55Z","title_canon_sha256":"7103dd2c7cca4fa803cf899e0562f48973a969add40b5f08b2236589568a1b88"},"schema_version":"1.0","source":{"id":"2511.00870","kind":"arxiv","version":2}},"canonical_sha256":"7a8610a0604c5328d177ef8fab983b1aeffde381d16fad37ab9437112fde9b37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a8610a0604c5328d177ef8fab983b1aeffde381d16fad37ab9437112fde9b37","first_computed_at":"2026-06-30T01:17:28.318965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T01:17:28.318965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aicApvKoEVqGp3VXpAQ69s4ZNe1ZD7B9/Q/PcYCvfnMEu0cMyFxOrK4IH81ruwXyyfl/6r0gahBqlcKw+rjpCA==","signature_status":"signed_v1","signed_at":"2026-06-30T01:17:28.319734Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.00870","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7abc2e65633c73b4c50ce63db32b899f2cc29e759ea252b392b8a14eb693ff12","sha256:8d3e56e3c26d26bb704dc1c2977afec795c28b8b51ea9fe72943dc77fdd2d905"],"state_sha256":"56122f560c7f44c5d03fec950df951d4c3cf0be973d05bfabd21c88dadd8eed1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFMGttW+nrZRoiFOcI+ZOTe3Egupa39KKZzz73D0C48d3/bFHTmMB/bn8ls8Bv67Cd8a/NXn00Wvp8yBVROCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T19:23:28.701361Z","bundle_sha256":"218c98a616205fd89142de957296667ff8114bf74634c32890e48d744db944d9"}}