{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:O57RYCX3J3VOPY2BGLVZ5ZVCW6","short_pith_number":"pith:O57RYCX3","canonical_record":{"source":{"id":"2606.23398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-22T14:21:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e0288c981c8c599baf40ef98fa72dd235f1e7572db406bb148b39efbc93311ec","abstract_canon_sha256":"29ed1096cd4202a660793a7e1072e093e4bc6136eea673acbaf3988eb468e7a1"},"schema_version":"1.0"},"canonical_sha256":"777f1c0afb4eeae7e34132eb9ee6a2b7b5c2e0190672b984d67dfb84e9641e83","source":{"kind":"arxiv","id":"2606.23398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23398","created_at":"2026-06-23T03:14:19Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23398v1","created_at":"2026-06-23T03:14:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23398","created_at":"2026-06-23T03:14:19Z"},{"alias_kind":"pith_short_12","alias_value":"O57RYCX3J3VO","created_at":"2026-06-23T03:14:19Z"},{"alias_kind":"pith_short_16","alias_value":"O57RYCX3J3VOPY2B","created_at":"2026-06-23T03:14:19Z"},{"alias_kind":"pith_short_8","alias_value":"O57RYCX3","created_at":"2026-06-23T03:14:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:O57RYCX3J3VOPY2BGLVZ5ZVCW6","target":"record","payload":{"canonical_record":{"source":{"id":"2606.23398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-22T14:21:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e0288c981c8c599baf40ef98fa72dd235f1e7572db406bb148b39efbc93311ec","abstract_canon_sha256":"29ed1096cd4202a660793a7e1072e093e4bc6136eea673acbaf3988eb468e7a1"},"schema_version":"1.0"},"canonical_sha256":"777f1c0afb4eeae7e34132eb9ee6a2b7b5c2e0190672b984d67dfb84e9641e83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:19.000516Z","signature_b64":"JYKPIkwmrztLjHLzcx0cIOZF0GxmXKf/p9Bd7CYxX6rzYUj+YJnLNvS02UTQdLuU3GzhED2aloWKT9IBBdrMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"777f1c0afb4eeae7e34132eb9ee6a2b7b5c2e0190672b984d67dfb84e9641e83","last_reissued_at":"2026-06-23T03:14:19.000097Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:19.000097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.23398","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-06-23T03:14:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dSF19py29wFNhipIGGydX8UjWpuUnvS8KfbOW2ZRHf8W+/UF2hFKTilysSiaFeC3nwB5SWFQLGqO0j57kX5gCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:00:28.126295Z"},"content_sha256":"b66bbac422396c4cc7335b56a6d6bf3ac30b4ccfc9addcf264452ce7c63feec5","schema_version":"1.0","event_id":"sha256:b66bbac422396c4cc7335b56a6d6bf3ac30b4ccfc9addcf264452ce7c63feec5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:O57RYCX3J3VOPY2BGLVZ5ZVCW6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A first-exit proof of Cusick's sum-of-digits conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Kaimin Cheng","submitted_at":"2026-06-22T14:21:11Z","abstract_excerpt":"We prove Cusick's conjecture on the binary sum-of-digits function. More precisely, for every integer \\(t\\ge 1\\) we show that \\[ c_t:=\\lim_{N\\to\\infty}\\frac{1}{N} \\#\\{0\\le n<N:\\ s_2(n+t)\\ge s_2(n)\\}>\\frac{1}{2}, \\] and in fact obtain the explicit bound \\[ c_t\\ge \\frac{1}{2}+2^{-2s_2(t)-1}, \\] where \\(s_2(m)\\) denotes the number of ones in the binary expansion of \\(m\\). The proof is based on an exact deconvolution which replaces the distribution of \\(s_2(n+t)-s_2(n)\\) by a finite stopped random-walk law. The required bias is then proved through first-exit medians for principal subsequence ideals"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23398","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/2606.23398/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-06-23T03:14:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GrfCd4mTUiE9S2BASWqHbyjaaLq6Vwvm+y1TiVbKEcTxSR15oplGrrMEwKeTiCgyioLSxBZNU+gYUn235G9WCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:00:28.126714Z"},"content_sha256":"22ce0783fe5203d8855d63f31f8347f5a772b9eb57ab1001a30d8499c6f6296e","schema_version":"1.0","event_id":"sha256:22ce0783fe5203d8855d63f31f8347f5a772b9eb57ab1001a30d8499c6f6296e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O57RYCX3J3VOPY2BGLVZ5ZVCW6/bundle.json","state_url":"https://pith.science/pith/O57RYCX3J3VOPY2BGLVZ5ZVCW6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O57RYCX3J3VOPY2BGLVZ5ZVCW6/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-28T06:00:28Z","links":{"resolver":"https://pith.science/pith/O57RYCX3J3VOPY2BGLVZ5ZVCW6","bundle":"https://pith.science/pith/O57RYCX3J3VOPY2BGLVZ5ZVCW6/bundle.json","state":"https://pith.science/pith/O57RYCX3J3VOPY2BGLVZ5ZVCW6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O57RYCX3J3VOPY2BGLVZ5ZVCW6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:O57RYCX3J3VOPY2BGLVZ5ZVCW6","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":"29ed1096cd4202a660793a7e1072e093e4bc6136eea673acbaf3988eb468e7a1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-22T14:21:11Z","title_canon_sha256":"e0288c981c8c599baf40ef98fa72dd235f1e7572db406bb148b39efbc93311ec"},"schema_version":"1.0","source":{"id":"2606.23398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23398","created_at":"2026-06-23T03:14:19Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23398v1","created_at":"2026-06-23T03:14:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23398","created_at":"2026-06-23T03:14:19Z"},{"alias_kind":"pith_short_12","alias_value":"O57RYCX3J3VO","created_at":"2026-06-23T03:14:19Z"},{"alias_kind":"pith_short_16","alias_value":"O57RYCX3J3VOPY2B","created_at":"2026-06-23T03:14:19Z"},{"alias_kind":"pith_short_8","alias_value":"O57RYCX3","created_at":"2026-06-23T03:14:19Z"}],"graph_snapshots":[{"event_id":"sha256:22ce0783fe5203d8855d63f31f8347f5a772b9eb57ab1001a30d8499c6f6296e","target":"graph","created_at":"2026-06-23T03:14:19Z","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/2606.23398/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove Cusick's conjecture on the binary sum-of-digits function. More precisely, for every integer \\(t\\ge 1\\) we show that \\[ c_t:=\\lim_{N\\to\\infty}\\frac{1}{N} \\#\\{0\\le n<N:\\ s_2(n+t)\\ge s_2(n)\\}>\\frac{1}{2}, \\] and in fact obtain the explicit bound \\[ c_t\\ge \\frac{1}{2}+2^{-2s_2(t)-1}, \\] where \\(s_2(m)\\) denotes the number of ones in the binary expansion of \\(m\\). The proof is based on an exact deconvolution which replaces the distribution of \\(s_2(n+t)-s_2(n)\\) by a finite stopped random-walk law. The required bias is then proved through first-exit medians for principal subsequence ideals","authors_text":"Kaimin Cheng","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-22T14:21:11Z","title":"A first-exit proof of Cusick's sum-of-digits conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23398","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:b66bbac422396c4cc7335b56a6d6bf3ac30b4ccfc9addcf264452ce7c63feec5","target":"record","created_at":"2026-06-23T03:14:19Z","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":"29ed1096cd4202a660793a7e1072e093e4bc6136eea673acbaf3988eb468e7a1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-22T14:21:11Z","title_canon_sha256":"e0288c981c8c599baf40ef98fa72dd235f1e7572db406bb148b39efbc93311ec"},"schema_version":"1.0","source":{"id":"2606.23398","kind":"arxiv","version":1}},"canonical_sha256":"777f1c0afb4eeae7e34132eb9ee6a2b7b5c2e0190672b984d67dfb84e9641e83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"777f1c0afb4eeae7e34132eb9ee6a2b7b5c2e0190672b984d67dfb84e9641e83","first_computed_at":"2026-06-23T03:14:19.000097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:14:19.000097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JYKPIkwmrztLjHLzcx0cIOZF0GxmXKf/p9Bd7CYxX6rzYUj+YJnLNvS02UTQdLuU3GzhED2aloWKT9IBBdrMBg==","signature_status":"signed_v1","signed_at":"2026-06-23T03:14:19.000516Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.23398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b66bbac422396c4cc7335b56a6d6bf3ac30b4ccfc9addcf264452ce7c63feec5","sha256:22ce0783fe5203d8855d63f31f8347f5a772b9eb57ab1001a30d8499c6f6296e"],"state_sha256":"73f72dd6667c3686e23637a486e80066d1d5212d1a0713405d73e95c5097cb85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WrRTCmGwgoYzXeIYGseJA2739YRc9adSIPLkZjCyGMPI+fktx2OAICniBKJCpUyNZDhRd7xUu4JoVBwJey4bAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T06:00:28.128905Z","bundle_sha256":"355bf09a2ac33b48b9be2c95ef8598fcaa6090b88b5c3b16f2a2f5701994036d"}}