{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7RGJB2Y7PX7KXAM72KAMHOEXWU","short_pith_number":"pith:7RGJB2Y7","schema_version":"1.0","canonical_sha256":"fc4c90eb1f7dfeab819fd280c3b897b5232cd81c558c023b4281d42b4c3525ad","source":{"kind":"arxiv","id":"1804.11000","version":1},"attestation_state":"computed","paper":{"title":"Zolotarev Iterations for the Matrix Square Root","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Evan S. Gawlik","submitted_at":"2018-04-29T23:02:29Z","abstract_excerpt":"We construct a family of iterations for computing the principal square root of a square matrix $A$ using Zolotarev's rational minimax approximants of the square root function. We show that these rational functions obey a recursion, allowing one to iteratively generate optimal rational approximants of $\\sqrt{z}$ of high degree using compositions and products of low-degree rational functions. The corresponding iterations for the matrix square root converge to $A^{1/2}$ for any input matrix $A$ having no nonpositive real eigenvalues. In special limiting cases, these iterations reduce to known ite"},"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":"1804.11000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-04-29T23:02:29Z","cross_cats_sorted":[],"title_canon_sha256":"c68d9b06caf4e76d9ec5373f074544b0fb077325540a54e2484073be0bc422a0","abstract_canon_sha256":"15d5f584d5f26207662c479042dfcffa4281d0c7bf9562355aa9fbcad3aedbfc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:14.933904Z","signature_b64":"5PH0g+p4PzcgcMGUhWliC+h7WKAAtVEaAP1nuSIhfQNotwSNyuPokMNmBN8a71SDN8C+XdhGAkOehbJETa51Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc4c90eb1f7dfeab819fd280c3b897b5232cd81c558c023b4281d42b4c3525ad","last_reissued_at":"2026-05-18T00:17:14.933348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:14.933348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zolotarev Iterations for the Matrix Square Root","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Evan S. Gawlik","submitted_at":"2018-04-29T23:02:29Z","abstract_excerpt":"We construct a family of iterations for computing the principal square root of a square matrix $A$ using Zolotarev's rational minimax approximants of the square root function. We show that these rational functions obey a recursion, allowing one to iteratively generate optimal rational approximants of $\\sqrt{z}$ of high degree using compositions and products of low-degree rational functions. The corresponding iterations for the matrix square root converge to $A^{1/2}$ for any input matrix $A$ having no nonpositive real eigenvalues. In special limiting cases, these iterations reduce to known ite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11000","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":"1804.11000","created_at":"2026-05-18T00:17:14.933436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.11000v1","created_at":"2026-05-18T00:17:14.933436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11000","created_at":"2026-05-18T00:17:14.933436+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RGJB2Y7PX7K","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RGJB2Y7PX7KXAM7","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RGJB2Y7","created_at":"2026-05-18T12:32:11.075285+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/7RGJB2Y7PX7KXAM72KAMHOEXWU","json":"https://pith.science/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU.json","graph_json":"https://pith.science/api/pith-number/7RGJB2Y7PX7KXAM72KAMHOEXWU/graph.json","events_json":"https://pith.science/api/pith-number/7RGJB2Y7PX7KXAM72KAMHOEXWU/events.json","paper":"https://pith.science/paper/7RGJB2Y7"},"agent_actions":{"view_html":"https://pith.science/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU","download_json":"https://pith.science/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU.json","view_paper":"https://pith.science/paper/7RGJB2Y7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.11000&json=true","fetch_graph":"https://pith.science/api/pith-number/7RGJB2Y7PX7KXAM72KAMHOEXWU/graph.json","fetch_events":"https://pith.science/api/pith-number/7RGJB2Y7PX7KXAM72KAMHOEXWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU/action/storage_attestation","attest_author":"https://pith.science/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU/action/author_attestation","sign_citation":"https://pith.science/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU/action/citation_signature","submit_replication":"https://pith.science/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU/action/replication_record"}},"created_at":"2026-05-18T00:17:14.933436+00:00","updated_at":"2026-05-18T00:17:14.933436+00:00"}