{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HWOHNVTM4VLNB73B5QP2ZMJZI3","short_pith_number":"pith:HWOHNVTM","schema_version":"1.0","canonical_sha256":"3d9c76d66ce556d0ff61ec1facb13946cc126491b32584f84f341b03dadbce28","source":{"kind":"arxiv","id":"1810.09390","version":1},"attestation_state":"computed","paper":{"title":"A minimax near-optimal algorithm for adaptive rejection sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexandra Carpentier, Gilles Blanchard, Joseph C. Lam, Juliette Achdou","submitted_at":"2018-10-22T16:22:43Z","abstract_excerpt":"Rejection Sampling is a fundamental Monte-Carlo method. It is used to sample from distributions admitting a probability density function which can be evaluated exactly at any given point, albeit at a high computational cost. However, without proper tuning, this technique implies a high rejection rate. Several methods have been explored to cope with this problem, based on the principle of adaptively estimating the density by a simpler function, using the information of the previous samples. Most of them either rely on strong assumptions on the form of the density, or do not offer any theoretica"},"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":"1810.09390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-22T16:22:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bb903ad79c382e01a1cea57341435c0e5230138a9aed44a867f95a062ef7498b","abstract_canon_sha256":"caa2fa35a882fd18366d73857693aa35ddfec924ba3f8e0bd763065e00824d3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:40.228861Z","signature_b64":"3KBTz5gEJ6pwZTRGb158yyzQp619cP1wgfgkujobgfp0iZJUDReWR+Ae9kCJwlrr3S0T/J//DG6rkgem8zl1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d9c76d66ce556d0ff61ec1facb13946cc126491b32584f84f341b03dadbce28","last_reissued_at":"2026-05-18T00:02:40.228275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:40.228275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A minimax near-optimal algorithm for adaptive rejection sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexandra Carpentier, Gilles Blanchard, Joseph C. Lam, Juliette Achdou","submitted_at":"2018-10-22T16:22:43Z","abstract_excerpt":"Rejection Sampling is a fundamental Monte-Carlo method. It is used to sample from distributions admitting a probability density function which can be evaluated exactly at any given point, albeit at a high computational cost. However, without proper tuning, this technique implies a high rejection rate. Several methods have been explored to cope with this problem, based on the principle of adaptively estimating the density by a simpler function, using the information of the previous samples. Most of them either rely on strong assumptions on the form of the density, or do not offer any theoretica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09390","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1810.09390","created_at":"2026-05-18T00:02:40.228357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.09390v1","created_at":"2026-05-18T00:02:40.228357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09390","created_at":"2026-05-18T00:02:40.228357+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWOHNVTM4VLN","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWOHNVTM4VLNB73B","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWOHNVTM","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HWOHNVTM4VLNB73B5QP2ZMJZI3","json":"https://pith.science/pith/HWOHNVTM4VLNB73B5QP2ZMJZI3.json","graph_json":"https://pith.science/api/pith-number/HWOHNVTM4VLNB73B5QP2ZMJZI3/graph.json","events_json":"https://pith.science/api/pith-number/HWOHNVTM4VLNB73B5QP2ZMJZI3/events.json","paper":"https://pith.science/paper/HWOHNVTM"},"agent_actions":{"view_html":"https://pith.science/pith/HWOHNVTM4VLNB73B5QP2ZMJZI3","download_json":"https://pith.science/pith/HWOHNVTM4VLNB73B5QP2ZMJZI3.json","view_paper":"https://pith.science/paper/HWOHNVTM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.09390&json=true","fetch_graph":"https://pith.science/api/pith-number/HWOHNVTM4VLNB73B5QP2ZMJZI3/graph.json","fetch_events":"https://pith.science/api/pith-number/HWOHNVTM4VLNB73B5QP2ZMJZI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWOHNVTM4VLNB73B5QP2ZMJZI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWOHNVTM4VLNB73B5QP2ZMJZI3/action/storage_attestation","attest_author":"https://pith.science/pith/HWOHNVTM4VLNB73B5QP2ZMJZI3/action/author_attestation","sign_citation":"https://pith.science/pith/HWOHNVTM4VLNB73B5QP2ZMJZI3/action/citation_signature","submit_replication":"https://pith.science/pith/HWOHNVTM4VLNB73B5QP2ZMJZI3/action/replication_record"}},"created_at":"2026-05-18T00:02:40.228357+00:00","updated_at":"2026-05-18T00:02:40.228357+00:00"}