{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:I67X6XB64RG65KB6MDCRZIL7ES","short_pith_number":"pith:I67X6XB6","canonical_record":{"source":{"id":"1910.13723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-30T08:54:05Z","cross_cats_sorted":[],"title_canon_sha256":"c0002ce789e79d66e331a20f0d075be01b0da145d19518d1ab0913f1ce0e88d8","abstract_canon_sha256":"eed74a6c51afc93df8ba9bfa668cd2cda181656d6bdf9ace5501d171cb9e81d6"},"schema_version":"1.0"},"canonical_sha256":"47bf7f5c3ee44deea83e60c51ca17f24ae2d38aa8782afb4f2c300d648057175","source":{"kind":"arxiv","id":"1910.13723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.13723","created_at":"2026-07-05T00:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"1910.13723v1","created_at":"2026-07-05T00:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.13723","created_at":"2026-07-05T00:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"I67X6XB64RG6","created_at":"2026-07-05T00:15:55Z"},{"alias_kind":"pith_short_16","alias_value":"I67X6XB64RG65KB6","created_at":"2026-07-05T00:15:55Z"},{"alias_kind":"pith_short_8","alias_value":"I67X6XB6","created_at":"2026-07-05T00:15:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:I67X6XB64RG65KB6MDCRZIL7ES","target":"record","payload":{"canonical_record":{"source":{"id":"1910.13723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-30T08:54:05Z","cross_cats_sorted":[],"title_canon_sha256":"c0002ce789e79d66e331a20f0d075be01b0da145d19518d1ab0913f1ce0e88d8","abstract_canon_sha256":"eed74a6c51afc93df8ba9bfa668cd2cda181656d6bdf9ace5501d171cb9e81d6"},"schema_version":"1.0"},"canonical_sha256":"47bf7f5c3ee44deea83e60c51ca17f24ae2d38aa8782afb4f2c300d648057175","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:55.395055Z","signature_b64":"HtOj8SpenOdx/a6gNngfbP/x1GjCc8JfCzDaMz6/mLCpJ2ix2a6iJvHQcPyQkegIadzl0sGsCE9cJzC3bkGpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47bf7f5c3ee44deea83e60c51ca17f24ae2d38aa8782afb4f2c300d648057175","last_reissued_at":"2026-07-05T00:15:55.394562Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:55.394562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.13723","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-07-05T00:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XMg6jtzwP1OPJC3qw63yuAjhDY+4k7bi26T0BwIQc81IcJnJZpbecNYrbqi73YEKR3IWwGmA/3zz6HGe7duOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T21:06:18.102325Z"},"content_sha256":"9761bd272cf432b34744ba40393290635311fd604ad5293b559a63066626c24e","schema_version":"1.0","event_id":"sha256:9761bd272cf432b34744ba40393290635311fd604ad5293b559a63066626c24e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:I67X6XB64RG65KB6MDCRZIL7ES","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the maximum order complexity of the Thue-Morse and Rudin-Shapiro sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arne Winterhof, Zhimin Sun","submitted_at":"2019-10-30T08:54:05Z","abstract_excerpt":"Expansion complexity and maximum order complexity are both finer measures of pseudorandomness than the linear complexity which is the most prominent quality measure for cryptographic sequences. The expected value of the $N$th maximum order complexity is of order of magnitude $\\log N$ whereas it is easy to find families of sequences with $N$th expansion complexity exponential in $\\log N$. This might lead to the conjecture that the maximum order complexity is a finer measure than the expansion complexity. However, in this paper we provide two examples, the Thue-Morse sequence and the Rudin-Shapi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.13723","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.13723/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6/cUDDAQCbDrQbOq92SlFkalYSUqQJmwRuXml/5bVjb1yAmJ4yWWOPMZTyE4Ptp02ifo+ER5Y2b1+UNZ2hLVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T21:06:18.103280Z"},"content_sha256":"5df361b144edd82ddbe7284f732cc740f28d9b4b41c72b739838b355202f5f69","schema_version":"1.0","event_id":"sha256:5df361b144edd82ddbe7284f732cc740f28d9b4b41c72b739838b355202f5f69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I67X6XB64RG65KB6MDCRZIL7ES/bundle.json","state_url":"https://pith.science/pith/I67X6XB64RG65KB6MDCRZIL7ES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I67X6XB64RG65KB6MDCRZIL7ES/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-08-17T21:06:18Z","links":{"resolver":"https://pith.science/pith/I67X6XB64RG65KB6MDCRZIL7ES","bundle":"https://pith.science/pith/I67X6XB64RG65KB6MDCRZIL7ES/bundle.json","state":"https://pith.science/pith/I67X6XB64RG65KB6MDCRZIL7ES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I67X6XB64RG65KB6MDCRZIL7ES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:I67X6XB64RG65KB6MDCRZIL7ES","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":"eed74a6c51afc93df8ba9bfa668cd2cda181656d6bdf9ace5501d171cb9e81d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-30T08:54:05Z","title_canon_sha256":"c0002ce789e79d66e331a20f0d075be01b0da145d19518d1ab0913f1ce0e88d8"},"schema_version":"1.0","source":{"id":"1910.13723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.13723","created_at":"2026-07-05T00:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"1910.13723v1","created_at":"2026-07-05T00:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.13723","created_at":"2026-07-05T00:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"I67X6XB64RG6","created_at":"2026-07-05T00:15:55Z"},{"alias_kind":"pith_short_16","alias_value":"I67X6XB64RG65KB6","created_at":"2026-07-05T00:15:55Z"},{"alias_kind":"pith_short_8","alias_value":"I67X6XB6","created_at":"2026-07-05T00:15:55Z"}],"graph_snapshots":[{"event_id":"sha256:5df361b144edd82ddbe7284f732cc740f28d9b4b41c72b739838b355202f5f69","target":"graph","created_at":"2026-07-05T00:15:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.13723/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Expansion complexity and maximum order complexity are both finer measures of pseudorandomness than the linear complexity which is the most prominent quality measure for cryptographic sequences. The expected value of the $N$th maximum order complexity is of order of magnitude $\\log N$ whereas it is easy to find families of sequences with $N$th expansion complexity exponential in $\\log N$. This might lead to the conjecture that the maximum order complexity is a finer measure than the expansion complexity. However, in this paper we provide two examples, the Thue-Morse sequence and the Rudin-Shapi","authors_text":"Arne Winterhof, Zhimin Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-30T08:54:05Z","title":"On the maximum order complexity of the Thue-Morse and Rudin-Shapiro sequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.13723","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:9761bd272cf432b34744ba40393290635311fd604ad5293b559a63066626c24e","target":"record","created_at":"2026-07-05T00:15:55Z","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":"eed74a6c51afc93df8ba9bfa668cd2cda181656d6bdf9ace5501d171cb9e81d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-30T08:54:05Z","title_canon_sha256":"c0002ce789e79d66e331a20f0d075be01b0da145d19518d1ab0913f1ce0e88d8"},"schema_version":"1.0","source":{"id":"1910.13723","kind":"arxiv","version":1}},"canonical_sha256":"47bf7f5c3ee44deea83e60c51ca17f24ae2d38aa8782afb4f2c300d648057175","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47bf7f5c3ee44deea83e60c51ca17f24ae2d38aa8782afb4f2c300d648057175","first_computed_at":"2026-07-05T00:15:55.394562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:15:55.394562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HtOj8SpenOdx/a6gNngfbP/x1GjCc8JfCzDaMz6/mLCpJ2ix2a6iJvHQcPyQkegIadzl0sGsCE9cJzC3bkGpDA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:15:55.395055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.13723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9761bd272cf432b34744ba40393290635311fd604ad5293b559a63066626c24e","sha256:5df361b144edd82ddbe7284f732cc740f28d9b4b41c72b739838b355202f5f69"],"state_sha256":"256ce0748f99be107d89f294444957812f3d91fb5f5a504a6cba79b5f400c405"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0TTznkVdxgBURaOFGyy9qHrAO9D/jDtlxI2EQurI2w6qcPRpef8agk7FLZukXpov2xKy6AxlFGm5j+HP7XtGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T21:06:18.109942Z","bundle_sha256":"64cfd1bd9f2a54aeacd951687e8eafe76aa988f14d92bea392ceacf2fca92256"}}