{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5J7V6ZLB6JDZ34RYICCLFW7X3J","short_pith_number":"pith:5J7V6ZLB","schema_version":"1.0","canonical_sha256":"ea7f5f6561f2479df2384084b2dbf7da64d869dba767993474fb5cba236c13fb","source":{"kind":"arxiv","id":"1312.0039","version":1},"attestation_state":"computed","paper":{"title":"A bound for the error term in the Brent-McMillan algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Fredrik Johansson, Richard P. Brent","submitted_at":"2013-11-29T23:47:32Z","abstract_excerpt":"The Brent-McMillan algorithm B3 (1980), when implemented with binary splitting, is the fastest known algorithm for high-precision computation of Euler's constant. However, no rigorous error bound for the algorithm has ever been published. We provide such a bound and justify the empirical observations of Brent and McMillan. We also give bounds on the error in the asymptotic expansions of functions related to modified Bessel functions."},"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":"1312.0039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-11-29T23:47:32Z","cross_cats_sorted":[],"title_canon_sha256":"55d302a37775d790376d27a281afd95cecb406eb56f8e8617c25cf11150e9a76","abstract_canon_sha256":"c08d38e05e88dfc6aaf5ceb7197c067fe37c601990a4fedfcf66f9874efe1545"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:16.744369Z","signature_b64":"W6N6wdxSwEOPRNNtywjywLwNhhoYaqJIaNpjdZbiSz9s1W6qNv3+my6TKf91a/1CMDoXlHtPDHzHmC0UE4lsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea7f5f6561f2479df2384084b2dbf7da64d869dba767993474fb5cba236c13fb","last_reissued_at":"2026-05-18T01:35:16.743831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:16.743831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A bound for the error term in the Brent-McMillan algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Fredrik Johansson, Richard P. Brent","submitted_at":"2013-11-29T23:47:32Z","abstract_excerpt":"The Brent-McMillan algorithm B3 (1980), when implemented with binary splitting, is the fastest known algorithm for high-precision computation of Euler's constant. However, no rigorous error bound for the algorithm has ever been published. We provide such a bound and justify the empirical observations of Brent and McMillan. We also give bounds on the error in the asymptotic expansions of functions related to modified Bessel functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0039","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":"1312.0039","created_at":"2026-05-18T01:35:16.743917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0039v1","created_at":"2026-05-18T01:35:16.743917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0039","created_at":"2026-05-18T01:35:16.743917+00:00"},{"alias_kind":"pith_short_12","alias_value":"5J7V6ZLB6JDZ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5J7V6ZLB6JDZ34RY","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5J7V6ZLB","created_at":"2026-05-18T12:27:34.582898+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/5J7V6ZLB6JDZ34RYICCLFW7X3J","json":"https://pith.science/pith/5J7V6ZLB6JDZ34RYICCLFW7X3J.json","graph_json":"https://pith.science/api/pith-number/5J7V6ZLB6JDZ34RYICCLFW7X3J/graph.json","events_json":"https://pith.science/api/pith-number/5J7V6ZLB6JDZ34RYICCLFW7X3J/events.json","paper":"https://pith.science/paper/5J7V6ZLB"},"agent_actions":{"view_html":"https://pith.science/pith/5J7V6ZLB6JDZ34RYICCLFW7X3J","download_json":"https://pith.science/pith/5J7V6ZLB6JDZ34RYICCLFW7X3J.json","view_paper":"https://pith.science/paper/5J7V6ZLB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0039&json=true","fetch_graph":"https://pith.science/api/pith-number/5J7V6ZLB6JDZ34RYICCLFW7X3J/graph.json","fetch_events":"https://pith.science/api/pith-number/5J7V6ZLB6JDZ34RYICCLFW7X3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5J7V6ZLB6JDZ34RYICCLFW7X3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5J7V6ZLB6JDZ34RYICCLFW7X3J/action/storage_attestation","attest_author":"https://pith.science/pith/5J7V6ZLB6JDZ34RYICCLFW7X3J/action/author_attestation","sign_citation":"https://pith.science/pith/5J7V6ZLB6JDZ34RYICCLFW7X3J/action/citation_signature","submit_replication":"https://pith.science/pith/5J7V6ZLB6JDZ34RYICCLFW7X3J/action/replication_record"}},"created_at":"2026-05-18T01:35:16.743917+00:00","updated_at":"2026-05-18T01:35:16.743917+00:00"}