{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PQYVF6NIFY2QNWWUNKTUSGVAF2","short_pith_number":"pith:PQYVF6NI","canonical_record":{"source":{"id":"1009.5357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-09-27T19:04:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"eaef54ff9c74e7ec524cef9f7b66ca10bf755d14f8f3fabf383361f0c005c241","abstract_canon_sha256":"a9587d0bc1078e93c5ef58862bc2b6a8bd8871bbe37cf2a83af9c950a6a6c7e6"},"schema_version":"1.0"},"canonical_sha256":"7c3152f9a82e3506dad46aa7491aa02e9d85b01cf147f2c1e402feb5843b11d9","source":{"kind":"arxiv","id":"1009.5357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5357","created_at":"2026-05-18T04:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5357v1","created_at":"2026-05-18T04:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5357","created_at":"2026-05-18T04:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"PQYVF6NIFY2Q","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PQYVF6NIFY2QNWWU","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PQYVF6NI","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PQYVF6NIFY2QNWWUNKTUSGVAF2","target":"record","payload":{"canonical_record":{"source":{"id":"1009.5357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-09-27T19:04:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"eaef54ff9c74e7ec524cef9f7b66ca10bf755d14f8f3fabf383361f0c005c241","abstract_canon_sha256":"a9587d0bc1078e93c5ef58862bc2b6a8bd8871bbe37cf2a83af9c950a6a6c7e6"},"schema_version":"1.0"},"canonical_sha256":"7c3152f9a82e3506dad46aa7491aa02e9d85b01cf147f2c1e402feb5843b11d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:18.705988Z","signature_b64":"lncYWjLeAALKXa1an1+WcvMgpW4ubKmwuJJhlW/INDC6J2z1K9FFIc5MIglBcuKC8TZaJTbIP5/WDYK5nOLuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c3152f9a82e3506dad46aa7491aa02e9d85b01cf147f2c1e402feb5843b11d9","last_reissued_at":"2026-05-18T04:40:18.705254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:18.705254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.5357","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-18T04:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sq4t9pDREcupM7HVJhada/dQn7Eeuv3RkMPsNLtoMb752s7tPRbsEEA225FD/fyCT7Q8j8mUTenU5RnzKlRHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:29:48.925626Z"},"content_sha256":"c1f675ab5b17b56278e2ef32fcfcd841154c4284cf2fb898b30ba5899ef2611c","schema_version":"1.0","event_id":"sha256:c1f675ab5b17b56278e2ef32fcfcd841154c4284cf2fb898b30ba5899ef2611c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PQYVF6NIFY2QNWWUNKTUSGVAF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Thue-Morse at Multiples of an Integer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Jeffrey Shallit, Johannes F. Morgenbesser, Thomas Stoll","submitted_at":"2010-09-27T19:04:22Z","abstract_excerpt":"Let (t_n) be the classical Thue-Morse sequence defined by t_n = s_2(n) (mod 2), where s_2 is the sum of the bits in the binary representation of n. It is well known that for any integer k>=1 the frequency of the letter \"1\" in the subsequence t_0, t_k, t_{2k}, ... is asymptotically 1/2. Here we prove that for any k there is a n<=k+4 such that t_{kn}=1. Moreover, we show that n can be chosen to have Hamming weight <=3. This is best in a twofold sense. First, there are infinitely many k such that t_{kn}=1 implies that n has Hamming weight >=3. Second, we characterize all k where the minimal n equ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5357","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-18T04:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5Oa4WKBbOTKH+jJzqHrCHkbySqQ77m8kseiOVoupYoOEckzExLTRLduVkXUQTXX3vmKohL5imkKKch+gOY0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:29:48.925993Z"},"content_sha256":"1611f67465d82708cd3062c3a25a43e026aa5a7280c57768c001d9ad8cfb552a","schema_version":"1.0","event_id":"sha256:1611f67465d82708cd3062c3a25a43e026aa5a7280c57768c001d9ad8cfb552a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PQYVF6NIFY2QNWWUNKTUSGVAF2/bundle.json","state_url":"https://pith.science/pith/PQYVF6NIFY2QNWWUNKTUSGVAF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PQYVF6NIFY2QNWWUNKTUSGVAF2/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-04T21:29:48Z","links":{"resolver":"https://pith.science/pith/PQYVF6NIFY2QNWWUNKTUSGVAF2","bundle":"https://pith.science/pith/PQYVF6NIFY2QNWWUNKTUSGVAF2/bundle.json","state":"https://pith.science/pith/PQYVF6NIFY2QNWWUNKTUSGVAF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PQYVF6NIFY2QNWWUNKTUSGVAF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PQYVF6NIFY2QNWWUNKTUSGVAF2","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":"a9587d0bc1078e93c5ef58862bc2b6a8bd8871bbe37cf2a83af9c950a6a6c7e6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-09-27T19:04:22Z","title_canon_sha256":"eaef54ff9c74e7ec524cef9f7b66ca10bf755d14f8f3fabf383361f0c005c241"},"schema_version":"1.0","source":{"id":"1009.5357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5357","created_at":"2026-05-18T04:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5357v1","created_at":"2026-05-18T04:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5357","created_at":"2026-05-18T04:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"PQYVF6NIFY2Q","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PQYVF6NIFY2QNWWU","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PQYVF6NI","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:1611f67465d82708cd3062c3a25a43e026aa5a7280c57768c001d9ad8cfb552a","target":"graph","created_at":"2026-05-18T04:40:18Z","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":"Let (t_n) be the classical Thue-Morse sequence defined by t_n = s_2(n) (mod 2), where s_2 is the sum of the bits in the binary representation of n. It is well known that for any integer k>=1 the frequency of the letter \"1\" in the subsequence t_0, t_k, t_{2k}, ... is asymptotically 1/2. Here we prove that for any k there is a n<=k+4 such that t_{kn}=1. Moreover, we show that n can be chosen to have Hamming weight <=3. This is best in a twofold sense. First, there are infinitely many k such that t_{kn}=1 implies that n has Hamming weight >=3. Second, we characterize all k where the minimal n equ","authors_text":"Jeffrey Shallit, Johannes F. Morgenbesser, Thomas Stoll","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-09-27T19:04:22Z","title":"Thue-Morse at Multiples of an Integer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5357","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:c1f675ab5b17b56278e2ef32fcfcd841154c4284cf2fb898b30ba5899ef2611c","target":"record","created_at":"2026-05-18T04:40:18Z","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":"a9587d0bc1078e93c5ef58862bc2b6a8bd8871bbe37cf2a83af9c950a6a6c7e6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-09-27T19:04:22Z","title_canon_sha256":"eaef54ff9c74e7ec524cef9f7b66ca10bf755d14f8f3fabf383361f0c005c241"},"schema_version":"1.0","source":{"id":"1009.5357","kind":"arxiv","version":1}},"canonical_sha256":"7c3152f9a82e3506dad46aa7491aa02e9d85b01cf147f2c1e402feb5843b11d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c3152f9a82e3506dad46aa7491aa02e9d85b01cf147f2c1e402feb5843b11d9","first_computed_at":"2026-05-18T04:40:18.705254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:18.705254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lncYWjLeAALKXa1an1+WcvMgpW4ubKmwuJJhlW/INDC6J2z1K9FFIc5MIglBcuKC8TZaJTbIP5/WDYK5nOLuAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:18.705988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.5357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1f675ab5b17b56278e2ef32fcfcd841154c4284cf2fb898b30ba5899ef2611c","sha256:1611f67465d82708cd3062c3a25a43e026aa5a7280c57768c001d9ad8cfb552a"],"state_sha256":"ae26fe924b265ad61185d5b29f2ba01dd7fc0a15032ce39c67f7fdefbfd11234"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hji39vHX6bLAp20OjsdKIVl1tJkBxbGUB55kgwJwDc7qJ5RDyjnRYrUdzhBkiL2T6dLOR2dbfaRQNs713OI4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:29:48.928084Z","bundle_sha256":"90620f0f778006da12e0412faa8ca9d04909f421b6d15040fbcdce947f14d953"}}