{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:34ZG4UEG3HSBI6N3OPLQTAXAVM","short_pith_number":"pith:34ZG4UEG","canonical_record":{"source":{"id":"1507.05854","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-21T14:42:45Z","cross_cats_sorted":["cs.DS","cs.NA","math.OC"],"title_canon_sha256":"f83fe1dfd459eea51d444c987fa925c4f626706c726c01754446320c06ae243e","abstract_canon_sha256":"f8fe0a60b177f30eeeecf4e1f45c2723781d0c1719b204e22a91004f71ef1532"},"schema_version":"1.0"},"canonical_sha256":"df326e5086d9e41479bb73d70982e0ab05259cd3320e514bc4064e314614f0ff","source":{"kind":"arxiv","id":"1507.05854","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05854","created_at":"2026-05-18T00:49:04Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05854v2","created_at":"2026-05-18T00:49:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05854","created_at":"2026-05-18T00:49:04Z"},{"alias_kind":"pith_short_12","alias_value":"34ZG4UEG3HSB","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"34ZG4UEG3HSBI6N3","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"34ZG4UEG","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:34ZG4UEG3HSBI6N3OPLQTAXAVM","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05854","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-21T14:42:45Z","cross_cats_sorted":["cs.DS","cs.NA","math.OC"],"title_canon_sha256":"f83fe1dfd459eea51d444c987fa925c4f626706c726c01754446320c06ae243e","abstract_canon_sha256":"f8fe0a60b177f30eeeecf4e1f45c2723781d0c1719b204e22a91004f71ef1532"},"schema_version":"1.0"},"canonical_sha256":"df326e5086d9e41479bb73d70982e0ab05259cd3320e514bc4064e314614f0ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:04.874425Z","signature_b64":"ggXNaQSs3l+MtNo3zIiUxiiBv4SoBDskDJ+6Yx2e8xECvzyPwmIWD16F3cicvWITiwoGyniC5GBlE7tzgWmvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df326e5086d9e41479bb73d70982e0ab05259cd3320e514bc4064e314614f0ff","last_reissued_at":"2026-05-18T00:49:04.873971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:04.873971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05854","source_version":2,"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:49:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ql1CdukTyV9ptJhbRvbsZKj1fMf889Q4Oj6Av5KxJYaWtgnCOtf2DszFmCnn6LFIFlK9Ka3GMaAj/GVo3VPsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:08:10.685868Z"},"content_sha256":"65edb24d20f77eabd4de2ea6344337c54d2cfb707f762657affbceedf40830bf","schema_version":"1.0","event_id":"sha256:65edb24d20f77eabd4de2ea6344337c54d2cfb707f762657affbceedf40830bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:34ZG4UEG3HSBI6N3OPLQTAXAVM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Global Convergence of Non-Convex Gradient Descent for Computing Matrix Squareroot","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Chi Jin, Praneeth Netrapalli, Prateek Jain, Sham M. Kakade","submitted_at":"2015-07-21T14:42:45Z","abstract_excerpt":"While there has been a significant amount of work studying gradient descent techniques for non-convex optimization problems over the last few years, all existing results establish either local convergence with good rates or global convergence with highly suboptimal rates, for many problems of interest. In this paper, we take the first step in getting the best of both worlds -- establishing global convergence and obtaining a good rate of convergence for the problem of computing squareroot of a positive definite (PD) matrix, which is a widely studied problem in numerical linear algebra with appl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05854","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":""},"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:49:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"06tG8W3txDnIBV9wTeslRi9KEIwTMhhUTm7VpC4s4nDJ1aekkbHf1HY/liIUt/DvAYmtckRfFCGxXVKmKd95DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:08:10.686489Z"},"content_sha256":"514ca2949aaf38952b12103a22cdf3dd5155820ef8ea6cdb0949bea77d92b077","schema_version":"1.0","event_id":"sha256:514ca2949aaf38952b12103a22cdf3dd5155820ef8ea6cdb0949bea77d92b077"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34ZG4UEG3HSBI6N3OPLQTAXAVM/bundle.json","state_url":"https://pith.science/pith/34ZG4UEG3HSBI6N3OPLQTAXAVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34ZG4UEG3HSBI6N3OPLQTAXAVM/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-05-26T02:08:10Z","links":{"resolver":"https://pith.science/pith/34ZG4UEG3HSBI6N3OPLQTAXAVM","bundle":"https://pith.science/pith/34ZG4UEG3HSBI6N3OPLQTAXAVM/bundle.json","state":"https://pith.science/pith/34ZG4UEG3HSBI6N3OPLQTAXAVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34ZG4UEG3HSBI6N3OPLQTAXAVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:34ZG4UEG3HSBI6N3OPLQTAXAVM","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":"f8fe0a60b177f30eeeecf4e1f45c2723781d0c1719b204e22a91004f71ef1532","cross_cats_sorted":["cs.DS","cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-21T14:42:45Z","title_canon_sha256":"f83fe1dfd459eea51d444c987fa925c4f626706c726c01754446320c06ae243e"},"schema_version":"1.0","source":{"id":"1507.05854","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05854","created_at":"2026-05-18T00:49:04Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05854v2","created_at":"2026-05-18T00:49:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05854","created_at":"2026-05-18T00:49:04Z"},{"alias_kind":"pith_short_12","alias_value":"34ZG4UEG3HSB","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"34ZG4UEG3HSBI6N3","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"34ZG4UEG","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:514ca2949aaf38952b12103a22cdf3dd5155820ef8ea6cdb0949bea77d92b077","target":"graph","created_at":"2026-05-18T00:49:04Z","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":"While there has been a significant amount of work studying gradient descent techniques for non-convex optimization problems over the last few years, all existing results establish either local convergence with good rates or global convergence with highly suboptimal rates, for many problems of interest. In this paper, we take the first step in getting the best of both worlds -- establishing global convergence and obtaining a good rate of convergence for the problem of computing squareroot of a positive definite (PD) matrix, which is a widely studied problem in numerical linear algebra with appl","authors_text":"Chi Jin, Praneeth Netrapalli, Prateek Jain, Sham M. Kakade","cross_cats":["cs.DS","cs.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-21T14:42:45Z","title":"Global Convergence of Non-Convex Gradient Descent for Computing Matrix Squareroot"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05854","kind":"arxiv","version":2},"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:65edb24d20f77eabd4de2ea6344337c54d2cfb707f762657affbceedf40830bf","target":"record","created_at":"2026-05-18T00:49:04Z","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":"f8fe0a60b177f30eeeecf4e1f45c2723781d0c1719b204e22a91004f71ef1532","cross_cats_sorted":["cs.DS","cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-21T14:42:45Z","title_canon_sha256":"f83fe1dfd459eea51d444c987fa925c4f626706c726c01754446320c06ae243e"},"schema_version":"1.0","source":{"id":"1507.05854","kind":"arxiv","version":2}},"canonical_sha256":"df326e5086d9e41479bb73d70982e0ab05259cd3320e514bc4064e314614f0ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df326e5086d9e41479bb73d70982e0ab05259cd3320e514bc4064e314614f0ff","first_computed_at":"2026-05-18T00:49:04.873971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:04.873971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ggXNaQSs3l+MtNo3zIiUxiiBv4SoBDskDJ+6Yx2e8xECvzyPwmIWD16F3cicvWITiwoGyniC5GBlE7tzgWmvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:04.874425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05854","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65edb24d20f77eabd4de2ea6344337c54d2cfb707f762657affbceedf40830bf","sha256:514ca2949aaf38952b12103a22cdf3dd5155820ef8ea6cdb0949bea77d92b077"],"state_sha256":"26f7eba8f324df685c5e517da4b2759fcb05b9d77226eaa9104c259a96eea567"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2vaVgA5XoQicjlUnjtCnyGykZBZw9Zzm9uKhB9lItg13sk+rNNEh6YHtuzZ/yai6fRpIIUocaSJBrNduUUVQCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:08:10.689896Z","bundle_sha256":"33568ba10a965304e6f87f6711ad0df575498197330449d41e124a5654c9b636"}}