{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7RGJB2Y7PX7KXAM72KAMHOEXWU","short_pith_number":"pith:7RGJB2Y7","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"},"canonical_sha256":"fc4c90eb1f7dfeab819fd280c3b897b5232cd81c558c023b4281d42b4c3525ad","source":{"kind":"arxiv","id":"1804.11000","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.11000","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.11000v1","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11000","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"7RGJB2Y7PX7K","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7RGJB2Y7PX7KXAM7","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7RGJB2Y7","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7RGJB2Y7PX7KXAM72KAMHOEXWU","target":"record","payload":{"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"},"canonical_sha256":"fc4c90eb1f7dfeab819fd280c3b897b5232cd81c558c023b4281d42b4c3525ad","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"},"source_kind":"arxiv","source_id":"1804.11000","source_version":1,"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-18T00:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zHZMGbpYd60Aud0V8ta0x/GZ0/OSnjZPkskc8uqe417qHtbZkUM+V5D19uFNVidh1AFF5iJowK+r7qoT3LQyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:10:30.559834Z"},"content_sha256":"a2d88669adf4ec4a2eafa24d4fa5d7e3edf81c4dd1c49508e740f8f54ca19d50","schema_version":"1.0","event_id":"sha256:a2d88669adf4ec4a2eafa24d4fa5d7e3edf81c4dd1c49508e740f8f54ca19d50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7RGJB2Y7PX7KXAM72KAMHOEXWU","target":"graph","payload":{"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"},"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-18T00:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9caYeb0JBzd2ycQGdXkOT/mhKZE2a+Mq00I+4DNbHpwMO2+BUi6opXFNHhi+vQOYtyRA9nToyZFsTHJCvuFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:10:30.560483Z"},"content_sha256":"483ff5f5b80f89937d83d7740c3f799842ff1f72195249b6fb23ecff06c3451e","schema_version":"1.0","event_id":"sha256:483ff5f5b80f89937d83d7740c3f799842ff1f72195249b6fb23ecff06c3451e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU/bundle.json","state_url":"https://pith.science/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU/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-08T05:10:30Z","links":{"resolver":"https://pith.science/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU","bundle":"https://pith.science/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU/bundle.json","state":"https://pith.science/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RGJB2Y7PX7KXAM72KAMHOEXWU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7RGJB2Y7PX7KXAM72KAMHOEXWU","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":"15d5f584d5f26207662c479042dfcffa4281d0c7bf9562355aa9fbcad3aedbfc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-04-29T23:02:29Z","title_canon_sha256":"c68d9b06caf4e76d9ec5373f074544b0fb077325540a54e2484073be0bc422a0"},"schema_version":"1.0","source":{"id":"1804.11000","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.11000","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.11000v1","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11000","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"7RGJB2Y7PX7K","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7RGJB2Y7PX7KXAM7","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7RGJB2Y7","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:483ff5f5b80f89937d83d7740c3f799842ff1f72195249b6fb23ecff06c3451e","target":"graph","created_at":"2026-05-18T00:17:14Z","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":"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","authors_text":"Evan S. Gawlik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-04-29T23:02:29Z","title":"Zolotarev Iterations for the Matrix Square Root"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11000","kind":"arxiv","version":1},"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:a2d88669adf4ec4a2eafa24d4fa5d7e3edf81c4dd1c49508e740f8f54ca19d50","target":"record","created_at":"2026-05-18T00:17:14Z","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":"15d5f584d5f26207662c479042dfcffa4281d0c7bf9562355aa9fbcad3aedbfc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-04-29T23:02:29Z","title_canon_sha256":"c68d9b06caf4e76d9ec5373f074544b0fb077325540a54e2484073be0bc422a0"},"schema_version":"1.0","source":{"id":"1804.11000","kind":"arxiv","version":1}},"canonical_sha256":"fc4c90eb1f7dfeab819fd280c3b897b5232cd81c558c023b4281d42b4c3525ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc4c90eb1f7dfeab819fd280c3b897b5232cd81c558c023b4281d42b4c3525ad","first_computed_at":"2026-05-18T00:17:14.933348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:14.933348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5PH0g+p4PzcgcMGUhWliC+h7WKAAtVEaAP1nuSIhfQNotwSNyuPokMNmBN8a71SDN8C+XdhGAkOehbJETa51Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:14.933904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.11000","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2d88669adf4ec4a2eafa24d4fa5d7e3edf81c4dd1c49508e740f8f54ca19d50","sha256:483ff5f5b80f89937d83d7740c3f799842ff1f72195249b6fb23ecff06c3451e"],"state_sha256":"0e6414f43273e3a35418094917b7cc01d0b5e3105e17a0a56033fec2e016cc61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lh2+iuruTYf9nVtO6hPwke0xMaq/EDy3+l54XGaMiMs8yZ5oFXHDemYuI9lJZO8koRepe7ruTtrsEQO5Inv1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:10:30.563799Z","bundle_sha256":"ea3e955a2cb7d217cab4dc2dcaafcd0d035cbc9e187680c94f480958bd68d36e"}}