{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TYIB4SNDGS3ZVSMN7DKVWKINHL","short_pith_number":"pith:TYIB4SND","schema_version":"1.0","canonical_sha256":"9e101e49a334b79ac98df8d55b290d3ae36737bf3cd75710a06ee7f46d56944f","source":{"kind":"arxiv","id":"1904.08646","version":1},"attestation_state":"computed","paper":{"title":"Approaching Cusick's conjecture on the sum-of-digits function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Lukas Spiegelhofer","submitted_at":"2019-04-18T09:14:17Z","abstract_excerpt":"Cusick's conjecture on the binary sum of digits $s(n)$ of a nonnegative integer $n$ states the following: for all nonnegative integers $t$ we have \\[ c_t=\\lim_{N\\rightarrow\\infty}\\frac 1N\\left\\lvert\\{n<N:s(n+t)\\geq s(n)\\}\\right\\rvert>1/2. \\] We prove that for given $\\varepsilon>0$ we have \\[ c_t+c_{t'}>1-\\varepsilon \\] if the binary expansion of $t$ contains enough blocks of consecutive $\\mathtt 1$s (depending on $\\varepsilon$), where $t'=3\\cdot 2^\\lambda-t$ and $\\lambda$ is chosen such that $2^\\lambda\\leq t<2^{\\lambda+1}$."},"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":"1904.08646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-04-18T09:14:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ba787642c0906cded5225b75f08d1e2cc7793714fa5141a7b9c88bf1228c5517","abstract_canon_sha256":"132b1265703d4ac358e445fc13582857551307e2fbed4a848a499b4efe179be2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:13.556695Z","signature_b64":"baEJuAtK4kuU3rY7vrclPRiMY6iGTYa+oV312oBEpd9Q9YxlZlvTe2o/sTwpPXbs6uUJH/y2Lp336dBbBNGjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e101e49a334b79ac98df8d55b290d3ae36737bf3cd75710a06ee7f46d56944f","last_reissued_at":"2026-05-17T23:48:13.555896Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:13.555896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approaching Cusick's conjecture on the sum-of-digits function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Lukas Spiegelhofer","submitted_at":"2019-04-18T09:14:17Z","abstract_excerpt":"Cusick's conjecture on the binary sum of digits $s(n)$ of a nonnegative integer $n$ states the following: for all nonnegative integers $t$ we have \\[ c_t=\\lim_{N\\rightarrow\\infty}\\frac 1N\\left\\lvert\\{n<N:s(n+t)\\geq s(n)\\}\\right\\rvert>1/2. \\] We prove that for given $\\varepsilon>0$ we have \\[ c_t+c_{t'}>1-\\varepsilon \\] if the binary expansion of $t$ contains enough blocks of consecutive $\\mathtt 1$s (depending on $\\varepsilon$), where $t'=3\\cdot 2^\\lambda-t$ and $\\lambda$ is chosen such that $2^\\lambda\\leq t<2^{\\lambda+1}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08646","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":"1904.08646","created_at":"2026-05-17T23:48:13.556022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08646v1","created_at":"2026-05-17T23:48:13.556022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08646","created_at":"2026-05-17T23:48:13.556022+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYIB4SNDGS3Z","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYIB4SNDGS3ZVSMN","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYIB4SND","created_at":"2026-05-18T12:33:30.264802+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/TYIB4SNDGS3ZVSMN7DKVWKINHL","json":"https://pith.science/pith/TYIB4SNDGS3ZVSMN7DKVWKINHL.json","graph_json":"https://pith.science/api/pith-number/TYIB4SNDGS3ZVSMN7DKVWKINHL/graph.json","events_json":"https://pith.science/api/pith-number/TYIB4SNDGS3ZVSMN7DKVWKINHL/events.json","paper":"https://pith.science/paper/TYIB4SND"},"agent_actions":{"view_html":"https://pith.science/pith/TYIB4SNDGS3ZVSMN7DKVWKINHL","download_json":"https://pith.science/pith/TYIB4SNDGS3ZVSMN7DKVWKINHL.json","view_paper":"https://pith.science/paper/TYIB4SND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08646&json=true","fetch_graph":"https://pith.science/api/pith-number/TYIB4SNDGS3ZVSMN7DKVWKINHL/graph.json","fetch_events":"https://pith.science/api/pith-number/TYIB4SNDGS3ZVSMN7DKVWKINHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYIB4SNDGS3ZVSMN7DKVWKINHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYIB4SNDGS3ZVSMN7DKVWKINHL/action/storage_attestation","attest_author":"https://pith.science/pith/TYIB4SNDGS3ZVSMN7DKVWKINHL/action/author_attestation","sign_citation":"https://pith.science/pith/TYIB4SNDGS3ZVSMN7DKVWKINHL/action/citation_signature","submit_replication":"https://pith.science/pith/TYIB4SNDGS3ZVSMN7DKVWKINHL/action/replication_record"}},"created_at":"2026-05-17T23:48:13.556022+00:00","updated_at":"2026-05-17T23:48:13.556022+00:00"}