{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3SISVXREHDRRIJZC3ZO7B6FBXR","short_pith_number":"pith:3SISVXRE","canonical_record":{"source":{"id":"2512.02384","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-12-02T03:54:01Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"a9af77aedccfd588421fb32ec3ed43329310fbb1c5efbfc3733cfaf8c3d77987","abstract_canon_sha256":"713120c52ec47fb93d1767cdd8ce93fd1e4205abfcbeea789f0af47560b32b05"},"schema_version":"1.0"},"canonical_sha256":"dc912ade2438e3142722de5df0f8a1bc7db4cf5c752d96ca486debda5d9994f3","source":{"kind":"arxiv","id":"2512.02384","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.02384","created_at":"2026-07-20T02:19:16Z"},{"alias_kind":"arxiv_version","alias_value":"2512.02384v3","created_at":"2026-07-20T02:19:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.02384","created_at":"2026-07-20T02:19:16Z"},{"alias_kind":"pith_short_12","alias_value":"3SISVXREHDRR","created_at":"2026-07-20T02:19:16Z"},{"alias_kind":"pith_short_16","alias_value":"3SISVXREHDRRIJZC","created_at":"2026-07-20T02:19:16Z"},{"alias_kind":"pith_short_8","alias_value":"3SISVXRE","created_at":"2026-07-20T02:19:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3SISVXREHDRRIJZC3ZO7B6FBXR","target":"record","payload":{"canonical_record":{"source":{"id":"2512.02384","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-12-02T03:54:01Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"a9af77aedccfd588421fb32ec3ed43329310fbb1c5efbfc3733cfaf8c3d77987","abstract_canon_sha256":"713120c52ec47fb93d1767cdd8ce93fd1e4205abfcbeea789f0af47560b32b05"},"schema_version":"1.0"},"canonical_sha256":"dc912ade2438e3142722de5df0f8a1bc7db4cf5c752d96ca486debda5d9994f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-20T02:19:16.654681Z","signature_b64":"oMEVSIhnJ7IejdT8zOjOA6RRrrBYIEfTW2VGz0WBsJrN2zsH7pR4WxQK4A5pXK0LViUiMxLWlCzB0ZnQQCCyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc912ade2438e3142722de5df0f8a1bc7db4cf5c752d96ca486debda5d9994f3","last_reissued_at":"2026-07-20T02:19:16.653742Z","signature_status":"signed_v1","first_computed_at":"2026-07-20T02:19:16.653742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.02384","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-20T02:19:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eV4ajkvID90Qw+3upnmgdvIqzqJmv9qhopTkLjiQPb3Gyllq4NOMJCdHz6qZLLdaKUhud9Ua63GUfcvz+zmTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T13:30:34.005061Z"},"content_sha256":"300266585525d5be66139e39a518e7ef5b50fea704034ea9f7d201f70aee99d8","schema_version":"1.0","event_id":"sha256:300266585525d5be66139e39a518e7ef5b50fea704034ea9f7d201f70aee99d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3SISVXREHDRRIJZC3ZO7B6FBXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markov Chains Approximate Message Passing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"Amit Rajaraman, David X. Wu","submitted_at":"2025-12-02T03:54:01Z","abstract_excerpt":"Markov chain Monte Carlo algorithms have long been observed to obtain near-optimal performance in various Bayesian inference settings. However, developing a supporting theory that makes these studies rigorous has proved challenging.\n  In this paper, we study the classical spiked Wigner inference problem, where one aims to recover a planted Boolean spike from a noisy matrix measurement. We relate the recovery performance of Glauber dynamics on the annealed posterior to the performance of Approximate Message Passing (AMP), which is known to achieve Bayes-optimal performance. Our main results rel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.02384","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/2512.02384/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-20T02:19:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AC5PSfSdOxHLFWqjG87EXQtFCkrOYw+hPbvrng4tbypE9ZPRdyE/ZipzLc3AeNJrQdy1Z3k7m9XRkXol9xLbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T13:30:34.005577Z"},"content_sha256":"0aa274c3ab3f8e20cf87ec84c4c04bf3437b9c6c9c47ab5d84ac9cbef36422a0","schema_version":"1.0","event_id":"sha256:0aa274c3ab3f8e20cf87ec84c4c04bf3437b9c6c9c47ab5d84ac9cbef36422a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SISVXREHDRRIJZC3ZO7B6FBXR/bundle.json","state_url":"https://pith.science/pith/3SISVXREHDRRIJZC3ZO7B6FBXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SISVXREHDRRIJZC3ZO7B6FBXR/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-09T13:30:34Z","links":{"resolver":"https://pith.science/pith/3SISVXREHDRRIJZC3ZO7B6FBXR","bundle":"https://pith.science/pith/3SISVXREHDRRIJZC3ZO7B6FBXR/bundle.json","state":"https://pith.science/pith/3SISVXREHDRRIJZC3ZO7B6FBXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SISVXREHDRRIJZC3ZO7B6FBXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3SISVXREHDRRIJZC3ZO7B6FBXR","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":"713120c52ec47fb93d1767cdd8ce93fd1e4205abfcbeea789f0af47560b32b05","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-12-02T03:54:01Z","title_canon_sha256":"a9af77aedccfd588421fb32ec3ed43329310fbb1c5efbfc3733cfaf8c3d77987"},"schema_version":"1.0","source":{"id":"2512.02384","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.02384","created_at":"2026-07-20T02:19:16Z"},{"alias_kind":"arxiv_version","alias_value":"2512.02384v3","created_at":"2026-07-20T02:19:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.02384","created_at":"2026-07-20T02:19:16Z"},{"alias_kind":"pith_short_12","alias_value":"3SISVXREHDRR","created_at":"2026-07-20T02:19:16Z"},{"alias_kind":"pith_short_16","alias_value":"3SISVXREHDRRIJZC","created_at":"2026-07-20T02:19:16Z"},{"alias_kind":"pith_short_8","alias_value":"3SISVXRE","created_at":"2026-07-20T02:19:16Z"}],"graph_snapshots":[{"event_id":"sha256:0aa274c3ab3f8e20cf87ec84c4c04bf3437b9c6c9c47ab5d84ac9cbef36422a0","target":"graph","created_at":"2026-07-20T02:19:16Z","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/2512.02384/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Markov chain Monte Carlo algorithms have long been observed to obtain near-optimal performance in various Bayesian inference settings. However, developing a supporting theory that makes these studies rigorous has proved challenging.\n  In this paper, we study the classical spiked Wigner inference problem, where one aims to recover a planted Boolean spike from a noisy matrix measurement. We relate the recovery performance of Glauber dynamics on the annealed posterior to the performance of Approximate Message Passing (AMP), which is known to achieve Bayes-optimal performance. Our main results rel","authors_text":"Amit Rajaraman, David X. Wu","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-12-02T03:54:01Z","title":"Markov Chains Approximate Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.02384","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:300266585525d5be66139e39a518e7ef5b50fea704034ea9f7d201f70aee99d8","target":"record","created_at":"2026-07-20T02:19:16Z","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":"713120c52ec47fb93d1767cdd8ce93fd1e4205abfcbeea789f0af47560b32b05","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-12-02T03:54:01Z","title_canon_sha256":"a9af77aedccfd588421fb32ec3ed43329310fbb1c5efbfc3733cfaf8c3d77987"},"schema_version":"1.0","source":{"id":"2512.02384","kind":"arxiv","version":3}},"canonical_sha256":"dc912ade2438e3142722de5df0f8a1bc7db4cf5c752d96ca486debda5d9994f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc912ade2438e3142722de5df0f8a1bc7db4cf5c752d96ca486debda5d9994f3","first_computed_at":"2026-07-20T02:19:16.653742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-20T02:19:16.653742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oMEVSIhnJ7IejdT8zOjOA6RRrrBYIEfTW2VGz0WBsJrN2zsH7pR4WxQK4A5pXK0LViUiMxLWlCzB0ZnQQCCyCw==","signature_status":"signed_v1","signed_at":"2026-07-20T02:19:16.654681Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.02384","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:300266585525d5be66139e39a518e7ef5b50fea704034ea9f7d201f70aee99d8","sha256:0aa274c3ab3f8e20cf87ec84c4c04bf3437b9c6c9c47ab5d84ac9cbef36422a0"],"state_sha256":"467c5ec912ab1619aac204bc5092d381061d8f7d1234b3db7169a233f15676f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gALw/Tz6f4Vzpp2hIttID5/qc6BnDU8bhz4N9UEGyOO4gbjzbCUWOZqTCaNVT8X/PwNHbJVakzbFohlJJi6oAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T13:30:34.010809Z","bundle_sha256":"269b74406056e4859ad7ff7c10f31dfbbf78b16b98db039aaece22a3d6f503a8"}}