{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:F3WPTVM3GA662HL4VZA5LVNHZH","short_pith_number":"pith:F3WPTVM3","schema_version":"1.0","canonical_sha256":"2eecf9d59b303ded1d7cae41d5d5a7c9e124a26734927fd6390b0d49e21a7c5c","source":{"kind":"arxiv","id":"2408.11780","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Stereographic MCMC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Cameron Bell, Gareth O. Roberts, Krzystof {\\L}atuszy\\'nski","submitted_at":"2024-08-21T17:09:54Z","abstract_excerpt":"In order to tackle the problem of sampling from heavy tailed, high dimensional distributions via Markov Chain Monte Carlo (MCMC) methods, Yang, Latuszy\\'nski, and Roberts (2022) (arXiv:2205.12112) introduces the stereographic projection as a tool to compactify $\\mathbb{R}^d$ and transform the problem into sampling from a density on the unit sphere $\\mathbb{S}^d$. However, the improvement in algorithmic efficiency, as well as the computational cost of the implementation, are still significantly impacted by the parameters used in this transformation.\n  To address this, we introduce adaptive vers"},"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":"2408.11780","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2024-08-21T17:09:54Z","cross_cats_sorted":[],"title_canon_sha256":"e8c312945e592ad810d1ffcedb229c6a2bf5ab9349f5c3454d315eb0d35fc2d8","abstract_canon_sha256":"ba712d66922ead79806d8899a890919fe3e6df92469363486097a2f5add40eb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:51.615551Z","signature_b64":"NXCBwNko8QbfR6KTbVofKsQ6asgRK/SrRQ1PDDkiHYSdtQLel182wPkTxcVygl3AK3bP52gK20yg81fv42OHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eecf9d59b303ded1d7cae41d5d5a7c9e124a26734927fd6390b0d49e21a7c5c","last_reissued_at":"2026-07-05T11:03:51.615023Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:51.615023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Stereographic MCMC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Cameron Bell, Gareth O. Roberts, Krzystof {\\L}atuszy\\'nski","submitted_at":"2024-08-21T17:09:54Z","abstract_excerpt":"In order to tackle the problem of sampling from heavy tailed, high dimensional distributions via Markov Chain Monte Carlo (MCMC) methods, Yang, Latuszy\\'nski, and Roberts (2022) (arXiv:2205.12112) introduces the stereographic projection as a tool to compactify $\\mathbb{R}^d$ and transform the problem into sampling from a density on the unit sphere $\\mathbb{S}^d$. However, the improvement in algorithmic efficiency, as well as the computational cost of the implementation, are still significantly impacted by the parameters used in this transformation.\n  To address this, we introduce adaptive vers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.11780","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/2408.11780/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":"2408.11780","created_at":"2026-07-05T11:03:51.615087+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.11780v2","created_at":"2026-07-05T11:03:51.615087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.11780","created_at":"2026-07-05T11:03:51.615087+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3WPTVM3GA66","created_at":"2026-07-05T11:03:51.615087+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3WPTVM3GA662HL4","created_at":"2026-07-05T11:03:51.615087+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3WPTVM3","created_at":"2026-07-05T11:03:51.615087+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2606.06730","citing_title":"Bayesian genome-wide clustering and variable selection of transcriptomic data via rank-based mixtures","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2606.30018","citing_title":"Error bounds for simultaneous Wasserstein contractive adaptive increasingly rare MCMC","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2603.18640","citing_title":"A Theoretical Comparison of No-U-Turn Sampler Variants: Necessary and Sufficient Convergence Conditions and Mixing Time Analysis under Gaussian Targets","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2604.09832","citing_title":"Adaptive Riemannian Manifold Hamiltonian Monte Carlo with Hierarchical Metric","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F3WPTVM3GA662HL4VZA5LVNHZH","json":"https://pith.science/pith/F3WPTVM3GA662HL4VZA5LVNHZH.json","graph_json":"https://pith.science/api/pith-number/F3WPTVM3GA662HL4VZA5LVNHZH/graph.json","events_json":"https://pith.science/api/pith-number/F3WPTVM3GA662HL4VZA5LVNHZH/events.json","paper":"https://pith.science/paper/F3WPTVM3"},"agent_actions":{"view_html":"https://pith.science/pith/F3WPTVM3GA662HL4VZA5LVNHZH","download_json":"https://pith.science/pith/F3WPTVM3GA662HL4VZA5LVNHZH.json","view_paper":"https://pith.science/paper/F3WPTVM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.11780&json=true","fetch_graph":"https://pith.science/api/pith-number/F3WPTVM3GA662HL4VZA5LVNHZH/graph.json","fetch_events":"https://pith.science/api/pith-number/F3WPTVM3GA662HL4VZA5LVNHZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3WPTVM3GA662HL4VZA5LVNHZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3WPTVM3GA662HL4VZA5LVNHZH/action/storage_attestation","attest_author":"https://pith.science/pith/F3WPTVM3GA662HL4VZA5LVNHZH/action/author_attestation","sign_citation":"https://pith.science/pith/F3WPTVM3GA662HL4VZA5LVNHZH/action/citation_signature","submit_replication":"https://pith.science/pith/F3WPTVM3GA662HL4VZA5LVNHZH/action/replication_record"}},"created_at":"2026-07-05T11:03:51.615087+00:00","updated_at":"2026-07-05T11:03:51.615087+00:00"}