{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:E7PAPU37ZNTBM6HAUYCGCT5GYZ","short_pith_number":"pith:E7PAPU37","canonical_record":{"source":{"id":"1109.4455","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-09-21T01:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"3327701edd5c31e690e5efea7c2f3016154c6ab989ed9a97fb90cfa94b541056","abstract_canon_sha256":"14e4ed4b34ded3e86e47eceb3eb1a21b222525aa9e6336ade357806773fcab49"},"schema_version":"1.0"},"canonical_sha256":"27de07d37fcb661678e0a604614fa6c6761c6a874131b4660a2dccb10568b49f","source":{"kind":"arxiv","id":"1109.4455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4455","created_at":"2026-05-18T04:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4455v1","created_at":"2026-05-18T04:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4455","created_at":"2026-05-18T04:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"E7PAPU37ZNTB","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E7PAPU37ZNTBM6HA","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E7PAPU37","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:E7PAPU37ZNTBM6HAUYCGCT5GYZ","target":"record","payload":{"canonical_record":{"source":{"id":"1109.4455","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-09-21T01:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"3327701edd5c31e690e5efea7c2f3016154c6ab989ed9a97fb90cfa94b541056","abstract_canon_sha256":"14e4ed4b34ded3e86e47eceb3eb1a21b222525aa9e6336ade357806773fcab49"},"schema_version":"1.0"},"canonical_sha256":"27de07d37fcb661678e0a604614fa6c6761c6a874131b4660a2dccb10568b49f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:34.728619Z","signature_b64":"s8FhrLuOEEO5o6nKMYnkFFn11O9UPl9CciTqKPM3oNQGiXfYxu/XQ4lzEGMYPhGBF6byIS1ftPUhjtOC5BEWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27de07d37fcb661678e0a604614fa6c6761c6a874131b4660a2dccb10568b49f","last_reissued_at":"2026-05-18T04:12:34.728070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:34.728070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.4455","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-18T04:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YV1+i1mgatUlVkQm1jookS1g+a1ZC4OFcirygfNWLgI3eKVYpZIpQzQP4sl5v5E25+BS1byhegOj3K20Rg7JCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:14:03.789782Z"},"content_sha256":"ca07431b6f7e94fee4613a7efb6be810a2242c32f43083c7abc0f99f20c62a28","schema_version":"1.0","event_id":"sha256:ca07431b6f7e94fee4613a7efb6be810a2242c32f43083c7abc0f99f20c62a28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:E7PAPU37ZNTBM6HAUYCGCT5GYZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Periodic sequences with stable $k$-error linear complexity","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jianqin Zhou","submitted_at":"2011-09-21T01:48:36Z","abstract_excerpt":"The linear complexity of a sequence has been used as an important measure of keystream strength, hence designing a sequence which possesses high linear complexity and $k$-error linear complexity is a hot topic in cryptography and communication. Niederreiter first noticed many periodic sequences with high $k$-error linear complexity over GF(q). In this paper, the concept of stable $k$-error linear complexity is presented to study sequences with high $k$-error linear complexity. By studying linear complexity of binary sequences with period $2^n$, the method using cube theory to construct sequenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4455","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-18T04:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5eL4kIH+U8hY643DYFb7KVNTox4i71ilKpT3Wq3hBlPGfi+3xCmHvkVeXTs39fqhsfO7giD3KNe2u8upEX/7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:14:03.790448Z"},"content_sha256":"36888ead9bdbcf297254ec59206982592797f0557eebb6b49f241ee3642e738b","schema_version":"1.0","event_id":"sha256:36888ead9bdbcf297254ec59206982592797f0557eebb6b49f241ee3642e738b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7PAPU37ZNTBM6HAUYCGCT5GYZ/bundle.json","state_url":"https://pith.science/pith/E7PAPU37ZNTBM6HAUYCGCT5GYZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7PAPU37ZNTBM6HAUYCGCT5GYZ/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:14:03Z","links":{"resolver":"https://pith.science/pith/E7PAPU37ZNTBM6HAUYCGCT5GYZ","bundle":"https://pith.science/pith/E7PAPU37ZNTBM6HAUYCGCT5GYZ/bundle.json","state":"https://pith.science/pith/E7PAPU37ZNTBM6HAUYCGCT5GYZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7PAPU37ZNTBM6HAUYCGCT5GYZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:E7PAPU37ZNTBM6HAUYCGCT5GYZ","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":"14e4ed4b34ded3e86e47eceb3eb1a21b222525aa9e6336ade357806773fcab49","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-09-21T01:48:36Z","title_canon_sha256":"3327701edd5c31e690e5efea7c2f3016154c6ab989ed9a97fb90cfa94b541056"},"schema_version":"1.0","source":{"id":"1109.4455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4455","created_at":"2026-05-18T04:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4455v1","created_at":"2026-05-18T04:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4455","created_at":"2026-05-18T04:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"E7PAPU37ZNTB","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E7PAPU37ZNTBM6HA","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E7PAPU37","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:36888ead9bdbcf297254ec59206982592797f0557eebb6b49f241ee3642e738b","target":"graph","created_at":"2026-05-18T04:12:34Z","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 of a sequence has been used as an important measure of keystream strength, hence designing a sequence which possesses high linear complexity and $k$-error linear complexity is a hot topic in cryptography and communication. Niederreiter first noticed many periodic sequences with high $k$-error linear complexity over GF(q). In this paper, the concept of stable $k$-error linear complexity is presented to study sequences with high $k$-error linear complexity. By studying linear complexity of binary sequences with period $2^n$, the method using cube theory to construct sequenc","authors_text":"Jianqin Zhou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-09-21T01:48:36Z","title":"Periodic sequences with stable $k$-error linear complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4455","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:ca07431b6f7e94fee4613a7efb6be810a2242c32f43083c7abc0f99f20c62a28","target":"record","created_at":"2026-05-18T04:12:34Z","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":"14e4ed4b34ded3e86e47eceb3eb1a21b222525aa9e6336ade357806773fcab49","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-09-21T01:48:36Z","title_canon_sha256":"3327701edd5c31e690e5efea7c2f3016154c6ab989ed9a97fb90cfa94b541056"},"schema_version":"1.0","source":{"id":"1109.4455","kind":"arxiv","version":1}},"canonical_sha256":"27de07d37fcb661678e0a604614fa6c6761c6a874131b4660a2dccb10568b49f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27de07d37fcb661678e0a604614fa6c6761c6a874131b4660a2dccb10568b49f","first_computed_at":"2026-05-18T04:12:34.728070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:34.728070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s8FhrLuOEEO5o6nKMYnkFFn11O9UPl9CciTqKPM3oNQGiXfYxu/XQ4lzEGMYPhGBF6byIS1ftPUhjtOC5BEWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:34.728619Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.4455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca07431b6f7e94fee4613a7efb6be810a2242c32f43083c7abc0f99f20c62a28","sha256:36888ead9bdbcf297254ec59206982592797f0557eebb6b49f241ee3642e738b"],"state_sha256":"521f89ee10379fa4512c55b00db5be090d2e2c781a94d8006f768c6fe9c230dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ujVvoAFR0ZLl7xpF2C8As4af71mjHewRt3DB0TBRdG+xzArdlwFRMWUOqN3Bg3KWXuvvZX+pTSBJYrdm9EOxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:14:03.794835Z","bundle_sha256":"b21829b40e5de67ce68117fc58802375bb2d61b38d55abb2723320ee639979ab"}}