{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E4PB4G75CIHVSS2EFUKNS2OSCI","short_pith_number":"pith:E4PB4G75","schema_version":"1.0","canonical_sha256":"271e1e1bfd120f594b442d14d969d212145dc204bfe7b039be966beeeeb2064c","source":{"kind":"arxiv","id":"1706.03749","version":1},"attestation_state":"computed","paper":{"title":"A new proof of Hal\\'asz's Theorem, and its consequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Adam J Harper, Andrew Granville, K. Soundararajan","submitted_at":"2017-06-12T17:36:26Z","abstract_excerpt":"Hal\\'asz's Theorem gives an upper bound for the mean value of a multiplicative function $f$. The bound is sharp for general such $f$, and, in particular, it implies that a multiplicative function with $|f(n)|\\le 1$ has either mean value $0$, or is \"close to\" $n^{it}$ for some fixed $t$. The proofs in the current literature have certain features that are difficult to motivate and which are not particularly flexible. In this article we supply a different, more flexible, proof, which indicates how one might obtain asymptotics, and can be modified to short intervals and to arithmetic progressions."},"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":"1706.03749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-12T17:36:26Z","cross_cats_sorted":[],"title_canon_sha256":"2711067c406be8a99b08e92b2f9483d7d4b21da7714c5a78723e6716d1b2bc1e","abstract_canon_sha256":"b1821f4186f7abf0527d3b5172505b62dbb8175b30fa3e2def941d850f42e763"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:12.737159Z","signature_b64":"B5exbvufIcJVk5FN8vxEcSnVt3Eeu76K4qrcpHOhjiIZjLDFL/kaLHb+LNxHcxOphO5dnrS9hBmuYJXoaTWBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"271e1e1bfd120f594b442d14d969d212145dc204bfe7b039be966beeeeb2064c","last_reissued_at":"2026-05-17T23:53:12.736435Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:12.736435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new proof of Hal\\'asz's Theorem, and its consequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Adam J Harper, Andrew Granville, K. Soundararajan","submitted_at":"2017-06-12T17:36:26Z","abstract_excerpt":"Hal\\'asz's Theorem gives an upper bound for the mean value of a multiplicative function $f$. The bound is sharp for general such $f$, and, in particular, it implies that a multiplicative function with $|f(n)|\\le 1$ has either mean value $0$, or is \"close to\" $n^{it}$ for some fixed $t$. The proofs in the current literature have certain features that are difficult to motivate and which are not particularly flexible. In this article we supply a different, more flexible, proof, which indicates how one might obtain asymptotics, and can be modified to short intervals and to arithmetic progressions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03749","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":"1706.03749","created_at":"2026-05-17T23:53:12.736552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03749v1","created_at":"2026-05-17T23:53:12.736552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03749","created_at":"2026-05-17T23:53:12.736552+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4PB4G75CIHV","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4PB4G75CIHVSS2E","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4PB4G75","created_at":"2026-05-18T12:31:12.930513+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/E4PB4G75CIHVSS2EFUKNS2OSCI","json":"https://pith.science/pith/E4PB4G75CIHVSS2EFUKNS2OSCI.json","graph_json":"https://pith.science/api/pith-number/E4PB4G75CIHVSS2EFUKNS2OSCI/graph.json","events_json":"https://pith.science/api/pith-number/E4PB4G75CIHVSS2EFUKNS2OSCI/events.json","paper":"https://pith.science/paper/E4PB4G75"},"agent_actions":{"view_html":"https://pith.science/pith/E4PB4G75CIHVSS2EFUKNS2OSCI","download_json":"https://pith.science/pith/E4PB4G75CIHVSS2EFUKNS2OSCI.json","view_paper":"https://pith.science/paper/E4PB4G75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03749&json=true","fetch_graph":"https://pith.science/api/pith-number/E4PB4G75CIHVSS2EFUKNS2OSCI/graph.json","fetch_events":"https://pith.science/api/pith-number/E4PB4G75CIHVSS2EFUKNS2OSCI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4PB4G75CIHVSS2EFUKNS2OSCI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4PB4G75CIHVSS2EFUKNS2OSCI/action/storage_attestation","attest_author":"https://pith.science/pith/E4PB4G75CIHVSS2EFUKNS2OSCI/action/author_attestation","sign_citation":"https://pith.science/pith/E4PB4G75CIHVSS2EFUKNS2OSCI/action/citation_signature","submit_replication":"https://pith.science/pith/E4PB4G75CIHVSS2EFUKNS2OSCI/action/replication_record"}},"created_at":"2026-05-17T23:53:12.736552+00:00","updated_at":"2026-05-17T23:53:12.736552+00:00"}