{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PXO4H3YRYOKCJZWX5S5FQMSTP7","short_pith_number":"pith:PXO4H3YR","canonical_record":{"source":{"id":"2607.00592","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-01T08:17:56Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ce769785b8910cb1284b8b6460e66d24227bed26e99ee4d7be4cf924f5d70aa2","abstract_canon_sha256":"bcf4fd06c2dbb001777960f60eacf116810a4131babb9a112feca769c5cb3cd5"},"schema_version":"1.0"},"canonical_sha256":"7dddc3ef11c39424e6d7ecba5832537ffb2e840d15002cf93b5e75d497edb178","source":{"kind":"arxiv","id":"2607.00592","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00592","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00592v1","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00592","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"PXO4H3YRYOKC","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"pith_short_16","alias_value":"PXO4H3YRYOKCJZWX","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"pith_short_8","alias_value":"PXO4H3YR","created_at":"2026-07-02T01:17:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PXO4H3YRYOKCJZWX5S5FQMSTP7","target":"record","payload":{"canonical_record":{"source":{"id":"2607.00592","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-01T08:17:56Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ce769785b8910cb1284b8b6460e66d24227bed26e99ee4d7be4cf924f5d70aa2","abstract_canon_sha256":"bcf4fd06c2dbb001777960f60eacf116810a4131babb9a112feca769c5cb3cd5"},"schema_version":"1.0"},"canonical_sha256":"7dddc3ef11c39424e6d7ecba5832537ffb2e840d15002cf93b5e75d497edb178","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:48.458768Z","signature_b64":"2SNFwyQZonL78OOGxlziL4xMkEY359sXNTRT2YT0s8PAERtVk7fRGIZ3r29DSYvi0qjfL8Sn+8LQ2Md28qkgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dddc3ef11c39424e6d7ecba5832537ffb2e840d15002cf93b5e75d497edb178","last_reissued_at":"2026-07-02T01:17:48.458342Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:48.458342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.00592","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-07-02T01:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOtsxGedGwMBMIE1cGg155Ib872ZW6hGdt7Pv3XBHum57VMbT/Uz8ig0IWYffB8PyTiiuUQiwO7WT4nUTGjTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T08:37:55.733132Z"},"content_sha256":"b1bf9e25ed83acb9dedb5d764c776bbca21f0c2b155b8f399aac2ca1416bbec8","schema_version":"1.0","event_id":"sha256:b1bf9e25ed83acb9dedb5d764c776bbca21f0c2b155b8f399aac2ca1416bbec8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PXO4H3YRYOKCJZWX5S5FQMSTP7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Character sums over smooth numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NT","authors_text":"Max Wenqiang Xu, Seth Hardy","submitted_at":"2026-07-01T08:17:56Z","abstract_excerpt":"Let $\\Psi (x,y)$ denote the count of $y$-smooth numbers below $x$ and $P(n)$ denote the largest prime factor of $n$. We show that \\[ \\frac{1}{\\varphi(q)} \\sum_{\\chi \\bmod q} \\Bigl| \\sum_{\\substack{n \\leq x \\\\ P(n) \\leq y}} \\chi(n) \\Bigr| = o \\Bigl( \\sqrt{\\Psi(x,y)} \\Bigr), \\] whenever $(\\log x)^6 \\leq y \\leq x^{\\frac{1}{32 \\log \\log x}}$ and $q \\geq x^{1 + \\varepsilon}$ for some small quantifiable $\\varepsilon > 0$. The saving is substantial when $\\varepsilon$ is fixed away from zero, and we prove similar results for continuous characters and completely multiplicative twists of these sums."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00592","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/2607.00592/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-07-02T01:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MvNLEiBs/nhRYrwl4ZmsYGZKpdkN3cdqrookFvzOHoH5SLGj7lhACtYrRrwFoR4u8zmRUyVIGrlTFs7j4NfKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T08:37:55.733526Z"},"content_sha256":"63a9f33c50d33c4f585e0f94f7523daa3bd5b4daca094ae720961cafe02922ed","schema_version":"1.0","event_id":"sha256:63a9f33c50d33c4f585e0f94f7523daa3bd5b4daca094ae720961cafe02922ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PXO4H3YRYOKCJZWX5S5FQMSTP7/bundle.json","state_url":"https://pith.science/pith/PXO4H3YRYOKCJZWX5S5FQMSTP7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PXO4H3YRYOKCJZWX5S5FQMSTP7/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-07-03T08:37:55Z","links":{"resolver":"https://pith.science/pith/PXO4H3YRYOKCJZWX5S5FQMSTP7","bundle":"https://pith.science/pith/PXO4H3YRYOKCJZWX5S5FQMSTP7/bundle.json","state":"https://pith.science/pith/PXO4H3YRYOKCJZWX5S5FQMSTP7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PXO4H3YRYOKCJZWX5S5FQMSTP7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PXO4H3YRYOKCJZWX5S5FQMSTP7","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":"bcf4fd06c2dbb001777960f60eacf116810a4131babb9a112feca769c5cb3cd5","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-01T08:17:56Z","title_canon_sha256":"ce769785b8910cb1284b8b6460e66d24227bed26e99ee4d7be4cf924f5d70aa2"},"schema_version":"1.0","source":{"id":"2607.00592","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00592","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00592v1","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00592","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"PXO4H3YRYOKC","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"pith_short_16","alias_value":"PXO4H3YRYOKCJZWX","created_at":"2026-07-02T01:17:48Z"},{"alias_kind":"pith_short_8","alias_value":"PXO4H3YR","created_at":"2026-07-02T01:17:48Z"}],"graph_snapshots":[{"event_id":"sha256:63a9f33c50d33c4f585e0f94f7523daa3bd5b4daca094ae720961cafe02922ed","target":"graph","created_at":"2026-07-02T01:17:48Z","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/2607.00592/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\Psi (x,y)$ denote the count of $y$-smooth numbers below $x$ and $P(n)$ denote the largest prime factor of $n$. We show that \\[ \\frac{1}{\\varphi(q)} \\sum_{\\chi \\bmod q} \\Bigl| \\sum_{\\substack{n \\leq x \\\\ P(n) \\leq y}} \\chi(n) \\Bigr| = o \\Bigl( \\sqrt{\\Psi(x,y)} \\Bigr), \\] whenever $(\\log x)^6 \\leq y \\leq x^{\\frac{1}{32 \\log \\log x}}$ and $q \\geq x^{1 + \\varepsilon}$ for some small quantifiable $\\varepsilon > 0$. The saving is substantial when $\\varepsilon$ is fixed away from zero, and we prove similar results for continuous characters and completely multiplicative twists of these sums.","authors_text":"Max Wenqiang Xu, Seth Hardy","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-01T08:17:56Z","title":"Character sums over smooth numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00592","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:b1bf9e25ed83acb9dedb5d764c776bbca21f0c2b155b8f399aac2ca1416bbec8","target":"record","created_at":"2026-07-02T01:17:48Z","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":"bcf4fd06c2dbb001777960f60eacf116810a4131babb9a112feca769c5cb3cd5","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-01T08:17:56Z","title_canon_sha256":"ce769785b8910cb1284b8b6460e66d24227bed26e99ee4d7be4cf924f5d70aa2"},"schema_version":"1.0","source":{"id":"2607.00592","kind":"arxiv","version":1}},"canonical_sha256":"7dddc3ef11c39424e6d7ecba5832537ffb2e840d15002cf93b5e75d497edb178","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dddc3ef11c39424e6d7ecba5832537ffb2e840d15002cf93b5e75d497edb178","first_computed_at":"2026-07-02T01:17:48.458342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:17:48.458342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2SNFwyQZonL78OOGxlziL4xMkEY359sXNTRT2YT0s8PAERtVk7fRGIZ3r29DSYvi0qjfL8Sn+8LQ2Md28qkgDA==","signature_status":"signed_v1","signed_at":"2026-07-02T01:17:48.458768Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00592","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1bf9e25ed83acb9dedb5d764c776bbca21f0c2b155b8f399aac2ca1416bbec8","sha256:63a9f33c50d33c4f585e0f94f7523daa3bd5b4daca094ae720961cafe02922ed"],"state_sha256":"0d49c8f5a6cc78d6701548ebe9cb876790d56670b5669ca295493583f8e83e51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oTi8wqtGqO1nV+FO4EEQAQATEPMoJQyMP3KBF1aqEHtJ62rI7WtqTiZayO+bM3gdCRTs2HpCMZ7vxSoarX75AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T08:37:55.735488Z","bundle_sha256":"02143889b9f5fadaf40a868f0223f2672140544f33a003e9caf0ddda610d2a1f"}}