{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WHHZQQQL67YOE3N2HZLJAJIFC2","short_pith_number":"pith:WHHZQQQL","canonical_record":{"source":{"id":"1112.6047","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2011-12-28T02:57:58Z","cross_cats_sorted":[],"title_canon_sha256":"2c5a29f8ab2cc71f5153899b123c99aa637137799a1322d580522ac0b47a4cbd","abstract_canon_sha256":"8ac85cafdb463ffab207d6c9651487982798bea9c7ca6845668bcb50abef169f"},"schema_version":"1.0"},"canonical_sha256":"b1cf98420bf7f0e26dba3e5690250516943676681fb9f0378400436f738cb84c","source":{"kind":"arxiv","id":"1112.6047","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6047","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6047v1","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6047","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"WHHZQQQL67YO","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WHHZQQQL67YOE3N2","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WHHZQQQL","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WHHZQQQL67YOE3N2HZLJAJIFC2","target":"record","payload":{"canonical_record":{"source":{"id":"1112.6047","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2011-12-28T02:57:58Z","cross_cats_sorted":[],"title_canon_sha256":"2c5a29f8ab2cc71f5153899b123c99aa637137799a1322d580522ac0b47a4cbd","abstract_canon_sha256":"8ac85cafdb463ffab207d6c9651487982798bea9c7ca6845668bcb50abef169f"},"schema_version":"1.0"},"canonical_sha256":"b1cf98420bf7f0e26dba3e5690250516943676681fb9f0378400436f738cb84c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:36.992058Z","signature_b64":"avK7/bTn9oFtJi/IEtHLGScaSt8V4BziUO08zm03TmGdoTkDG0mZV3OT3upAqEc5hMNZkJFaDEtaZidZTLNoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1cf98420bf7f0e26dba3e5690250516943676681fb9f0378400436f738cb84c","last_reissued_at":"2026-05-18T04:05:36.991547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:36.991547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.6047","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:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"En7WCg/txBzzf86EDhs+VP3v1BcooXmISTpIUHNIFUNC3OV2aSYg/Gx0wQMrjj1YnbynkKXiEMnpT8HHXiLeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:19:34.014122Z"},"content_sha256":"3ed097c340b75e5c6794a6da06cb917dd9d80897fd38d70754495e11ae40de38","schema_version":"1.0","event_id":"sha256:3ed097c340b75e5c6794a6da06cb917dd9d80897fd38d70754495e11ae40de38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WHHZQQQL67YOE3N2HZLJAJIFC2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterization of $2^n$-periodic binary sequences with fixed 3-error or 4-error linear complexity","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jianqin Zhou, Jun Liu, Wanquan Liu","submitted_at":"2011-12-28T02:57:58Z","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 using the sieve method of combinatorics, the $k$-error linear complexity distribution of $2^n$-periodic binary sequences is investigated based on Games-Chan algorithm.\n  First, for $k=2,3$, the complete counting functions on the $k$-error linear complexity of $2^n$-periodic binary sequences with linear complexity less than $2^n$ are characterized. Second, for $k=3,4$, the complete counting functions o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6047","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:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MTSGCys2cIhu5uGMCT1C7wU0yLRFc16YFJdiqyLINmnx6Otclzt41xRlHww1EA9FLwOTzxLa4Wo5r7SlL7fXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:19:34.014920Z"},"content_sha256":"aea85001904b4fdb7420b3f0cc6c3e01b4acabe2ca744ce543f84a8748eed68b","schema_version":"1.0","event_id":"sha256:aea85001904b4fdb7420b3f0cc6c3e01b4acabe2ca744ce543f84a8748eed68b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHHZQQQL67YOE3N2HZLJAJIFC2/bundle.json","state_url":"https://pith.science/pith/WHHZQQQL67YOE3N2HZLJAJIFC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHHZQQQL67YOE3N2HZLJAJIFC2/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-09T19:19:34Z","links":{"resolver":"https://pith.science/pith/WHHZQQQL67YOE3N2HZLJAJIFC2","bundle":"https://pith.science/pith/WHHZQQQL67YOE3N2HZLJAJIFC2/bundle.json","state":"https://pith.science/pith/WHHZQQQL67YOE3N2HZLJAJIFC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHHZQQQL67YOE3N2HZLJAJIFC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WHHZQQQL67YOE3N2HZLJAJIFC2","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":"8ac85cafdb463ffab207d6c9651487982798bea9c7ca6845668bcb50abef169f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2011-12-28T02:57:58Z","title_canon_sha256":"2c5a29f8ab2cc71f5153899b123c99aa637137799a1322d580522ac0b47a4cbd"},"schema_version":"1.0","source":{"id":"1112.6047","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6047","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6047v1","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6047","created_at":"2026-05-18T04:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"WHHZQQQL67YO","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WHHZQQQL67YOE3N2","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WHHZQQQL","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:aea85001904b4fdb7420b3f0cc6c3e01b4acabe2ca744ce543f84a8748eed68b","target":"graph","created_at":"2026-05-18T04:05:36Z","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 using the sieve method of combinatorics, the $k$-error linear complexity distribution of $2^n$-periodic binary sequences is investigated based on Games-Chan algorithm.\n  First, for $k=2,3$, the complete counting functions on the $k$-error linear complexity of $2^n$-periodic binary sequences with linear complexity less than $2^n$ are characterized. Second, for $k=3,4$, the complete counting functions o","authors_text":"Jianqin Zhou, Jun Liu, Wanquan Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2011-12-28T02:57:58Z","title":"Characterization of $2^n$-periodic binary sequences with fixed 3-error or 4-error linear complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6047","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:3ed097c340b75e5c6794a6da06cb917dd9d80897fd38d70754495e11ae40de38","target":"record","created_at":"2026-05-18T04:05:36Z","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":"8ac85cafdb463ffab207d6c9651487982798bea9c7ca6845668bcb50abef169f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2011-12-28T02:57:58Z","title_canon_sha256":"2c5a29f8ab2cc71f5153899b123c99aa637137799a1322d580522ac0b47a4cbd"},"schema_version":"1.0","source":{"id":"1112.6047","kind":"arxiv","version":1}},"canonical_sha256":"b1cf98420bf7f0e26dba3e5690250516943676681fb9f0378400436f738cb84c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1cf98420bf7f0e26dba3e5690250516943676681fb9f0378400436f738cb84c","first_computed_at":"2026-05-18T04:05:36.991547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:36.991547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"avK7/bTn9oFtJi/IEtHLGScaSt8V4BziUO08zm03TmGdoTkDG0mZV3OT3upAqEc5hMNZkJFaDEtaZidZTLNoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:36.992058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.6047","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ed097c340b75e5c6794a6da06cb917dd9d80897fd38d70754495e11ae40de38","sha256:aea85001904b4fdb7420b3f0cc6c3e01b4acabe2ca744ce543f84a8748eed68b"],"state_sha256":"eec5da4ac2b1bf3d259b37e0806ed200dc9c5a17f0f81f6a74bce034d2c30814"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3MNzkid4/kW9Gq3HswFY7qOVnMDxkKaMyVFPxOvVrMZzboRTL5ccTTjwjPcVRJabJkRsv3ifTQBlV/BgbLCqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:19:34.019773Z","bundle_sha256":"6fb205ff25d223fd536441023d0e689b8c53155dabbb28fff3e923bb055dfdb2"}}