{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4DZH7PYSV4EJ5SXO5IMDVKZ4OL","short_pith_number":"pith:4DZH7PYS","canonical_record":{"source":{"id":"1809.03652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-11T02:04:05Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"4284ca61618ce51283c33ee356cd783c2e4463b7eca10c18ab12e43ef6927948","abstract_canon_sha256":"85d7513dc301f225c00be3fa7765352d2b47eacd7019df957782adcc844bc4ec"},"schema_version":"1.0"},"canonical_sha256":"e0f27fbf12af089ecaeeea183aab3c72f3523d4e43a129bb452de57e8835fa05","source":{"kind":"arxiv","id":"1809.03652","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03652","created_at":"2026-05-18T00:05:57Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03652v1","created_at":"2026-05-18T00:05:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03652","created_at":"2026-05-18T00:05:57Z"},{"alias_kind":"pith_short_12","alias_value":"4DZH7PYSV4EJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4DZH7PYSV4EJ5SXO","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4DZH7PYS","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4DZH7PYSV4EJ5SXO5IMDVKZ4OL","target":"record","payload":{"canonical_record":{"source":{"id":"1809.03652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-11T02:04:05Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"4284ca61618ce51283c33ee356cd783c2e4463b7eca10c18ab12e43ef6927948","abstract_canon_sha256":"85d7513dc301f225c00be3fa7765352d2b47eacd7019df957782adcc844bc4ec"},"schema_version":"1.0"},"canonical_sha256":"e0f27fbf12af089ecaeeea183aab3c72f3523d4e43a129bb452de57e8835fa05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:57.110020Z","signature_b64":"3t4R+wSJfdSWbQ0j40WTmpaHWqSGQMFxwYu5cdl14CWB8F/swp5ASlGtWlAXZXzxfCNvbPFNYkmvIj36Kx38BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0f27fbf12af089ecaeeea183aab3c72f3523d4e43a129bb452de57e8835fa05","last_reissued_at":"2026-05-18T00:05:57.109511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:57.109511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.03652","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:05:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWsRecr7RbtkO7m/ixIRCmhWL7TcA1iT2HLPiSovkGEk0vLIWoLi+NkOetfPabtVVCazax9WvpOZhzjo8zmaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:08:35.409204Z"},"content_sha256":"8c290ac06d23dfcf2c89660e7ce75e326ef26aedcb0e8c7b35a2690b4e3db3f1","schema_version":"1.0","event_id":"sha256:8c290ac06d23dfcf2c89660e7ce75e326ef26aedcb0e8c7b35a2690b4e3db3f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4DZH7PYSV4EJ5SXO5IMDVKZ4OL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting the structure effectively and efficiently in low rank matrix recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jian-Feng Cai, Ke Wei","submitted_at":"2018-09-11T02:04:05Z","abstract_excerpt":"Low rank model arises from a wide range of applications, including machine learning, signal processing, computer algebra, computer vision, and imaging science. Low rank matrix recovery is about reconstructing a low rank matrix from incomplete measurements. In this survey we review recent developments on low rank matrix recovery, focusing on three typical scenarios: matrix sensing, matrix completion and phase retrieval. An overview of effective and efficient approaches for the problem is given, including nuclear norm minimization, projected gradient descent based on matrix factorization, and Ri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03652","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:05:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebX5odQDEY+lZR7wP/bQWc/BN4o06wU90dqlGu5Ea51qQesZ2D4w+PtqcuYwLcDHfSHwlFAQs9cI18BSIBFlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:08:35.410095Z"},"content_sha256":"4a7ae79bcf69053032f77a26e6c038e04d508fd021a7add67363b238b9b6bbfa","schema_version":"1.0","event_id":"sha256:4a7ae79bcf69053032f77a26e6c038e04d508fd021a7add67363b238b9b6bbfa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DZH7PYSV4EJ5SXO5IMDVKZ4OL/bundle.json","state_url":"https://pith.science/pith/4DZH7PYSV4EJ5SXO5IMDVKZ4OL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DZH7PYSV4EJ5SXO5IMDVKZ4OL/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-31T08:08:35Z","links":{"resolver":"https://pith.science/pith/4DZH7PYSV4EJ5SXO5IMDVKZ4OL","bundle":"https://pith.science/pith/4DZH7PYSV4EJ5SXO5IMDVKZ4OL/bundle.json","state":"https://pith.science/pith/4DZH7PYSV4EJ5SXO5IMDVKZ4OL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DZH7PYSV4EJ5SXO5IMDVKZ4OL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4DZH7PYSV4EJ5SXO5IMDVKZ4OL","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":"85d7513dc301f225c00be3fa7765352d2b47eacd7019df957782adcc844bc4ec","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-11T02:04:05Z","title_canon_sha256":"4284ca61618ce51283c33ee356cd783c2e4463b7eca10c18ab12e43ef6927948"},"schema_version":"1.0","source":{"id":"1809.03652","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03652","created_at":"2026-05-18T00:05:57Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03652v1","created_at":"2026-05-18T00:05:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03652","created_at":"2026-05-18T00:05:57Z"},{"alias_kind":"pith_short_12","alias_value":"4DZH7PYSV4EJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4DZH7PYSV4EJ5SXO","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4DZH7PYS","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:4a7ae79bcf69053032f77a26e6c038e04d508fd021a7add67363b238b9b6bbfa","target":"graph","created_at":"2026-05-18T00:05:57Z","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":"Low rank model arises from a wide range of applications, including machine learning, signal processing, computer algebra, computer vision, and imaging science. Low rank matrix recovery is about reconstructing a low rank matrix from incomplete measurements. In this survey we review recent developments on low rank matrix recovery, focusing on three typical scenarios: matrix sensing, matrix completion and phase retrieval. An overview of effective and efficient approaches for the problem is given, including nuclear norm minimization, projected gradient descent based on matrix factorization, and Ri","authors_text":"Jian-Feng Cai, Ke Wei","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-11T02:04:05Z","title":"Exploiting the structure effectively and efficiently in low rank matrix recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03652","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:8c290ac06d23dfcf2c89660e7ce75e326ef26aedcb0e8c7b35a2690b4e3db3f1","target":"record","created_at":"2026-05-18T00:05:57Z","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":"85d7513dc301f225c00be3fa7765352d2b47eacd7019df957782adcc844bc4ec","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-11T02:04:05Z","title_canon_sha256":"4284ca61618ce51283c33ee356cd783c2e4463b7eca10c18ab12e43ef6927948"},"schema_version":"1.0","source":{"id":"1809.03652","kind":"arxiv","version":1}},"canonical_sha256":"e0f27fbf12af089ecaeeea183aab3c72f3523d4e43a129bb452de57e8835fa05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0f27fbf12af089ecaeeea183aab3c72f3523d4e43a129bb452de57e8835fa05","first_computed_at":"2026-05-18T00:05:57.109511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:57.109511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3t4R+wSJfdSWbQ0j40WTmpaHWqSGQMFxwYu5cdl14CWB8F/swp5ASlGtWlAXZXzxfCNvbPFNYkmvIj36Kx38BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:57.110020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03652","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c290ac06d23dfcf2c89660e7ce75e326ef26aedcb0e8c7b35a2690b4e3db3f1","sha256:4a7ae79bcf69053032f77a26e6c038e04d508fd021a7add67363b238b9b6bbfa"],"state_sha256":"23d1a7301a7c1819028a9a9d1c2a8b045cc75b37f3e8c07d751738c249055396"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PhCnzA5+THRfP96/WadK+PAnroHx48RxoC922D1Xn2kK3uZY2Bo/j/pNCsJ9JUS+S236GkFXyUKAx347tgo4Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:08:35.414664Z","bundle_sha256":"ea1218d5a03a4e39d83d8280454fae0e48d29a4f4f0119058545a1b66c640d1a"}}