{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OKWVAW4LOUCJZPMV2BFHRR3WHX","short_pith_number":"pith:OKWVAW4L","canonical_record":{"source":{"id":"1310.0132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-10-01T03:41:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fdff24f95a432fa9049257b53b119b1b63aae8ab40cce8eb19dc8d09cd5bfd14","abstract_canon_sha256":"75e70c28f16d88d4b1963c55f5bdc350bf6b3cbe0e868d23f39e88f580f0f383"},"schema_version":"1.0"},"canonical_sha256":"72ad505b8b75049cbd95d04a78c7763dec1838a637c73887153f4bac06c5d016","source":{"kind":"arxiv","id":"1310.0132","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0132","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0132v1","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0132","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"OKWVAW4LOUCJ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OKWVAW4LOUCJZPMV","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OKWVAW4L","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OKWVAW4LOUCJZPMV2BFHRR3WHX","target":"record","payload":{"canonical_record":{"source":{"id":"1310.0132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-10-01T03:41:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fdff24f95a432fa9049257b53b119b1b63aae8ab40cce8eb19dc8d09cd5bfd14","abstract_canon_sha256":"75e70c28f16d88d4b1963c55f5bdc350bf6b3cbe0e868d23f39e88f580f0f383"},"schema_version":"1.0"},"canonical_sha256":"72ad505b8b75049cbd95d04a78c7763dec1838a637c73887153f4bac06c5d016","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:45.505779Z","signature_b64":"m2zywzqnxyby7Q7IysqClFrz7QuX+otlxvTFFqMIKU9mvhmkwIVWrkG57VTWNFbvEG1TERtB96TvCyXA9UWKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72ad505b8b75049cbd95d04a78c7763dec1838a637c73887153f4bac06c5d016","last_reissued_at":"2026-05-18T03:11:45.504939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:45.504939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.0132","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-18T03:11:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LaIQLxftEj1+AWszZc5t+RBOUGVLERHXw/w/uwTMR+O1e3TOA0V9+hv7vxfa86imUmyVBE25Q+PQxgkjJ3tWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:42:13.635974Z"},"content_sha256":"ae4f7f6e2e36015dacc392f82fd56ed08f8ba595b634d9c21e8974bff689fe8f","schema_version":"1.0","event_id":"sha256:ae4f7f6e2e36015dacc392f82fd56ed08f8ba595b634d9c21e8974bff689fe8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OKWVAW4LOUCJZPMV2BFHRR3WHX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The 4-error linear complexity distribution 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, Jun Liu, Wanquan Liu","submitted_at":"2013-10-01T03:41:28Z","abstract_excerpt":"By using the sieve method of combinatorics, we study $k$-error linear complexity distribution of $2^n$-periodic binary sequences based on Games-Chan algorithm. For $k=4,5$, the complete counting functions on the $k$-error linear complexity of $2^n$-periodic balanced binary sequences (with linear complexity less than $2^n$) are presented. As a consequence of the result, the complete counting functions on the 4-error linear complexity of $2^n$-periodic binary sequences (with linear complexity $2^n$ or less than $2^n$) are obvious. Generally, the complete counting functions on the $k$-error linea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0132","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-18T03:11:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wKxkMpOiPZdiret4byf3IeFwd8crw8NvAglr5jLleKQD3y+rrkCf4nWNf+wwoxcqNPlAifhkRL0cBCHy+hQkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:42:13.636774Z"},"content_sha256":"b25c82f0c1e68115d22fa33db68ebaa2cdf0ac8acac65914a8b2d40743cfb963","schema_version":"1.0","event_id":"sha256:b25c82f0c1e68115d22fa33db68ebaa2cdf0ac8acac65914a8b2d40743cfb963"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX/bundle.json","state_url":"https://pith.science/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX/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-10T07:42:13Z","links":{"resolver":"https://pith.science/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX","bundle":"https://pith.science/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX/bundle.json","state":"https://pith.science/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OKWVAW4LOUCJZPMV2BFHRR3WHX","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":"75e70c28f16d88d4b1963c55f5bdc350bf6b3cbe0e868d23f39e88f580f0f383","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-10-01T03:41:28Z","title_canon_sha256":"fdff24f95a432fa9049257b53b119b1b63aae8ab40cce8eb19dc8d09cd5bfd14"},"schema_version":"1.0","source":{"id":"1310.0132","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0132","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0132v1","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0132","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"OKWVAW4LOUCJ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OKWVAW4LOUCJZPMV","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OKWVAW4L","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:b25c82f0c1e68115d22fa33db68ebaa2cdf0ac8acac65914a8b2d40743cfb963","target":"graph","created_at":"2026-05-18T03:11:45Z","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":"By using the sieve method of combinatorics, we study $k$-error linear complexity distribution of $2^n$-periodic binary sequences based on Games-Chan algorithm. For $k=4,5$, the complete counting functions on the $k$-error linear complexity of $2^n$-periodic balanced binary sequences (with linear complexity less than $2^n$) are presented. As a consequence of the result, the complete counting functions on the 4-error linear complexity of $2^n$-periodic binary sequences (with linear complexity $2^n$ or less than $2^n$) are obvious. Generally, the complete counting functions on the $k$-error linea","authors_text":"Jianqin Zhou, Jun Liu, Wanquan Liu","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-10-01T03:41:28Z","title":"The 4-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":"1310.0132","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:ae4f7f6e2e36015dacc392f82fd56ed08f8ba595b634d9c21e8974bff689fe8f","target":"record","created_at":"2026-05-18T03:11:45Z","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":"75e70c28f16d88d4b1963c55f5bdc350bf6b3cbe0e868d23f39e88f580f0f383","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-10-01T03:41:28Z","title_canon_sha256":"fdff24f95a432fa9049257b53b119b1b63aae8ab40cce8eb19dc8d09cd5bfd14"},"schema_version":"1.0","source":{"id":"1310.0132","kind":"arxiv","version":1}},"canonical_sha256":"72ad505b8b75049cbd95d04a78c7763dec1838a637c73887153f4bac06c5d016","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72ad505b8b75049cbd95d04a78c7763dec1838a637c73887153f4bac06c5d016","first_computed_at":"2026-05-18T03:11:45.504939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:45.504939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m2zywzqnxyby7Q7IysqClFrz7QuX+otlxvTFFqMIKU9mvhmkwIVWrkG57VTWNFbvEG1TERtB96TvCyXA9UWKCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:45.505779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.0132","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae4f7f6e2e36015dacc392f82fd56ed08f8ba595b634d9c21e8974bff689fe8f","sha256:b25c82f0c1e68115d22fa33db68ebaa2cdf0ac8acac65914a8b2d40743cfb963"],"state_sha256":"805eb3b3109c21102a2e3923c399cc6186b6cae4acae971ba71bd36528229711"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tOGTZ/CdS1dPmTfkcx1cULohIxlzsMGyMHBllcjbmB8KTsIVRTXEO3nDj8V/HcjEURlHXKCoYzZplRWqmN1GCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T07:42:13.640855Z","bundle_sha256":"9019c11f3d00919a07b43f4e3a369236039341b439efd504885e4afa0ae205cf"}}