{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DZ4KLMNI3HPG563PFRYGFTET4J","short_pith_number":"pith:DZ4KLMNI","schema_version":"1.0","canonical_sha256":"1e78a5b1a8d9de6efb6f2c7062cc93e27ebc46628132a1025092405d446d6d2a","source":{"kind":"arxiv","id":"2406.19550","version":1},"attestation_state":"computed","paper":{"title":"Provably Efficient Posterior Sampling for Sparse Linear Regression via Measure Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Andrea Montanari, Yuchen Wu","submitted_at":"2024-06-27T22:05:35Z","abstract_excerpt":"We consider the problem of sampling from the posterior distribution of a $d$-dimensional coefficient vector $\\boldsymbol{\\theta}$, given linear observations $\\boldsymbol{y} = \\boldsymbol{X}\\boldsymbol{\\theta}+\\boldsymbol{\\varepsilon}$. In general, such posteriors are multimodal, and therefore challenging to sample from. This observation has prompted the exploration of various heuristics that aim at approximating the posterior distribution.\n  In this paper, we study a different approach based on decomposing the posterior distribution into a log-concave mixture of simple product measures. This d"},"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":"2406.19550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2024-06-27T22:05:35Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"cce614292424bb603a3077de4862812e0a7879b25f78a98b6da8f11bf83d94b2","abstract_canon_sha256":"9473003747ca0dfebeb63acd6f29e05fff1d66ac183079389e0b5294e283a5af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:41.414037Z","signature_b64":"fguiPXsaXIhII+atORL90BMX1FXVkhjEyyr8DnaTmuyFVZcDmr+zf7eB7geRIh5p84RSeriJlDjBw7HLoEhPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e78a5b1a8d9de6efb6f2c7062cc93e27ebc46628132a1025092405d446d6d2a","last_reissued_at":"2026-07-05T08:37:41.413580Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:41.413580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provably Efficient Posterior Sampling for Sparse Linear Regression via Measure Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Andrea Montanari, Yuchen Wu","submitted_at":"2024-06-27T22:05:35Z","abstract_excerpt":"We consider the problem of sampling from the posterior distribution of a $d$-dimensional coefficient vector $\\boldsymbol{\\theta}$, given linear observations $\\boldsymbol{y} = \\boldsymbol{X}\\boldsymbol{\\theta}+\\boldsymbol{\\varepsilon}$. In general, such posteriors are multimodal, and therefore challenging to sample from. This observation has prompted the exploration of various heuristics that aim at approximating the posterior distribution.\n  In this paper, we study a different approach based on decomposing the posterior distribution into a log-concave mixture of simple product measures. This d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19550","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.19550/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":"2406.19550","created_at":"2026-07-05T08:37:41.413641+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.19550v1","created_at":"2026-07-05T08:37:41.413641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19550","created_at":"2026-07-05T08:37:41.413641+00:00"},{"alias_kind":"pith_short_12","alias_value":"DZ4KLMNI3HPG","created_at":"2026-07-05T08:37:41.413641+00:00"},{"alias_kind":"pith_short_16","alias_value":"DZ4KLMNI3HPG563P","created_at":"2026-07-05T08:37:41.413641+00:00"},{"alias_kind":"pith_short_8","alias_value":"DZ4KLMNI","created_at":"2026-07-05T08:37:41.413641+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.26285","citing_title":"Denoising growth complexity: Data geometry and certified schedules for diffusion sampling","ref_index":154,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DZ4KLMNI3HPG563PFRYGFTET4J","json":"https://pith.science/pith/DZ4KLMNI3HPG563PFRYGFTET4J.json","graph_json":"https://pith.science/api/pith-number/DZ4KLMNI3HPG563PFRYGFTET4J/graph.json","events_json":"https://pith.science/api/pith-number/DZ4KLMNI3HPG563PFRYGFTET4J/events.json","paper":"https://pith.science/paper/DZ4KLMNI"},"agent_actions":{"view_html":"https://pith.science/pith/DZ4KLMNI3HPG563PFRYGFTET4J","download_json":"https://pith.science/pith/DZ4KLMNI3HPG563PFRYGFTET4J.json","view_paper":"https://pith.science/paper/DZ4KLMNI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.19550&json=true","fetch_graph":"https://pith.science/api/pith-number/DZ4KLMNI3HPG563PFRYGFTET4J/graph.json","fetch_events":"https://pith.science/api/pith-number/DZ4KLMNI3HPG563PFRYGFTET4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DZ4KLMNI3HPG563PFRYGFTET4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DZ4KLMNI3HPG563PFRYGFTET4J/action/storage_attestation","attest_author":"https://pith.science/pith/DZ4KLMNI3HPG563PFRYGFTET4J/action/author_attestation","sign_citation":"https://pith.science/pith/DZ4KLMNI3HPG563PFRYGFTET4J/action/citation_signature","submit_replication":"https://pith.science/pith/DZ4KLMNI3HPG563PFRYGFTET4J/action/replication_record"}},"created_at":"2026-07-05T08:37:41.413641+00:00","updated_at":"2026-07-05T08:37:41.413641+00:00"}