{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:N6GJRZ6AY2UPIVAA7WSAOAJBGH","short_pith_number":"pith:N6GJRZ6A","schema_version":"1.0","canonical_sha256":"6f8c98e7c0c6a8f45400fda407012131e068d398466543a0c78dc9fa865acc9f","source":{"kind":"arxiv","id":"2102.05407","version":3},"attestation_state":"computed","paper":{"title":"Advances in Importance Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Luca Martino, V\\'ictor Elvira","submitted_at":"2021-02-10T12:50:38Z","abstract_excerpt":"Importance sampling (IS) is a Monte Carlo technique for the approximation of intractable distributions and integrals with respect to them. The origin of IS dates from the early 1950s. In the last decades, the rise of the Bayesian paradigm and the increase of the available computational resources have propelled the interest in this theoretically sound methodology. In this paper, we first describe the basic IS algorithm and then revisit the recent advances in this methodology. We pay particular attention to two sophisticated lines. First, we focus on multiple IS (MIS), the case where more than o"},"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":"2102.05407","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2021-02-10T12:50:38Z","cross_cats_sorted":[],"title_canon_sha256":"00b6b69b9fdca32dbe3d43fe9d867766d4c4eaa2e39f92f908b3b9b34df6ecab","abstract_canon_sha256":"e4fe155c66e4aa5b2c1cfcdf6792427c3f02b09d40a9bacaff0e3012a2f2bfc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:33:59.181531Z","signature_b64":"UP1BQoJ4JbAm0AxcKuQczxFfYOuCkrqjpAM5lQVyF5gPP6cyPZRDHhlIyd35NkbFFvhfz9d+NmKNgGY8m5HNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f8c98e7c0c6a8f45400fda407012131e068d398466543a0c78dc9fa865acc9f","last_reissued_at":"2026-07-05T08:33:59.181106Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:33:59.181106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advances in Importance Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Luca Martino, V\\'ictor Elvira","submitted_at":"2021-02-10T12:50:38Z","abstract_excerpt":"Importance sampling (IS) is a Monte Carlo technique for the approximation of intractable distributions and integrals with respect to them. The origin of IS dates from the early 1950s. In the last decades, the rise of the Bayesian paradigm and the increase of the available computational resources have propelled the interest in this theoretically sound methodology. In this paper, we first describe the basic IS algorithm and then revisit the recent advances in this methodology. We pay particular attention to two sophisticated lines. First, we focus on multiple IS (MIS), the case where more than o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.05407","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/2102.05407/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":"2102.05407","created_at":"2026-07-05T08:33:59.181161+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.05407v3","created_at":"2026-07-05T08:33:59.181161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.05407","created_at":"2026-07-05T08:33:59.181161+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6GJRZ6AY2UP","created_at":"2026-07-05T08:33:59.181161+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6GJRZ6AY2UPIVAA","created_at":"2026-07-05T08:33:59.181161+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6GJRZ6A","created_at":"2026-07-05T08:33:59.181161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30055","citing_title":"The Wasserstein cost of Importance Sampling","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17295","citing_title":"DISA: Offline Importance Sampling for Distribution-Matching LLM-RL","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2512.01761","citing_title":"A novel sequential method for building upper and lower bounds of moments of distributions","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05493","citing_title":"A renormalization-group inspired lattice-based framework for piecewise generalized linear models","ref_index":180,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N6GJRZ6AY2UPIVAA7WSAOAJBGH","json":"https://pith.science/pith/N6GJRZ6AY2UPIVAA7WSAOAJBGH.json","graph_json":"https://pith.science/api/pith-number/N6GJRZ6AY2UPIVAA7WSAOAJBGH/graph.json","events_json":"https://pith.science/api/pith-number/N6GJRZ6AY2UPIVAA7WSAOAJBGH/events.json","paper":"https://pith.science/paper/N6GJRZ6A"},"agent_actions":{"view_html":"https://pith.science/pith/N6GJRZ6AY2UPIVAA7WSAOAJBGH","download_json":"https://pith.science/pith/N6GJRZ6AY2UPIVAA7WSAOAJBGH.json","view_paper":"https://pith.science/paper/N6GJRZ6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.05407&json=true","fetch_graph":"https://pith.science/api/pith-number/N6GJRZ6AY2UPIVAA7WSAOAJBGH/graph.json","fetch_events":"https://pith.science/api/pith-number/N6GJRZ6AY2UPIVAA7WSAOAJBGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6GJRZ6AY2UPIVAA7WSAOAJBGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6GJRZ6AY2UPIVAA7WSAOAJBGH/action/storage_attestation","attest_author":"https://pith.science/pith/N6GJRZ6AY2UPIVAA7WSAOAJBGH/action/author_attestation","sign_citation":"https://pith.science/pith/N6GJRZ6AY2UPIVAA7WSAOAJBGH/action/citation_signature","submit_replication":"https://pith.science/pith/N6GJRZ6AY2UPIVAA7WSAOAJBGH/action/replication_record"}},"created_at":"2026-07-05T08:33:59.181161+00:00","updated_at":"2026-07-05T08:33:59.181161+00:00"}