{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WHHZQQQL67YOE3N2HZLJAJIFC2","short_pith_number":"pith:WHHZQQQL","schema_version":"1.0","canonical_sha256":"b1cf98420bf7f0e26dba3e5690250516943676681fb9f0378400436f738cb84c","source":{"kind":"arxiv","id":"1112.6047","version":1},"attestation_state":"computed","paper":{"title":"Characterization of $2^n$-periodic binary sequences with fixed 3-error or 4-error linear complexity","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jianqin Zhou, Jun Liu, Wanquan Liu","submitted_at":"2011-12-28T02:57:58Z","abstract_excerpt":"The linear complexity and the $k$-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of combinatorics, the $k$-error linear complexity distribution of $2^n$-periodic binary sequences is investigated based on Games-Chan algorithm.\n  First, for $k=2,3$, the complete counting functions on the $k$-error linear complexity of $2^n$-periodic binary sequences with linear complexity less than $2^n$ are characterized. Second, for $k=3,4$, the complete counting functions o"},"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":"1112.6047","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2011-12-28T02:57:58Z","cross_cats_sorted":[],"title_canon_sha256":"2c5a29f8ab2cc71f5153899b123c99aa637137799a1322d580522ac0b47a4cbd","abstract_canon_sha256":"8ac85cafdb463ffab207d6c9651487982798bea9c7ca6845668bcb50abef169f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:36.992058Z","signature_b64":"avK7/bTn9oFtJi/IEtHLGScaSt8V4BziUO08zm03TmGdoTkDG0mZV3OT3upAqEc5hMNZkJFaDEtaZidZTLNoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1cf98420bf7f0e26dba3e5690250516943676681fb9f0378400436f738cb84c","last_reissued_at":"2026-05-18T04:05:36.991547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:36.991547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterization of $2^n$-periodic binary sequences with fixed 3-error or 4-error linear complexity","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jianqin Zhou, Jun Liu, Wanquan Liu","submitted_at":"2011-12-28T02:57:58Z","abstract_excerpt":"The linear complexity and the $k$-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of combinatorics, the $k$-error linear complexity distribution of $2^n$-periodic binary sequences is investigated based on Games-Chan algorithm.\n  First, for $k=2,3$, the complete counting functions on the $k$-error linear complexity of $2^n$-periodic binary sequences with linear complexity less than $2^n$ are characterized. Second, for $k=3,4$, the complete counting functions o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6047","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":"1112.6047","created_at":"2026-05-18T04:05:36.991626+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.6047v1","created_at":"2026-05-18T04:05:36.991626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6047","created_at":"2026-05-18T04:05:36.991626+00:00"},{"alias_kind":"pith_short_12","alias_value":"WHHZQQQL67YO","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WHHZQQQL67YOE3N2","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WHHZQQQL","created_at":"2026-05-18T12:26:44.992195+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/WHHZQQQL67YOE3N2HZLJAJIFC2","json":"https://pith.science/pith/WHHZQQQL67YOE3N2HZLJAJIFC2.json","graph_json":"https://pith.science/api/pith-number/WHHZQQQL67YOE3N2HZLJAJIFC2/graph.json","events_json":"https://pith.science/api/pith-number/WHHZQQQL67YOE3N2HZLJAJIFC2/events.json","paper":"https://pith.science/paper/WHHZQQQL"},"agent_actions":{"view_html":"https://pith.science/pith/WHHZQQQL67YOE3N2HZLJAJIFC2","download_json":"https://pith.science/pith/WHHZQQQL67YOE3N2HZLJAJIFC2.json","view_paper":"https://pith.science/paper/WHHZQQQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.6047&json=true","fetch_graph":"https://pith.science/api/pith-number/WHHZQQQL67YOE3N2HZLJAJIFC2/graph.json","fetch_events":"https://pith.science/api/pith-number/WHHZQQQL67YOE3N2HZLJAJIFC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WHHZQQQL67YOE3N2HZLJAJIFC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WHHZQQQL67YOE3N2HZLJAJIFC2/action/storage_attestation","attest_author":"https://pith.science/pith/WHHZQQQL67YOE3N2HZLJAJIFC2/action/author_attestation","sign_citation":"https://pith.science/pith/WHHZQQQL67YOE3N2HZLJAJIFC2/action/citation_signature","submit_replication":"https://pith.science/pith/WHHZQQQL67YOE3N2HZLJAJIFC2/action/replication_record"}},"created_at":"2026-05-18T04:05:36.991626+00:00","updated_at":"2026-05-18T04:05:36.991626+00:00"}