{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:M4V2JXACVBZH44LHDM7I2XTNYK","short_pith_number":"pith:M4V2JXAC","schema_version":"1.0","canonical_sha256":"672ba4dc02a8727e71671b3e8d5e6dc29efebc0fe45233a4cb7a1c87af7deee0","source":{"kind":"arxiv","id":"2304.06251","version":2},"attestation_state":"computed","paper":{"title":"Importance is Important: Generalized Markov Chain Importance Sampling Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML"],"primary_cat":"stat.CO","authors_text":"Aaron Smith, Guanxun Li, Quan Zhou","submitted_at":"2023-04-13T04:04:09Z","abstract_excerpt":"We show that for any multiple-try Metropolis algorithm, one can always accept the proposal and evaluate the importance weight that is needed to correct for the bias without extra computational cost. This results in a general, convenient, and rejection-free Markov chain Monte Carlo (MCMC) sampling scheme. By further leveraging the importance sampling perspective on Metropolis--Hastings algorithms, we propose an alternative MCMC sampler on discrete spaces that is also outside the Metropolis--Hastings framework, along with a general theory on its complexity. Numerical examples suggest that the pr"},"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":"2304.06251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2023-04-13T04:04:09Z","cross_cats_sorted":["stat.ME","stat.ML"],"title_canon_sha256":"e296fc1de7c332626701297ebb74239277e9ae611cd185f6f0fbf7eeefd10d94","abstract_canon_sha256":"bf8b5b9fbbbaa4727c9315d9b0a143c14a6b28c2f3c983fcc6b17493f534866f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:14:26.987122Z","signature_b64":"6199YlDw1fxKqu8OkqI6B7hHnScbbQWvYmzNP7YEjb2I3Mt7r98IpicQSp8Mo9wWf+vAwI9xK1sNtWEyPOI/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"672ba4dc02a8727e71671b3e8d5e6dc29efebc0fe45233a4cb7a1c87af7deee0","last_reissued_at":"2026-07-05T09:14:26.986620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:14:26.986620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Importance is Important: Generalized Markov Chain Importance Sampling Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML"],"primary_cat":"stat.CO","authors_text":"Aaron Smith, Guanxun Li, Quan Zhou","submitted_at":"2023-04-13T04:04:09Z","abstract_excerpt":"We show that for any multiple-try Metropolis algorithm, one can always accept the proposal and evaluate the importance weight that is needed to correct for the bias without extra computational cost. This results in a general, convenient, and rejection-free Markov chain Monte Carlo (MCMC) sampling scheme. By further leveraging the importance sampling perspective on Metropolis--Hastings algorithms, we propose an alternative MCMC sampler on discrete spaces that is also outside the Metropolis--Hastings framework, along with a general theory on its complexity. Numerical examples suggest that the pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.06251","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/2304.06251/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":"2304.06251","created_at":"2026-07-05T09:14:26.986677+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.06251v2","created_at":"2026-07-05T09:14:26.986677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.06251","created_at":"2026-07-05T09:14:26.986677+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4V2JXACVBZH","created_at":"2026-07-05T09:14:26.986677+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4V2JXACVBZH44LH","created_at":"2026-07-05T09:14:26.986677+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4V2JXAC","created_at":"2026-07-05T09:14:26.986677+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21899","citing_title":"Mad Props: Parallelism in Markov Chain Monte Carlo Through the Lens of the Infinite Proposal Limit","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M4V2JXACVBZH44LHDM7I2XTNYK","json":"https://pith.science/pith/M4V2JXACVBZH44LHDM7I2XTNYK.json","graph_json":"https://pith.science/api/pith-number/M4V2JXACVBZH44LHDM7I2XTNYK/graph.json","events_json":"https://pith.science/api/pith-number/M4V2JXACVBZH44LHDM7I2XTNYK/events.json","paper":"https://pith.science/paper/M4V2JXAC"},"agent_actions":{"view_html":"https://pith.science/pith/M4V2JXACVBZH44LHDM7I2XTNYK","download_json":"https://pith.science/pith/M4V2JXACVBZH44LHDM7I2XTNYK.json","view_paper":"https://pith.science/paper/M4V2JXAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.06251&json=true","fetch_graph":"https://pith.science/api/pith-number/M4V2JXACVBZH44LHDM7I2XTNYK/graph.json","fetch_events":"https://pith.science/api/pith-number/M4V2JXACVBZH44LHDM7I2XTNYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4V2JXACVBZH44LHDM7I2XTNYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4V2JXACVBZH44LHDM7I2XTNYK/action/storage_attestation","attest_author":"https://pith.science/pith/M4V2JXACVBZH44LHDM7I2XTNYK/action/author_attestation","sign_citation":"https://pith.science/pith/M4V2JXACVBZH44LHDM7I2XTNYK/action/citation_signature","submit_replication":"https://pith.science/pith/M4V2JXACVBZH44LHDM7I2XTNYK/action/replication_record"}},"created_at":"2026-07-05T09:14:26.986677+00:00","updated_at":"2026-07-05T09:14:26.986677+00:00"}