{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:W2ADV46B3W3I6GEOPZFXF3XFQ5","short_pith_number":"pith:W2ADV46B","canonical_record":{"source":{"id":"1108.5793","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-08-30T01:39:11Z","cross_cats_sorted":[],"title_canon_sha256":"76790171bd10dfc178e860a12db3cd7df2b6b10f725ebe9c8a0b6162d49ece0a","abstract_canon_sha256":"b853887ec1762ebb65498a5b8b055cdbbc133aac602bdb0c882df367322ad734"},"schema_version":"1.0"},"canonical_sha256":"b6803af3c1ddb68f188e7e4b72eee5876620051cfc6d1a8b89c7448e25e2272a","source":{"kind":"arxiv","id":"1108.5793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5793","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5793v1","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5793","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"W2ADV46B3W3I","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"W2ADV46B3W3I6GEO","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"W2ADV46B","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:W2ADV46B3W3I6GEOPZFXF3XFQ5","target":"record","payload":{"canonical_record":{"source":{"id":"1108.5793","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-08-30T01:39:11Z","cross_cats_sorted":[],"title_canon_sha256":"76790171bd10dfc178e860a12db3cd7df2b6b10f725ebe9c8a0b6162d49ece0a","abstract_canon_sha256":"b853887ec1762ebb65498a5b8b055cdbbc133aac602bdb0c882df367322ad734"},"schema_version":"1.0"},"canonical_sha256":"b6803af3c1ddb68f188e7e4b72eee5876620051cfc6d1a8b89c7448e25e2272a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:28.603245Z","signature_b64":"yEldR6/rpO29SP2TgygIYJXhAh7m4A0Z/g475VSMbpOApgVUU34I2nb/ep3nrJ5WS2QSzbnARlkzdEzcXLa5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6803af3c1ddb68f188e7e4b72eee5876620051cfc6d1a8b89c7448e25e2272a","last_reissued_at":"2026-05-18T04:14:28.602751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:28.602751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.5793","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:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PbgTYSXVeEnG5WjyVfWXDOmT/NnftCOq++SlsSf1oaQOYP9q8awbjp8rOOHuRwgYbgIBJ+zzjac99lOv6sUZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:40:01.960548Z"},"content_sha256":"67fbef8629315e948c559cc6d9f03c0784c34300e08d67d797a120fa3f1eb619","schema_version":"1.0","event_id":"sha256:67fbef8629315e948c559cc6d9f03c0784c34300e08d67d797a120fa3f1eb619"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:W2ADV46B3W3I6GEOPZFXF3XFQ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The $k$-error linear complexity distribution for $2^n$-periodic binary sequences","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jianqin Zhou, Wanquan Liu","submitted_at":"2011-08-30T01:39:11Z","abstract_excerpt":"The linear complexity and the $k$-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By studying the linear complexity of binary sequences with period $2^n$, one could convert the computation of $k$-error linear complexity into finding error sequences with minimal Hamming weight. Based on Games-Chan algorithm, the $k$-error linear complexity distribution of $2^n$-periodic binary sequences is investigated in this paper. First, for $k=2,3$, the complete counting functions on the $k$-error "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5793","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:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ozyWaD+YwyEZ1Oxo4HZR7VtmNd1HlSvHRv2Kl7+L7F3OENHDr60YPcB2tlwlf4q07Eel/L2oHrJo0pxqDPOpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:40:01.961050Z"},"content_sha256":"90c1ce8de970a8afbe53392a5ac80b9070c404dfa2e3ee6b10506ffd217fff7f","schema_version":"1.0","event_id":"sha256:90c1ce8de970a8afbe53392a5ac80b9070c404dfa2e3ee6b10506ffd217fff7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W2ADV46B3W3I6GEOPZFXF3XFQ5/bundle.json","state_url":"https://pith.science/pith/W2ADV46B3W3I6GEOPZFXF3XFQ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W2ADV46B3W3I6GEOPZFXF3XFQ5/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-10T05:40:01Z","links":{"resolver":"https://pith.science/pith/W2ADV46B3W3I6GEOPZFXF3XFQ5","bundle":"https://pith.science/pith/W2ADV46B3W3I6GEOPZFXF3XFQ5/bundle.json","state":"https://pith.science/pith/W2ADV46B3W3I6GEOPZFXF3XFQ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W2ADV46B3W3I6GEOPZFXF3XFQ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:W2ADV46B3W3I6GEOPZFXF3XFQ5","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":"b853887ec1762ebb65498a5b8b055cdbbc133aac602bdb0c882df367322ad734","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-08-30T01:39:11Z","title_canon_sha256":"76790171bd10dfc178e860a12db3cd7df2b6b10f725ebe9c8a0b6162d49ece0a"},"schema_version":"1.0","source":{"id":"1108.5793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5793","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5793v1","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5793","created_at":"2026-05-18T04:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"W2ADV46B3W3I","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"W2ADV46B3W3I6GEO","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"W2ADV46B","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:90c1ce8de970a8afbe53392a5ac80b9070c404dfa2e3ee6b10506ffd217fff7f","target":"graph","created_at":"2026-05-18T04:14:28Z","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 the $k$-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By studying the linear complexity of binary sequences with period $2^n$, one could convert the computation of $k$-error linear complexity into finding error sequences with minimal Hamming weight. Based on Games-Chan algorithm, the $k$-error linear complexity distribution of $2^n$-periodic binary sequences is investigated in this paper. First, for $k=2,3$, the complete counting functions on the $k$-error ","authors_text":"Jianqin Zhou, Wanquan Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-08-30T01:39:11Z","title":"The $k$-error linear complexity distribution for $2^n$-periodic binary sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5793","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:67fbef8629315e948c559cc6d9f03c0784c34300e08d67d797a120fa3f1eb619","target":"record","created_at":"2026-05-18T04:14:28Z","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":"b853887ec1762ebb65498a5b8b055cdbbc133aac602bdb0c882df367322ad734","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CR","submitted_at":"2011-08-30T01:39:11Z","title_canon_sha256":"76790171bd10dfc178e860a12db3cd7df2b6b10f725ebe9c8a0b6162d49ece0a"},"schema_version":"1.0","source":{"id":"1108.5793","kind":"arxiv","version":1}},"canonical_sha256":"b6803af3c1ddb68f188e7e4b72eee5876620051cfc6d1a8b89c7448e25e2272a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6803af3c1ddb68f188e7e4b72eee5876620051cfc6d1a8b89c7448e25e2272a","first_computed_at":"2026-05-18T04:14:28.602751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:28.602751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yEldR6/rpO29SP2TgygIYJXhAh7m4A0Z/g475VSMbpOApgVUU34I2nb/ep3nrJ5WS2QSzbnARlkzdEzcXLa5Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:28.603245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.5793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67fbef8629315e948c559cc6d9f03c0784c34300e08d67d797a120fa3f1eb619","sha256:90c1ce8de970a8afbe53392a5ac80b9070c404dfa2e3ee6b10506ffd217fff7f"],"state_sha256":"865449bc69e9ce8da6f3b255777b4123d73b0490fd951535e2b6566912a33825"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QsC5/efGLOP5YL4hBsEwyyPlQV2cWcEGA2lwl7SCl25QUdCgMK0Ns3La7v4jR4ARxZVLLUVKZUSJIkn314TWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T05:40:01.964932Z","bundle_sha256":"968c4604d1ab5bb96936c760e7373a55b601a4867c48657a37bf370924f3849e"}}