{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Y6OM45TEU3V2ARIDO6QMQDMM5S","short_pith_number":"pith:Y6OM45TE","schema_version":"1.0","canonical_sha256":"c79cce7664a6eba0450377a0c80d8cecaf6928c39c9b911b13ebb81b353531b2","source":{"kind":"arxiv","id":"1509.07985","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Rejection Sampling with fixed number of nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"F. Louzada, L. Martino","submitted_at":"2015-09-26T14:16:25Z","abstract_excerpt":"The adaptive rejection sampling (ARS) algorithm is a universal random generator for drawing samples efficiently from a univariate log-concave target probability density function (pdf). ARS generates independent samples from the target via rejection sampling with high acceptance rates. Indeed, ARS yields a sequence of proposal functions that converge toward the target pdf, so that the probability of accepting a sample approaches one. However, sampling from the proposal pdf becomes more computational demanding each time it is updated. In this work, we propose a novel ARS scheme, called Cheap Ada"},"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":"1509.07985","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-09-26T14:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"5dde8990f976ad193752557a33e4f69663badea39d2cbb4ded3fa7f10c519335","abstract_canon_sha256":"d4d4f2bb05c187c0fb944f9312a7e91a88d829ba5a2ce382a0fb03bef6c4e075"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:32.727456Z","signature_b64":"FNBjl6TX/V5m5XC7M3blc9vvfCVxtdT856ls5DGdte9dIvUuMWLYeAGnWzhYboE2Zu2QvQJ88mIQxDKYcYEACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c79cce7664a6eba0450377a0c80d8cecaf6928c39c9b911b13ebb81b353531b2","last_reissued_at":"2026-05-18T00:33:32.726825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:32.726825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Rejection Sampling with fixed number of nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"F. Louzada, L. Martino","submitted_at":"2015-09-26T14:16:25Z","abstract_excerpt":"The adaptive rejection sampling (ARS) algorithm is a universal random generator for drawing samples efficiently from a univariate log-concave target probability density function (pdf). ARS generates independent samples from the target via rejection sampling with high acceptance rates. Indeed, ARS yields a sequence of proposal functions that converge toward the target pdf, so that the probability of accepting a sample approaches one. However, sampling from the proposal pdf becomes more computational demanding each time it is updated. In this work, we propose a novel ARS scheme, called Cheap Ada"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07985","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":""},"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":"1509.07985","created_at":"2026-05-18T00:33:32.726940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07985v2","created_at":"2026-05-18T00:33:32.726940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07985","created_at":"2026-05-18T00:33:32.726940+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6OM45TEU3V2","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6OM45TEU3V2ARID","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6OM45TE","created_at":"2026-05-18T12:29:50.041715+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/Y6OM45TEU3V2ARIDO6QMQDMM5S","json":"https://pith.science/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S.json","graph_json":"https://pith.science/api/pith-number/Y6OM45TEU3V2ARIDO6QMQDMM5S/graph.json","events_json":"https://pith.science/api/pith-number/Y6OM45TEU3V2ARIDO6QMQDMM5S/events.json","paper":"https://pith.science/paper/Y6OM45TE"},"agent_actions":{"view_html":"https://pith.science/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S","download_json":"https://pith.science/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S.json","view_paper":"https://pith.science/paper/Y6OM45TE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07985&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6OM45TEU3V2ARIDO6QMQDMM5S/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6OM45TEU3V2ARIDO6QMQDMM5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S/action/storage_attestation","attest_author":"https://pith.science/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S/action/author_attestation","sign_citation":"https://pith.science/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S/action/citation_signature","submit_replication":"https://pith.science/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S/action/replication_record"}},"created_at":"2026-05-18T00:33:32.726940+00:00","updated_at":"2026-05-18T00:33:32.726940+00:00"}