{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:75DA2NCXSHGY5V5V2T2ZXXORH7","short_pith_number":"pith:75DA2NCX","schema_version":"1.0","canonical_sha256":"ff460d345791cd8ed7b5d4f59bddd13fd8f7cccd0e902a66a2fba79f8d435d48","source":{"kind":"arxiv","id":"1610.01893","version":3},"attestation_state":"computed","paper":{"title":"Precise error estimate of the Brent-McMillan algorithm for the computation of Euler's constant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Jean-Pierre Demailly (IF)","submitted_at":"2016-10-06T14:39:48Z","abstract_excerpt":"Brent and McMillan introduced in 1980 a new algorithm for the computation of Euler's constant $\\gamma$, based on the use of the Bessel functions I\\_0(x) and K\\_0(x). It is the fastest known algorithm for the computation of $\\gamma$. The time complexity can still be improved by evaluating a certain divergent asymptotic expansion up to its minimal term. Brent-McMillan conjectured in 1980 that the error is of the same magnitude as the last computed term, and Brent-Johansson partially proved it in 2015. They also gave some numerical evidence for a more precise estimate of the error term. We find h"},"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.01893","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2016-10-06T14:39:48Z","cross_cats_sorted":[],"title_canon_sha256":"95334afe9a95caa468baaa96fa257156351c218f41ea4ff9433b2855323bc617","abstract_canon_sha256":"4a49e2ee10b1b3a734792ddea7c068941a21de55acfbc1de4792fc679c9958ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:27.066847Z","signature_b64":"eWW9xX3P2l+D5dSJGLw63bLewIfo7K+s8UEA8b5VzX+XNoKli1A24+TIwphfZg0++nuyXMXBDxbSf7/YLq7FBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff460d345791cd8ed7b5d4f59bddd13fd8f7cccd0e902a66a2fba79f8d435d48","last_reissued_at":"2026-05-18T00:28:27.066081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:27.066081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Precise error estimate of the Brent-McMillan algorithm for the computation of Euler's constant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"Jean-Pierre Demailly (IF)","submitted_at":"2016-10-06T14:39:48Z","abstract_excerpt":"Brent and McMillan introduced in 1980 a new algorithm for the computation of Euler's constant $\\gamma$, based on the use of the Bessel functions I\\_0(x) and K\\_0(x). It is the fastest known algorithm for the computation of $\\gamma$. The time complexity can still be improved by evaluating a certain divergent asymptotic expansion up to its minimal term. Brent-McMillan conjectured in 1980 that the error is of the same magnitude as the last computed term, and Brent-Johansson partially proved it in 2015. They also gave some numerical evidence for a more precise estimate of the error term. We find h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01893","kind":"arxiv","version":3},"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.01893","created_at":"2026-05-18T00:28:27.066170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.01893v3","created_at":"2026-05-18T00:28:27.066170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01893","created_at":"2026-05-18T00:28:27.066170+00:00"},{"alias_kind":"pith_short_12","alias_value":"75DA2NCXSHGY","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"75DA2NCXSHGY5V5V","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"75DA2NCX","created_at":"2026-05-18T12:30:04.600751+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/75DA2NCXSHGY5V5V2T2ZXXORH7","json":"https://pith.science/pith/75DA2NCXSHGY5V5V2T2ZXXORH7.json","graph_json":"https://pith.science/api/pith-number/75DA2NCXSHGY5V5V2T2ZXXORH7/graph.json","events_json":"https://pith.science/api/pith-number/75DA2NCXSHGY5V5V2T2ZXXORH7/events.json","paper":"https://pith.science/paper/75DA2NCX"},"agent_actions":{"view_html":"https://pith.science/pith/75DA2NCXSHGY5V5V2T2ZXXORH7","download_json":"https://pith.science/pith/75DA2NCXSHGY5V5V2T2ZXXORH7.json","view_paper":"https://pith.science/paper/75DA2NCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.01893&json=true","fetch_graph":"https://pith.science/api/pith-number/75DA2NCXSHGY5V5V2T2ZXXORH7/graph.json","fetch_events":"https://pith.science/api/pith-number/75DA2NCXSHGY5V5V2T2ZXXORH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75DA2NCXSHGY5V5V2T2ZXXORH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75DA2NCXSHGY5V5V2T2ZXXORH7/action/storage_attestation","attest_author":"https://pith.science/pith/75DA2NCXSHGY5V5V2T2ZXXORH7/action/author_attestation","sign_citation":"https://pith.science/pith/75DA2NCXSHGY5V5V2T2ZXXORH7/action/citation_signature","submit_replication":"https://pith.science/pith/75DA2NCXSHGY5V5V2T2ZXXORH7/action/replication_record"}},"created_at":"2026-05-18T00:28:27.066170+00:00","updated_at":"2026-05-18T00:28:27.066170+00:00"}