{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CWNKLO4AIQIJKWAONYMHIWXBSB","short_pith_number":"pith:CWNKLO4A","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"},"canonical_sha256":"159aa5bb80441095580e6e18745ae190501605edb461dda048bbc07b25e0839f","source":{"kind":"arxiv","id":"1711.10764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10764","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10764v1","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10764","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"CWNKLO4AIQIJ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CWNKLO4AIQIJKWAO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CWNKLO4A","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CWNKLO4AIQIJKWAONYMHIWXBSB","target":"record","payload":{"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"},"canonical_sha256":"159aa5bb80441095580e6e18745ae190501605edb461dda048bbc07b25e0839f","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"},"source_kind":"arxiv","source_id":"1711.10764","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-18T00:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nQH/tMj9mAoSWtaOcjLDaLOJ1pU1XnhR7VmE+spDAhXUpp6+FPXBau7ypLDIHdrq+gkJjdNAKRyxz5CJSpVdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:11:02.663050Z"},"content_sha256":"141bd27cf5a97fa7e4652f85466cbcaa69ca2990cc45bc2cbb9d892a5e581595","schema_version":"1.0","event_id":"sha256:141bd27cf5a97fa7e4652f85466cbcaa69ca2990cc45bc2cbb9d892a5e581595"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CWNKLO4AIQIJKWAONYMHIWXBSB","target":"graph","payload":{"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"},"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-18T00:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gKRjpzP4hV8IYDI0MOQriufP8h9g9zcVI2368Qfu4QIGXEtdnjPU2WN5GP0gVXx6BjLyh2R6x98e1EU/RYG0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:11:02.663413Z"},"content_sha256":"a2a8db2c99641a1c3fbf087257e6ab305fc99d3c6ef1dc346c2ee8331bdd59a2","schema_version":"1.0","event_id":"sha256:a2a8db2c99641a1c3fbf087257e6ab305fc99d3c6ef1dc346c2ee8331bdd59a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWNKLO4AIQIJKWAONYMHIWXBSB/bundle.json","state_url":"https://pith.science/pith/CWNKLO4AIQIJKWAONYMHIWXBSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWNKLO4AIQIJKWAONYMHIWXBSB/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-12T10:11:02Z","links":{"resolver":"https://pith.science/pith/CWNKLO4AIQIJKWAONYMHIWXBSB","bundle":"https://pith.science/pith/CWNKLO4AIQIJKWAONYMHIWXBSB/bundle.json","state":"https://pith.science/pith/CWNKLO4AIQIJKWAONYMHIWXBSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWNKLO4AIQIJKWAONYMHIWXBSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CWNKLO4AIQIJKWAONYMHIWXBSB","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":"4ebbc2fd72f233664af0aa23c0b3be1fa071a1cd39c8e81cd3159e9a6b33771b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-29T10:37:22Z","title_canon_sha256":"8573b890b2fd6bec02160ccc8996601803981b7843136bee5fbf5c46c2f42726"},"schema_version":"1.0","source":{"id":"1711.10764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10764","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10764v1","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10764","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"CWNKLO4AIQIJ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CWNKLO4AIQIJKWAO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CWNKLO4A","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:a2a8db2c99641a1c3fbf087257e6ab305fc99d3c6ef1dc346c2ee8331bdd59a2","target":"graph","created_at":"2026-05-18T00:29:17Z","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 $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","authors_text":"Arne Winterhof, L\\'aszl\\'o M\\'erai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-29T10:37:22Z","title":"On the $N$th linear complexity of automatic sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10764","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:141bd27cf5a97fa7e4652f85466cbcaa69ca2990cc45bc2cbb9d892a5e581595","target":"record","created_at":"2026-05-18T00:29:17Z","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":"4ebbc2fd72f233664af0aa23c0b3be1fa071a1cd39c8e81cd3159e9a6b33771b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-29T10:37:22Z","title_canon_sha256":"8573b890b2fd6bec02160ccc8996601803981b7843136bee5fbf5c46c2f42726"},"schema_version":"1.0","source":{"id":"1711.10764","kind":"arxiv","version":1}},"canonical_sha256":"159aa5bb80441095580e6e18745ae190501605edb461dda048bbc07b25e0839f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"159aa5bb80441095580e6e18745ae190501605edb461dda048bbc07b25e0839f","first_computed_at":"2026-05-18T00:29:17.035068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:17.035068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AH9+gZM656FWrJvlqm15zw8/R/Ds3DgleDijHG+p2bY+84YqMDrHyXDXTKuXy8AX03QH4gkTV0RCzy8WFUqrAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:17.035759Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:141bd27cf5a97fa7e4652f85466cbcaa69ca2990cc45bc2cbb9d892a5e581595","sha256:a2a8db2c99641a1c3fbf087257e6ab305fc99d3c6ef1dc346c2ee8331bdd59a2"],"state_sha256":"188f24a780e2f3864ab84e3f808a556e39399417a0442a00781fed6a31a2ff66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QoqaBhCF/eGm1BoHGdI6Aa+Aa5rMUwnFBAQiwtT2T7VZJUuNlmk55i9BC/SHWpsFqoEd16Wxdsf61FUUY9sbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:11:02.665342Z","bundle_sha256":"589deefc90b61ca1c69dac290cb9e27595310c509c9dece782755b0dea8638ee"}}