{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RRSGNJ6GR2UFQONOY7NDQD7L43","short_pith_number":"pith:RRSGNJ6G","canonical_record":{"source":{"id":"1310.5791","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-10-22T03:30:29Z","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"9de9186f96e7fe0346cae8b49002a928f6ff0f32a4d865075041c4d9becffa4b","abstract_canon_sha256":"dfdc048e166f8a1a9a1fb406153b0212497f1b416f85c3d53b7c0ba1e7a7e3be"},"schema_version":"1.0"},"canonical_sha256":"8c6466a7c68ea85839aec7da380febe6f84727e60cd2608d7aedbba6af987fd5","source":{"kind":"arxiv","id":"1310.5791","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5791","created_at":"2026-05-18T02:31:48Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5791v3","created_at":"2026-05-18T02:31:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5791","created_at":"2026-05-18T02:31:48Z"},{"alias_kind":"pith_short_12","alias_value":"RRSGNJ6GR2UF","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RRSGNJ6GR2UFQONO","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RRSGNJ6G","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RRSGNJ6GR2UFQONOY7NDQD7L43","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5791","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-10-22T03:30:29Z","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"9de9186f96e7fe0346cae8b49002a928f6ff0f32a4d865075041c4d9becffa4b","abstract_canon_sha256":"dfdc048e166f8a1a9a1fb406153b0212497f1b416f85c3d53b7c0ba1e7a7e3be"},"schema_version":"1.0"},"canonical_sha256":"8c6466a7c68ea85839aec7da380febe6f84727e60cd2608d7aedbba6af987fd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:48.119053Z","signature_b64":"MYdN6MAcCkN2qr99cKxFiN96dvpihlPmLXOyIB4CFqiYHSH/ozd9Slt3ZuOBqjv1wWlG+ymdL7cC5dxhP7Z4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c6466a7c68ea85839aec7da380febe6f84727e60cd2608d7aedbba6af987fd5","last_reissued_at":"2026-05-18T02:31:48.117841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:48.117841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5791","source_version":3,"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-18T02:31:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5p16HwD5OWBfq7bhrOKCjREYcLTr84FGV9pXenZvMkWnqEuZCYPUl9aMu7P0n/Z7qFbNho74M/+I4s5l3zOPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:30:19.465517Z"},"content_sha256":"9a76443b8b36f52c43cccb484eabdd6d2d8436c8dc0e798be2825981aa46bb3c","schema_version":"1.0","event_id":"sha256:9a76443b8b36f52c43cccb484eabdd6d2d8436c8dc0e798be2825981aa46bb3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RRSGNJ6GR2UFQONOY7NDQD7L43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ROP: Matrix recovery via rank-one projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Anru Zhang, T. Tony Cai","submitted_at":"2013-10-22T03:30:29Z","abstract_excerpt":"Estimation of low-rank matrices is of significant interest in a range of contemporary applications. In this paper, we introduce a rank-one projection model for low-rank matrix recovery and propose a constrained nuclear norm minimization method for stable recovery of low-rank matrices in the noisy case. The procedure is adaptive to the rank and robust against small perturbations. Both upper and lower bounds for the estimation accuracy under the Frobenius norm loss are obtained. The proposed estimator is shown to be rate-optimal under certain conditions. The estimator is easy to implement via co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5791","kind":"arxiv","version":3},"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-18T02:31:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i6/sdaDhh5X7IP0Yl09WSY+OtY5GmmhToO2plJ8GYBntqRSjNni6VJ6xgaqCGs4f/0ZJL9d9cDyBtXFn8illBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:30:19.465868Z"},"content_sha256":"e537d4096065ff506102d921f0bfc56205a37c7879e11a03a46e22e819aecde5","schema_version":"1.0","event_id":"sha256:e537d4096065ff506102d921f0bfc56205a37c7879e11a03a46e22e819aecde5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRSGNJ6GR2UFQONOY7NDQD7L43/bundle.json","state_url":"https://pith.science/pith/RRSGNJ6GR2UFQONOY7NDQD7L43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRSGNJ6GR2UFQONOY7NDQD7L43/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-03T12:30:19Z","links":{"resolver":"https://pith.science/pith/RRSGNJ6GR2UFQONOY7NDQD7L43","bundle":"https://pith.science/pith/RRSGNJ6GR2UFQONOY7NDQD7L43/bundle.json","state":"https://pith.science/pith/RRSGNJ6GR2UFQONOY7NDQD7L43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRSGNJ6GR2UFQONOY7NDQD7L43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RRSGNJ6GR2UFQONOY7NDQD7L43","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":"dfdc048e166f8a1a9a1fb406153b0212497f1b416f85c3d53b7c0ba1e7a7e3be","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-10-22T03:30:29Z","title_canon_sha256":"9de9186f96e7fe0346cae8b49002a928f6ff0f32a4d865075041c4d9becffa4b"},"schema_version":"1.0","source":{"id":"1310.5791","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5791","created_at":"2026-05-18T02:31:48Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5791v3","created_at":"2026-05-18T02:31:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5791","created_at":"2026-05-18T02:31:48Z"},{"alias_kind":"pith_short_12","alias_value":"RRSGNJ6GR2UF","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RRSGNJ6GR2UFQONO","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RRSGNJ6G","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:e537d4096065ff506102d921f0bfc56205a37c7879e11a03a46e22e819aecde5","target":"graph","created_at":"2026-05-18T02:31:48Z","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":"Estimation of low-rank matrices is of significant interest in a range of contemporary applications. In this paper, we introduce a rank-one projection model for low-rank matrix recovery and propose a constrained nuclear norm minimization method for stable recovery of low-rank matrices in the noisy case. The procedure is adaptive to the rank and robust against small perturbations. Both upper and lower bounds for the estimation accuracy under the Frobenius norm loss are obtained. The proposed estimator is shown to be rate-optimal under certain conditions. The estimator is easy to implement via co","authors_text":"Anru Zhang, T. Tony Cai","cross_cats":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-10-22T03:30:29Z","title":"ROP: Matrix recovery via rank-one projections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5791","kind":"arxiv","version":3},"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:9a76443b8b36f52c43cccb484eabdd6d2d8436c8dc0e798be2825981aa46bb3c","target":"record","created_at":"2026-05-18T02:31:48Z","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":"dfdc048e166f8a1a9a1fb406153b0212497f1b416f85c3d53b7c0ba1e7a7e3be","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-10-22T03:30:29Z","title_canon_sha256":"9de9186f96e7fe0346cae8b49002a928f6ff0f32a4d865075041c4d9becffa4b"},"schema_version":"1.0","source":{"id":"1310.5791","kind":"arxiv","version":3}},"canonical_sha256":"8c6466a7c68ea85839aec7da380febe6f84727e60cd2608d7aedbba6af987fd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c6466a7c68ea85839aec7da380febe6f84727e60cd2608d7aedbba6af987fd5","first_computed_at":"2026-05-18T02:31:48.117841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:48.117841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MYdN6MAcCkN2qr99cKxFiN96dvpihlPmLXOyIB4CFqiYHSH/ozd9Slt3ZuOBqjv1wWlG+ymdL7cC5dxhP7Z4Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:48.119053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5791","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a76443b8b36f52c43cccb484eabdd6d2d8436c8dc0e798be2825981aa46bb3c","sha256:e537d4096065ff506102d921f0bfc56205a37c7879e11a03a46e22e819aecde5"],"state_sha256":"2e7f6b06a9b3ff148b9a559f60cd1f564640cfa6b0423b24d1028dcec7549cf5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b0BBKjsavqi7bjcM779AQHI/WanjTTfARjBguHEKtzA++81PSfSNk1P55zl9MdB3j6KUGgaIu4UJNJcDHvfGBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:30:19.467834Z","bundle_sha256":"15057af90205f49fff383c96c3aa2ebe19fe8689ea2e944bf57c1e20e7cb31e6"}}