{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5PCX4E5YMR2YYNRTPDOK4OZURH","short_pith_number":"pith:5PCX4E5Y","canonical_record":{"source":{"id":"1306.5596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-24T12:30:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c2df080b82e85322a08c9d5312ddf73e2b185156fa14ee7842ec3abe73e2505","abstract_canon_sha256":"cb34fc3802c4ac3df087db4cfee463431bb2e7cdd233eb27ddb7cb6204582385"},"schema_version":"1.0"},"canonical_sha256":"ebc57e13b864758c363378dcae3b3489fb53229c5a807a9c297ba1e439f8cf9b","source":{"kind":"arxiv","id":"1306.5596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5596","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5596v1","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5596","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"5PCX4E5YMR2Y","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5PCX4E5YMR2YYNRT","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5PCX4E5Y","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5PCX4E5YMR2YYNRTPDOK4OZURH","target":"record","payload":{"canonical_record":{"source":{"id":"1306.5596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-24T12:30:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c2df080b82e85322a08c9d5312ddf73e2b185156fa14ee7842ec3abe73e2505","abstract_canon_sha256":"cb34fc3802c4ac3df087db4cfee463431bb2e7cdd233eb27ddb7cb6204582385"},"schema_version":"1.0"},"canonical_sha256":"ebc57e13b864758c363378dcae3b3489fb53229c5a807a9c297ba1e439f8cf9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:07.472223Z","signature_b64":"JxK4ceh3nadHC31Eq23oMgi/rFt1QiPKdrhx+5iGIcK3MYrEsrzVOdPJIMxd2M3bl8tZbOx1Ac8MqwrGJFcsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebc57e13b864758c363378dcae3b3489fb53229c5a807a9c297ba1e439f8cf9b","last_reissued_at":"2026-05-18T03:20:07.471544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:07.471544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.5596","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:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wn48fWa8aYgnRooNzAhu4IwW7kfvN5zJHTfArZ4ZpnYZFneFpbEz4s4HitHAKnj6vfCPgIAdCXbBGp6awn8rCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T19:57:02.529030Z"},"content_sha256":"0f2c4e2084507c546744e3236c8251cac241390080a8abea07fefbd84f7c7391","schema_version":"1.0","event_id":"sha256:0f2c4e2084507c546744e3236c8251cac241390080a8abea07fefbd84f7c7391"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5PCX4E5YMR2YYNRTPDOK4OZURH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm for Constructing a Smallest Register with Non-Linear Update Generating a Given Binary Sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elena Dubrova, Nan Li","submitted_at":"2013-06-24T12:30:36Z","abstract_excerpt":"Registers with Non-Linear Update (RNLUs) are a generalization of Non-Linear Feedback Shift Registers (NLFSRs) in which both, feedback and feedforward, connections are allowed and no chain connection between the stages is required. In this paper, a new algorithm for constructing RNLUs generating a given binary sequence is presented. Expected size of RNLUs constructed by the presented algorithm is proved to be O(n/log(n/p)), where n is the sequence length and p is the degree of parallelization. This is asymptotically smaller than the expected size of RNLUs constructed by previous algorithms and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5596","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:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9c78jm5LortZIq44TiHBzEz15RENmdBPFNVm2IOWoAYAG+em6wts/0uN4QTI0gJlzMrja4m/DL5DsT1r14CUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T19:57:02.529697Z"},"content_sha256":"48ad2888d2d1c63ec181af38db89a13fbb93fb8ee607695bfdb049730ea0bb7d","schema_version":"1.0","event_id":"sha256:48ad2888d2d1c63ec181af38db89a13fbb93fb8ee607695bfdb049730ea0bb7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5PCX4E5YMR2YYNRTPDOK4OZURH/bundle.json","state_url":"https://pith.science/pith/5PCX4E5YMR2YYNRTPDOK4OZURH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5PCX4E5YMR2YYNRTPDOK4OZURH/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-22T19:57:02Z","links":{"resolver":"https://pith.science/pith/5PCX4E5YMR2YYNRTPDOK4OZURH","bundle":"https://pith.science/pith/5PCX4E5YMR2YYNRTPDOK4OZURH/bundle.json","state":"https://pith.science/pith/5PCX4E5YMR2YYNRTPDOK4OZURH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5PCX4E5YMR2YYNRTPDOK4OZURH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5PCX4E5YMR2YYNRTPDOK4OZURH","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":"cb34fc3802c4ac3df087db4cfee463431bb2e7cdd233eb27ddb7cb6204582385","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-24T12:30:36Z","title_canon_sha256":"3c2df080b82e85322a08c9d5312ddf73e2b185156fa14ee7842ec3abe73e2505"},"schema_version":"1.0","source":{"id":"1306.5596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5596","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5596v1","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5596","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"5PCX4E5YMR2Y","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5PCX4E5YMR2YYNRT","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5PCX4E5Y","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:48ad2888d2d1c63ec181af38db89a13fbb93fb8ee607695bfdb049730ea0bb7d","target":"graph","created_at":"2026-05-18T03:20:07Z","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":"Registers with Non-Linear Update (RNLUs) are a generalization of Non-Linear Feedback Shift Registers (NLFSRs) in which both, feedback and feedforward, connections are allowed and no chain connection between the stages is required. In this paper, a new algorithm for constructing RNLUs generating a given binary sequence is presented. Expected size of RNLUs constructed by the presented algorithm is proved to be O(n/log(n/p)), where n is the sequence length and p is the degree of parallelization. This is asymptotically smaller than the expected size of RNLUs constructed by previous algorithms and ","authors_text":"Elena Dubrova, Nan Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-24T12:30:36Z","title":"An Algorithm for Constructing a Smallest Register with Non-Linear Update Generating a Given Binary Sequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5596","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:0f2c4e2084507c546744e3236c8251cac241390080a8abea07fefbd84f7c7391","target":"record","created_at":"2026-05-18T03:20:07Z","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":"cb34fc3802c4ac3df087db4cfee463431bb2e7cdd233eb27ddb7cb6204582385","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-24T12:30:36Z","title_canon_sha256":"3c2df080b82e85322a08c9d5312ddf73e2b185156fa14ee7842ec3abe73e2505"},"schema_version":"1.0","source":{"id":"1306.5596","kind":"arxiv","version":1}},"canonical_sha256":"ebc57e13b864758c363378dcae3b3489fb53229c5a807a9c297ba1e439f8cf9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebc57e13b864758c363378dcae3b3489fb53229c5a807a9c297ba1e439f8cf9b","first_computed_at":"2026-05-18T03:20:07.471544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:07.471544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JxK4ceh3nadHC31Eq23oMgi/rFt1QiPKdrhx+5iGIcK3MYrEsrzVOdPJIMxd2M3bl8tZbOx1Ac8MqwrGJFcsBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:07.472223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f2c4e2084507c546744e3236c8251cac241390080a8abea07fefbd84f7c7391","sha256:48ad2888d2d1c63ec181af38db89a13fbb93fb8ee607695bfdb049730ea0bb7d"],"state_sha256":"6afba689e598864a106f57866fb9670d60dba41651f009c7706ad2b4be66c8e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bVLDmNzHRpmMvXnDGFqoWrao3JJJeTJKUwDoaOQUMY3012pMGA3lp/d7vE6MT0Cp0yDW6U0uF+OiaBdhJ3J7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T19:57:02.533274Z","bundle_sha256":"f50d7a636fd53e787dc634e11097546de4b2f0b8463ce4140fc9993fdd648c4f"}}