{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OXNRIP72O7TS7OZGQWDKHPMTTN","short_pith_number":"pith:OXNRIP72","canonical_record":{"source":{"id":"1505.07925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-29T05:33:22Z","cross_cats_sorted":["cs.LG","stat.CO","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"756d2c14d86f97e1ecf3972ddf651d92dd39cdab454640583cd0217d7062a654","abstract_canon_sha256":"f522f4bd0351ff0240847b5abd69d64b9fd28b2cc4b2d6c57c70efeee79a652f"},"schema_version":"1.0"},"canonical_sha256":"75db143ffa77e72fbb268586a3bd939b473060a0e472f839f252f0b6da4b7934","source":{"kind":"arxiv","id":"1505.07925","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07925","created_at":"2026-05-18T02:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07925v1","created_at":"2026-05-18T02:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07925","created_at":"2026-05-18T02:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"OXNRIP72O7TS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OXNRIP72O7TS7OZG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OXNRIP72","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OXNRIP72O7TS7OZGQWDKHPMTTN","target":"record","payload":{"canonical_record":{"source":{"id":"1505.07925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-29T05:33:22Z","cross_cats_sorted":["cs.LG","stat.CO","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"756d2c14d86f97e1ecf3972ddf651d92dd39cdab454640583cd0217d7062a654","abstract_canon_sha256":"f522f4bd0351ff0240847b5abd69d64b9fd28b2cc4b2d6c57c70efeee79a652f"},"schema_version":"1.0"},"canonical_sha256":"75db143ffa77e72fbb268586a3bd939b473060a0e472f839f252f0b6da4b7934","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:00.294813Z","signature_b64":"a6T9HRk6tYZRIZY3Lvomaz0mBkrkZ4Hk6zowg+O3AReZv5siBQ+3F0/z7D6NtEpLbbfOLPFaLDlEkOwnmDuyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75db143ffa77e72fbb268586a3bd939b473060a0e472f839f252f0b6da4b7934","last_reissued_at":"2026-05-18T02:00:00.294280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:00.294280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.07925","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-18T02:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XZeOiZ0wsNCCQUmZ29fgaPwIe3QOnoMatrPj4qGZUlLivYcsnD5039qC7ADLGWfKl4npkfCs2ouzLGaBowSLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:49:32.406528Z"},"content_sha256":"8dc2b008a2a887f69500be532051790a29e0f9009da2e24e94c5e2c550f515e9","schema_version":"1.0","event_id":"sha256:8dc2b008a2a887f69500be532051790a29e0f9009da2e24e94c5e2c550f515e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OXNRIP72O7TS7OZGQWDKHPMTTN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Computational Complexity of High-Dimensional Bayesian Variable Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO","stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Martin J. Wainwright, Michael I. Jordan, Yun Yang","submitted_at":"2015-05-29T05:33:22Z","abstract_excerpt":"We study the computational complexity of Markov chain Monte Carlo (MCMC) methods for high-dimensional Bayesian linear regression under sparsity constraints. We first show that a Bayesian approach can achieve variable-selection consistency under relatively mild conditions on the design matrix. We then demonstrate that the statistical criterion of posterior concentration need not imply the computational desideratum of rapid mixing of the MCMC algorithm. By introducing a truncated sparsity prior for variable selection, we provide a set of conditions that guarantee both variable-selection consiste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07925","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-18T02:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvYFUHHM2bd4ZVDQYtGfJwh8I7twGIRhNTnNw5P88pkM+Kdy1HdqnmgTIgz33cM6XwCQu52YEVcE7TUaSX1dCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:49:32.406885Z"},"content_sha256":"dfa72b9ccbb217dd3745be20ca38cebde2410df816bda5c8e04d39bee4367c1b","schema_version":"1.0","event_id":"sha256:dfa72b9ccbb217dd3745be20ca38cebde2410df816bda5c8e04d39bee4367c1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXNRIP72O7TS7OZGQWDKHPMTTN/bundle.json","state_url":"https://pith.science/pith/OXNRIP72O7TS7OZGQWDKHPMTTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXNRIP72O7TS7OZGQWDKHPMTTN/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-06-02T17:49:32Z","links":{"resolver":"https://pith.science/pith/OXNRIP72O7TS7OZGQWDKHPMTTN","bundle":"https://pith.science/pith/OXNRIP72O7TS7OZGQWDKHPMTTN/bundle.json","state":"https://pith.science/pith/OXNRIP72O7TS7OZGQWDKHPMTTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXNRIP72O7TS7OZGQWDKHPMTTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OXNRIP72O7TS7OZGQWDKHPMTTN","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":"f522f4bd0351ff0240847b5abd69d64b9fd28b2cc4b2d6c57c70efeee79a652f","cross_cats_sorted":["cs.LG","stat.CO","stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-29T05:33:22Z","title_canon_sha256":"756d2c14d86f97e1ecf3972ddf651d92dd39cdab454640583cd0217d7062a654"},"schema_version":"1.0","source":{"id":"1505.07925","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07925","created_at":"2026-05-18T02:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07925v1","created_at":"2026-05-18T02:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07925","created_at":"2026-05-18T02:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"OXNRIP72O7TS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OXNRIP72O7TS7OZG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OXNRIP72","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:dfa72b9ccbb217dd3745be20ca38cebde2410df816bda5c8e04d39bee4367c1b","target":"graph","created_at":"2026-05-18T02:00:00Z","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":"We study the computational complexity of Markov chain Monte Carlo (MCMC) methods for high-dimensional Bayesian linear regression under sparsity constraints. We first show that a Bayesian approach can achieve variable-selection consistency under relatively mild conditions on the design matrix. We then demonstrate that the statistical criterion of posterior concentration need not imply the computational desideratum of rapid mixing of the MCMC algorithm. By introducing a truncated sparsity prior for variable selection, we provide a set of conditions that guarantee both variable-selection consiste","authors_text":"Martin J. Wainwright, Michael I. Jordan, Yun Yang","cross_cats":["cs.LG","stat.CO","stat.ME","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-29T05:33:22Z","title":"On the Computational Complexity of High-Dimensional Bayesian Variable Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07925","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:8dc2b008a2a887f69500be532051790a29e0f9009da2e24e94c5e2c550f515e9","target":"record","created_at":"2026-05-18T02:00:00Z","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":"f522f4bd0351ff0240847b5abd69d64b9fd28b2cc4b2d6c57c70efeee79a652f","cross_cats_sorted":["cs.LG","stat.CO","stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-05-29T05:33:22Z","title_canon_sha256":"756d2c14d86f97e1ecf3972ddf651d92dd39cdab454640583cd0217d7062a654"},"schema_version":"1.0","source":{"id":"1505.07925","kind":"arxiv","version":1}},"canonical_sha256":"75db143ffa77e72fbb268586a3bd939b473060a0e472f839f252f0b6da4b7934","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75db143ffa77e72fbb268586a3bd939b473060a0e472f839f252f0b6da4b7934","first_computed_at":"2026-05-18T02:00:00.294280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:00.294280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a6T9HRk6tYZRIZY3Lvomaz0mBkrkZ4Hk6zowg+O3AReZv5siBQ+3F0/z7D6NtEpLbbfOLPFaLDlEkOwnmDuyCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:00.294813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.07925","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8dc2b008a2a887f69500be532051790a29e0f9009da2e24e94c5e2c550f515e9","sha256:dfa72b9ccbb217dd3745be20ca38cebde2410df816bda5c8e04d39bee4367c1b"],"state_sha256":"91acc2e2ac83c071951f2a5640f12c8ebaaf97e07fc333b9c6c55f504bf9d222"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5KCrMNmkDN/22HDFVmpNa8Dv0TIQITOWBC4sgB9Hg8rteFLMmbHWdB1Ha1bmPmopjmP7TmGgTDzqj9ruQlnDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:49:32.409002Z","bundle_sha256":"bd0a618629753edd9a6c8cf515abd06685968568c5921cdfde7e7b59b3cb76f4"}}