{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DCBLACA2BDK2EBWYSBSG7CPMFQ","short_pith_number":"pith:DCBLACA2","schema_version":"1.0","canonical_sha256":"1882b0081a08d5a206d890646f89ec2c3bb397b1a04428a048afb8c6c2cd6ce3","source":{"kind":"arxiv","id":"1312.6927","version":2},"attestation_state":"computed","paper":{"title":"Structure Analysis on the $k$-error Linear Complexity for $2^n$-periodic Binary Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Jianqin Zhou, Wanquan Liu, Xifeng Wang","submitted_at":"2013-12-25T05:15:30Z","abstract_excerpt":"In this paper, in order to characterize the critical error linear complexity spectrum (CELCS) for $2^n$-periodic binary sequences, we first propose a decomposition based on the cube theory. Based on the proposed $k$-error cube decomposition, and the famous inclusion-exclusion principle, we obtain the complete characterization of $i$th descent point (critical point) of the k-error linear complexity for $i=2,3$. Second, by using the sieve method and Games-Chan algorithm, we characterize the second descent point (critical point) distribution of the $k$-error linear complexity for $2^n$-periodic b"},"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":"1312.6927","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-12-25T05:15:30Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7e0e5b451b0248bcbe8fbb36d456acfff377de825723b1f8e4a59b363c6b330c","abstract_canon_sha256":"d959c28fec6cdc098f8f2da047bc9f541e1f02a81cd80b65b2636d380c148c05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:31.745581Z","signature_b64":"6WeU+ap5Cr/OEsPYaKRhfm5rX6INAT/uaaKvrY8PFMPGleuiAfRlSrkJCyjXt4FGfEoA/kwCkwUtdnFCl2VEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1882b0081a08d5a206d890646f89ec2c3bb397b1a04428a048afb8c6c2cd6ce3","last_reissued_at":"2026-05-18T02:45:31.744947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:31.744947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure Analysis on the $k$-error Linear Complexity for $2^n$-periodic Binary Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Jianqin Zhou, Wanquan Liu, Xifeng Wang","submitted_at":"2013-12-25T05:15:30Z","abstract_excerpt":"In this paper, in order to characterize the critical error linear complexity spectrum (CELCS) for $2^n$-periodic binary sequences, we first propose a decomposition based on the cube theory. Based on the proposed $k$-error cube decomposition, and the famous inclusion-exclusion principle, we obtain the complete characterization of $i$th descent point (critical point) of the k-error linear complexity for $i=2,3$. Second, by using the sieve method and Games-Chan algorithm, we characterize the second descent point (critical point) distribution of the $k$-error linear complexity for $2^n$-periodic b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6927","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":"1312.6927","created_at":"2026-05-18T02:45:31.745039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6927v2","created_at":"2026-05-18T02:45:31.745039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6927","created_at":"2026-05-18T02:45:31.745039+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCBLACA2BDK2","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCBLACA2BDK2EBWY","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCBLACA2","created_at":"2026-05-18T12:27:40.988391+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/DCBLACA2BDK2EBWYSBSG7CPMFQ","json":"https://pith.science/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ.json","graph_json":"https://pith.science/api/pith-number/DCBLACA2BDK2EBWYSBSG7CPMFQ/graph.json","events_json":"https://pith.science/api/pith-number/DCBLACA2BDK2EBWYSBSG7CPMFQ/events.json","paper":"https://pith.science/paper/DCBLACA2"},"agent_actions":{"view_html":"https://pith.science/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ","download_json":"https://pith.science/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ.json","view_paper":"https://pith.science/paper/DCBLACA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6927&json=true","fetch_graph":"https://pith.science/api/pith-number/DCBLACA2BDK2EBWYSBSG7CPMFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DCBLACA2BDK2EBWYSBSG7CPMFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ/action/storage_attestation","attest_author":"https://pith.science/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ/action/author_attestation","sign_citation":"https://pith.science/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ/action/citation_signature","submit_replication":"https://pith.science/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ/action/replication_record"}},"created_at":"2026-05-18T02:45:31.745039+00:00","updated_at":"2026-05-18T02:45:31.745039+00:00"}