{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5PCX4E5YMR2YYNRTPDOK4OZURH","short_pith_number":"pith:5PCX4E5Y","schema_version":"1.0","canonical_sha256":"ebc57e13b864758c363378dcae3b3489fb53229c5a807a9c297ba1e439f8cf9b","source":{"kind":"arxiv","id":"1306.5596","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.5596","created_at":"2026-05-18T03:20:07.471659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5596v1","created_at":"2026-05-18T03:20:07.471659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5596","created_at":"2026-05-18T03:20:07.471659+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PCX4E5YMR2Y","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PCX4E5YMR2YYNRT","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PCX4E5Y","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5PCX4E5YMR2YYNRTPDOK4OZURH","json":"https://pith.science/pith/5PCX4E5YMR2YYNRTPDOK4OZURH.json","graph_json":"https://pith.science/api/pith-number/5PCX4E5YMR2YYNRTPDOK4OZURH/graph.json","events_json":"https://pith.science/api/pith-number/5PCX4E5YMR2YYNRTPDOK4OZURH/events.json","paper":"https://pith.science/paper/5PCX4E5Y"},"agent_actions":{"view_html":"https://pith.science/pith/5PCX4E5YMR2YYNRTPDOK4OZURH","download_json":"https://pith.science/pith/5PCX4E5YMR2YYNRTPDOK4OZURH.json","view_paper":"https://pith.science/paper/5PCX4E5Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5596&json=true","fetch_graph":"https://pith.science/api/pith-number/5PCX4E5YMR2YYNRTPDOK4OZURH/graph.json","fetch_events":"https://pith.science/api/pith-number/5PCX4E5YMR2YYNRTPDOK4OZURH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PCX4E5YMR2YYNRTPDOK4OZURH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PCX4E5YMR2YYNRTPDOK4OZURH/action/storage_attestation","attest_author":"https://pith.science/pith/5PCX4E5YMR2YYNRTPDOK4OZURH/action/author_attestation","sign_citation":"https://pith.science/pith/5PCX4E5YMR2YYNRTPDOK4OZURH/action/citation_signature","submit_replication":"https://pith.science/pith/5PCX4E5YMR2YYNRTPDOK4OZURH/action/replication_record"}},"created_at":"2026-05-18T03:20:07.471659+00:00","updated_at":"2026-05-18T03:20:07.471659+00:00"}