{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VWVPUG7KOIYC5SACN6D62PCAES","short_pith_number":"pith:VWVPUG7K","schema_version":"1.0","canonical_sha256":"adaafa1bea72302ec8026f87ed3c4024bf8fbe746bfd8a104c4298e357397863","source":{"kind":"arxiv","id":"1402.5472","version":2},"attestation_state":"computed","paper":{"title":"On the $k$-error linear complexity for $p^n$-periodic binary sequences via hypercube theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Guanglu Zhou, Jianqin Zhou, Wanquan Liu","submitted_at":"2014-02-22T03:26:54Z","abstract_excerpt":"The linear complexity and the $k$-error linear complexity of a binary sequence are important security measures for key stream strength. By studying binary sequences with the minimum Hamming weight, a new tool named as hypercube theory is developed for $p^n$-periodic binary sequences. In fact, hypercube theory is based on a typical sequence decomposition and it is a very important tool in investigating the critical error linear complexity spectrum proposed by Etzion et al. To demonstrate the importance of hypercube theory, we first give a standard hypercube decomposition based on a well-known a"},"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":"1402.5472","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-02-22T03:26:54Z","cross_cats_sorted":[],"title_canon_sha256":"f3f62062fc5f0b30b0a02ffbb28fcd9e45955d85ee290c29f010b28a292adc53","abstract_canon_sha256":"0ed423df05ddce0f0cc324c70d4cdd65f146d232076a60ecda1a0b777acf730d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:23.205875Z","signature_b64":"c43XtGOmBXmNHTaLC2P9or7CkbQ3pxibHb0xDY8fntdWP4m+tb6GbC038m28lSALV2dkliUREgwiHAvShqTGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adaafa1bea72302ec8026f87ed3c4024bf8fbe746bfd8a104c4298e357397863","last_reissued_at":"2026-05-18T02:45:23.205421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:23.205421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the $k$-error linear complexity for $p^n$-periodic binary sequences via hypercube theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Guanglu Zhou, Jianqin Zhou, Wanquan Liu","submitted_at":"2014-02-22T03:26:54Z","abstract_excerpt":"The linear complexity and the $k$-error linear complexity of a binary sequence are important security measures for key stream strength. By studying binary sequences with the minimum Hamming weight, a new tool named as hypercube theory is developed for $p^n$-periodic binary sequences. In fact, hypercube theory is based on a typical sequence decomposition and it is a very important tool in investigating the critical error linear complexity spectrum proposed by Etzion et al. To demonstrate the importance of hypercube theory, we first give a standard hypercube decomposition based on a well-known a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5472","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":"1402.5472","created_at":"2026-05-18T02:45:23.205488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5472v2","created_at":"2026-05-18T02:45:23.205488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5472","created_at":"2026-05-18T02:45:23.205488+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWVPUG7KOIYC","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWVPUG7KOIYC5SAC","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWVPUG7K","created_at":"2026-05-18T12:28:54.890064+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/VWVPUG7KOIYC5SACN6D62PCAES","json":"https://pith.science/pith/VWVPUG7KOIYC5SACN6D62PCAES.json","graph_json":"https://pith.science/api/pith-number/VWVPUG7KOIYC5SACN6D62PCAES/graph.json","events_json":"https://pith.science/api/pith-number/VWVPUG7KOIYC5SACN6D62PCAES/events.json","paper":"https://pith.science/paper/VWVPUG7K"},"agent_actions":{"view_html":"https://pith.science/pith/VWVPUG7KOIYC5SACN6D62PCAES","download_json":"https://pith.science/pith/VWVPUG7KOIYC5SACN6D62PCAES.json","view_paper":"https://pith.science/paper/VWVPUG7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5472&json=true","fetch_graph":"https://pith.science/api/pith-number/VWVPUG7KOIYC5SACN6D62PCAES/graph.json","fetch_events":"https://pith.science/api/pith-number/VWVPUG7KOIYC5SACN6D62PCAES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWVPUG7KOIYC5SACN6D62PCAES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWVPUG7KOIYC5SACN6D62PCAES/action/storage_attestation","attest_author":"https://pith.science/pith/VWVPUG7KOIYC5SACN6D62PCAES/action/author_attestation","sign_citation":"https://pith.science/pith/VWVPUG7KOIYC5SACN6D62PCAES/action/citation_signature","submit_replication":"https://pith.science/pith/VWVPUG7KOIYC5SACN6D62PCAES/action/replication_record"}},"created_at":"2026-05-18T02:45:23.205488+00:00","updated_at":"2026-05-18T02:45:23.205488+00:00"}