{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OKWVAW4LOUCJZPMV2BFHRR3WHX","short_pith_number":"pith:OKWVAW4L","schema_version":"1.0","canonical_sha256":"72ad505b8b75049cbd95d04a78c7763dec1838a637c73887153f4bac06c5d016","source":{"kind":"arxiv","id":"1310.0132","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.0132","created_at":"2026-05-18T03:11:45.505071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.0132v1","created_at":"2026-05-18T03:11:45.505071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0132","created_at":"2026-05-18T03:11:45.505071+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKWVAW4LOUCJ","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKWVAW4LOUCJZPMV","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKWVAW4L","created_at":"2026-05-18T12:27:54.935989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX","json":"https://pith.science/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX.json","graph_json":"https://pith.science/api/pith-number/OKWVAW4LOUCJZPMV2BFHRR3WHX/graph.json","events_json":"https://pith.science/api/pith-number/OKWVAW4LOUCJZPMV2BFHRR3WHX/events.json","paper":"https://pith.science/paper/OKWVAW4L"},"agent_actions":{"view_html":"https://pith.science/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX","download_json":"https://pith.science/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX.json","view_paper":"https://pith.science/paper/OKWVAW4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.0132&json=true","fetch_graph":"https://pith.science/api/pith-number/OKWVAW4LOUCJZPMV2BFHRR3WHX/graph.json","fetch_events":"https://pith.science/api/pith-number/OKWVAW4LOUCJZPMV2BFHRR3WHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX/action/storage_attestation","attest_author":"https://pith.science/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX/action/author_attestation","sign_citation":"https://pith.science/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX/action/citation_signature","submit_replication":"https://pith.science/pith/OKWVAW4LOUCJZPMV2BFHRR3WHX/action/replication_record"}},"created_at":"2026-05-18T03:11:45.505071+00:00","updated_at":"2026-05-18T03:11:45.505071+00:00"}