{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DSUU3G6YOGFHMGCJL4QWAPLVFM","short_pith_number":"pith:DSUU3G6Y","schema_version":"1.0","canonical_sha256":"1ca94d9bd8718a7618495f21603d752b30c8a17e4aa4e547f6ea09a3bc283979","source":{"kind":"arxiv","id":"2312.04898","version":2},"attestation_state":"computed","paper":{"title":"Quantifying the effectiveness of linear preconditioning in Markov chain Monte Carlo","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.ST","stat.OT","stat.TH"],"primary_cat":"stat.CO","authors_text":"Max Hird, Samuel Livingstone","submitted_at":"2023-12-08T08:29:47Z","abstract_excerpt":"We study linear preconditioning in Markov chain Monte Carlo. We consider the class of well-conditioned distributions, for which several mixing time bounds depend on the condition number $\\kappa$. First we show that well-conditioned distributions exist for which $\\kappa$ can be arbitrarily large and yet no linear preconditioner can reduce it. We then impose two sets of extra assumptions under which a linear preconditioner can significantly reduce $\\kappa$. For the random walk Metropolis we further provide upper and lower bounds on the spectral gap with tight $1/\\kappa$ dependence. This allows u"},"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":"2312.04898","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2023-12-08T08:29:47Z","cross_cats_sorted":["math.ST","stat.OT","stat.TH"],"title_canon_sha256":"1732d9251e6167326e365d22924bdc744419cf7eea822b22317118c5bcb6b6f5","abstract_canon_sha256":"e09796ac48e60fb4db430bbe9d5900f6b3d932902bbdbedcc2285b197f0294a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:06.329619Z","signature_b64":"hXH5r1p62pwz598QtqfB8DBpXEp0hams4nNLNViEevhFzHZSs634okxRnVkJhKYWBoLrtUKADXv0FJ3czMNlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ca94d9bd8718a7618495f21603d752b30c8a17e4aa4e547f6ea09a3bc283979","last_reissued_at":"2026-07-05T09:44:06.329141Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:06.329141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantifying the effectiveness of linear preconditioning in Markov chain Monte Carlo","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.ST","stat.OT","stat.TH"],"primary_cat":"stat.CO","authors_text":"Max Hird, Samuel Livingstone","submitted_at":"2023-12-08T08:29:47Z","abstract_excerpt":"We study linear preconditioning in Markov chain Monte Carlo. We consider the class of well-conditioned distributions, for which several mixing time bounds depend on the condition number $\\kappa$. First we show that well-conditioned distributions exist for which $\\kappa$ can be arbitrarily large and yet no linear preconditioner can reduce it. We then impose two sets of extra assumptions under which a linear preconditioner can significantly reduce $\\kappa$. For the random walk Metropolis we further provide upper and lower bounds on the spectral gap with tight $1/\\kappa$ dependence. This allows u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.04898","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/2312.04898/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":"2312.04898","created_at":"2026-07-05T09:44:06.329192+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.04898v2","created_at":"2026-07-05T09:44:06.329192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.04898","created_at":"2026-07-05T09:44:06.329192+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSUU3G6YOGFH","created_at":"2026-07-05T09:44:06.329192+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSUU3G6YOGFHMGCJ","created_at":"2026-07-05T09:44:06.329192+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSUU3G6Y","created_at":"2026-07-05T09:44:06.329192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05935","citing_title":"Hessian-informed, Coordinate Friendly Hamiltonian Monte Carlo in Linear Time","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DSUU3G6YOGFHMGCJL4QWAPLVFM","json":"https://pith.science/pith/DSUU3G6YOGFHMGCJL4QWAPLVFM.json","graph_json":"https://pith.science/api/pith-number/DSUU3G6YOGFHMGCJL4QWAPLVFM/graph.json","events_json":"https://pith.science/api/pith-number/DSUU3G6YOGFHMGCJL4QWAPLVFM/events.json","paper":"https://pith.science/paper/DSUU3G6Y"},"agent_actions":{"view_html":"https://pith.science/pith/DSUU3G6YOGFHMGCJL4QWAPLVFM","download_json":"https://pith.science/pith/DSUU3G6YOGFHMGCJL4QWAPLVFM.json","view_paper":"https://pith.science/paper/DSUU3G6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.04898&json=true","fetch_graph":"https://pith.science/api/pith-number/DSUU3G6YOGFHMGCJL4QWAPLVFM/graph.json","fetch_events":"https://pith.science/api/pith-number/DSUU3G6YOGFHMGCJL4QWAPLVFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSUU3G6YOGFHMGCJL4QWAPLVFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSUU3G6YOGFHMGCJL4QWAPLVFM/action/storage_attestation","attest_author":"https://pith.science/pith/DSUU3G6YOGFHMGCJL4QWAPLVFM/action/author_attestation","sign_citation":"https://pith.science/pith/DSUU3G6YOGFHMGCJL4QWAPLVFM/action/citation_signature","submit_replication":"https://pith.science/pith/DSUU3G6YOGFHMGCJL4QWAPLVFM/action/replication_record"}},"created_at":"2026-07-05T09:44:06.329192+00:00","updated_at":"2026-07-05T09:44:06.329192+00:00"}