{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5CIKVXT45PVMVWFRRB3TOEPABQ","short_pith_number":"pith:5CIKVXT4","canonical_record":{"source":{"id":"1309.1829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-09-07T07:14:00Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a6d80c6f3c7348f604624a46d8538a3632c226f2105d8827a4c8635a233b12b4","abstract_canon_sha256":"553f89908167ab1f324d588c19ee3792968db40a635df3eb07d3a577c1f97b32"},"schema_version":"1.0"},"canonical_sha256":"e890aade7cebeacad8b188773711e00c3613c73c4c3306cf313af0fdffc26e46","source":{"kind":"arxiv","id":"1309.1829","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1829","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1829v1","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1829","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"pith_short_12","alias_value":"5CIKVXT45PVM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5CIKVXT45PVMVWFR","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5CIKVXT4","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5CIKVXT45PVMVWFRRB3TOEPABQ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.1829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-09-07T07:14:00Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a6d80c6f3c7348f604624a46d8538a3632c226f2105d8827a4c8635a233b12b4","abstract_canon_sha256":"553f89908167ab1f324d588c19ee3792968db40a635df3eb07d3a577c1f97b32"},"schema_version":"1.0"},"canonical_sha256":"e890aade7cebeacad8b188773711e00c3613c73c4c3306cf313af0fdffc26e46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:57.367848Z","signature_b64":"zYywimv5JTKphzxSzcXurWI0U+9pYSwDH+WTpJSzxoaTrGmWfD4Agzt/X4ucrpo0QnaqRUkMePxFBA3YG+o+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e890aade7cebeacad8b188773711e00c3613c73c4c3306cf313af0fdffc26e46","last_reissued_at":"2026-05-18T03:13:57.367034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:57.367034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.1829","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:13:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fBjSXeDx1RAIuEnoqvdeF9xE4VIiTk25AWvd2n2U7AWHp3IO77XBoFcPFtaGBslcnpmu8TzmutTPAd0JZ3J8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:22:42.272842Z"},"content_sha256":"0d77d1827dcaef7d53995c69b0542610e6262b64aeebdce75f64f74d6cbd79f1","schema_version":"1.0","event_id":"sha256:0d77d1827dcaef7d53995c69b0542610e6262b64aeebdce75f64f74d6cbd79f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5CIKVXT45PVMVWFRRB3TOEPABQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the $k$-error linear complexity for $2^n$-periodic binary sequences via Cube Theory","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","submitted_at":"2013-09-07T07:14:00Z","abstract_excerpt":"The linear complexity and k-error linear complexity of a sequence have been used as important measures of keystream strength, hence designing a sequence with high linear complexity and $k$-error linear complexity is a popular research topic in cryptography. In this paper, the concept of stable $k$-error linear complexity is proposed to study sequences with stable and large $k$-error linear complexity. In order to study k-error linear complexity of binary sequences with period $2^n$, a new tool called cube theory is developed. By using the cube theory, one can easily construct sequences with th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1829","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:13:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4dW6mSc7YdOE26IpLv7iRkxhzeFZtRHka50ShygAypBqXf8uroxt3QCW3vXo6bn+6wtnZ0llgDEZf/fpFjbpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:22:42.273498Z"},"content_sha256":"ab625da3b91f9229a859eb8af281d0456a11244b46b36b5d632c4c5a1b1669a8","schema_version":"1.0","event_id":"sha256:ab625da3b91f9229a859eb8af281d0456a11244b46b36b5d632c4c5a1b1669a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5CIKVXT45PVMVWFRRB3TOEPABQ/bundle.json","state_url":"https://pith.science/pith/5CIKVXT45PVMVWFRRB3TOEPABQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5CIKVXT45PVMVWFRRB3TOEPABQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T01:22:42Z","links":{"resolver":"https://pith.science/pith/5CIKVXT45PVMVWFRRB3TOEPABQ","bundle":"https://pith.science/pith/5CIKVXT45PVMVWFRRB3TOEPABQ/bundle.json","state":"https://pith.science/pith/5CIKVXT45PVMVWFRRB3TOEPABQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5CIKVXT45PVMVWFRRB3TOEPABQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5CIKVXT45PVMVWFRRB3TOEPABQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"553f89908167ab1f324d588c19ee3792968db40a635df3eb07d3a577c1f97b32","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-09-07T07:14:00Z","title_canon_sha256":"a6d80c6f3c7348f604624a46d8538a3632c226f2105d8827a4c8635a233b12b4"},"schema_version":"1.0","source":{"id":"1309.1829","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1829","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1829v1","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1829","created_at":"2026-05-18T03:13:57Z"},{"alias_kind":"pith_short_12","alias_value":"5CIKVXT45PVM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5CIKVXT45PVMVWFR","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5CIKVXT4","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:ab625da3b91f9229a859eb8af281d0456a11244b46b36b5d632c4c5a1b1669a8","target":"graph","created_at":"2026-05-18T03:13:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The linear complexity and k-error linear complexity of a sequence have been used as important measures of keystream strength, hence designing a sequence with high linear complexity and $k$-error linear complexity is a popular research topic in cryptography. In this paper, the concept of stable $k$-error linear complexity is proposed to study sequences with stable and large $k$-error linear complexity. In order to study k-error linear complexity of binary sequences with period $2^n$, a new tool called cube theory is developed. By using the cube theory, one can easily construct sequences with th","authors_text":"Jianqin Zhou, Wanquan Liu","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-09-07T07:14:00Z","title":"On the $k$-error linear complexity for $2^n$-periodic binary sequences via Cube Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1829","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0d77d1827dcaef7d53995c69b0542610e6262b64aeebdce75f64f74d6cbd79f1","target":"record","created_at":"2026-05-18T03:13:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"553f89908167ab1f324d588c19ee3792968db40a635df3eb07d3a577c1f97b32","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-09-07T07:14:00Z","title_canon_sha256":"a6d80c6f3c7348f604624a46d8538a3632c226f2105d8827a4c8635a233b12b4"},"schema_version":"1.0","source":{"id":"1309.1829","kind":"arxiv","version":1}},"canonical_sha256":"e890aade7cebeacad8b188773711e00c3613c73c4c3306cf313af0fdffc26e46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e890aade7cebeacad8b188773711e00c3613c73c4c3306cf313af0fdffc26e46","first_computed_at":"2026-05-18T03:13:57.367034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:57.367034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zYywimv5JTKphzxSzcXurWI0U+9pYSwDH+WTpJSzxoaTrGmWfD4Agzt/X4ucrpo0QnaqRUkMePxFBA3YG+o+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:57.367848Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1829","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d77d1827dcaef7d53995c69b0542610e6262b64aeebdce75f64f74d6cbd79f1","sha256:ab625da3b91f9229a859eb8af281d0456a11244b46b36b5d632c4c5a1b1669a8"],"state_sha256":"e5490f9ce6364ff11c99e79ae5db021d4a8e8e77747834a89df9ca725bc54efc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GvWT1CoQFk66hzmv5CRnrHaZlLAkYiKbdqTs+enAEvMrsg5ziTf4AxsvDDgDwP+VBb9W/oD1bVhS8hASjzanCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:22:42.277717Z","bundle_sha256":"2837ec05943a90d28a7c67bfbc59d5736d90d3bcbb64dc580f60aabe7e5de8ae"}}