{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:D377ERVSSMPCUUFNVF4FQPQVGX","short_pith_number":"pith:D377ERVS","canonical_record":{"source":{"id":"1110.3856","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-18T00:22:40Z","cross_cats_sorted":[],"title_canon_sha256":"d4db793be0af62fa52b461d36a818ac9a7d9cf6b925157028233861ba9e4fb82","abstract_canon_sha256":"e8204022b6fc22eeb17ee48d83cc7e525f2fc9134c23779f6380023272ac443d"},"schema_version":"1.0"},"canonical_sha256":"1efff246b2931e2a50ada978583e1535f16f13f3429a8abbe7e074308a95c0d5","source":{"kind":"arxiv","id":"1110.3856","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3856","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3856v7","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3856","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"D377ERVSSMPC","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"D377ERVSSMPCUUFN","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"D377ERVS","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:D377ERVSSMPCUUFNVF4FQPQVGX","target":"record","payload":{"canonical_record":{"source":{"id":"1110.3856","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-18T00:22:40Z","cross_cats_sorted":[],"title_canon_sha256":"d4db793be0af62fa52b461d36a818ac9a7d9cf6b925157028233861ba9e4fb82","abstract_canon_sha256":"e8204022b6fc22eeb17ee48d83cc7e525f2fc9134c23779f6380023272ac443d"},"schema_version":"1.0"},"canonical_sha256":"1efff246b2931e2a50ada978583e1535f16f13f3429a8abbe7e074308a95c0d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:11.300557Z","signature_b64":"kq3zRyL5U3b3WCz764Diqr1kDS0CJXiRAYejWkp276fntcPo5vZqa4HbeJR2oUPqD9xH2LmmjNTlvBjFyyz3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1efff246b2931e2a50ada978583e1535f16f13f3429a8abbe7e074308a95c0d5","last_reissued_at":"2026-05-18T01:26:11.300058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:11.300058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.3856","source_version":7,"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-18T01:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kx3m4Lk4TOef9wnKzt7WX7LboADHCxJsaDPKYLPKzDOMD+htbhZv3Vg1GyLIMeNkYjk7Na6WWrcsExF5GvwgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:34:26.027806Z"},"content_sha256":"04a0560725e8bdd97b5746dbede2315ab43c34325b7153baba68c8598b365bf5","schema_version":"1.0","event_id":"sha256:04a0560725e8bdd97b5746dbede2315ab43c34325b7153baba68c8598b365bf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:D377ERVSSMPCUUFNVF4FQPQVGX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Richard Arratia, Stephen DeSalvo","submitted_at":"2011-10-18T00:22:40Z","abstract_excerpt":"We propose a new method, probabilistic divide-and-conquer, for improving the success probability in rejection sampling. For the example of integer partitions, there is an ideal recursive scheme which improves the rejection cost from asymptotically order $n^{3/4}$ to a constant. We show other examples for which a non--recursive, one--time application of probabilistic divide-and-conquer removes a substantial fraction of the rejection sampling cost.\n  We also present a variation of probabilistic divide-and-conquer for generating i.i.d. samples that exploits features of the coupon collector's prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3856","kind":"arxiv","version":7},"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-18T01:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UqXZdyybVzJ2W5+kybiLUTlSu46APgQUt0Tn8lVQbbLDiQ/r052FgGZ/MvmLU4cgzltm/dXbFkRYWnESLxTYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:34:26.028154Z"},"content_sha256":"b230f66287b41b1e9818de6a2f553329a9f5a44f392cc1d00f440f230745c7a1","schema_version":"1.0","event_id":"sha256:b230f66287b41b1e9818de6a2f553329a9f5a44f392cc1d00f440f230745c7a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D377ERVSSMPCUUFNVF4FQPQVGX/bundle.json","state_url":"https://pith.science/pith/D377ERVSSMPCUUFNVF4FQPQVGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D377ERVSSMPCUUFNVF4FQPQVGX/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-24T06:34:26Z","links":{"resolver":"https://pith.science/pith/D377ERVSSMPCUUFNVF4FQPQVGX","bundle":"https://pith.science/pith/D377ERVSSMPCUUFNVF4FQPQVGX/bundle.json","state":"https://pith.science/pith/D377ERVSSMPCUUFNVF4FQPQVGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D377ERVSSMPCUUFNVF4FQPQVGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:D377ERVSSMPCUUFNVF4FQPQVGX","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":"e8204022b6fc22eeb17ee48d83cc7e525f2fc9134c23779f6380023272ac443d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-18T00:22:40Z","title_canon_sha256":"d4db793be0af62fa52b461d36a818ac9a7d9cf6b925157028233861ba9e4fb82"},"schema_version":"1.0","source":{"id":"1110.3856","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3856","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3856v7","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3856","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"D377ERVSSMPC","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"D377ERVSSMPCUUFN","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"D377ERVS","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:b230f66287b41b1e9818de6a2f553329a9f5a44f392cc1d00f440f230745c7a1","target":"graph","created_at":"2026-05-18T01:26:11Z","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":"We propose a new method, probabilistic divide-and-conquer, for improving the success probability in rejection sampling. For the example of integer partitions, there is an ideal recursive scheme which improves the rejection cost from asymptotically order $n^{3/4}$ to a constant. We show other examples for which a non--recursive, one--time application of probabilistic divide-and-conquer removes a substantial fraction of the rejection sampling cost.\n  We also present a variation of probabilistic divide-and-conquer for generating i.i.d. samples that exploits features of the coupon collector's prob","authors_text":"Richard Arratia, Stephen DeSalvo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-18T00:22:40Z","title":"Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3856","kind":"arxiv","version":7},"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:04a0560725e8bdd97b5746dbede2315ab43c34325b7153baba68c8598b365bf5","target":"record","created_at":"2026-05-18T01:26:11Z","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":"e8204022b6fc22eeb17ee48d83cc7e525f2fc9134c23779f6380023272ac443d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-18T00:22:40Z","title_canon_sha256":"d4db793be0af62fa52b461d36a818ac9a7d9cf6b925157028233861ba9e4fb82"},"schema_version":"1.0","source":{"id":"1110.3856","kind":"arxiv","version":7}},"canonical_sha256":"1efff246b2931e2a50ada978583e1535f16f13f3429a8abbe7e074308a95c0d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1efff246b2931e2a50ada978583e1535f16f13f3429a8abbe7e074308a95c0d5","first_computed_at":"2026-05-18T01:26:11.300058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:11.300058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kq3zRyL5U3b3WCz764Diqr1kDS0CJXiRAYejWkp276fntcPo5vZqa4HbeJR2oUPqD9xH2LmmjNTlvBjFyyz3Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:11.300557Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.3856","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04a0560725e8bdd97b5746dbede2315ab43c34325b7153baba68c8598b365bf5","sha256:b230f66287b41b1e9818de6a2f553329a9f5a44f392cc1d00f440f230745c7a1"],"state_sha256":"ed3d15ab2eeebb3e95c23a810065eed0fab24ebb1851360f7ba3458a784f6fd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sRzkKbfFKIZUks6WC1g7Fl/S3EXxkBRohFYBXP7w51ZRO1AIjuDet3t/4TEJCwTMwwqmdCejNCB4iIMmkJxoCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:34:26.030137Z","bundle_sha256":"0fbc8963ac2b1d80d5c5bf26dc3a190e3538da56ec88a6d30b8e17c6dee113fd"}}