{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:L6ZZP7WALYVHF7WBC3AMZAWC7N","short_pith_number":"pith:L6ZZP7WA","canonical_record":{"source":{"id":"1611.03060","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-09T19:49:06Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"2ae6afaacad1665945135015af5b5a2de19eeaa230407dc6b1c31f96a8c98c5d","abstract_canon_sha256":"e35d529caf6a6f6ec40563c5d49d210ecc2ca4ad77c0590f36e9484444d66d98"},"schema_version":"1.0"},"canonical_sha256":"5fb397fec05e2a72fec116c0cc82c2fb5ec58cfb354d3d11eb1087fd67749544","source":{"kind":"arxiv","id":"1611.03060","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03060","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03060v3","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03060","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"L6ZZP7WALYVH","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L6ZZP7WALYVHF7WB","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L6ZZP7WA","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:L6ZZP7WALYVHF7WBC3AMZAWC7N","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03060","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-09T19:49:06Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"2ae6afaacad1665945135015af5b5a2de19eeaa230407dc6b1c31f96a8c98c5d","abstract_canon_sha256":"e35d529caf6a6f6ec40563c5d49d210ecc2ca4ad77c0590f36e9484444d66d98"},"schema_version":"1.0"},"canonical_sha256":"5fb397fec05e2a72fec116c0cc82c2fb5ec58cfb354d3d11eb1087fd67749544","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:03.100843Z","signature_b64":"YkNgClA7ZprkPWCPPkfOVXesWpo3lO5oT4YIub5QyaPe2bjE3XXFYO2HCmuqHkLDYuWD5Dwkyl0bAx6wpHZxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fb397fec05e2a72fec116c0cc82c2fb5ec58cfb354d3d11eb1087fd67749544","last_reissued_at":"2026-05-17T23:53:03.100334Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:03.100334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03060","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-17T23:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"caSCnYoMRt+KjhzV3HN6Wx/0rHN17sAQ5b1e3hWyWPTd1afEfKPaOOfVVFwlduR6IHGJdS4DPPrylMLAF2vPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:56:18.611148Z"},"content_sha256":"13a46c3336ccbb9c9584c0e9da80a00a282df904d4772574336eb1ba4419c132","schema_version":"1.0","event_id":"sha256:13a46c3336ccbb9c9584c0e9da80a00a282df904d4772574336eb1ba4419c132"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:L6ZZP7WALYVHF7WBC3AMZAWC7N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Non-convex Geometry of Low-rank Matrix Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Gongguo Tang, Qiuwei Li, Zhihui Zhu","submitted_at":"2016-11-09T19:49:06Z","abstract_excerpt":"This work considers two popular minimization problems: (i) the minimization of a general convex function $f(\\mathbf{X})$ with the domain being positive semi-definite matrices; (ii) the minimization of a general convex function $f(\\mathbf{X})$ regularized by the matrix nuclear norm $\\|\\mathbf{X}\\|_*$ with the domain being general matrices. Despite their optimal statistical performance in the literature, these two optimization problems have a high computational complexity even when solved using tailored fast convex solvers. To develop faster and more scalable algorithms, we follow the proposal o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03060","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-17T23:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fBNe4OLe8VS4KpMAWazISSGnMoh8oZDCxQNaJxErcQniFyslNhSaiREMo60CoHaXdw3whviZdQeQMb4yQlJvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:56:18.611502Z"},"content_sha256":"e264fb1819bf55bbd1b7841f3e1166a35a3d78a09528fd017e7a9585533a251a","schema_version":"1.0","event_id":"sha256:e264fb1819bf55bbd1b7841f3e1166a35a3d78a09528fd017e7a9585533a251a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L6ZZP7WALYVHF7WBC3AMZAWC7N/bundle.json","state_url":"https://pith.science/pith/L6ZZP7WALYVHF7WBC3AMZAWC7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L6ZZP7WALYVHF7WBC3AMZAWC7N/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-27T02:56:18Z","links":{"resolver":"https://pith.science/pith/L6ZZP7WALYVHF7WBC3AMZAWC7N","bundle":"https://pith.science/pith/L6ZZP7WALYVHF7WBC3AMZAWC7N/bundle.json","state":"https://pith.science/pith/L6ZZP7WALYVHF7WBC3AMZAWC7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L6ZZP7WALYVHF7WBC3AMZAWC7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:L6ZZP7WALYVHF7WBC3AMZAWC7N","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":"e35d529caf6a6f6ec40563c5d49d210ecc2ca4ad77c0590f36e9484444d66d98","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-09T19:49:06Z","title_canon_sha256":"2ae6afaacad1665945135015af5b5a2de19eeaa230407dc6b1c31f96a8c98c5d"},"schema_version":"1.0","source":{"id":"1611.03060","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03060","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03060v3","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03060","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"L6ZZP7WALYVH","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L6ZZP7WALYVHF7WB","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L6ZZP7WA","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:e264fb1819bf55bbd1b7841f3e1166a35a3d78a09528fd017e7a9585533a251a","target":"graph","created_at":"2026-05-17T23:53:03Z","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":"This work considers two popular minimization problems: (i) the minimization of a general convex function $f(\\mathbf{X})$ with the domain being positive semi-definite matrices; (ii) the minimization of a general convex function $f(\\mathbf{X})$ regularized by the matrix nuclear norm $\\|\\mathbf{X}\\|_*$ with the domain being general matrices. Despite their optimal statistical performance in the literature, these two optimization problems have a high computational complexity even when solved using tailored fast convex solvers. To develop faster and more scalable algorithms, we follow the proposal o","authors_text":"Gongguo Tang, Qiuwei Li, Zhihui Zhu","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-09T19:49:06Z","title":"The Non-convex Geometry of Low-rank Matrix Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03060","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:13a46c3336ccbb9c9584c0e9da80a00a282df904d4772574336eb1ba4419c132","target":"record","created_at":"2026-05-17T23:53:03Z","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":"e35d529caf6a6f6ec40563c5d49d210ecc2ca4ad77c0590f36e9484444d66d98","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-09T19:49:06Z","title_canon_sha256":"2ae6afaacad1665945135015af5b5a2de19eeaa230407dc6b1c31f96a8c98c5d"},"schema_version":"1.0","source":{"id":"1611.03060","kind":"arxiv","version":3}},"canonical_sha256":"5fb397fec05e2a72fec116c0cc82c2fb5ec58cfb354d3d11eb1087fd67749544","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fb397fec05e2a72fec116c0cc82c2fb5ec58cfb354d3d11eb1087fd67749544","first_computed_at":"2026-05-17T23:53:03.100334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:03.100334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YkNgClA7ZprkPWCPPkfOVXesWpo3lO5oT4YIub5QyaPe2bjE3XXFYO2HCmuqHkLDYuWD5Dwkyl0bAx6wpHZxCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:03.100843Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03060","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13a46c3336ccbb9c9584c0e9da80a00a282df904d4772574336eb1ba4419c132","sha256:e264fb1819bf55bbd1b7841f3e1166a35a3d78a09528fd017e7a9585533a251a"],"state_sha256":"835fe6018e6d2f6a3127241b19d92f6d40728c69bb22b23a525c77ae3738e5b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xj+9YbQl+2Arg+9m+4po3budHYOTx6ON6srNaFm6f/N/Lr3Gu7RNLNSTbD/EHrrty7h/NcBDNa9KS7GwdjF/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T02:56:18.613400Z","bundle_sha256":"857496a76c2590fae8cbd601c6ec659eeabdc6493947464faa1097c0b2b32b68"}}