{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PYBJK2KXVM5Q3NPXPX5P2C55ML","short_pith_number":"pith:PYBJK2KX","canonical_record":{"source":{"id":"1903.06268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-14T21:27:25Z","cross_cats_sorted":[],"title_canon_sha256":"cb80160eb735c8bdcdb2c4cf5a5f977b49182e4d0f2b168af2a7d1e0a43fc4bd","abstract_canon_sha256":"cef5882c854ef448b81f1fbc72af755f635a20d51598b1f2e6b046225170f39c"},"schema_version":"1.0"},"canonical_sha256":"7e02956957ab3b0db5f77dfafd0bbd62ffda5895cf0ab89e1cd52de30a7c1b37","source":{"kind":"arxiv","id":"1903.06268","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06268","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06268v1","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06268","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"pith_short_12","alias_value":"PYBJK2KXVM5Q","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PYBJK2KXVM5Q3NPX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PYBJK2KX","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PYBJK2KXVM5Q3NPXPX5P2C55ML","target":"record","payload":{"canonical_record":{"source":{"id":"1903.06268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-14T21:27:25Z","cross_cats_sorted":[],"title_canon_sha256":"cb80160eb735c8bdcdb2c4cf5a5f977b49182e4d0f2b168af2a7d1e0a43fc4bd","abstract_canon_sha256":"cef5882c854ef448b81f1fbc72af755f635a20d51598b1f2e6b046225170f39c"},"schema_version":"1.0"},"canonical_sha256":"7e02956957ab3b0db5f77dfafd0bbd62ffda5895cf0ab89e1cd52de30a7c1b37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:11.287735Z","signature_b64":"H4XKt0IJ47kbkz/JTu2HvtBSXkpKX3x0GDisLsVQ81zPC1N264OTGoMfrSgTBN/bHOGX3i9v5NRFyLCIMk3EBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e02956957ab3b0db5f77dfafd0bbd62ffda5895cf0ab89e1cd52de30a7c1b37","last_reissued_at":"2026-05-17T23:51:11.287109Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:11.287109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.06268","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-17T23:51:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+a8eiYjiuwq93umCTz/dQIoJAW1zz6P+JQOtWL1Fg3r21r7EwdrJ1oxP/AJsJc9YyNhgohbVFMtTdXnoi7t7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:12:55.100715Z"},"content_sha256":"39a2b861dab0364c5ad086f12e40e419aa8e4ea272b43f1abb2310cefaea6527","schema_version":"1.0","event_id":"sha256:39a2b861dab0364c5ad086f12e40e419aa8e4ea272b43f1abb2310cefaea6527"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PYBJK2KXVM5Q3NPXPX5P2C55ML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rational Minimax Iterations for Computing the Matrix $p$th Root","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Evan S. Gawlik","submitted_at":"2019-03-14T21:27:25Z","abstract_excerpt":"In [E. S. Gawlik, Zolotarev iterations for the matrix square root, arXiv preprint 1804.11000, (2018)], a family of iterations for computing the matrix square root was constructed by exploiting a recursion obeyed by Zolotarev's rational minimax approximants of the function $z^{1/2}$. The present paper generalizes this construction by deriving rational minimax iterations for the matrix $p^{th}$ root, where $p \\ge 2$ is an integer. The analysis of these iterations is considerably different from the case $p=2$, owing to the fact that when $p>2$, rational minimax approximants of the function $z^{1/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06268","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-17T23:51:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VvIKOK8704gv7S0SuI3gB6XpZTNewOfSEkLE3Z0nH5ImGQhph6PVundgVcY1vqwlBzHF5jEvqLoBNlV///5QAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:12:55.101573Z"},"content_sha256":"e095632e3ef494a4850a9499c35597423da475a8ea1a484b1a39805b8c32f203","schema_version":"1.0","event_id":"sha256:e095632e3ef494a4850a9499c35597423da475a8ea1a484b1a39805b8c32f203"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML/bundle.json","state_url":"https://pith.science/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML/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-08T04:12:55Z","links":{"resolver":"https://pith.science/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML","bundle":"https://pith.science/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML/bundle.json","state":"https://pith.science/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYBJK2KXVM5Q3NPXPX5P2C55ML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PYBJK2KXVM5Q3NPXPX5P2C55ML","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":"cef5882c854ef448b81f1fbc72af755f635a20d51598b1f2e6b046225170f39c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-14T21:27:25Z","title_canon_sha256":"cb80160eb735c8bdcdb2c4cf5a5f977b49182e4d0f2b168af2a7d1e0a43fc4bd"},"schema_version":"1.0","source":{"id":"1903.06268","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06268","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06268v1","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06268","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"pith_short_12","alias_value":"PYBJK2KXVM5Q","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PYBJK2KXVM5Q3NPX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PYBJK2KX","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:e095632e3ef494a4850a9499c35597423da475a8ea1a484b1a39805b8c32f203","target":"graph","created_at":"2026-05-17T23:51:11Z","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":"In [E. S. Gawlik, Zolotarev iterations for the matrix square root, arXiv preprint 1804.11000, (2018)], a family of iterations for computing the matrix square root was constructed by exploiting a recursion obeyed by Zolotarev's rational minimax approximants of the function $z^{1/2}$. The present paper generalizes this construction by deriving rational minimax iterations for the matrix $p^{th}$ root, where $p \\ge 2$ is an integer. The analysis of these iterations is considerably different from the case $p=2$, owing to the fact that when $p>2$, rational minimax approximants of the function $z^{1/","authors_text":"Evan S. Gawlik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-14T21:27:25Z","title":"Rational Minimax Iterations for Computing the Matrix $p$th Root"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06268","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:39a2b861dab0364c5ad086f12e40e419aa8e4ea272b43f1abb2310cefaea6527","target":"record","created_at":"2026-05-17T23:51:11Z","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":"cef5882c854ef448b81f1fbc72af755f635a20d51598b1f2e6b046225170f39c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-14T21:27:25Z","title_canon_sha256":"cb80160eb735c8bdcdb2c4cf5a5f977b49182e4d0f2b168af2a7d1e0a43fc4bd"},"schema_version":"1.0","source":{"id":"1903.06268","kind":"arxiv","version":1}},"canonical_sha256":"7e02956957ab3b0db5f77dfafd0bbd62ffda5895cf0ab89e1cd52de30a7c1b37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e02956957ab3b0db5f77dfafd0bbd62ffda5895cf0ab89e1cd52de30a7c1b37","first_computed_at":"2026-05-17T23:51:11.287109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:11.287109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H4XKt0IJ47kbkz/JTu2HvtBSXkpKX3x0GDisLsVQ81zPC1N264OTGoMfrSgTBN/bHOGX3i9v5NRFyLCIMk3EBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:11.287735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.06268","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39a2b861dab0364c5ad086f12e40e419aa8e4ea272b43f1abb2310cefaea6527","sha256:e095632e3ef494a4850a9499c35597423da475a8ea1a484b1a39805b8c32f203"],"state_sha256":"cdd222db5321493d00cf7d91a104537b9ae81f7f92fdb26d5b7294b51438ad41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1uJiy6LgooGTTcPXpIYnvE2XZzx3N1go/nWuNjvFZ19gQH02FmmJKFcRTi18ckSQQLAJjuIk9M2SmZdS/kaxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:12:55.105286Z","bundle_sha256":"a88ac2abe80ca453d725e7a21f9aa0d07a7e49309f3b73e60b271c7d35c7b355"}}