{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JLFAFPLGIKFAKK55NBUZ7IJL3G","short_pith_number":"pith:JLFAFPLG","schema_version":"1.0","canonical_sha256":"4aca02bd66428a052bbd68699fa12bd984cdf40054a6486b3e36f9196856c962","source":{"kind":"arxiv","id":"1803.03339","version":2},"attestation_state":"computed","paper":{"title":"On $k$-error linear complexity of pseudorandom binary sequences derived from Euler quotients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Chenhuang Wu, Pinhui Ke, Vladimir Edemskiy, Zhixiong Chen","submitted_at":"2018-03-09T00:13:08Z","abstract_excerpt":"We investigate the $k$-error linear complexity of pseudorandom binary sequences of period $p^{\\mathfrak{r}}$ derived from the Euler quotients modulo $p^{\\mathfrak{r}-1}$, a power of an odd prime $p$ for $\\mathfrak{r}\\geq 2$. When $\\mathfrak{r}=2$, this is just the case of polynomial quotients (including Fermat quotients) modulo $p$, which has been studied in an earlier work of Chen, Niu and Wu. In this work, we establish a recursive relation on the $k$-error linear complexity of the sequences for the case of $\\mathfrak{r}\\geq 3$. We also state the exact values of the $k$-error linear complexit"},"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":"1803.03339","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-03-09T00:13:08Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"3737b1dda29dacd7b349fed60ddb52cd4812edf33274603742d82cdfd9aa1852","abstract_canon_sha256":"e5ba1c1051164482f3277c099ebad3124ad847e690ce25b90667966a5fbdcc61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:07.862593Z","signature_b64":"Gx56VskzETbXa1aHZQgxxNPA/GYFBjYdiSv/LO56Alt+GA3zmsnTP0PkcGNMe/wYS8pM3xdz7wR+0cpJ8Yx2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aca02bd66428a052bbd68699fa12bd984cdf40054a6486b3e36f9196856c962","last_reissued_at":"2026-05-18T00:04:07.861949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:07.861949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $k$-error linear complexity of pseudorandom binary sequences derived from Euler quotients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Chenhuang Wu, Pinhui Ke, Vladimir Edemskiy, Zhixiong Chen","submitted_at":"2018-03-09T00:13:08Z","abstract_excerpt":"We investigate the $k$-error linear complexity of pseudorandom binary sequences of period $p^{\\mathfrak{r}}$ derived from the Euler quotients modulo $p^{\\mathfrak{r}-1}$, a power of an odd prime $p$ for $\\mathfrak{r}\\geq 2$. When $\\mathfrak{r}=2$, this is just the case of polynomial quotients (including Fermat quotients) modulo $p$, which has been studied in an earlier work of Chen, Niu and Wu. In this work, we establish a recursive relation on the $k$-error linear complexity of the sequences for the case of $\\mathfrak{r}\\geq 3$. We also state the exact values of the $k$-error linear complexit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03339","kind":"arxiv","version":2},"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":"1803.03339","created_at":"2026-05-18T00:04:07.862056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03339v2","created_at":"2026-05-18T00:04:07.862056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03339","created_at":"2026-05-18T00:04:07.862056+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLFAFPLGIKFA","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLFAFPLGIKFAKK55","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLFAFPLG","created_at":"2026-05-18T12:32:31.084164+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/JLFAFPLGIKFAKK55NBUZ7IJL3G","json":"https://pith.science/pith/JLFAFPLGIKFAKK55NBUZ7IJL3G.json","graph_json":"https://pith.science/api/pith-number/JLFAFPLGIKFAKK55NBUZ7IJL3G/graph.json","events_json":"https://pith.science/api/pith-number/JLFAFPLGIKFAKK55NBUZ7IJL3G/events.json","paper":"https://pith.science/paper/JLFAFPLG"},"agent_actions":{"view_html":"https://pith.science/pith/JLFAFPLGIKFAKK55NBUZ7IJL3G","download_json":"https://pith.science/pith/JLFAFPLGIKFAKK55NBUZ7IJL3G.json","view_paper":"https://pith.science/paper/JLFAFPLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03339&json=true","fetch_graph":"https://pith.science/api/pith-number/JLFAFPLGIKFAKK55NBUZ7IJL3G/graph.json","fetch_events":"https://pith.science/api/pith-number/JLFAFPLGIKFAKK55NBUZ7IJL3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLFAFPLGIKFAKK55NBUZ7IJL3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLFAFPLGIKFAKK55NBUZ7IJL3G/action/storage_attestation","attest_author":"https://pith.science/pith/JLFAFPLGIKFAKK55NBUZ7IJL3G/action/author_attestation","sign_citation":"https://pith.science/pith/JLFAFPLGIKFAKK55NBUZ7IJL3G/action/citation_signature","submit_replication":"https://pith.science/pith/JLFAFPLGIKFAKK55NBUZ7IJL3G/action/replication_record"}},"created_at":"2026-05-18T00:04:07.862056+00:00","updated_at":"2026-05-18T00:04:07.862056+00:00"}