{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QRB2YT5OOGLDXQDWUNOIIOHESC","short_pith_number":"pith:QRB2YT5O","schema_version":"1.0","canonical_sha256":"8443ac4fae71963bc076a35c8438e490a5bbc344e67dc410191a2742347357d1","source":{"kind":"arxiv","id":"2402.06426","version":1},"attestation_state":"computed","paper":{"title":"Random multiplicative functions and typical size of character in short intervals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Rachid Caich","submitted_at":"2024-02-09T14:15:07Z","abstract_excerpt":"We examine the conditions under which the sum of random multiplicative functions in short intervals, given by $\\sum_{x<n \\leqslant x+y} f(n)$, exhibits the phenomenon of \\textit{better than square-root cancellation}. We establish that the point at which the square-root cancellation diminishes significantly is approximately when the ratio $\\log\\big(\\frac{x}{y}\\big)$ is around $\\sqrt{\\log\\log x}$. By modeling characters by random multiplicative functions, we give a sharp bound of $\\frac{1}{r-1}\\sum_{\\chi \\!\\!\\!\\mod r} \\big|\\sum_{x<n\\leqslant x+y}\\chi(n)\\big|$, where $r$ is a large prime and $x+y"},"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":"2402.06426","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-02-09T14:15:07Z","cross_cats_sorted":[],"title_canon_sha256":"84b7fa339b4d5dc833d1dbb4678aa9ea818f4ca3613bbead13bfb7ae02a89b1b","abstract_canon_sha256":"9958ec116332ada28d1c499f43013086ccee7f8c521d64de56abfcb73f6905a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:24.063054Z","signature_b64":"iCI8733P3FoaBoHJLVt9Vh8BB6uYlZGrEd5UWTrGuSRXJch0UNb/IdoqSQmKG+Vg/vnyhgVLF5JJ8L6UvOy4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8443ac4fae71963bc076a35c8438e490a5bbc344e67dc410191a2742347357d1","last_reissued_at":"2026-07-05T07:43:24.062560Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:24.062560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random multiplicative functions and typical size of character in short intervals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Rachid Caich","submitted_at":"2024-02-09T14:15:07Z","abstract_excerpt":"We examine the conditions under which the sum of random multiplicative functions in short intervals, given by $\\sum_{x<n \\leqslant x+y} f(n)$, exhibits the phenomenon of \\textit{better than square-root cancellation}. We establish that the point at which the square-root cancellation diminishes significantly is approximately when the ratio $\\log\\big(\\frac{x}{y}\\big)$ is around $\\sqrt{\\log\\log x}$. By modeling characters by random multiplicative functions, we give a sharp bound of $\\frac{1}{r-1}\\sum_{\\chi \\!\\!\\!\\mod r} \\big|\\sum_{x<n\\leqslant x+y}\\chi(n)\\big|$, where $r$ is a large prime and $x+y"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.06426","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/2402.06426/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.06426","created_at":"2026-07-05T07:43:24.062619+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.06426v1","created_at":"2026-07-05T07:43:24.062619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.06426","created_at":"2026-07-05T07:43:24.062619+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRB2YT5OOGLD","created_at":"2026-07-05T07:43:24.062619+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRB2YT5OOGLDXQDW","created_at":"2026-07-05T07:43:24.062619+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRB2YT5O","created_at":"2026-07-05T07:43:24.062619+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00592","citing_title":"Character sums over smooth numbers","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21737","citing_title":"Escaping Chaos in Random Multiplicative Functions","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29040","citing_title":"Distribution of random multiplicative functions in short intervals, with proper normalization","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21737","citing_title":"Escaping Chaos in Random Multiplicative Functions","ref_index":127,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QRB2YT5OOGLDXQDWUNOIIOHESC","json":"https://pith.science/pith/QRB2YT5OOGLDXQDWUNOIIOHESC.json","graph_json":"https://pith.science/api/pith-number/QRB2YT5OOGLDXQDWUNOIIOHESC/graph.json","events_json":"https://pith.science/api/pith-number/QRB2YT5OOGLDXQDWUNOIIOHESC/events.json","paper":"https://pith.science/paper/QRB2YT5O"},"agent_actions":{"view_html":"https://pith.science/pith/QRB2YT5OOGLDXQDWUNOIIOHESC","download_json":"https://pith.science/pith/QRB2YT5OOGLDXQDWUNOIIOHESC.json","view_paper":"https://pith.science/paper/QRB2YT5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.06426&json=true","fetch_graph":"https://pith.science/api/pith-number/QRB2YT5OOGLDXQDWUNOIIOHESC/graph.json","fetch_events":"https://pith.science/api/pith-number/QRB2YT5OOGLDXQDWUNOIIOHESC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRB2YT5OOGLDXQDWUNOIIOHESC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRB2YT5OOGLDXQDWUNOIIOHESC/action/storage_attestation","attest_author":"https://pith.science/pith/QRB2YT5OOGLDXQDWUNOIIOHESC/action/author_attestation","sign_citation":"https://pith.science/pith/QRB2YT5OOGLDXQDWUNOIIOHESC/action/citation_signature","submit_replication":"https://pith.science/pith/QRB2YT5OOGLDXQDWUNOIIOHESC/action/replication_record"}},"created_at":"2026-07-05T07:43:24.062619+00:00","updated_at":"2026-07-05T07:43:24.062619+00:00"}