{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DCBLACA2BDK2EBWYSBSG7CPMFQ","short_pith_number":"pith:DCBLACA2","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"},"canonical_sha256":"1882b0081a08d5a206d890646f89ec2c3bb397b1a04428a048afb8c6c2cd6ce3","source":{"kind":"arxiv","id":"1312.6927","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6927","created_at":"2026-05-18T02:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6927v2","created_at":"2026-05-18T02:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6927","created_at":"2026-05-18T02:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"DCBLACA2BDK2","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DCBLACA2BDK2EBWY","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DCBLACA2","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DCBLACA2BDK2EBWYSBSG7CPMFQ","target":"record","payload":{"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"},"canonical_sha256":"1882b0081a08d5a206d890646f89ec2c3bb397b1a04428a048afb8c6c2cd6ce3","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"},"source_kind":"arxiv","source_id":"1312.6927","source_version":2,"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-18T02:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6pxMB+b6AKDrFjEpNITXa6izAsvyQ6jQY41ULG4rvi2eh5hzIQdfrMfklSAHEsacjYKFmJfHI40J+OI5ZKdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:38:48.700898Z"},"content_sha256":"89af2a5b3561de8e906923705fc8f3517ef6e06a2d82c2458610c3d4b2400a4e","schema_version":"1.0","event_id":"sha256:89af2a5b3561de8e906923705fc8f3517ef6e06a2d82c2458610c3d4b2400a4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DCBLACA2BDK2EBWYSBSG7CPMFQ","target":"graph","payload":{"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"},"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-18T02:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0THMDytKjcBmjF4uXHkXc+7ewuDB+pXGUq9+nxTAIIuPjwNkelc7aNNAiUTnU43HN7E84V2h8syEmKdNCNZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:38:48.701239Z"},"content_sha256":"bb0a1d2be40010a32810daf14f336f762512fcfd5c3ecd3002e43ebeb15f0fde","schema_version":"1.0","event_id":"sha256:bb0a1d2be40010a32810daf14f336f762512fcfd5c3ecd3002e43ebeb15f0fde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ/bundle.json","state_url":"https://pith.science/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ/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-07-05T07:38:48Z","links":{"resolver":"https://pith.science/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ","bundle":"https://pith.science/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ/bundle.json","state":"https://pith.science/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCBLACA2BDK2EBWYSBSG7CPMFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DCBLACA2BDK2EBWYSBSG7CPMFQ","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":"d959c28fec6cdc098f8f2da047bc9f541e1f02a81cd80b65b2636d380c148c05","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-12-25T05:15:30Z","title_canon_sha256":"7e0e5b451b0248bcbe8fbb36d456acfff377de825723b1f8e4a59b363c6b330c"},"schema_version":"1.0","source":{"id":"1312.6927","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6927","created_at":"2026-05-18T02:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6927v2","created_at":"2026-05-18T02:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6927","created_at":"2026-05-18T02:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"DCBLACA2BDK2","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DCBLACA2BDK2EBWY","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DCBLACA2","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:bb0a1d2be40010a32810daf14f336f762512fcfd5c3ecd3002e43ebeb15f0fde","target":"graph","created_at":"2026-05-18T02:45:31Z","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":"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","authors_text":"Jianqin Zhou, Wanquan Liu, Xifeng Wang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-12-25T05:15:30Z","title":"Structure Analysis on the $k$-error Linear Complexity for $2^n$-periodic Binary Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6927","kind":"arxiv","version":2},"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:89af2a5b3561de8e906923705fc8f3517ef6e06a2d82c2458610c3d4b2400a4e","target":"record","created_at":"2026-05-18T02:45:31Z","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":"d959c28fec6cdc098f8f2da047bc9f541e1f02a81cd80b65b2636d380c148c05","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-12-25T05:15:30Z","title_canon_sha256":"7e0e5b451b0248bcbe8fbb36d456acfff377de825723b1f8e4a59b363c6b330c"},"schema_version":"1.0","source":{"id":"1312.6927","kind":"arxiv","version":2}},"canonical_sha256":"1882b0081a08d5a206d890646f89ec2c3bb397b1a04428a048afb8c6c2cd6ce3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1882b0081a08d5a206d890646f89ec2c3bb397b1a04428a048afb8c6c2cd6ce3","first_computed_at":"2026-05-18T02:45:31.744947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:31.744947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6WeU+ap5Cr/OEsPYaKRhfm5rX6INAT/uaaKvrY8PFMPGleuiAfRlSrkJCyjXt4FGfEoA/kwCkwUtdnFCl2VEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:31.745581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6927","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89af2a5b3561de8e906923705fc8f3517ef6e06a2d82c2458610c3d4b2400a4e","sha256:bb0a1d2be40010a32810daf14f336f762512fcfd5c3ecd3002e43ebeb15f0fde"],"state_sha256":"37a139435afa15351d99a0a89a7d013ca36dfb03852a965a7f2b59f0df188f23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w1XwR5stXxlLRPvuoYeHsXiFJ45+ghTVNen0eMgiVZMPpPHpZdPEXukbvtaw7PimBHs2e6xRJZ9f3Tnj/sbfDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T07:38:48.703423Z","bundle_sha256":"a38a9de270574b54e4c17d19c08cc6a9c0e35ef5ef088b1206dcc39b553080e8"}}