{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GA3IGLCPKNC4WH4DKDT3K4JVJZ","short_pith_number":"pith:GA3IGLCP","canonical_record":{"source":{"id":"1509.03025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-10T06:07:52Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"eb7809f30e659ed621defe18a2088fc2e0cef4bc761b07cdacc6e7dde836288c","abstract_canon_sha256":"a9670f88391bd27f84dfdb1971d6e2cf5fa147a6ba7edfe0ce5ecb6184d12841"},"schema_version":"1.0"},"canonical_sha256":"3036832c4f5345cb1f8350e7b571354e7edb28a2fed236eb4200caec9177f2ca","source":{"kind":"arxiv","id":"1509.03025","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03025","created_at":"2026-05-18T01:33:25Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03025v1","created_at":"2026-05-18T01:33:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03025","created_at":"2026-05-18T01:33:25Z"},{"alias_kind":"pith_short_12","alias_value":"GA3IGLCPKNC4","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GA3IGLCPKNC4WH4D","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GA3IGLCP","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GA3IGLCPKNC4WH4DKDT3K4JVJZ","target":"record","payload":{"canonical_record":{"source":{"id":"1509.03025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-10T06:07:52Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"eb7809f30e659ed621defe18a2088fc2e0cef4bc761b07cdacc6e7dde836288c","abstract_canon_sha256":"a9670f88391bd27f84dfdb1971d6e2cf5fa147a6ba7edfe0ce5ecb6184d12841"},"schema_version":"1.0"},"canonical_sha256":"3036832c4f5345cb1f8350e7b571354e7edb28a2fed236eb4200caec9177f2ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:25.722767Z","signature_b64":"sm7o8HBTzhmL2fqFVyRsOQmuSZMS6wGLREAZyeHAoVkONa7BZpZdD4Ec87hPJawKnL9lWZjuKVO3tqo7VQUYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3036832c4f5345cb1f8350e7b571354e7edb28a2fed236eb4200caec9177f2ca","last_reissued_at":"2026-05-18T01:33:25.722115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:25.722115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.03025","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-18T01:33:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VXqwHdg8+Y92w3DbEiBE4eVPGnD5F/nVcRm057VwuIMY9N5hgh9UO39g1yy0eXnImMYQrUWb7KgA02oARkm/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:08:10.642967Z"},"content_sha256":"904f852023ddbcdc4f68ac71ef89429a8475accbeb8e7d9cef1fe408bd83be96","schema_version":"1.0","event_id":"sha256:904f852023ddbcdc4f68ac71ef89429a8475accbeb8e7d9cef1fe408bd83be96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GA3IGLCPKNC4WH4DKDT3K4JVJZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Martin J. Wainwright, Yudong Chen","submitted_at":"2015-09-10T06:07:52Z","abstract_excerpt":"Optimization problems with rank constraints arise in many applications, including matrix regression, structured PCA, matrix completion and matrix decomposition problems. An attractive heuristic for solving such problems is to factorize the low-rank matrix, and to run projected gradient descent on the nonconvex factorized optimization problem. The goal of this problem is to provide a general theoretical framework for understanding when such methods work well, and to characterize the nature of the resulting fixed point. We provide a simple set of conditions under which projected gradient descent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03025","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-18T01:33:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9vD/mPPh9B+ahfSjLbYlHig2kO6EpyUV6I2veWjh/Bl9AvCO8w7fA869NgygXA8gZqApi+ROnTVJjt+/pvTeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:08:10.643652Z"},"content_sha256":"98dbde196c2242867d72a27c8946d23972a49b458c1037fa78ed9dd6b072b13d","schema_version":"1.0","event_id":"sha256:98dbde196c2242867d72a27c8946d23972a49b458c1037fa78ed9dd6b072b13d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ/bundle.json","state_url":"https://pith.science/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ/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-25T15:08:10Z","links":{"resolver":"https://pith.science/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ","bundle":"https://pith.science/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ/bundle.json","state":"https://pith.science/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GA3IGLCPKNC4WH4DKDT3K4JVJZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GA3IGLCPKNC4WH4DKDT3K4JVJZ","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":"a9670f88391bd27f84dfdb1971d6e2cf5fa147a6ba7edfe0ce5ecb6184d12841","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-10T06:07:52Z","title_canon_sha256":"eb7809f30e659ed621defe18a2088fc2e0cef4bc761b07cdacc6e7dde836288c"},"schema_version":"1.0","source":{"id":"1509.03025","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03025","created_at":"2026-05-18T01:33:25Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03025v1","created_at":"2026-05-18T01:33:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03025","created_at":"2026-05-18T01:33:25Z"},{"alias_kind":"pith_short_12","alias_value":"GA3IGLCPKNC4","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GA3IGLCPKNC4WH4D","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GA3IGLCP","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:98dbde196c2242867d72a27c8946d23972a49b458c1037fa78ed9dd6b072b13d","target":"graph","created_at":"2026-05-18T01:33:25Z","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":"Optimization problems with rank constraints arise in many applications, including matrix regression, structured PCA, matrix completion and matrix decomposition problems. An attractive heuristic for solving such problems is to factorize the low-rank matrix, and to run projected gradient descent on the nonconvex factorized optimization problem. The goal of this problem is to provide a general theoretical framework for understanding when such methods work well, and to characterize the nature of the resulting fixed point. We provide a simple set of conditions under which projected gradient descent","authors_text":"Martin J. Wainwright, Yudong Chen","cross_cats":["cs.LG","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-10T06:07:52Z","title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03025","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:904f852023ddbcdc4f68ac71ef89429a8475accbeb8e7d9cef1fe408bd83be96","target":"record","created_at":"2026-05-18T01:33:25Z","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":"a9670f88391bd27f84dfdb1971d6e2cf5fa147a6ba7edfe0ce5ecb6184d12841","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-09-10T06:07:52Z","title_canon_sha256":"eb7809f30e659ed621defe18a2088fc2e0cef4bc761b07cdacc6e7dde836288c"},"schema_version":"1.0","source":{"id":"1509.03025","kind":"arxiv","version":1}},"canonical_sha256":"3036832c4f5345cb1f8350e7b571354e7edb28a2fed236eb4200caec9177f2ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3036832c4f5345cb1f8350e7b571354e7edb28a2fed236eb4200caec9177f2ca","first_computed_at":"2026-05-18T01:33:25.722115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:25.722115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sm7o8HBTzhmL2fqFVyRsOQmuSZMS6wGLREAZyeHAoVkONa7BZpZdD4Ec87hPJawKnL9lWZjuKVO3tqo7VQUYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:25.722767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.03025","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:904f852023ddbcdc4f68ac71ef89429a8475accbeb8e7d9cef1fe408bd83be96","sha256:98dbde196c2242867d72a27c8946d23972a49b458c1037fa78ed9dd6b072b13d"],"state_sha256":"8491af91ac814170feef9070b9eafb1c133dd23f789fc15d5e200316bed17412"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHjgY0s56vSyUldyTEZs66RcEavan9MusTpCGbjBXQ4g2qel5tKVXxW2MlBWM3nHlAJYRR0nXhg3YYoOeqnzDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:08:10.647989Z","bundle_sha256":"a8dfd26c058d9be4450c0aeef22fee086b4443596b53b286a034beae066590f3"}}