{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VWVPUG7KOIYC5SACN6D62PCAES","short_pith_number":"pith:VWVPUG7K","canonical_record":{"source":{"id":"1402.5472","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-02-22T03:26:54Z","cross_cats_sorted":[],"title_canon_sha256":"f3f62062fc5f0b30b0a02ffbb28fcd9e45955d85ee290c29f010b28a292adc53","abstract_canon_sha256":"0ed423df05ddce0f0cc324c70d4cdd65f146d232076a60ecda1a0b777acf730d"},"schema_version":"1.0"},"canonical_sha256":"adaafa1bea72302ec8026f87ed3c4024bf8fbe746bfd8a104c4298e357397863","source":{"kind":"arxiv","id":"1402.5472","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5472","created_at":"2026-05-18T02:45:23Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5472v2","created_at":"2026-05-18T02:45:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5472","created_at":"2026-05-18T02:45:23Z"},{"alias_kind":"pith_short_12","alias_value":"VWVPUG7KOIYC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VWVPUG7KOIYC5SAC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VWVPUG7K","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VWVPUG7KOIYC5SACN6D62PCAES","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5472","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-02-22T03:26:54Z","cross_cats_sorted":[],"title_canon_sha256":"f3f62062fc5f0b30b0a02ffbb28fcd9e45955d85ee290c29f010b28a292adc53","abstract_canon_sha256":"0ed423df05ddce0f0cc324c70d4cdd65f146d232076a60ecda1a0b777acf730d"},"schema_version":"1.0"},"canonical_sha256":"adaafa1bea72302ec8026f87ed3c4024bf8fbe746bfd8a104c4298e357397863","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:23.205875Z","signature_b64":"c43XtGOmBXmNHTaLC2P9or7CkbQ3pxibHb0xDY8fntdWP4m+tb6GbC038m28lSALV2dkliUREgwiHAvShqTGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adaafa1bea72302ec8026f87ed3c4024bf8fbe746bfd8a104c4298e357397863","last_reissued_at":"2026-05-18T02:45:23.205421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:23.205421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5472","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:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ejrw6Hzir4ZPQ/wegRofgBFGibqsbrtfCdArdXZA+MW1tD+GBNIC/WqRE5lTrSQci4wyFMnhsEKzODrPG0qeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:26:47.984242Z"},"content_sha256":"0e69dcecc45e180eb2651af1d264af5c3b48365140353aa33dd49c6212378c6d","schema_version":"1.0","event_id":"sha256:0e69dcecc45e180eb2651af1d264af5c3b48365140353aa33dd49c6212378c6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VWVPUG7KOIYC5SACN6D62PCAES","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the $k$-error linear complexity for $p^n$-periodic binary sequences via hypercube theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Guanglu Zhou, Jianqin Zhou, Wanquan Liu","submitted_at":"2014-02-22T03:26:54Z","abstract_excerpt":"The linear complexity and the $k$-error linear complexity of a binary sequence are important security measures for key stream strength. By studying binary sequences with the minimum Hamming weight, a new tool named as hypercube theory is developed for $p^n$-periodic binary sequences. In fact, hypercube theory is based on a typical sequence decomposition and it is a very important tool in investigating the critical error linear complexity spectrum proposed by Etzion et al. To demonstrate the importance of hypercube theory, we first give a standard hypercube decomposition based on a well-known a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5472","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:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q19NGBBfO5FiOsZe3reeWmYFNZFs1GmD7bsUqzGl5Aq0AcVNDies0cdVAGwzltE8PKxcbh35CQn8RcJ1f5XpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:26:47.985014Z"},"content_sha256":"e2b77e968ccd09d3b67e4283e059085f3c544ab467fa206cd08aae53d440a336","schema_version":"1.0","event_id":"sha256:e2b77e968ccd09d3b67e4283e059085f3c544ab467fa206cd08aae53d440a336"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VWVPUG7KOIYC5SACN6D62PCAES/bundle.json","state_url":"https://pith.science/pith/VWVPUG7KOIYC5SACN6D62PCAES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VWVPUG7KOIYC5SACN6D62PCAES/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:26:47Z","links":{"resolver":"https://pith.science/pith/VWVPUG7KOIYC5SACN6D62PCAES","bundle":"https://pith.science/pith/VWVPUG7KOIYC5SACN6D62PCAES/bundle.json","state":"https://pith.science/pith/VWVPUG7KOIYC5SACN6D62PCAES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VWVPUG7KOIYC5SACN6D62PCAES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VWVPUG7KOIYC5SACN6D62PCAES","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":"0ed423df05ddce0f0cc324c70d4cdd65f146d232076a60ecda1a0b777acf730d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-02-22T03:26:54Z","title_canon_sha256":"f3f62062fc5f0b30b0a02ffbb28fcd9e45955d85ee290c29f010b28a292adc53"},"schema_version":"1.0","source":{"id":"1402.5472","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5472","created_at":"2026-05-18T02:45:23Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5472v2","created_at":"2026-05-18T02:45:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5472","created_at":"2026-05-18T02:45:23Z"},{"alias_kind":"pith_short_12","alias_value":"VWVPUG7KOIYC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VWVPUG7KOIYC5SAC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VWVPUG7K","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:e2b77e968ccd09d3b67e4283e059085f3c544ab467fa206cd08aae53d440a336","target":"graph","created_at":"2026-05-18T02:45:23Z","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 binary sequence are important security measures for key stream strength. By studying binary sequences with the minimum Hamming weight, a new tool named as hypercube theory is developed for $p^n$-periodic binary sequences. In fact, hypercube theory is based on a typical sequence decomposition and it is a very important tool in investigating the critical error linear complexity spectrum proposed by Etzion et al. To demonstrate the importance of hypercube theory, we first give a standard hypercube decomposition based on a well-known a","authors_text":"Guanglu Zhou, Jianqin Zhou, Wanquan Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-02-22T03:26:54Z","title":"On the $k$-error linear complexity for $p^n$-periodic binary sequences via hypercube theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5472","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:0e69dcecc45e180eb2651af1d264af5c3b48365140353aa33dd49c6212378c6d","target":"record","created_at":"2026-05-18T02:45:23Z","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":"0ed423df05ddce0f0cc324c70d4cdd65f146d232076a60ecda1a0b777acf730d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-02-22T03:26:54Z","title_canon_sha256":"f3f62062fc5f0b30b0a02ffbb28fcd9e45955d85ee290c29f010b28a292adc53"},"schema_version":"1.0","source":{"id":"1402.5472","kind":"arxiv","version":2}},"canonical_sha256":"adaafa1bea72302ec8026f87ed3c4024bf8fbe746bfd8a104c4298e357397863","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adaafa1bea72302ec8026f87ed3c4024bf8fbe746bfd8a104c4298e357397863","first_computed_at":"2026-05-18T02:45:23.205421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:23.205421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c43XtGOmBXmNHTaLC2P9or7CkbQ3pxibHb0xDY8fntdWP4m+tb6GbC038m28lSALV2dkliUREgwiHAvShqTGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:23.205875Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5472","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e69dcecc45e180eb2651af1d264af5c3b48365140353aa33dd49c6212378c6d","sha256:e2b77e968ccd09d3b67e4283e059085f3c544ab467fa206cd08aae53d440a336"],"state_sha256":"7dc7f24d0b94077ed9f4c3540cce37b244e801bb3948e0d1a6af3c8b398ecf3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fO4bIWWFsvyrxVtVqotsALImR4DhdK6lC4R7uGAJFExE/2jqDiGyTOlybacnKlX6fSTmyrKpZGiHsMREpeKtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:26:47.989626Z","bundle_sha256":"6745fac749057229d80e74f342f68d3e546deac183b95d23aca7241601e1c559"}}