{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:X2HRVNIWQUFK2ZHIEI2RQINPEN","short_pith_number":"pith:X2HRVNIW","canonical_record":{"source":{"id":"1608.05930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-08-21T12:45:43Z","cross_cats_sorted":["cs.AR","math.DS","nlin.CD"],"title_canon_sha256":"74777703b294ae749e8fc09a4b84cef2e36bb634a5644fada938b41bfd2d2c8a","abstract_canon_sha256":"c8e75c6ee5efa32e5edf195e4d51b6c6e3d15028ec8d127add12e8e79d427d37"},"schema_version":"1.0"},"canonical_sha256":"be8f1ab516850aad64e822351821af23644a15137c8af83ccb59218f461aa0e8","source":{"kind":"arxiv","id":"1608.05930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05930","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05930v1","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05930","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"X2HRVNIWQUFK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X2HRVNIWQUFK2ZHI","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X2HRVNIW","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:X2HRVNIWQUFK2ZHIEI2RQINPEN","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-08-21T12:45:43Z","cross_cats_sorted":["cs.AR","math.DS","nlin.CD"],"title_canon_sha256":"74777703b294ae749e8fc09a4b84cef2e36bb634a5644fada938b41bfd2d2c8a","abstract_canon_sha256":"c8e75c6ee5efa32e5edf195e4d51b6c6e3d15028ec8d127add12e8e79d427d37"},"schema_version":"1.0"},"canonical_sha256":"be8f1ab516850aad64e822351821af23644a15137c8af83ccb59218f461aa0e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:22.781697Z","signature_b64":"K/IBOu5eMtKjYddbXM0i+Jwv3rXQeyNp0UXVrX4G6AYMsSecNlx0C6LVKZwu6n2W15L1Tw7kg2UoUNULFq/bCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be8f1ab516850aad64e822351821af23644a15137c8af83ccb59218f461aa0e8","last_reissued_at":"2026-05-18T01:08:22.781037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:22.781037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05930","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-18T01:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DQvUpwcKozGMuLSWVYuITwoAExCcQmKKnsQMIWctzFlIdXMPCjtaB+Df7Nc3yr7Bvq5ZagyHk92o+lj+Cy23BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:49:23.840713Z"},"content_sha256":"13831ea7b4685aab3cce6c9dca7ba0b7cc8733568164f617cd1f39ad71622963","schema_version":"1.0","event_id":"sha256:13831ea7b4685aab3cce6c9dca7ba0b7cc8733568164f617cd1f39ad71622963"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:X2HRVNIWQUFK2ZHIEI2RQINPEN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FPGA Design for Pseudorandom Number Generator Based on Chaotic Iteration used in Information Hiding Application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","math.DS","nlin.CD"],"primary_cat":"cs.CR","authors_text":"Christophe Guyeux, Jacques M. Bahi, Laurent Larger, Xiaole Fang","submitted_at":"2016-08-21T12:45:43Z","abstract_excerpt":"Lots of researches indicate that the inefficient generation of random numbers is a significant bottleneck for information communication applications. Therefore, Field Programmable Gate Array (FPGA) is developed to process a scalable fixed-point method for random streams generation. In our previous researches, we have proposed a technique by applying some well-defined discrete chaotic iterations that satisfy the reputed Devaney's definition of chaos, namely chaotic iterations (CI). We have formerly proven that the generator with CI can provide qualified chaotic random numbers. In this paper, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05930","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-18T01:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"trRUbEHflFqiRIqvHdQPpZJhFQiYZmPAQk3zzN685vt7pziFYlqFn4Y/uH8zs20CCaPWyAGCv/VuURBYBa9kCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:49:23.841419Z"},"content_sha256":"d665ac8a245f073e1b7ff279a73247e41fe267d73ed5162d9027fa89dfc31c6d","schema_version":"1.0","event_id":"sha256:d665ac8a245f073e1b7ff279a73247e41fe267d73ed5162d9027fa89dfc31c6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X2HRVNIWQUFK2ZHIEI2RQINPEN/bundle.json","state_url":"https://pith.science/pith/X2HRVNIWQUFK2ZHIEI2RQINPEN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X2HRVNIWQUFK2ZHIEI2RQINPEN/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-05-31T05:49:23Z","links":{"resolver":"https://pith.science/pith/X2HRVNIWQUFK2ZHIEI2RQINPEN","bundle":"https://pith.science/pith/X2HRVNIWQUFK2ZHIEI2RQINPEN/bundle.json","state":"https://pith.science/pith/X2HRVNIWQUFK2ZHIEI2RQINPEN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X2HRVNIWQUFK2ZHIEI2RQINPEN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:X2HRVNIWQUFK2ZHIEI2RQINPEN","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":"c8e75c6ee5efa32e5edf195e4d51b6c6e3d15028ec8d127add12e8e79d427d37","cross_cats_sorted":["cs.AR","math.DS","nlin.CD"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-08-21T12:45:43Z","title_canon_sha256":"74777703b294ae749e8fc09a4b84cef2e36bb634a5644fada938b41bfd2d2c8a"},"schema_version":"1.0","source":{"id":"1608.05930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05930","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05930v1","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05930","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"X2HRVNIWQUFK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X2HRVNIWQUFK2ZHI","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X2HRVNIW","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:d665ac8a245f073e1b7ff279a73247e41fe267d73ed5162d9027fa89dfc31c6d","target":"graph","created_at":"2026-05-18T01:08:22Z","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":"Lots of researches indicate that the inefficient generation of random numbers is a significant bottleneck for information communication applications. Therefore, Field Programmable Gate Array (FPGA) is developed to process a scalable fixed-point method for random streams generation. In our previous researches, we have proposed a technique by applying some well-defined discrete chaotic iterations that satisfy the reputed Devaney's definition of chaos, namely chaotic iterations (CI). We have formerly proven that the generator with CI can provide qualified chaotic random numbers. In this paper, th","authors_text":"Christophe Guyeux, Jacques M. Bahi, Laurent Larger, Xiaole Fang","cross_cats":["cs.AR","math.DS","nlin.CD"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-08-21T12:45:43Z","title":"FPGA Design for Pseudorandom Number Generator Based on Chaotic Iteration used in Information Hiding Application"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05930","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:13831ea7b4685aab3cce6c9dca7ba0b7cc8733568164f617cd1f39ad71622963","target":"record","created_at":"2026-05-18T01:08:22Z","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":"c8e75c6ee5efa32e5edf195e4d51b6c6e3d15028ec8d127add12e8e79d427d37","cross_cats_sorted":["cs.AR","math.DS","nlin.CD"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-08-21T12:45:43Z","title_canon_sha256":"74777703b294ae749e8fc09a4b84cef2e36bb634a5644fada938b41bfd2d2c8a"},"schema_version":"1.0","source":{"id":"1608.05930","kind":"arxiv","version":1}},"canonical_sha256":"be8f1ab516850aad64e822351821af23644a15137c8af83ccb59218f461aa0e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be8f1ab516850aad64e822351821af23644a15137c8af83ccb59218f461aa0e8","first_computed_at":"2026-05-18T01:08:22.781037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:22.781037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K/IBOu5eMtKjYddbXM0i+Jwv3rXQeyNp0UXVrX4G6AYMsSecNlx0C6LVKZwu6n2W15L1Tw7kg2UoUNULFq/bCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:22.781697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13831ea7b4685aab3cce6c9dca7ba0b7cc8733568164f617cd1f39ad71622963","sha256:d665ac8a245f073e1b7ff279a73247e41fe267d73ed5162d9027fa89dfc31c6d"],"state_sha256":"41e8adfc1a4c1eaf82f1c046664ba4e8fb2e0c09c808b1d54b480a34764c6279"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kar2Lboqb8F/OwWd+BIYd4ZfJPfsoPYOejoa4lj3f8S4+/aMpu94dzw81h3L/sXka5mnLe5JAL8iDdKJ0XgtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:49:23.845123Z","bundle_sha256":"8ed8d02e1d4e77a2b25318a917c92be25c097e14f4d2d11895d4935c172f53f5"}}