{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2GSNXR4LEFHGQVPOQWVTPKOU43","short_pith_number":"pith:2GSNXR4L","canonical_record":{"source":{"id":"1209.0732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-04T18:57:30Z","cross_cats_sorted":["cs.CR","math.IT","math.PR"],"title_canon_sha256":"b9906faf8b7b47195b6fa98bb223738f7815e8f6a3800be3da8e4e4826ed29f1","abstract_canon_sha256":"8b20aa6dbf36273ba2c2ebf4508f5779d1a846c666bf2d48900d1d7323195373"},"schema_version":"1.0"},"canonical_sha256":"d1a4dbc78b214e6855ee85ab37a9d4e6f64e560d8bbe7e297888b48c5d3388fb","source":{"kind":"arxiv","id":"1209.0732","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0732","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0732v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0732","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"2GSNXR4LEFHG","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2GSNXR4LEFHGQVPO","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2GSNXR4L","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2GSNXR4LEFHGQVPOQWVTPKOU43","target":"record","payload":{"canonical_record":{"source":{"id":"1209.0732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-04T18:57:30Z","cross_cats_sorted":["cs.CR","math.IT","math.PR"],"title_canon_sha256":"b9906faf8b7b47195b6fa98bb223738f7815e8f6a3800be3da8e4e4826ed29f1","abstract_canon_sha256":"8b20aa6dbf36273ba2c2ebf4508f5779d1a846c666bf2d48900d1d7323195373"},"schema_version":"1.0"},"canonical_sha256":"d1a4dbc78b214e6855ee85ab37a9d4e6f64e560d8bbe7e297888b48c5d3388fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:17.366294Z","signature_b64":"UzGs/7px0zYLk+jcJFeeLyRFmVIlxAbNSiKGLdCkNFpL+kDwBODrRq/R8b1Hbbc3kyIQCW0my1bTITV+EJ3qBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1a4dbc78b214e6855ee85ab37a9d4e6f64e560d8bbe7e297888b48c5d3388fb","last_reissued_at":"2026-05-18T03:46:17.365684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:17.365684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.0732","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-18T03:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j7NV7JMXtBGQOfAGFGfm32FsEmMJg0RTvoC6sYYkj/1qD7PpTUiRG3CmW7gdkpbqay8snDqCrtuDlOdurigXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:17:06.067948Z"},"content_sha256":"5bb8704c2cbbe201b5b320536958375afc2472043f90835ad48b4c77a4aa46aa","schema_version":"1.0","event_id":"sha256:5bb8704c2cbbe201b5b320536958375afc2472043f90835ad48b4c77a4aa46aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2GSNXR4LEFHGQVPOQWVTPKOU43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Transformations for Randomness Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Hongchao Zhou, Jehoshua Bruck","submitted_at":"2012-09-04T18:57:30Z","abstract_excerpt":"Information-efficient approaches for extracting randomness from imperfect sources have been extensively studied, but simpler and faster ones are required in the high-speed applications of random number generation. In this paper, we focus on linear constructions, namely, applying linear transformation for randomness extraction. We show that linear transformations based on sparse random matrices are asymptotically optimal to extract randomness from independent sources and bit-fixing sources, and they are efficient (may not be optimal) to extract randomness from hidden Markov sources. Further stu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0732","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-18T03:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H7E2LsaKcYFEQ7u0dk0l9+Scokx+QPX88ZcDuUTtV36GJ8ZcGgt8vecbFtG66bKsnB5xjGxKlhJIsXqVF0uOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:17:06.068299Z"},"content_sha256":"1748efb99e07990c6a6b77a981f0e7301db953127041cfce71c346965a07dfc1","schema_version":"1.0","event_id":"sha256:1748efb99e07990c6a6b77a981f0e7301db953127041cfce71c346965a07dfc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2GSNXR4LEFHGQVPOQWVTPKOU43/bundle.json","state_url":"https://pith.science/pith/2GSNXR4LEFHGQVPOQWVTPKOU43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2GSNXR4LEFHGQVPOQWVTPKOU43/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-22T13:17:06Z","links":{"resolver":"https://pith.science/pith/2GSNXR4LEFHGQVPOQWVTPKOU43","bundle":"https://pith.science/pith/2GSNXR4LEFHGQVPOQWVTPKOU43/bundle.json","state":"https://pith.science/pith/2GSNXR4LEFHGQVPOQWVTPKOU43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2GSNXR4LEFHGQVPOQWVTPKOU43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2GSNXR4LEFHGQVPOQWVTPKOU43","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":"8b20aa6dbf36273ba2c2ebf4508f5779d1a846c666bf2d48900d1d7323195373","cross_cats_sorted":["cs.CR","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-04T18:57:30Z","title_canon_sha256":"b9906faf8b7b47195b6fa98bb223738f7815e8f6a3800be3da8e4e4826ed29f1"},"schema_version":"1.0","source":{"id":"1209.0732","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0732","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0732v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0732","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"2GSNXR4LEFHG","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2GSNXR4LEFHGQVPO","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2GSNXR4L","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:1748efb99e07990c6a6b77a981f0e7301db953127041cfce71c346965a07dfc1","target":"graph","created_at":"2026-05-18T03:46:17Z","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":"Information-efficient approaches for extracting randomness from imperfect sources have been extensively studied, but simpler and faster ones are required in the high-speed applications of random number generation. In this paper, we focus on linear constructions, namely, applying linear transformation for randomness extraction. We show that linear transformations based on sparse random matrices are asymptotically optimal to extract randomness from independent sources and bit-fixing sources, and they are efficient (may not be optimal) to extract randomness from hidden Markov sources. Further stu","authors_text":"Hongchao Zhou, Jehoshua Bruck","cross_cats":["cs.CR","math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-04T18:57:30Z","title":"Linear Transformations for Randomness Extraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0732","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:5bb8704c2cbbe201b5b320536958375afc2472043f90835ad48b4c77a4aa46aa","target":"record","created_at":"2026-05-18T03:46:17Z","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":"8b20aa6dbf36273ba2c2ebf4508f5779d1a846c666bf2d48900d1d7323195373","cross_cats_sorted":["cs.CR","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-04T18:57:30Z","title_canon_sha256":"b9906faf8b7b47195b6fa98bb223738f7815e8f6a3800be3da8e4e4826ed29f1"},"schema_version":"1.0","source":{"id":"1209.0732","kind":"arxiv","version":1}},"canonical_sha256":"d1a4dbc78b214e6855ee85ab37a9d4e6f64e560d8bbe7e297888b48c5d3388fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1a4dbc78b214e6855ee85ab37a9d4e6f64e560d8bbe7e297888b48c5d3388fb","first_computed_at":"2026-05-18T03:46:17.365684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:17.365684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UzGs/7px0zYLk+jcJFeeLyRFmVIlxAbNSiKGLdCkNFpL+kDwBODrRq/R8b1Hbbc3kyIQCW0my1bTITV+EJ3qBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:17.366294Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0732","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bb8704c2cbbe201b5b320536958375afc2472043f90835ad48b4c77a4aa46aa","sha256:1748efb99e07990c6a6b77a981f0e7301db953127041cfce71c346965a07dfc1"],"state_sha256":"62ad350d22fbc7af5814171b0f81dabcecb6c02f8e692fc8ce86ef8a320bdcce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xi1bNwAA+UYaN4E1aQqga5YccmxBxN/8XQb/jgG9/dFpFyz6QJClJsLOGxxSV3T02atgpw+dYNBv25puEuTiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:17:06.070328Z","bundle_sha256":"031161c54e3f29aecbdf1023fd28f8e06e8a9a88edce6bddb31bb2c36888b9e7"}}