{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VTWER23J2U464OVMGE4ASKGU3R","short_pith_number":"pith:VTWER23J","schema_version":"1.0","canonical_sha256":"acec48eb69d539ee3aac31380928d4dc76edb2f19426385effc9141205d9ed86","source":{"kind":"arxiv","id":"1904.05083","version":1},"attestation_state":"computed","paper":{"title":"On the $k$-error linear complexity of subsequences of $d$-ary Sidel'nikov sequences over prime field $\\mathbb{F}_{d}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jiejing Wen, Minghui Yang","submitted_at":"2019-04-10T09:28:27Z","abstract_excerpt":"We study the $k$-error linear complexity of subsequences of the $d$-ary Sidel'nikov sequences over the prime field $\\mathbb{F}_{d}$. A general lower bound for the $k$-error linear complexity is given. For several special periods, we show that these sequences have large $k$-error linear complexity."},"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":"1904.05083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-10T09:28:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4e0e9d1f36496f28f56c1ea3e634e40332ead299c0263564bb30eb7f314198e9","abstract_canon_sha256":"6d6c86b44b4c8617b4c4f0282c76147ba116d52921791486e13fc4d5131af553"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:54.197456Z","signature_b64":"JXxSxSbgfbuNu0b+EHIkEHrW1/S6BXTUrxuzfJrfPCuhm7wN0eQF4jh5eXJmFU/y9tB8K32WNOAJPyu1f+8SBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acec48eb69d539ee3aac31380928d4dc76edb2f19426385effc9141205d9ed86","last_reissued_at":"2026-05-17T23:48:54.196854Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:54.196854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the $k$-error linear complexity of subsequences of $d$-ary Sidel'nikov sequences over prime field $\\mathbb{F}_{d}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jiejing Wen, Minghui Yang","submitted_at":"2019-04-10T09:28:27Z","abstract_excerpt":"We study the $k$-error linear complexity of subsequences of the $d$-ary Sidel'nikov sequences over the prime field $\\mathbb{F}_{d}$. A general lower bound for the $k$-error linear complexity is given. For several special periods, we show that these sequences have large $k$-error linear complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05083","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":"1904.05083","created_at":"2026-05-17T23:48:54.196935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.05083v1","created_at":"2026-05-17T23:48:54.196935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05083","created_at":"2026-05-17T23:48:54.196935+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTWER23J2U46","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTWER23J2U464OVM","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTWER23J","created_at":"2026-05-18T12:33:30.264802+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/VTWER23J2U464OVMGE4ASKGU3R","json":"https://pith.science/pith/VTWER23J2U464OVMGE4ASKGU3R.json","graph_json":"https://pith.science/api/pith-number/VTWER23J2U464OVMGE4ASKGU3R/graph.json","events_json":"https://pith.science/api/pith-number/VTWER23J2U464OVMGE4ASKGU3R/events.json","paper":"https://pith.science/paper/VTWER23J"},"agent_actions":{"view_html":"https://pith.science/pith/VTWER23J2U464OVMGE4ASKGU3R","download_json":"https://pith.science/pith/VTWER23J2U464OVMGE4ASKGU3R.json","view_paper":"https://pith.science/paper/VTWER23J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.05083&json=true","fetch_graph":"https://pith.science/api/pith-number/VTWER23J2U464OVMGE4ASKGU3R/graph.json","fetch_events":"https://pith.science/api/pith-number/VTWER23J2U464OVMGE4ASKGU3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTWER23J2U464OVMGE4ASKGU3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTWER23J2U464OVMGE4ASKGU3R/action/storage_attestation","attest_author":"https://pith.science/pith/VTWER23J2U464OVMGE4ASKGU3R/action/author_attestation","sign_citation":"https://pith.science/pith/VTWER23J2U464OVMGE4ASKGU3R/action/citation_signature","submit_replication":"https://pith.science/pith/VTWER23J2U464OVMGE4ASKGU3R/action/replication_record"}},"created_at":"2026-05-17T23:48:54.196935+00:00","updated_at":"2026-05-17T23:48:54.196935+00:00"}