{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MIWEEQM56HYF7PAVYE6CBYPPWJ","short_pith_number":"pith:MIWEEQM5","schema_version":"1.0","canonical_sha256":"622c42419df1f05fbc15c13c20e1efb268e9b0f4d79c504468d3785ab5339c48","source":{"kind":"arxiv","id":"1610.08551","version":2},"attestation_state":"computed","paper":{"title":"Computations of the Mertens Function and Improved Bounds on the Mertens Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Greg Hurst","submitted_at":"2016-10-26T21:14:02Z","abstract_excerpt":"The Mertens function is defined as $M(x) = \\sum_{n \\leq x} \\mu(n)$, where $\\mu(n)$ is the M\\\"obius function. The Mertens conjecture states $|M(x)/\\sqrt{x}| < 1$ for $x > 1$, which was proven false in 1985 by showing $\\liminf M(x)/\\sqrt{x} < -1.009$ and $\\limsup M(x)/\\sqrt{x} > 1.06$. The same techniques used were revisited here with present day hardware and algorithms, giving improved lower and upper bounds of $-1.837625$ and $1.826054$. In addition, $M(x)$ was computed for all $x \\leq 10^{16}$, recording all extrema, all zeros, and $10^8$ values sampled at a regular interval. Lastly, an algor"},"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":"1610.08551","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-10-26T21:14:02Z","cross_cats_sorted":[],"title_canon_sha256":"104b2a356f85fbc03452ad2cc30adc0332105372bdffcb8bd40b3d11fae22c59","abstract_canon_sha256":"9c5d71decb3db61c0603ec8b233f03b26e85a4c3d30a1c4d4c44b2bcd5d506e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:09.503087Z","signature_b64":"xcC2b38GW1cgHjoUFPrHmKltXKmomL2Zwuq+c4QzMLOj8mNQeEFDl2Am6CyVdQKA7YLxqbcdgsY8OIZqJsHuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"622c42419df1f05fbc15c13c20e1efb268e9b0f4d79c504468d3785ab5339c48","last_reissued_at":"2026-05-18T00:36:09.502444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:09.502444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computations of the Mertens Function and Improved Bounds on the Mertens Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Greg Hurst","submitted_at":"2016-10-26T21:14:02Z","abstract_excerpt":"The Mertens function is defined as $M(x) = \\sum_{n \\leq x} \\mu(n)$, where $\\mu(n)$ is the M\\\"obius function. The Mertens conjecture states $|M(x)/\\sqrt{x}| < 1$ for $x > 1$, which was proven false in 1985 by showing $\\liminf M(x)/\\sqrt{x} < -1.009$ and $\\limsup M(x)/\\sqrt{x} > 1.06$. The same techniques used were revisited here with present day hardware and algorithms, giving improved lower and upper bounds of $-1.837625$ and $1.826054$. In addition, $M(x)$ was computed for all $x \\leq 10^{16}$, recording all extrema, all zeros, and $10^8$ values sampled at a regular interval. Lastly, an algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08551","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":"1610.08551","created_at":"2026-05-18T00:36:09.502557+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08551v2","created_at":"2026-05-18T00:36:09.502557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08551","created_at":"2026-05-18T00:36:09.502557+00:00"},{"alias_kind":"pith_short_12","alias_value":"MIWEEQM56HYF","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MIWEEQM56HYF7PAV","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MIWEEQM5","created_at":"2026-05-18T12:30:32.724797+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/MIWEEQM56HYF7PAVYE6CBYPPWJ","json":"https://pith.science/pith/MIWEEQM56HYF7PAVYE6CBYPPWJ.json","graph_json":"https://pith.science/api/pith-number/MIWEEQM56HYF7PAVYE6CBYPPWJ/graph.json","events_json":"https://pith.science/api/pith-number/MIWEEQM56HYF7PAVYE6CBYPPWJ/events.json","paper":"https://pith.science/paper/MIWEEQM5"},"agent_actions":{"view_html":"https://pith.science/pith/MIWEEQM56HYF7PAVYE6CBYPPWJ","download_json":"https://pith.science/pith/MIWEEQM56HYF7PAVYE6CBYPPWJ.json","view_paper":"https://pith.science/paper/MIWEEQM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08551&json=true","fetch_graph":"https://pith.science/api/pith-number/MIWEEQM56HYF7PAVYE6CBYPPWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MIWEEQM56HYF7PAVYE6CBYPPWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MIWEEQM56HYF7PAVYE6CBYPPWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MIWEEQM56HYF7PAVYE6CBYPPWJ/action/storage_attestation","attest_author":"https://pith.science/pith/MIWEEQM56HYF7PAVYE6CBYPPWJ/action/author_attestation","sign_citation":"https://pith.science/pith/MIWEEQM56HYF7PAVYE6CBYPPWJ/action/citation_signature","submit_replication":"https://pith.science/pith/MIWEEQM56HYF7PAVYE6CBYPPWJ/action/replication_record"}},"created_at":"2026-05-18T00:36:09.502557+00:00","updated_at":"2026-05-18T00:36:09.502557+00:00"}