{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RSJG3GWEPCA2VOP7SBKTOHWGCY","short_pith_number":"pith:RSJG3GWE","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"},"canonical_sha256":"8c926d9ac47881aab9ff9055371ec61622382e34fcab4db2037c09c3bd8271a0","source":{"kind":"arxiv","id":"1711.10582","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10582","created_at":"2026-05-17T23:46:46Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10582v2","created_at":"2026-05-17T23:46:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10582","created_at":"2026-05-17T23:46:46Z"},{"alias_kind":"pith_short_12","alias_value":"RSJG3GWEPCA2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RSJG3GWEPCA2VOP7","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RSJG3GWE","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RSJG3GWEPCA2VOP7SBKTOHWGCY","target":"record","payload":{"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"},"canonical_sha256":"8c926d9ac47881aab9ff9055371ec61622382e34fcab4db2037c09c3bd8271a0","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"},"source_kind":"arxiv","source_id":"1711.10582","source_version":2,"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-17T23:46:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08+NOyBXVw1moMOrbLGC6TRg8cC8ZjiF67wp3SBn2fCMJ2KipmmmhGjm8uiz7WgRq05bcXU9kYNANfR9xqDODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:58:12.164668Z"},"content_sha256":"d00576135026dd9dbbb8bdbd0c19c45f81b6f0a4e84651e63e8dbb68142cd5e6","schema_version":"1.0","event_id":"sha256:d00576135026dd9dbbb8bdbd0c19c45f81b6f0a4e84651e63e8dbb68142cd5e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RSJG3GWEPCA2VOP7SBKTOHWGCY","target":"graph","payload":{"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"},"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-17T23:46:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a3C+AOeHVWs5BjzzfMAOKIOHA5UFn6wzJmWnfBeRiJKZHUAVcRtUWBlMN9WwEnoU8s0n+vl2XeEvBovrAlkjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:58:12.165383Z"},"content_sha256":"350def464b4f4ff5536cd7d4a2cbc468e829806dc047307a8e3fce6d5dad2a52","schema_version":"1.0","event_id":"sha256:350def464b4f4ff5536cd7d4a2cbc468e829806dc047307a8e3fce6d5dad2a52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY/bundle.json","state_url":"https://pith.science/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY/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-11T04:58:12Z","links":{"resolver":"https://pith.science/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY","bundle":"https://pith.science/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY/bundle.json","state":"https://pith.science/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSJG3GWEPCA2VOP7SBKTOHWGCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RSJG3GWEPCA2VOP7SBKTOHWGCY","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":"3e2e4e141c8e86ffda2d67e50d7894905e1b16a11e6ef308fdb77bab75816f5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-28T22:03:40Z","title_canon_sha256":"d2d5590b9bb8cf8621cb80362a14f506c39a47b08b1eddc13c70395a14f27385"},"schema_version":"1.0","source":{"id":"1711.10582","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10582","created_at":"2026-05-17T23:46:46Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10582v2","created_at":"2026-05-17T23:46:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10582","created_at":"2026-05-17T23:46:46Z"},{"alias_kind":"pith_short_12","alias_value":"RSJG3GWEPCA2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RSJG3GWEPCA2VOP7","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RSJG3GWE","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:350def464b4f4ff5536cd7d4a2cbc468e829806dc047307a8e3fce6d5dad2a52","target":"graph","created_at":"2026-05-17T23:46:46Z","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":"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 ","authors_text":"Bryce Kerr, Igor E. Shparlinski, Kam Hung Yau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-28T22:03:40Z","title":"A refinement of the Burgess bound for character sums"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10582","kind":"arxiv","version":2},"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:d00576135026dd9dbbb8bdbd0c19c45f81b6f0a4e84651e63e8dbb68142cd5e6","target":"record","created_at":"2026-05-17T23:46:46Z","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":"3e2e4e141c8e86ffda2d67e50d7894905e1b16a11e6ef308fdb77bab75816f5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-28T22:03:40Z","title_canon_sha256":"d2d5590b9bb8cf8621cb80362a14f506c39a47b08b1eddc13c70395a14f27385"},"schema_version":"1.0","source":{"id":"1711.10582","kind":"arxiv","version":2}},"canonical_sha256":"8c926d9ac47881aab9ff9055371ec61622382e34fcab4db2037c09c3bd8271a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c926d9ac47881aab9ff9055371ec61622382e34fcab4db2037c09c3bd8271a0","first_computed_at":"2026-05-17T23:46:46.509338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:46.509338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nkdDPY0YZrx/fzmd1671gkesJ7fuaT29TKgZ7q8dg6h0YrXjg7pHWvXXUbsfB0ltyRdb3XfHsHX975koM8sSBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:46.509737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10582","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d00576135026dd9dbbb8bdbd0c19c45f81b6f0a4e84651e63e8dbb68142cd5e6","sha256:350def464b4f4ff5536cd7d4a2cbc468e829806dc047307a8e3fce6d5dad2a52"],"state_sha256":"e33dfeee6f08ff40d6563c5118cc89886e02b3b29c18e4e07a1a0614e13637cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bm2XwdmNEZotseaCtFwtSvvw6nGs99hmDwn4I2t6Ep8kEl0iaqjwY8dWjGPbhgxMKjFqzgLJjriqVzRO2m7eCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T04:58:12.169813Z","bundle_sha256":"86d30405363f72bceeafba573506dec4048710d7994a97d00c2e7a546390fef8"}}