{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:IPX4MC24WC2UGYKWE2S3RYXVV7","short_pith_number":"pith:IPX4MC24","schema_version":"1.0","canonical_sha256":"43efc60b5cb0b543615626a5b8e2f5afda5342acab1ce3c6c72efcd994b2dd58","source":{"kind":"arxiv","id":"cs/0701151","version":1},"attestation_state":"computed","paper":{"title":"Time- and Space-Efficient Evaluation of Some Hypergeometric Constants","license":"","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Emmanuel Thom\\'e (INRIA Lorraine - LORIA), Eugene Zima, Guillaume Hanrot (INRIA Lorraine - LORIA), Howard Cheng, Paul Zimmermann (INRIA Lorraine - LORIA)","submitted_at":"2007-01-25T08:07:38Z","abstract_excerpt":"The currently best known algorithms for the numerical evaluation of hypergeometric constants such as $\\zeta(3)$ to $d$ decimal digits have time complexity $O(M(d) \\log^2 d)$ and space complexity of $O(d \\log d)$ or $O(d)$. Following work from Cheng, Gergel, Kim and Zima, we present a new algorithm with the same asymptotic complexity, but more efficient in practice. Our implementation of this algorithm improves slightly over existing programs for the computation of $\\pi$, and we announce a new record of 2 billion digits for $\\zeta(3)$."},"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":"cs/0701151","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.SC","submitted_at":"2007-01-25T08:07:38Z","cross_cats_sorted":[],"title_canon_sha256":"c261cbc18dc970fb5e777fd524d99ef79ec75af0c2543111b6c88bf667c504b2","abstract_canon_sha256":"e1998f4a08bb14f4132dc730a64616d1fd62b1f66e75cbce2ed491703f6ad2ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:19.662765Z","signature_b64":"uHySjbenFiHWDprFGPOBQUl3IuYJj3yaWgQuvwVYuaQQIyFZFKT4U7LH3eK5NCOQl9TD8Q9ToLXBHmUlp61XDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43efc60b5cb0b543615626a5b8e2f5afda5342acab1ce3c6c72efcd994b2dd58","last_reissued_at":"2026-05-18T01:09:19.662231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:19.662231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time- and Space-Efficient Evaluation of Some Hypergeometric Constants","license":"","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Emmanuel Thom\\'e (INRIA Lorraine - LORIA), Eugene Zima, Guillaume Hanrot (INRIA Lorraine - LORIA), Howard Cheng, Paul Zimmermann (INRIA Lorraine - LORIA)","submitted_at":"2007-01-25T08:07:38Z","abstract_excerpt":"The currently best known algorithms for the numerical evaluation of hypergeometric constants such as $\\zeta(3)$ to $d$ decimal digits have time complexity $O(M(d) \\log^2 d)$ and space complexity of $O(d \\log d)$ or $O(d)$. Following work from Cheng, Gergel, Kim and Zima, we present a new algorithm with the same asymptotic complexity, but more efficient in practice. Our implementation of this algorithm improves slightly over existing programs for the computation of $\\pi$, and we announce a new record of 2 billion digits for $\\zeta(3)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701151","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":"cs/0701151","created_at":"2026-05-18T01:09:19.662331+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0701151v1","created_at":"2026-05-18T01:09:19.662331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701151","created_at":"2026-05-18T01:09:19.662331+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPX4MC24WC2U","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPX4MC24WC2UGYKW","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPX4MC24","created_at":"2026-05-18T12:25:55.427421+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/IPX4MC24WC2UGYKWE2S3RYXVV7","json":"https://pith.science/pith/IPX4MC24WC2UGYKWE2S3RYXVV7.json","graph_json":"https://pith.science/api/pith-number/IPX4MC24WC2UGYKWE2S3RYXVV7/graph.json","events_json":"https://pith.science/api/pith-number/IPX4MC24WC2UGYKWE2S3RYXVV7/events.json","paper":"https://pith.science/paper/IPX4MC24"},"agent_actions":{"view_html":"https://pith.science/pith/IPX4MC24WC2UGYKWE2S3RYXVV7","download_json":"https://pith.science/pith/IPX4MC24WC2UGYKWE2S3RYXVV7.json","view_paper":"https://pith.science/paper/IPX4MC24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0701151&json=true","fetch_graph":"https://pith.science/api/pith-number/IPX4MC24WC2UGYKWE2S3RYXVV7/graph.json","fetch_events":"https://pith.science/api/pith-number/IPX4MC24WC2UGYKWE2S3RYXVV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPX4MC24WC2UGYKWE2S3RYXVV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPX4MC24WC2UGYKWE2S3RYXVV7/action/storage_attestation","attest_author":"https://pith.science/pith/IPX4MC24WC2UGYKWE2S3RYXVV7/action/author_attestation","sign_citation":"https://pith.science/pith/IPX4MC24WC2UGYKWE2S3RYXVV7/action/citation_signature","submit_replication":"https://pith.science/pith/IPX4MC24WC2UGYKWE2S3RYXVV7/action/replication_record"}},"created_at":"2026-05-18T01:09:19.662331+00:00","updated_at":"2026-05-18T01:09:19.662331+00:00"}