{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:GFCH2RCBRJ4XQVBUJGL2HUEBPP","short_pith_number":"pith:GFCH2RCB","canonical_record":{"source":{"id":"2410.16826","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-22T08:58:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e6bfb7b55c7bbfb71f86e7b58ca3cead0977e731a06cc082c3654e45f9e1c5d5","abstract_canon_sha256":"e5d25b3f300631fde39a0b87370cf45074677a75bcb523e783cf535b90f949ba"},"schema_version":"1.0"},"canonical_sha256":"31447d44418a797854344997a3d0817bd8f11ebcd8c99f62349150f962394a92","source":{"kind":"arxiv","id":"2410.16826","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.16826","created_at":"2026-07-05T11:11:36Z"},{"alias_kind":"arxiv_version","alias_value":"2410.16826v2","created_at":"2026-07-05T11:11:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16826","created_at":"2026-07-05T11:11:36Z"},{"alias_kind":"pith_short_12","alias_value":"GFCH2RCBRJ4X","created_at":"2026-07-05T11:11:36Z"},{"alias_kind":"pith_short_16","alias_value":"GFCH2RCBRJ4XQVBU","created_at":"2026-07-05T11:11:36Z"},{"alias_kind":"pith_short_8","alias_value":"GFCH2RCB","created_at":"2026-07-05T11:11:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:GFCH2RCBRJ4XQVBUJGL2HUEBPP","target":"record","payload":{"canonical_record":{"source":{"id":"2410.16826","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-22T08:58:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e6bfb7b55c7bbfb71f86e7b58ca3cead0977e731a06cc082c3654e45f9e1c5d5","abstract_canon_sha256":"e5d25b3f300631fde39a0b87370cf45074677a75bcb523e783cf535b90f949ba"},"schema_version":"1.0"},"canonical_sha256":"31447d44418a797854344997a3d0817bd8f11ebcd8c99f62349150f962394a92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:36.335277Z","signature_b64":"rcZvupY0O93D9AO0xAOk2B1eQtJgAdFiFDVnYQ0kU1Nz5fi1DLmiIH9IN7yyB4nwMFz461r6IChDblaxUjPfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31447d44418a797854344997a3d0817bd8f11ebcd8c99f62349150f962394a92","last_reissued_at":"2026-07-05T11:11:36.334729Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:36.334729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.16826","source_version":2,"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-07-05T11:11:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2jL0XiHdGOvFyJEKoTa07JHzYygDJ/tqWGJcRfzd9FIZTCBtJsWVj9Nl3QfR5OvHWm9RfOdvaTd6A2QR8ZJJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T07:12:54.494761Z"},"content_sha256":"d97b8ef4af581c031308028dfab4b5e505e3d6c3ad124f2897ed1b03abd952a0","schema_version":"1.0","event_id":"sha256:d97b8ef4af581c031308028dfab4b5e505e3d6c3ad124f2897ed1b03abd952a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:GFCH2RCBRJ4XQVBUJGL2HUEBPP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"HanQin Cai, Paris Giampouras, Rene Vidal","submitted_at":"2024-10-22T08:58:44Z","abstract_excerpt":"In this paper, we focus on a matrix factorization-based approach to recover low-rank {\\it asymmetric} matrices from corrupted measurements. We propose an {\\it Overparameterized Preconditioned Subgradient Algorithm (OPSA)} and provide, for the first time in the literature, linear convergence rates independent of the rank of the sought asymmetric matrix in the presence of gross corruptions. Our work goes beyond existing results in preconditioned-type approaches addressing their current limitation, i.e., the lack of convergence guarantees in the case of {\\it asymmetric matrices of unknown rank}. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.16826","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.16826/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:11:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pT1dlbd2JC4D+hfiS9GV5mLckEhIsb0WJQkEVWlljiKMUDu4YP1FepKG5l3oMacA4xJdDz0WqhNFiCjJBJ7FCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T07:12:54.495129Z"},"content_sha256":"1d5217cc51c97e8f24d0edb9dffe21f22f9c79ffea3bb9d9243e3e5eee2d964d","schema_version":"1.0","event_id":"sha256:1d5217cc51c97e8f24d0edb9dffe21f22f9c79ffea3bb9d9243e3e5eee2d964d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GFCH2RCBRJ4XQVBUJGL2HUEBPP/bundle.json","state_url":"https://pith.science/pith/GFCH2RCBRJ4XQVBUJGL2HUEBPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GFCH2RCBRJ4XQVBUJGL2HUEBPP/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-07-06T07:12:54Z","links":{"resolver":"https://pith.science/pith/GFCH2RCBRJ4XQVBUJGL2HUEBPP","bundle":"https://pith.science/pith/GFCH2RCBRJ4XQVBUJGL2HUEBPP/bundle.json","state":"https://pith.science/pith/GFCH2RCBRJ4XQVBUJGL2HUEBPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GFCH2RCBRJ4XQVBUJGL2HUEBPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GFCH2RCBRJ4XQVBUJGL2HUEBPP","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":"e5d25b3f300631fde39a0b87370cf45074677a75bcb523e783cf535b90f949ba","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-22T08:58:44Z","title_canon_sha256":"e6bfb7b55c7bbfb71f86e7b58ca3cead0977e731a06cc082c3654e45f9e1c5d5"},"schema_version":"1.0","source":{"id":"2410.16826","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.16826","created_at":"2026-07-05T11:11:36Z"},{"alias_kind":"arxiv_version","alias_value":"2410.16826v2","created_at":"2026-07-05T11:11:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16826","created_at":"2026-07-05T11:11:36Z"},{"alias_kind":"pith_short_12","alias_value":"GFCH2RCBRJ4X","created_at":"2026-07-05T11:11:36Z"},{"alias_kind":"pith_short_16","alias_value":"GFCH2RCBRJ4XQVBU","created_at":"2026-07-05T11:11:36Z"},{"alias_kind":"pith_short_8","alias_value":"GFCH2RCB","created_at":"2026-07-05T11:11:36Z"}],"graph_snapshots":[{"event_id":"sha256:1d5217cc51c97e8f24d0edb9dffe21f22f9c79ffea3bb9d9243e3e5eee2d964d","target":"graph","created_at":"2026-07-05T11:11:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.16826/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we focus on a matrix factorization-based approach to recover low-rank {\\it asymmetric} matrices from corrupted measurements. We propose an {\\it Overparameterized Preconditioned Subgradient Algorithm (OPSA)} and provide, for the first time in the literature, linear convergence rates independent of the rank of the sought asymmetric matrix in the presence of gross corruptions. Our work goes beyond existing results in preconditioned-type approaches addressing their current limitation, i.e., the lack of convergence guarantees in the case of {\\it asymmetric matrices of unknown rank}. ","authors_text":"HanQin Cai, Paris Giampouras, Rene Vidal","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-22T08:58:44Z","title":"Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.16826","kind":"arxiv","version":2},"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:d97b8ef4af581c031308028dfab4b5e505e3d6c3ad124f2897ed1b03abd952a0","target":"record","created_at":"2026-07-05T11:11:36Z","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":"e5d25b3f300631fde39a0b87370cf45074677a75bcb523e783cf535b90f949ba","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-22T08:58:44Z","title_canon_sha256":"e6bfb7b55c7bbfb71f86e7b58ca3cead0977e731a06cc082c3654e45f9e1c5d5"},"schema_version":"1.0","source":{"id":"2410.16826","kind":"arxiv","version":2}},"canonical_sha256":"31447d44418a797854344997a3d0817bd8f11ebcd8c99f62349150f962394a92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31447d44418a797854344997a3d0817bd8f11ebcd8c99f62349150f962394a92","first_computed_at":"2026-07-05T11:11:36.334729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:36.334729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rcZvupY0O93D9AO0xAOk2B1eQtJgAdFiFDVnYQ0kU1Nz5fi1DLmiIH9IN7yyB4nwMFz461r6IChDblaxUjPfDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:36.335277Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.16826","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d97b8ef4af581c031308028dfab4b5e505e3d6c3ad124f2897ed1b03abd952a0","sha256:1d5217cc51c97e8f24d0edb9dffe21f22f9c79ffea3bb9d9243e3e5eee2d964d"],"state_sha256":"9733db4e177efa72551f60cf6a47163118f936ef88897076c2f83d85c7fa1cbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YvHucmFrVMzJ8//jel3+YH7N5tP/Vj7Y4Alu2HX1HkhGdBB36FeAq04W47IEY3p+ehEbWyLDB46Qas5W5Mi8Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T07:12:54.497143Z","bundle_sha256":"d909d2ee439b7ae0cc7c5caad1f473fca073ceb563dc1ab96aa92184cbd49bba"}}