{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YT4BFMXJBAAQNURP4IGRNTYEKS","short_pith_number":"pith:YT4BFMXJ","schema_version":"1.0","canonical_sha256":"c4f812b2e9080106d22fe20d16cf045487703e7757b4c75d887c0128803c6f3d","source":{"kind":"arxiv","id":"1803.10282","version":3},"attestation_state":"computed","paper":{"title":"An approach to large-scale Quasi-Bayesian inference with spike-and-slab priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Anwesha Bhattacharyya, Yves Atchade","submitted_at":"2018-03-27T19:25:14Z","abstract_excerpt":"We propose a general framework using spike-and-slab prior distributions to aid with the development of high-dimensional Bayesian inference. Our framework allows inference with a general quasi-likelihood function. We show that highly efficient and scalable Markov Chain Monte Carlo (MCMC) algorithms can be easily constructed to sample from the resulting quasi-posterior distributions.\n  We study the large scale behavior of the resulting quasi-posterior distributions as the dimension of the parameter space grows, and we establish several convergence results. In large-scale applications where compu"},"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":"1803.10282","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-03-27T19:25:14Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"03267d4ba393b20e403e539bbdaa6869d94503261af4bfa6387c4d5ab3440ac3","abstract_canon_sha256":"f534cfd4415a7d75496df122ae4f585903e677cd03b1126a596982c5c57bbdff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:23.097238Z","signature_b64":"2f4lF4BXExptiVn52M/5wiPUj5URnH+xX3xyGX9yT6AMA75e7zw527V9TvnzYS0fPX2PQmVlotYxy0BJKNGpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4f812b2e9080106d22fe20d16cf045487703e7757b4c75d887c0128803c6f3d","last_reissued_at":"2026-07-04T23:58:23.096777Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:23.096777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An approach to large-scale Quasi-Bayesian inference with spike-and-slab priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Anwesha Bhattacharyya, Yves Atchade","submitted_at":"2018-03-27T19:25:14Z","abstract_excerpt":"We propose a general framework using spike-and-slab prior distributions to aid with the development of high-dimensional Bayesian inference. Our framework allows inference with a general quasi-likelihood function. We show that highly efficient and scalable Markov Chain Monte Carlo (MCMC) algorithms can be easily constructed to sample from the resulting quasi-posterior distributions.\n  We study the large scale behavior of the resulting quasi-posterior distributions as the dimension of the parameter space grows, and we establish several convergence results. In large-scale applications where compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10282","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/1803.10282/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":"1803.10282","created_at":"2026-07-04T23:58:23.096833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10282v3","created_at":"2026-07-04T23:58:23.096833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10282","created_at":"2026-07-04T23:58:23.096833+00:00"},{"alias_kind":"pith_short_12","alias_value":"YT4BFMXJBAAQ","created_at":"2026-07-04T23:58:23.096833+00:00"},{"alias_kind":"pith_short_16","alias_value":"YT4BFMXJBAAQNURP","created_at":"2026-07-04T23:58:23.096833+00:00"},{"alias_kind":"pith_short_8","alias_value":"YT4BFMXJ","created_at":"2026-07-04T23:58:23.096833+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00715","citing_title":"Rate-optimal neural boundary detection from unlabeled noisy images","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14404","citing_title":"Early-stopped aggregation: Adaptive inference with computational efficiency","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YT4BFMXJBAAQNURP4IGRNTYEKS","json":"https://pith.science/pith/YT4BFMXJBAAQNURP4IGRNTYEKS.json","graph_json":"https://pith.science/api/pith-number/YT4BFMXJBAAQNURP4IGRNTYEKS/graph.json","events_json":"https://pith.science/api/pith-number/YT4BFMXJBAAQNURP4IGRNTYEKS/events.json","paper":"https://pith.science/paper/YT4BFMXJ"},"agent_actions":{"view_html":"https://pith.science/pith/YT4BFMXJBAAQNURP4IGRNTYEKS","download_json":"https://pith.science/pith/YT4BFMXJBAAQNURP4IGRNTYEKS.json","view_paper":"https://pith.science/paper/YT4BFMXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10282&json=true","fetch_graph":"https://pith.science/api/pith-number/YT4BFMXJBAAQNURP4IGRNTYEKS/graph.json","fetch_events":"https://pith.science/api/pith-number/YT4BFMXJBAAQNURP4IGRNTYEKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YT4BFMXJBAAQNURP4IGRNTYEKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YT4BFMXJBAAQNURP4IGRNTYEKS/action/storage_attestation","attest_author":"https://pith.science/pith/YT4BFMXJBAAQNURP4IGRNTYEKS/action/author_attestation","sign_citation":"https://pith.science/pith/YT4BFMXJBAAQNURP4IGRNTYEKS/action/citation_signature","submit_replication":"https://pith.science/pith/YT4BFMXJBAAQNURP4IGRNTYEKS/action/replication_record"}},"created_at":"2026-07-04T23:58:23.096833+00:00","updated_at":"2026-07-04T23:58:23.096833+00:00"}