{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:JJXDP6D6D2ZHMPPFLDV2CQJGDA","short_pith_number":"pith:JJXDP6D6","schema_version":"1.0","canonical_sha256":"4a6e37f87e1eb2763de558eba1412618019e213b779530fd24b994caa885b3a2","source":{"kind":"arxiv","id":"1004.3412","version":2},"attestation_state":"computed","paper":{"title":"Multiple-precision zero-finding methods and the complexity of elementary function evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.NA"],"primary_cat":"cs.NA","authors_text":"Richard P. Brent","submitted_at":"2010-04-20T11:27:07Z","abstract_excerpt":"We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example, if x is a positive floating-point number with an n-bit fraction, then (under rather weak assumptions) an n-bit approximation to log(x) or exp(x) may be computed in time asymptotically equal to 13M(n)lg(n), where M(n) is the time required to multiply floating-point numbers with n-bit fractions. Similar results are given for the other elementary functions. Some"},"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":"1004.3412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2010-04-20T11:27:07Z","cross_cats_sorted":["cs.CC","cs.DS","cs.NA"],"title_canon_sha256":"4724ac674a906c7446efb5601ab2fcac946e6fe1c2da701b77b0ae8dbab79957","abstract_canon_sha256":"75e24130bf4b405455b1679fdfd593bc50bd838d2b10373dca55f8100ccdbc2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:06:35.989246Z","signature_b64":"mD4NYT0432airCziNSmwC0k0iA8+LzMejA2RIsnTEIjxHrmBnd3UykzJJhMYPbgJMSsCDraK7QTAwba0zLaeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a6e37f87e1eb2763de558eba1412618019e213b779530fd24b994caa885b3a2","last_reissued_at":"2026-06-03T23:06:35.988756Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:06:35.988756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple-precision zero-finding methods and the complexity of elementary function evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.NA"],"primary_cat":"cs.NA","authors_text":"Richard P. Brent","submitted_at":"2010-04-20T11:27:07Z","abstract_excerpt":"We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example, if x is a positive floating-point number with an n-bit fraction, then (under rather weak assumptions) an n-bit approximation to log(x) or exp(x) may be computed in time asymptotically equal to 13M(n)lg(n), where M(n) is the time required to multiply floating-point numbers with n-bit fractions. Similar results are given for the other elementary functions. Some"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3412","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1004.3412/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1004.3412","created_at":"2026-06-03T23:06:35.988831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.3412v2","created_at":"2026-06-03T23:06:35.988831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3412","created_at":"2026-06-03T23:06:35.988831+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJXDP6D6D2ZH","created_at":"2026-06-03T23:06:35.988831+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJXDP6D6D2ZHMPPF","created_at":"2026-06-03T23:06:35.988831+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJXDP6D6","created_at":"2026-06-03T23:06:35.988831+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.01742","citing_title":"Rendering Non-Euclidean Geometry in Real-Time Using Spherical and Hyperbolic Trigonometry","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJXDP6D6D2ZHMPPFLDV2CQJGDA","json":"https://pith.science/pith/JJXDP6D6D2ZHMPPFLDV2CQJGDA.json","graph_json":"https://pith.science/api/pith-number/JJXDP6D6D2ZHMPPFLDV2CQJGDA/graph.json","events_json":"https://pith.science/api/pith-number/JJXDP6D6D2ZHMPPFLDV2CQJGDA/events.json","paper":"https://pith.science/paper/JJXDP6D6"},"agent_actions":{"view_html":"https://pith.science/pith/JJXDP6D6D2ZHMPPFLDV2CQJGDA","download_json":"https://pith.science/pith/JJXDP6D6D2ZHMPPFLDV2CQJGDA.json","view_paper":"https://pith.science/paper/JJXDP6D6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.3412&json=true","fetch_graph":"https://pith.science/api/pith-number/JJXDP6D6D2ZHMPPFLDV2CQJGDA/graph.json","fetch_events":"https://pith.science/api/pith-number/JJXDP6D6D2ZHMPPFLDV2CQJGDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJXDP6D6D2ZHMPPFLDV2CQJGDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJXDP6D6D2ZHMPPFLDV2CQJGDA/action/storage_attestation","attest_author":"https://pith.science/pith/JJXDP6D6D2ZHMPPFLDV2CQJGDA/action/author_attestation","sign_citation":"https://pith.science/pith/JJXDP6D6D2ZHMPPFLDV2CQJGDA/action/citation_signature","submit_replication":"https://pith.science/pith/JJXDP6D6D2ZHMPPFLDV2CQJGDA/action/replication_record"}},"created_at":"2026-06-03T23:06:35.988831+00:00","updated_at":"2026-06-03T23:06:35.988831+00:00"}