{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FSEGGE4TEHIGDIRJ2TYNYSWUU2","short_pith_number":"pith:FSEGGE4T","canonical_record":{"source":{"id":"1810.02227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-04T14:08:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ac9c45e00c3ca084f52a3bbdd4fc1a8fdf6db0600f4492a48fda9cfd67dcf32b","abstract_canon_sha256":"1bc6178cb58cdbe1ae043dc137c5a65187f5b1c6fa232fd0fd91ebac91f7078f"},"schema_version":"1.0"},"canonical_sha256":"2c8863139321d061a229d4f0dc4ad4a6bb791734d1d4278285f7d26f1a7ede57","source":{"kind":"arxiv","id":"1810.02227","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02227","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02227v1","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02227","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"FSEGGE4TEHIG","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FSEGGE4TEHIGDIRJ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FSEGGE4T","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FSEGGE4TEHIGDIRJ2TYNYSWUU2","target":"record","payload":{"canonical_record":{"source":{"id":"1810.02227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-04T14:08:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ac9c45e00c3ca084f52a3bbdd4fc1a8fdf6db0600f4492a48fda9cfd67dcf32b","abstract_canon_sha256":"1bc6178cb58cdbe1ae043dc137c5a65187f5b1c6fa232fd0fd91ebac91f7078f"},"schema_version":"1.0"},"canonical_sha256":"2c8863139321d061a229d4f0dc4ad4a6bb791734d1d4278285f7d26f1a7ede57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:05.875290Z","signature_b64":"H8PSoOo9uF+9R4diNBHzKQvAaS5lmtcVRYn9FmWFlvn1q4FKtg/6WYCIMTSAxWFJhcJpeVtco6x7KIuEg0wqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c8863139321d061a229d4f0dc4ad4a6bb791734d1d4278285f7d26f1a7ede57","last_reissued_at":"2026-05-18T00:04:05.874539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:05.874539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.02227","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-18T00:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owFGRKSA3ZXg0wC6D5wTWoYFORN/VNgAQUCsINqlKVJ/um2O7vUUl3v4PRbJrtjF4ptXmJ8/3PFeWOb52uqvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:33:22.598054Z"},"content_sha256":"ac54212903b3fc5d55f2bc5fd5136c15fdff922a40ca5e562f7fd4ded6c13bb2","schema_version":"1.0","event_id":"sha256:ac54212903b3fc5d55f2bc5fd5136c15fdff922a40ca5e562f7fd4ded6c13bb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FSEGGE4TEHIGDIRJ2TYNYSWUU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randen - fast backtracking-resistant random generator with AES+Feistel+Reverie","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Emmanuel Mogenet, Jan Wassenberg, Jyrki Alakuijala, Robert Obryk","submitted_at":"2018-10-04T14:08:57Z","abstract_excerpt":"Algorithms that rely on a pseudorandom number generator often lose their performance guarantees when adversaries can predict the behavior of the generator. To protect non-cryptographic applications against such attacks, we propose 'strong' pseudorandom generators characterized by two properties: computationally indistinguishable from random and backtracking-resistant. Some existing cryptographically secure generators also meet these criteria, but they are too slow to be accepted for general-purpose use. We introduce a new open-sourced generator called 'Randen' and show that it is 'strong' in a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02227","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-18T00:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MWQjY/KAPHzdrEUHq5BnjUaGZQmqlpT8GaNU0XItzVgymhp7MkyHGSjEAQFovYRhgv2dqJ75sK56DvDYgRPsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:33:22.598834Z"},"content_sha256":"7a33053af6ac185d36fad60fd2911c4694c2041cb1c6e27034f88f743bfc69b7","schema_version":"1.0","event_id":"sha256:7a33053af6ac185d36fad60fd2911c4694c2041cb1c6e27034f88f743bfc69b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2/bundle.json","state_url":"https://pith.science/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2/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-01T02:33:22Z","links":{"resolver":"https://pith.science/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2","bundle":"https://pith.science/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2/bundle.json","state":"https://pith.science/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FSEGGE4TEHIGDIRJ2TYNYSWUU2","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":"1bc6178cb58cdbe1ae043dc137c5a65187f5b1c6fa232fd0fd91ebac91f7078f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-04T14:08:57Z","title_canon_sha256":"ac9c45e00c3ca084f52a3bbdd4fc1a8fdf6db0600f4492a48fda9cfd67dcf32b"},"schema_version":"1.0","source":{"id":"1810.02227","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02227","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02227v1","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02227","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"FSEGGE4TEHIG","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FSEGGE4TEHIGDIRJ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FSEGGE4T","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:7a33053af6ac185d36fad60fd2911c4694c2041cb1c6e27034f88f743bfc69b7","target":"graph","created_at":"2026-05-18T00:04:05Z","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":"Algorithms that rely on a pseudorandom number generator often lose their performance guarantees when adversaries can predict the behavior of the generator. To protect non-cryptographic applications against such attacks, we propose 'strong' pseudorandom generators characterized by two properties: computationally indistinguishable from random and backtracking-resistant. Some existing cryptographically secure generators also meet these criteria, but they are too slow to be accepted for general-purpose use. We introduce a new open-sourced generator called 'Randen' and show that it is 'strong' in a","authors_text":"Emmanuel Mogenet, Jan Wassenberg, Jyrki Alakuijala, Robert Obryk","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-04T14:08:57Z","title":"Randen - fast backtracking-resistant random generator with AES+Feistel+Reverie"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02227","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:ac54212903b3fc5d55f2bc5fd5136c15fdff922a40ca5e562f7fd4ded6c13bb2","target":"record","created_at":"2026-05-18T00:04:05Z","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":"1bc6178cb58cdbe1ae043dc137c5a65187f5b1c6fa232fd0fd91ebac91f7078f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-04T14:08:57Z","title_canon_sha256":"ac9c45e00c3ca084f52a3bbdd4fc1a8fdf6db0600f4492a48fda9cfd67dcf32b"},"schema_version":"1.0","source":{"id":"1810.02227","kind":"arxiv","version":1}},"canonical_sha256":"2c8863139321d061a229d4f0dc4ad4a6bb791734d1d4278285f7d26f1a7ede57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c8863139321d061a229d4f0dc4ad4a6bb791734d1d4278285f7d26f1a7ede57","first_computed_at":"2026-05-18T00:04:05.874539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:05.874539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H8PSoOo9uF+9R4diNBHzKQvAaS5lmtcVRYn9FmWFlvn1q4FKtg/6WYCIMTSAxWFJhcJpeVtco6x7KIuEg0wqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:05.875290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02227","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac54212903b3fc5d55f2bc5fd5136c15fdff922a40ca5e562f7fd4ded6c13bb2","sha256:7a33053af6ac185d36fad60fd2911c4694c2041cb1c6e27034f88f743bfc69b7"],"state_sha256":"a3145c53180f8be5cefabfea2f912e063b44b0510b6cd6036a51099b6d2942df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P4JWpxHz7MuBbDZrqAiT/9xZ+ZRjn2Dgdh5/CRoggmXdcsJHmUrCAovHNTJRZcw6HEaylkHI/Nkj4g/9eRnFDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:33:22.602978Z","bundle_sha256":"2e36667e120d9b7bf8b066492c49bac73dc4ccce8d9d3572ca4b1aa962d7317a"}}