{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Y6OM45TEU3V2ARIDO6QMQDMM5S","short_pith_number":"pith:Y6OM45TE","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"},"canonical_sha256":"c79cce7664a6eba0450377a0c80d8cecaf6928c39c9b911b13ebb81b353531b2","source":{"kind":"arxiv","id":"1509.07985","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07985","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07985v2","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07985","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"Y6OM45TEU3V2","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y6OM45TEU3V2ARID","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y6OM45TE","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Y6OM45TEU3V2ARIDO6QMQDMM5S","target":"record","payload":{"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"},"canonical_sha256":"c79cce7664a6eba0450377a0c80d8cecaf6928c39c9b911b13ebb81b353531b2","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"},"source_kind":"arxiv","source_id":"1509.07985","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yOhQLLZFuN+PzGv+anRtzVum+VCUDbVwEW0A0WaeNezLTBnqQUmYSRb3NX61o6iAxKUVub8iyYM2fecvCjSaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:21:33.508737Z"},"content_sha256":"611a44c8dbf5e091b65efcfee107cfa9933b1c70b5d0ca733dccf3cb531a2fc5","schema_version":"1.0","event_id":"sha256:611a44c8dbf5e091b65efcfee107cfa9933b1c70b5d0ca733dccf3cb531a2fc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Y6OM45TEU3V2ARIDO6QMQDMM5S","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SofQhZvh4MtSgZ/1iaryuMIygWpcea96mY9Z8p+/hkXmQs68728wbSbhGKWX0raTr0rqm3B+KztVrSYogb4SBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:21:33.509077Z"},"content_sha256":"b1f671909fe87f0fd6f5d3f80fdd3b52597cdc719109e624b1f6d03da6c9a0de","schema_version":"1.0","event_id":"sha256:b1f671909fe87f0fd6f5d3f80fdd3b52597cdc719109e624b1f6d03da6c9a0de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S/bundle.json","state_url":"https://pith.science/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T09:21:33Z","links":{"resolver":"https://pith.science/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S","bundle":"https://pith.science/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S/bundle.json","state":"https://pith.science/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6OM45TEU3V2ARIDO6QMQDMM5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Y6OM45TEU3V2ARIDO6QMQDMM5S","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d4d4f2bb05c187c0fb944f9312a7e91a88d829ba5a2ce382a0fb03bef6c4e075","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-09-26T14:16:25Z","title_canon_sha256":"5dde8990f976ad193752557a33e4f69663badea39d2cbb4ded3fa7f10c519335"},"schema_version":"1.0","source":{"id":"1509.07985","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07985","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07985v2","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07985","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"Y6OM45TEU3V2","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y6OM45TEU3V2ARID","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y6OM45TE","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:b1f671909fe87f0fd6f5d3f80fdd3b52597cdc719109e624b1f6d03da6c9a0de","target":"graph","created_at":"2026-05-18T00:33:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"F. Louzada, L. Martino","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-09-26T14:16:25Z","title":"Adaptive Rejection Sampling with fixed number of nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07985","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:611a44c8dbf5e091b65efcfee107cfa9933b1c70b5d0ca733dccf3cb531a2fc5","target":"record","created_at":"2026-05-18T00:33:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d4d4f2bb05c187c0fb944f9312a7e91a88d829ba5a2ce382a0fb03bef6c4e075","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-09-26T14:16:25Z","title_canon_sha256":"5dde8990f976ad193752557a33e4f69663badea39d2cbb4ded3fa7f10c519335"},"schema_version":"1.0","source":{"id":"1509.07985","kind":"arxiv","version":2}},"canonical_sha256":"c79cce7664a6eba0450377a0c80d8cecaf6928c39c9b911b13ebb81b353531b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c79cce7664a6eba0450377a0c80d8cecaf6928c39c9b911b13ebb81b353531b2","first_computed_at":"2026-05-18T00:33:32.726825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:32.726825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FNBjl6TX/V5m5XC7M3blc9vvfCVxtdT856ls5DGdte9dIvUuMWLYeAGnWzhYboE2Zu2QvQJ88mIQxDKYcYEACg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:32.727456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07985","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:611a44c8dbf5e091b65efcfee107cfa9933b1c70b5d0ca733dccf3cb531a2fc5","sha256:b1f671909fe87f0fd6f5d3f80fdd3b52597cdc719109e624b1f6d03da6c9a0de"],"state_sha256":"a3186b5cf88737a0b9ba4500fbae16f29c3ce89aa4072bcbdfceaa7b40a12e89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3vNP6YTKzWR34isI1QvMbdYRJ37EU3fvaB02UoXYVwrDUGc5mm7satMcKH6UBCggQKiHLnNviPVEfDOB7eCAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T09:21:33.510941Z","bundle_sha256":"7044238a9dd9f2d08a1293ae8fc4bd49a4e80997bed993950627a216294457e7"}}