{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RSJG3GWEPCA2VOP7SBKTOHWGCY","short_pith_number":"pith:RSJG3GWE","schema_version":"1.0","canonical_sha256":"8c926d9ac47881aab9ff9055371ec61622382e34fcab4db2037c09c3bd8271a0","source":{"kind":"arxiv","id":"1711.10582","version":2},"attestation_state":"computed","paper":{"title":"A refinement of the Burgess bound for character sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Bryce Kerr, Igor E. Shparlinski, Kam Hung Yau","submitted_at":"2017-11-28T22:03:40Z","abstract_excerpt":"In this paper we give a refinement of the bound of D. A. Burgess for multiplicative character sums modulo a prime number $q$. This continues a series of previous logarithmic improvements, which are mostly due to H. Iwaniec and E. Kowalski. In particular, for any nontrivial multiplicative character $\\chi$ modulo a prime $q$ and any integer $r\\ge 2$, we show that $$ \\sum_{M<n\\le M+N}\\chi(n) = O\\left( N^{1-1/r}q^{(r+1)/4r^2}(\\log q)^{1/4r}\\right), $$ which sharpens previous results by a factor $(\\log q)^{1/4r}$. Our improvement comes from averaging over numbers with no small prime factors rather "},"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":"1711.10582","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-28T22:03:40Z","cross_cats_sorted":[],"title_canon_sha256":"d2d5590b9bb8cf8621cb80362a14f506c39a47b08b1eddc13c70395a14f27385","abstract_canon_sha256":"3e2e4e141c8e86ffda2d67e50d7894905e1b16a11e6ef308fdb77bab75816f5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:46.509737Z","signature_b64":"nkdDPY0YZrx/fzmd1671gkesJ7fuaT29TKgZ7q8dg6h0YrXjg7pHWvXXUbsfB0ltyRdb3XfHsHX975koM8sSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c926d9ac47881aab9ff9055371ec61622382e34fcab4db2037c09c3bd8271a0","last_reissued_at":"2026-05-17T23:46:46.509338Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:46.509338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A refinement of the Burgess bound for character sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Bryce Kerr, Igor E. Shparlinski, Kam Hung Yau","submitted_at":"2017-11-28T22:03:40Z","abstract_excerpt":"In this paper we give a refinement of the bound of D. A. Burgess for multiplicative character sums modulo a prime number $q$. This continues a series of previous logarithmic improvements, which are mostly due to H. Iwaniec and E. Kowalski. In particular, for any nontrivial multiplicative character $\\chi$ modulo a prime $q$ and any integer $r\\ge 2$, we show that $$ \\sum_{M<n\\le M+N}\\chi(n) = O\\left( N^{1-1/r}q^{(r+1)/4r^2}(\\log q)^{1/4r}\\right), $$ which sharpens previous results by a factor $(\\log q)^{1/4r}$. Our improvement comes from averaging over numbers with no small prime factors rather "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10582","kind":"arxiv","version":2},"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":"1711.10582","created_at":"2026-05-17T23:46:46.509403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10582v2","created_at":"2026-05-17T23:46:46.509403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10582","created_at":"2026-05-17T23:46:46.509403+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSJG3GWEPCA2","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSJG3GWEPCA2VOP7","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSJG3GWE","created_at":"2026-05-18T12:31:39.905425+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/RSJG3GWEPCA2VOP7SBKTOHWGCY","json":"https://pith.science/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY.json","graph_json":"https://pith.science/api/pith-number/RSJG3GWEPCA2VOP7SBKTOHWGCY/graph.json","events_json":"https://pith.science/api/pith-number/RSJG3GWEPCA2VOP7SBKTOHWGCY/events.json","paper":"https://pith.science/paper/RSJG3GWE"},"agent_actions":{"view_html":"https://pith.science/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY","download_json":"https://pith.science/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY.json","view_paper":"https://pith.science/paper/RSJG3GWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10582&json=true","fetch_graph":"https://pith.science/api/pith-number/RSJG3GWEPCA2VOP7SBKTOHWGCY/graph.json","fetch_events":"https://pith.science/api/pith-number/RSJG3GWEPCA2VOP7SBKTOHWGCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY/action/storage_attestation","attest_author":"https://pith.science/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY/action/author_attestation","sign_citation":"https://pith.science/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY/action/citation_signature","submit_replication":"https://pith.science/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY/action/replication_record"}},"created_at":"2026-05-17T23:46:46.509403+00:00","updated_at":"2026-05-17T23:46:46.509403+00:00"}