{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TZLULBZBT52CR32D6GVZ22B3DJ","short_pith_number":"pith:TZLULBZB","canonical_record":{"source":{"id":"1809.04342","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2018-09-12T10:09:18Z","cross_cats_sorted":[],"title_canon_sha256":"34dd4fc4c67823a48735dc7e29bb7bf1855500dd19c18fc49de29013e9391c7d","abstract_canon_sha256":"ef7e26a9dc3f7497fc100827d61d3669d98e5387823043956a2055f7f3913d7f"},"schema_version":"1.0"},"canonical_sha256":"9e574587219f7428ef43f1ab9d683b1a6c9d11fef96a4abb399974636cce7dea","source":{"kind":"arxiv","id":"1809.04342","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04342","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04342v2","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04342","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"pith_short_12","alias_value":"TZLULBZBT52C","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TZLULBZBT52CR32D","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TZLULBZB","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TZLULBZBT52CR32D6GVZ22B3DJ","target":"record","payload":{"canonical_record":{"source":{"id":"1809.04342","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2018-09-12T10:09:18Z","cross_cats_sorted":[],"title_canon_sha256":"34dd4fc4c67823a48735dc7e29bb7bf1855500dd19c18fc49de29013e9391c7d","abstract_canon_sha256":"ef7e26a9dc3f7497fc100827d61d3669d98e5387823043956a2055f7f3913d7f"},"schema_version":"1.0"},"canonical_sha256":"9e574587219f7428ef43f1ab9d683b1a6c9d11fef96a4abb399974636cce7dea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:50.823048Z","signature_b64":"qFKoOdIE94l449iVEAcgj2VFdEy2QWj5tYPNVEjb++N3dvJkR1Y7sq1YB0ZkelUadAKfugWVO4AT09QC1jKwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e574587219f7428ef43f1ab9d683b1a6c9d11fef96a4abb399974636cce7dea","last_reissued_at":"2026-05-17T23:53:50.822374Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:50.822374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.04342","source_version":2,"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-05-17T23:53:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOmYfEvbZGO2K3e4phKcDl7HtwTGqeUiUANEd9og+ArgQBvgJrMZGD7V+w07YvbAZlEKdzzS6y0/C3f7rnLOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:47:05.929014Z"},"content_sha256":"af166312265b0c14ff6f64bf673302454b99b9fe2f891e492872d72cb6cfefb5","schema_version":"1.0","event_id":"sha256:af166312265b0c14ff6f64bf673302454b99b9fe2f891e492872d72cb6cfefb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TZLULBZBT52CR32D6GVZ22B3DJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An asymptotic expansion for the error term in the Brent-McMillan algorithm for Euler's constant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CA","authors_text":"R B Paris","submitted_at":"2018-09-12T10:09:18Z","abstract_excerpt":"The Brent-McMillan algorithm is the fastest known procedure for the high-precision computation of Euler's constant $\\gamma$ and is based on the modified Bessel functions $I_0(2x)$ and $K_0(2x)$. An error estimate for this algorithm relies on the optimally truncated asymptotic expansion for the product $I_0(2x) K_0(2x)$ when $x$ assumes large positive integer values. An asymptotic expansion for this optimal error term is derived by exploiting the techniques developed in hyperasymptotics, thereby enabling more precise information on the error term than recently obtained bounds and estimates."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04342","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"},"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-05-17T23:53:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ymQ3NLpTBEK+M393j1GX3gLkMlzu/0LY5xaEVw/Y0eYeVp3bZ37uBOtQvNmy1eMLmqG+lpDBoNnUpxoSyqf4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:47:05.929370Z"},"content_sha256":"eb560eb47b279f91e069ad21a9637467600929d30bc7253c846c0d4558dab5bb","schema_version":"1.0","event_id":"sha256:eb560eb47b279f91e069ad21a9637467600929d30bc7253c846c0d4558dab5bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZLULBZBT52CR32D6GVZ22B3DJ/bundle.json","state_url":"https://pith.science/pith/TZLULBZBT52CR32D6GVZ22B3DJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZLULBZBT52CR32D6GVZ22B3DJ/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-06-12T01:47:05Z","links":{"resolver":"https://pith.science/pith/TZLULBZBT52CR32D6GVZ22B3DJ","bundle":"https://pith.science/pith/TZLULBZBT52CR32D6GVZ22B3DJ/bundle.json","state":"https://pith.science/pith/TZLULBZBT52CR32D6GVZ22B3DJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZLULBZBT52CR32D6GVZ22B3DJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TZLULBZBT52CR32D6GVZ22B3DJ","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":"ef7e26a9dc3f7497fc100827d61d3669d98e5387823043956a2055f7f3913d7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2018-09-12T10:09:18Z","title_canon_sha256":"34dd4fc4c67823a48735dc7e29bb7bf1855500dd19c18fc49de29013e9391c7d"},"schema_version":"1.0","source":{"id":"1809.04342","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04342","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04342v2","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04342","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"pith_short_12","alias_value":"TZLULBZBT52C","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TZLULBZBT52CR32D","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TZLULBZB","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:eb560eb47b279f91e069ad21a9637467600929d30bc7253c846c0d4558dab5bb","target":"graph","created_at":"2026-05-17T23:53:50Z","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"},"paper":{"abstract_excerpt":"The Brent-McMillan algorithm is the fastest known procedure for the high-precision computation of Euler's constant $\\gamma$ and is based on the modified Bessel functions $I_0(2x)$ and $K_0(2x)$. An error estimate for this algorithm relies on the optimally truncated asymptotic expansion for the product $I_0(2x) K_0(2x)$ when $x$ assumes large positive integer values. An asymptotic expansion for this optimal error term is derived by exploiting the techniques developed in hyperasymptotics, thereby enabling more precise information on the error term than recently obtained bounds and estimates.","authors_text":"R B Paris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2018-09-12T10:09:18Z","title":"An asymptotic expansion for the error term in the Brent-McMillan algorithm for Euler's constant"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04342","kind":"arxiv","version":2},"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:af166312265b0c14ff6f64bf673302454b99b9fe2f891e492872d72cb6cfefb5","target":"record","created_at":"2026-05-17T23:53:50Z","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":"ef7e26a9dc3f7497fc100827d61d3669d98e5387823043956a2055f7f3913d7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2018-09-12T10:09:18Z","title_canon_sha256":"34dd4fc4c67823a48735dc7e29bb7bf1855500dd19c18fc49de29013e9391c7d"},"schema_version":"1.0","source":{"id":"1809.04342","kind":"arxiv","version":2}},"canonical_sha256":"9e574587219f7428ef43f1ab9d683b1a6c9d11fef96a4abb399974636cce7dea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e574587219f7428ef43f1ab9d683b1a6c9d11fef96a4abb399974636cce7dea","first_computed_at":"2026-05-17T23:53:50.822374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:50.822374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qFKoOdIE94l449iVEAcgj2VFdEy2QWj5tYPNVEjb++N3dvJkR1Y7sq1YB0ZkelUadAKfugWVO4AT09QC1jKwBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:50.823048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04342","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af166312265b0c14ff6f64bf673302454b99b9fe2f891e492872d72cb6cfefb5","sha256:eb560eb47b279f91e069ad21a9637467600929d30bc7253c846c0d4558dab5bb"],"state_sha256":"8afaf3593f160627b71c2b3f7d3ac24c215bac1e4c384f7f9dac3d5b82d5ad3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JyTclAW3Zp+AuWvSZt4cGCqLw14sJ/EQ9Fwj7zlvyLhETfHgOgmJPIH46DLzuFZpq20LaH4FL40qruAOzXc4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T01:47:05.931472Z","bundle_sha256":"eb2f37602e8eb554028c27d0fa74810439c116cbf9762ca23bd679ccf3a04590"}}