{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DCFKN7HAOCZHRM5YFVRO4AELNT","short_pith_number":"pith:DCFKN7HA","canonical_record":{"source":{"id":"1705.07469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-21T16:20:55Z","cross_cats_sorted":[],"title_canon_sha256":"5040d570f6e6fc22fd500d7ca5d439fc6b52122f4033c362a429f13f96e45d83","abstract_canon_sha256":"2c557b94cd5131fa9da599acb98dce2b96a344932a0717097780742b049e5d1c"},"schema_version":"1.0"},"canonical_sha256":"188aa6fce070b278b3b82d62ee008b6cf922a91f2b616461c1249597e9e56d0d","source":{"kind":"arxiv","id":"1705.07469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07469","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07469v1","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07469","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"DCFKN7HAOCZH","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DCFKN7HAOCZHRM5Y","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DCFKN7HA","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DCFKN7HAOCZHRM5YFVRO4AELNT","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-21T16:20:55Z","cross_cats_sorted":[],"title_canon_sha256":"5040d570f6e6fc22fd500d7ca5d439fc6b52122f4033c362a429f13f96e45d83","abstract_canon_sha256":"2c557b94cd5131fa9da599acb98dce2b96a344932a0717097780742b049e5d1c"},"schema_version":"1.0"},"canonical_sha256":"188aa6fce070b278b3b82d62ee008b6cf922a91f2b616461c1249597e9e56d0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:05.496695Z","signature_b64":"FHRKeM/XIx8RvfbnB910He1VEjVJeHRBtzJkY/IeSr18DUXBS+AAkukLJ2wsJLzCO/K1pjSVeEMr7zrPaN7FDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"188aa6fce070b278b3b82d62ee008b6cf922a91f2b616461c1249597e9e56d0d","last_reissued_at":"2026-05-18T00:44:05.495960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:05.495960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07469","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:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjQDjg50Vel+Iv7RIErEbx0gwLkYEmJbzSTeTEkJ0kzO9L5xow8/7ep1eKnBHrbVN6tLypDSoMxbhmtCBJFqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:33:21.078039Z"},"content_sha256":"3ae4b81bf71895bffb11231d3551809f9f145f0a3d012209cebc1ee45d2e7630","schema_version":"1.0","event_id":"sha256:3ae4b81bf71895bffb11231d3551809f9f145f0a3d012209cebc1ee45d2e7630"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DCFKN7HAOCZHRM5YFVRO4AELNT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Algorithms for Matrix Recovery from Rank-One Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Chinmay Hegde, Mohammadreza Soltani","submitted_at":"2017-05-21T16:20:55Z","abstract_excerpt":"We consider the problem of estimation of a low-rank matrix from a limited number of noisy rank-one projections. In particular, we propose two fast, non-convex \\emph{proper} algorithms for matrix recovery and support them with rigorous theoretical analysis. We show that the proposed algorithms enjoy linear convergence and that their sample complexity is independent of the condition number of the unknown true low-rank matrix. By leveraging recent advances in low-rank matrix approximation techniques, we show that our algorithms achieve computational speed-ups over existing methods. Finally, we co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07469","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:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h2X75CzqWfmOQon4J+n2zALzXS6jsiYKnqYzXonP2etyRmErgteccFTY7ZGTHA8UpYAXjPz0soeQberRgw7sBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:33:21.078967Z"},"content_sha256":"09600ecb60ebda82c5d796e31376a0709f161e37c774d2e0ceee9ddc2fa62858","schema_version":"1.0","event_id":"sha256:09600ecb60ebda82c5d796e31376a0709f161e37c774d2e0ceee9ddc2fa62858"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCFKN7HAOCZHRM5YFVRO4AELNT/bundle.json","state_url":"https://pith.science/pith/DCFKN7HAOCZHRM5YFVRO4AELNT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCFKN7HAOCZHRM5YFVRO4AELNT/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-30T16:33:21Z","links":{"resolver":"https://pith.science/pith/DCFKN7HAOCZHRM5YFVRO4AELNT","bundle":"https://pith.science/pith/DCFKN7HAOCZHRM5YFVRO4AELNT/bundle.json","state":"https://pith.science/pith/DCFKN7HAOCZHRM5YFVRO4AELNT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCFKN7HAOCZHRM5YFVRO4AELNT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DCFKN7HAOCZHRM5YFVRO4AELNT","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":"2c557b94cd5131fa9da599acb98dce2b96a344932a0717097780742b049e5d1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-21T16:20:55Z","title_canon_sha256":"5040d570f6e6fc22fd500d7ca5d439fc6b52122f4033c362a429f13f96e45d83"},"schema_version":"1.0","source":{"id":"1705.07469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07469","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07469v1","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07469","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"DCFKN7HAOCZH","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DCFKN7HAOCZHRM5Y","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DCFKN7HA","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:09600ecb60ebda82c5d796e31376a0709f161e37c774d2e0ceee9ddc2fa62858","target":"graph","created_at":"2026-05-18T00:44:05Z","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 estimation of a low-rank matrix from a limited number of noisy rank-one projections. In particular, we propose two fast, non-convex \\emph{proper} algorithms for matrix recovery and support them with rigorous theoretical analysis. We show that the proposed algorithms enjoy linear convergence and that their sample complexity is independent of the condition number of the unknown true low-rank matrix. By leveraging recent advances in low-rank matrix approximation techniques, we show that our algorithms achieve computational speed-ups over existing methods. Finally, we co","authors_text":"Chinmay Hegde, Mohammadreza Soltani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-21T16:20:55Z","title":"Improved Algorithms for Matrix Recovery from Rank-One Projections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07469","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:3ae4b81bf71895bffb11231d3551809f9f145f0a3d012209cebc1ee45d2e7630","target":"record","created_at":"2026-05-18T00:44:05Z","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":"2c557b94cd5131fa9da599acb98dce2b96a344932a0717097780742b049e5d1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-21T16:20:55Z","title_canon_sha256":"5040d570f6e6fc22fd500d7ca5d439fc6b52122f4033c362a429f13f96e45d83"},"schema_version":"1.0","source":{"id":"1705.07469","kind":"arxiv","version":1}},"canonical_sha256":"188aa6fce070b278b3b82d62ee008b6cf922a91f2b616461c1249597e9e56d0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"188aa6fce070b278b3b82d62ee008b6cf922a91f2b616461c1249597e9e56d0d","first_computed_at":"2026-05-18T00:44:05.495960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:05.495960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FHRKeM/XIx8RvfbnB910He1VEjVJeHRBtzJkY/IeSr18DUXBS+AAkukLJ2wsJLzCO/K1pjSVeEMr7zrPaN7FDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:05.496695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ae4b81bf71895bffb11231d3551809f9f145f0a3d012209cebc1ee45d2e7630","sha256:09600ecb60ebda82c5d796e31376a0709f161e37c774d2e0ceee9ddc2fa62858"],"state_sha256":"66025a816ba5281f296d141bfee33fe3a2fdd849c6cd6b318ba964fac509ce65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"46BPb9iRPtIjNk70Hp8oXg8NckhcdAPZR7GCIlBJ5kLny68oGUwQmayReSHqsEXkh2Q0ENDDV/4tUwpc62O9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:33:21.083929Z","bundle_sha256":"14ac12652554424a14a449310b256a7e82b3fe587956ff39a927478947c11ca0"}}