{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AFTPANDC7BKLYUF5A2ANKPHE5N","short_pith_number":"pith:AFTPANDC","canonical_record":{"source":{"id":"1802.06286","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-17T20:30:47Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"5f4dd89244d5e0e806c1f3f4b8bac2dfc9261fb9f173aa2aa0c03c9c100e3535","abstract_canon_sha256":"5400ba44e357baf7493b648b4be47cf855dcfb36abb1dc93770127db02ba0083"},"schema_version":"1.0"},"canonical_sha256":"0166f03462f854bc50bd0680d53ce4eb651c9c0e1b36b3b752d9fb43d0700058","source":{"kind":"arxiv","id":"1802.06286","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06286","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06286v2","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06286","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"AFTPANDC7BKL","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AFTPANDC7BKLYUF5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AFTPANDC","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AFTPANDC7BKLYUF5A2ANKPHE5N","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06286","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-17T20:30:47Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"5f4dd89244d5e0e806c1f3f4b8bac2dfc9261fb9f173aa2aa0c03c9c100e3535","abstract_canon_sha256":"5400ba44e357baf7493b648b4be47cf855dcfb36abb1dc93770127db02ba0083"},"schema_version":"1.0"},"canonical_sha256":"0166f03462f854bc50bd0680d53ce4eb651c9c0e1b36b3b752d9fb43d0700058","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:27.906519Z","signature_b64":"duC3z4zJlgRqdd/+d0c8VWdNTMyXX91moLcU5teAr+t/irtbpOYYJu4Klkfige1gf2mNEESGaKFHFQzdxb/qDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0166f03462f854bc50bd0680d53ce4eb651c9c0e1b36b3b752d9fb43d0700058","last_reissued_at":"2026-05-17T23:59:27.905822Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:27.905822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06286","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-17T23:59:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M69+NVNe2jWFC4G97CJKFLtlQuaUn7OpJSaLyWliAeSqIve3cfR1fZIvXjsXRa25i1yqZ8LuL7H+wjeyjsHcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:41:54.655604Z"},"content_sha256":"718418f746397a7e95dc4913f8f89e44e64c0e46e6fef24088a93183d3e88002","schema_version":"1.0","event_id":"sha256:718418f746397a7e95dc4913f8f89e44e64c0e46e6fef24088a93183d3e88002"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AFTPANDC7BKLYUF5A2ANKPHE5N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonconvex Matrix Factorization from Rank-One Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Cong Ma, Yuanxin Li, Yuejie Chi, Yuxin Chen","submitted_at":"2018-02-17T20:30:47Z","abstract_excerpt":"We consider the problem of recovering low-rank matrices from random rank-one measurements, which spans numerous applications including covariance sketching, phase retrieval, quantum state tomography, and learning shallow polynomial neural networks, among others. Our approach is to directly estimate the low-rank factor by minimizing a nonconvex quadratic loss function via vanilla gradient descent, following a tailored spectral initialization. When the true rank is small, this algorithm is guaranteed to converge to the ground truth (up to global ambiguity) with near-optimal sample complexity and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06286","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-17T23:59:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C9LwCXI3LFDlN3OYyv4b4FrIeRAe8uv5MFW7hlDAF4uTBv72UVCCXpDpyNBsAOiqvjFVSo6XVIEkLpKVFtX2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:41:54.656236Z"},"content_sha256":"8db21642327953a8710e187128f61b8a3594edf7048bb3751279d9970dbba8e0","schema_version":"1.0","event_id":"sha256:8db21642327953a8710e187128f61b8a3594edf7048bb3751279d9970dbba8e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AFTPANDC7BKLYUF5A2ANKPHE5N/bundle.json","state_url":"https://pith.science/pith/AFTPANDC7BKLYUF5A2ANKPHE5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AFTPANDC7BKLYUF5A2ANKPHE5N/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-26T01:41:54Z","links":{"resolver":"https://pith.science/pith/AFTPANDC7BKLYUF5A2ANKPHE5N","bundle":"https://pith.science/pith/AFTPANDC7BKLYUF5A2ANKPHE5N/bundle.json","state":"https://pith.science/pith/AFTPANDC7BKLYUF5A2ANKPHE5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AFTPANDC7BKLYUF5A2ANKPHE5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AFTPANDC7BKLYUF5A2ANKPHE5N","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":"5400ba44e357baf7493b648b4be47cf855dcfb36abb1dc93770127db02ba0083","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-17T20:30:47Z","title_canon_sha256":"5f4dd89244d5e0e806c1f3f4b8bac2dfc9261fb9f173aa2aa0c03c9c100e3535"},"schema_version":"1.0","source":{"id":"1802.06286","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06286","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06286v2","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06286","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"AFTPANDC7BKL","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AFTPANDC7BKLYUF5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AFTPANDC","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:8db21642327953a8710e187128f61b8a3594edf7048bb3751279d9970dbba8e0","target":"graph","created_at":"2026-05-17T23:59:27Z","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 consider the problem of recovering low-rank matrices from random rank-one measurements, which spans numerous applications including covariance sketching, phase retrieval, quantum state tomography, and learning shallow polynomial neural networks, among others. Our approach is to directly estimate the low-rank factor by minimizing a nonconvex quadratic loss function via vanilla gradient descent, following a tailored spectral initialization. When the true rank is small, this algorithm is guaranteed to converge to the ground truth (up to global ambiguity) with near-optimal sample complexity and","authors_text":"Cong Ma, Yuanxin Li, Yuejie Chi, Yuxin Chen","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-17T20:30:47Z","title":"Nonconvex Matrix Factorization from Rank-One Measurements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06286","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:718418f746397a7e95dc4913f8f89e44e64c0e46e6fef24088a93183d3e88002","target":"record","created_at":"2026-05-17T23:59:27Z","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":"5400ba44e357baf7493b648b4be47cf855dcfb36abb1dc93770127db02ba0083","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-17T20:30:47Z","title_canon_sha256":"5f4dd89244d5e0e806c1f3f4b8bac2dfc9261fb9f173aa2aa0c03c9c100e3535"},"schema_version":"1.0","source":{"id":"1802.06286","kind":"arxiv","version":2}},"canonical_sha256":"0166f03462f854bc50bd0680d53ce4eb651c9c0e1b36b3b752d9fb43d0700058","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0166f03462f854bc50bd0680d53ce4eb651c9c0e1b36b3b752d9fb43d0700058","first_computed_at":"2026-05-17T23:59:27.905822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:27.905822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"duC3z4zJlgRqdd/+d0c8VWdNTMyXX91moLcU5teAr+t/irtbpOYYJu4Klkfige1gf2mNEESGaKFHFQzdxb/qDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:27.906519Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06286","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:718418f746397a7e95dc4913f8f89e44e64c0e46e6fef24088a93183d3e88002","sha256:8db21642327953a8710e187128f61b8a3594edf7048bb3751279d9970dbba8e0"],"state_sha256":"d832f7b3a143e8928f73efbebf9119b0749a06d0e3d2090e0f47774575fc8685"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KknRY8+c/99583whPp/Q90J7DUufH/engyai66J9EIg3vUqcgCBjflExPDswSIm7Rbaoxp8gRSZoA+IYf4pcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:41:54.659880Z","bundle_sha256":"bb9a75a5aee8eaabcc73d430abb9fb1b66ea2bb07dba1176fdfc3b35ec1608ca"}}