{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SGX6H5XGD2MW4XRU62ZUOWQHFQ","short_pith_number":"pith:SGX6H5XG","canonical_record":{"source":{"id":"1412.2192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-06T02:00:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59b7e7f1c517554b5b6a8ac79b3475366795862673ac278a8912ae78fcd9056c","abstract_canon_sha256":"c706b044d75772bfdeb4f08c9dbc388a9ce1830120bae358ce4401d37cdb4fd0"},"schema_version":"1.0"},"canonical_sha256":"91afe3f6e61e996e5e34f6b3475a072c0203665613698cf031f56456a234acc3","source":{"kind":"arxiv","id":"1412.2192","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2192","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2192v1","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2192","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"SGX6H5XGD2MW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SGX6H5XGD2MW4XRU","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SGX6H5XG","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SGX6H5XGD2MW4XRU62ZUOWQHFQ","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-06T02:00:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59b7e7f1c517554b5b6a8ac79b3475366795862673ac278a8912ae78fcd9056c","abstract_canon_sha256":"c706b044d75772bfdeb4f08c9dbc388a9ce1830120bae358ce4401d37cdb4fd0"},"schema_version":"1.0"},"canonical_sha256":"91afe3f6e61e996e5e34f6b3475a072c0203665613698cf031f56456a234acc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:04.526902Z","signature_b64":"Kkuj3r6UHnqbhW5kmniaHSl82eJtvwV3ZDXmyQB0OAXSLo5Yxo0C7GfC4hu/RRkZa81ondlC2pGBnoh+e8IqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91afe3f6e61e996e5e34f6b3475a072c0203665613698cf031f56456a234acc3","last_reissued_at":"2026-05-18T02:25:04.526550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:04.526550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2192","source_version":1,"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-18T02:25:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DRvsLciUaD2EU8/mS1b5jrNOXMDZ0abF9drZG7eRpb38X3RKdefsP8RPg9vMLD8MWUWjY1x2FPufwvN4OAf0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:10:36.566861Z"},"content_sha256":"c0c2da5c8aa6d524889f402294b48901cc9f6a89c3e1e0d6b97b30dfd002cbef","schema_version":"1.0","event_id":"sha256:c0c2da5c8aa6d524889f402294b48901cc9f6a89c3e1e0d6b97b30dfd002cbef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SGX6H5XGD2MW4XRU62ZUOWQHFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal algorithms for universal random number generation from finite memory sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gadiel Seroussi, Marcelo J. Weinberger","submitted_at":"2014-12-06T02:00:52Z","abstract_excerpt":"We study random number generators (RNGs), both in the fixed to variable-length (FVR) and the variable to fixed-length (VFR) regimes, in a universal setting in which the input is a finite memory source of arbitrary order and unknown parameters, with arbitrary input and output (finite) alphabet sizes. Applying the method of types, we characterize essentially unique optimal universal RNGs that maximize the expected output (respectively, minimize the expected input) length in the FVR (respectively, VFR) case. For the FVR case, the RNG studied is a generalization of Elias's scheme, while in the VFR"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2192","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"},"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-18T02:25:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fj7bzI+GzFXN1pSkkKHc2ODW4y4cjjFFatHS4JPN43lYDIDi3gfJHtAYtaY8JUTUTGycI6huZy6TIEPvbcU8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:10:36.567336Z"},"content_sha256":"a43243e742a45033cfb8e6b5b9f0fd559e5aec86ba717760f735384f1cd7e9ca","schema_version":"1.0","event_id":"sha256:a43243e742a45033cfb8e6b5b9f0fd559e5aec86ba717760f735384f1cd7e9ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGX6H5XGD2MW4XRU62ZUOWQHFQ/bundle.json","state_url":"https://pith.science/pith/SGX6H5XGD2MW4XRU62ZUOWQHFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGX6H5XGD2MW4XRU62ZUOWQHFQ/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-24T22:10:36Z","links":{"resolver":"https://pith.science/pith/SGX6H5XGD2MW4XRU62ZUOWQHFQ","bundle":"https://pith.science/pith/SGX6H5XGD2MW4XRU62ZUOWQHFQ/bundle.json","state":"https://pith.science/pith/SGX6H5XGD2MW4XRU62ZUOWQHFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGX6H5XGD2MW4XRU62ZUOWQHFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SGX6H5XGD2MW4XRU62ZUOWQHFQ","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":"c706b044d75772bfdeb4f08c9dbc388a9ce1830120bae358ce4401d37cdb4fd0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-06T02:00:52Z","title_canon_sha256":"59b7e7f1c517554b5b6a8ac79b3475366795862673ac278a8912ae78fcd9056c"},"schema_version":"1.0","source":{"id":"1412.2192","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2192","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2192v1","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2192","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"SGX6H5XGD2MW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SGX6H5XGD2MW4XRU","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SGX6H5XG","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:a43243e742a45033cfb8e6b5b9f0fd559e5aec86ba717760f735384f1cd7e9ca","target":"graph","created_at":"2026-05-18T02:25:04Z","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 study random number generators (RNGs), both in the fixed to variable-length (FVR) and the variable to fixed-length (VFR) regimes, in a universal setting in which the input is a finite memory source of arbitrary order and unknown parameters, with arbitrary input and output (finite) alphabet sizes. Applying the method of types, we characterize essentially unique optimal universal RNGs that maximize the expected output (respectively, minimize the expected input) length in the FVR (respectively, VFR) case. For the FVR case, the RNG studied is a generalization of Elias's scheme, while in the VFR","authors_text":"Gadiel Seroussi, Marcelo J. Weinberger","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-06T02:00:52Z","title":"Optimal algorithms for universal random number generation from finite memory sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2192","kind":"arxiv","version":1},"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:c0c2da5c8aa6d524889f402294b48901cc9f6a89c3e1e0d6b97b30dfd002cbef","target":"record","created_at":"2026-05-18T02:25:04Z","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":"c706b044d75772bfdeb4f08c9dbc388a9ce1830120bae358ce4401d37cdb4fd0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-06T02:00:52Z","title_canon_sha256":"59b7e7f1c517554b5b6a8ac79b3475366795862673ac278a8912ae78fcd9056c"},"schema_version":"1.0","source":{"id":"1412.2192","kind":"arxiv","version":1}},"canonical_sha256":"91afe3f6e61e996e5e34f6b3475a072c0203665613698cf031f56456a234acc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91afe3f6e61e996e5e34f6b3475a072c0203665613698cf031f56456a234acc3","first_computed_at":"2026-05-18T02:25:04.526550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:04.526550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kkuj3r6UHnqbhW5kmniaHSl82eJtvwV3ZDXmyQB0OAXSLo5Yxo0C7GfC4hu/RRkZa81ondlC2pGBnoh+e8IqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:04.526902Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2192","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0c2da5c8aa6d524889f402294b48901cc9f6a89c3e1e0d6b97b30dfd002cbef","sha256:a43243e742a45033cfb8e6b5b9f0fd559e5aec86ba717760f735384f1cd7e9ca"],"state_sha256":"3501c6509339b2aaabcd8967df1538fcaf33b0b0d2819ed8f95ef45e5be5766f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jO+FNMn6Vn4JHp46coNQmuIrTFwk9HYvyayUJwpA9pRrIAvJKSPJvtTcAhfSopgG/MC4yiN4+j1DEtqhD5ExAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:10:36.569839Z","bundle_sha256":"6cf6c5f6f43c7f0c2f97ad49ac1ba3c77dbd2abfffe9584b428c45a26f8ea2b4"}}