{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CWNKLO4AIQIJKWAONYMHIWXBSB","short_pith_number":"pith:CWNKLO4A","schema_version":"1.0","canonical_sha256":"159aa5bb80441095580e6e18745ae190501605edb461dda048bbc07b25e0839f","source":{"kind":"arxiv","id":"1711.10764","version":1},"attestation_state":"computed","paper":{"title":"On the $N$th linear complexity of automatic sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Arne Winterhof, L\\'aszl\\'o M\\'erai","submitted_at":"2017-11-29T10:37:22Z","abstract_excerpt":"The $N$th linear complexity of a sequence is a measure of predictability. Any unpredictable sequence must have large $N$th linear complexity. However, in this paper we show that for $q$-automatic sequences over $\\mathbb{F}_q$ the converse is not true.\n  We prove that any (not ultimately periodic) $q$-automatic sequence over $\\mathbb{F}_q$ has $N$th linear complexity of order of magnitude $N$. For some famous sequences including the Thue--Morse and Rudin--Shapiro sequence we determine the exact values of their $N$th linear complexities. These are non-trivial examples of predictable sequences wi"},"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":"1711.10764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-29T10:37:22Z","cross_cats_sorted":[],"title_canon_sha256":"8573b890b2fd6bec02160ccc8996601803981b7843136bee5fbf5c46c2f42726","abstract_canon_sha256":"4ebbc2fd72f233664af0aa23c0b3be1fa071a1cd39c8e81cd3159e9a6b33771b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:17.035759Z","signature_b64":"AH9+gZM656FWrJvlqm15zw8/R/Ds3DgleDijHG+p2bY+84YqMDrHyXDXTKuXy8AX03QH4gkTV0RCzy8WFUqrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"159aa5bb80441095580e6e18745ae190501605edb461dda048bbc07b25e0839f","last_reissued_at":"2026-05-18T00:29:17.035068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:17.035068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the $N$th linear complexity of automatic sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Arne Winterhof, L\\'aszl\\'o M\\'erai","submitted_at":"2017-11-29T10:37:22Z","abstract_excerpt":"The $N$th linear complexity of a sequence is a measure of predictability. Any unpredictable sequence must have large $N$th linear complexity. However, in this paper we show that for $q$-automatic sequences over $\\mathbb{F}_q$ the converse is not true.\n  We prove that any (not ultimately periodic) $q$-automatic sequence over $\\mathbb{F}_q$ has $N$th linear complexity of order of magnitude $N$. For some famous sequences including the Thue--Morse and Rudin--Shapiro sequence we determine the exact values of their $N$th linear complexities. These are non-trivial examples of predictable sequences wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10764","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":"1711.10764","created_at":"2026-05-18T00:29:17.035178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10764v1","created_at":"2026-05-18T00:29:17.035178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10764","created_at":"2026-05-18T00:29:17.035178+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWNKLO4AIQIJ","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWNKLO4AIQIJKWAO","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWNKLO4A","created_at":"2026-05-18T12:31:10.602751+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/CWNKLO4AIQIJKWAONYMHIWXBSB","json":"https://pith.science/pith/CWNKLO4AIQIJKWAONYMHIWXBSB.json","graph_json":"https://pith.science/api/pith-number/CWNKLO4AIQIJKWAONYMHIWXBSB/graph.json","events_json":"https://pith.science/api/pith-number/CWNKLO4AIQIJKWAONYMHIWXBSB/events.json","paper":"https://pith.science/paper/CWNKLO4A"},"agent_actions":{"view_html":"https://pith.science/pith/CWNKLO4AIQIJKWAONYMHIWXBSB","download_json":"https://pith.science/pith/CWNKLO4AIQIJKWAONYMHIWXBSB.json","view_paper":"https://pith.science/paper/CWNKLO4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10764&json=true","fetch_graph":"https://pith.science/api/pith-number/CWNKLO4AIQIJKWAONYMHIWXBSB/graph.json","fetch_events":"https://pith.science/api/pith-number/CWNKLO4AIQIJKWAONYMHIWXBSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWNKLO4AIQIJKWAONYMHIWXBSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWNKLO4AIQIJKWAONYMHIWXBSB/action/storage_attestation","attest_author":"https://pith.science/pith/CWNKLO4AIQIJKWAONYMHIWXBSB/action/author_attestation","sign_citation":"https://pith.science/pith/CWNKLO4AIQIJKWAONYMHIWXBSB/action/citation_signature","submit_replication":"https://pith.science/pith/CWNKLO4AIQIJKWAONYMHIWXBSB/action/replication_record"}},"created_at":"2026-05-18T00:29:17.035178+00:00","updated_at":"2026-05-18T00:29:17.035178+00:00"}