{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2LAT42VCU2FHOMQNKER547L7MT","short_pith_number":"pith:2LAT42VC","canonical_record":{"source":{"id":"1709.08114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-23T20:35:12Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"0828cfffb37438e0df35165132e94858a3cbfb8fc0421afc7633ab459f37f40c","abstract_canon_sha256":"ba0426b930978b1298e373c38c45329e8d90d3d508e522ef3b9513659635d4d4"},"schema_version":"1.0"},"canonical_sha256":"d2c13e6aa2a68a77320d5123de7d7f64f0c706ee05fd4d610910aa23d7af66b2","source":{"kind":"arxiv","id":"1709.08114","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08114","created_at":"2026-05-18T00:34:27Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08114v1","created_at":"2026-05-18T00:34:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08114","created_at":"2026-05-18T00:34:27Z"},{"alias_kind":"pith_short_12","alias_value":"2LAT42VCU2FH","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2LAT42VCU2FHOMQN","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2LAT42VC","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2LAT42VCU2FHOMQNKER547L7MT","target":"record","payload":{"canonical_record":{"source":{"id":"1709.08114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-23T20:35:12Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"0828cfffb37438e0df35165132e94858a3cbfb8fc0421afc7633ab459f37f40c","abstract_canon_sha256":"ba0426b930978b1298e373c38c45329e8d90d3d508e522ef3b9513659635d4d4"},"schema_version":"1.0"},"canonical_sha256":"d2c13e6aa2a68a77320d5123de7d7f64f0c706ee05fd4d610910aa23d7af66b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:27.949145Z","signature_b64":"uRTqUMqZlGvdaNvQ1F2BZzcQpfVnfytCWvPnXqw4YLRgQZjS99/DZznoGdAqDffnG415oH3JBp7jaX/5k0qGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2c13e6aa2a68a77320d5123de7d7f64f0c706ee05fd4d610910aa23d7af66b2","last_reissued_at":"2026-05-18T00:34:27.948697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:27.948697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.08114","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:34:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mcmb6GHsIRParyCPtd5e7cN7Ijn/zmWdzK1CvzRCoi3P/8843t5Lgb1PddNTWogMy7lhrJqjjDcyUztztWoaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:55:16.815522Z"},"content_sha256":"d599da10264f5c51ec979b2f56eeb950d395caf9b6b635d2d920fca03b2cfb5f","schema_version":"1.0","event_id":"sha256:d599da10264f5c51ec979b2f56eeb950d395caf9b6b635d2d920fca03b2cfb5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2LAT42VCU2FHOMQNKER547L7MT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonconvex Low-Rank Matrix Recovery with Arbitrary Outliers via Median-Truncated Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Huishuai Zhang, Yingbin Liang, Yuanxin Li, Yuejie Chi","submitted_at":"2017-09-23T20:35:12Z","abstract_excerpt":"Recent work has demonstrated the effectiveness of gradient descent for directly recovering the factors of low-rank matrices from random linear measurements in a globally convergent manner when initialized properly. However, the performance of existing algorithms is highly sensitive in the presence of outliers that may take arbitrary values. In this paper, we propose a truncated gradient descent algorithm to improve the robustness against outliers, where the truncation is performed to rule out the contributions of samples that deviate significantly from the {\\em sample median} of measurement re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08114","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:34:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NnsJz3QoCc+hOiJabKeHG/dcAL7dgzS6zX2b1Hlod1o1ii0FSzNaTK0jT/JjE97kw4fqWOf6fJ0knfJxaonDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:55:16.816164Z"},"content_sha256":"f6f6616928048e2871c8ab068f507a38ad566604f6fa86eb531e2b11c1de10e7","schema_version":"1.0","event_id":"sha256:f6f6616928048e2871c8ab068f507a38ad566604f6fa86eb531e2b11c1de10e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2LAT42VCU2FHOMQNKER547L7MT/bundle.json","state_url":"https://pith.science/pith/2LAT42VCU2FHOMQNKER547L7MT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2LAT42VCU2FHOMQNKER547L7MT/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-26T13:55:16Z","links":{"resolver":"https://pith.science/pith/2LAT42VCU2FHOMQNKER547L7MT","bundle":"https://pith.science/pith/2LAT42VCU2FHOMQNKER547L7MT/bundle.json","state":"https://pith.science/pith/2LAT42VCU2FHOMQNKER547L7MT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2LAT42VCU2FHOMQNKER547L7MT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2LAT42VCU2FHOMQNKER547L7MT","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":"ba0426b930978b1298e373c38c45329e8d90d3d508e522ef3b9513659635d4d4","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-23T20:35:12Z","title_canon_sha256":"0828cfffb37438e0df35165132e94858a3cbfb8fc0421afc7633ab459f37f40c"},"schema_version":"1.0","source":{"id":"1709.08114","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08114","created_at":"2026-05-18T00:34:27Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08114v1","created_at":"2026-05-18T00:34:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08114","created_at":"2026-05-18T00:34:27Z"},{"alias_kind":"pith_short_12","alias_value":"2LAT42VCU2FH","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2LAT42VCU2FHOMQN","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2LAT42VC","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:f6f6616928048e2871c8ab068f507a38ad566604f6fa86eb531e2b11c1de10e7","target":"graph","created_at":"2026-05-18T00:34: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":"Recent work has demonstrated the effectiveness of gradient descent for directly recovering the factors of low-rank matrices from random linear measurements in a globally convergent manner when initialized properly. However, the performance of existing algorithms is highly sensitive in the presence of outliers that may take arbitrary values. In this paper, we propose a truncated gradient descent algorithm to improve the robustness against outliers, where the truncation is performed to rule out the contributions of samples that deviate significantly from the {\\em sample median} of measurement re","authors_text":"Huishuai Zhang, Yingbin Liang, Yuanxin Li, Yuejie Chi","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-23T20:35:12Z","title":"Nonconvex Low-Rank Matrix Recovery with Arbitrary Outliers via Median-Truncated Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08114","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:d599da10264f5c51ec979b2f56eeb950d395caf9b6b635d2d920fca03b2cfb5f","target":"record","created_at":"2026-05-18T00:34: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":"ba0426b930978b1298e373c38c45329e8d90d3d508e522ef3b9513659635d4d4","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-23T20:35:12Z","title_canon_sha256":"0828cfffb37438e0df35165132e94858a3cbfb8fc0421afc7633ab459f37f40c"},"schema_version":"1.0","source":{"id":"1709.08114","kind":"arxiv","version":1}},"canonical_sha256":"d2c13e6aa2a68a77320d5123de7d7f64f0c706ee05fd4d610910aa23d7af66b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2c13e6aa2a68a77320d5123de7d7f64f0c706ee05fd4d610910aa23d7af66b2","first_computed_at":"2026-05-18T00:34:27.948697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:27.948697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uRTqUMqZlGvdaNvQ1F2BZzcQpfVnfytCWvPnXqw4YLRgQZjS99/DZznoGdAqDffnG415oH3JBp7jaX/5k0qGDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:27.949145Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08114","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d599da10264f5c51ec979b2f56eeb950d395caf9b6b635d2d920fca03b2cfb5f","sha256:f6f6616928048e2871c8ab068f507a38ad566604f6fa86eb531e2b11c1de10e7"],"state_sha256":"32cbf352d403a90a8d8eaf5426b94f631526dc1016a65d0ffe29e0cd96a5af57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yK4JJtPbWscbLTov3eyETjLNUh0RX9qivxV7ehynnFqbgSa2fQe0VQeAi1XGiwd5NkZRztd8uqhmuA0eV4YOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:55:16.819463Z","bundle_sha256":"6e0d608a6c2012c003077c4ef55afd691f9df10a7931f28803f80d7ee120b092"}}