{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZAOGAB3I4WTDAZMGOKVGKXUWPG","short_pith_number":"pith:ZAOGAB3I","canonical_record":{"source":{"id":"1509.02447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-08T17:04:54Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a32114a246507f21ae30298460f7681adfa68055faba616ee62851fb0b9db3dd","abstract_canon_sha256":"dd007e3dbc1ca8373aaca36504a6a70d01c9c1ebbc9cfd69fe1f26a8a45742cb"},"schema_version":"1.0"},"canonical_sha256":"c81c600768e5a630658672aa655e9679bf5cf05d81ad6ef65e83f856c180e1c9","source":{"kind":"arxiv","id":"1509.02447","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02447","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02447v1","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02447","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"pith_short_12","alias_value":"ZAOGAB3I4WTD","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZAOGAB3I4WTDAZMG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZAOGAB3I","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZAOGAB3I4WTDAZMGOKVGKXUWPG","target":"record","payload":{"canonical_record":{"source":{"id":"1509.02447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-08T17:04:54Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a32114a246507f21ae30298460f7681adfa68055faba616ee62851fb0b9db3dd","abstract_canon_sha256":"dd007e3dbc1ca8373aaca36504a6a70d01c9c1ebbc9cfd69fe1f26a8a45742cb"},"schema_version":"1.0"},"canonical_sha256":"c81c600768e5a630658672aa655e9679bf5cf05d81ad6ef65e83f856c180e1c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:40.866186Z","signature_b64":"8+3l16Lgj75liTT3fSd9loTLU8hWF1cSlrnawS7FaJt4zDZmhVbpdHhg8/0g+RkgHsLMe14r1/zMM+QOBQarCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c81c600768e5a630658672aa655e9679bf5cf05d81ad6ef65e83f856c180e1c9","last_reissued_at":"2026-05-18T01:33:40.865737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:40.865737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.02447","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-18T01:33:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jRFVjl2S1Q2/t/uw8t1RE8zgUr8R+50S3F3ebof8b85Nh6w5t+Og0YQ1y3jNQNaPBeo3aWzc+kdW9VKHuWBgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:36:45.491556Z"},"content_sha256":"7c167bb6d22bbf627457466e765f242695eafd0962cf931efb912f2a856dd01e","schema_version":"1.0","event_id":"sha256:7c167bb6d22bbf627457466e765f242695eafd0962cf931efb912f2a856dd01e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZAOGAB3I4WTDAZMGOKVGKXUWPG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Structured Matrix Rank Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Adams Wei Yu, Jaime G. Carbonell, Suvrit Sra, Wanli Ma, Yaoliang Yu","submitted_at":"2015-09-08T17:04:54Z","abstract_excerpt":"We study the problem of finding structured low-rank matrices using nuclear norm regularization where the structure is encoded by a linear map. In contrast to most known approaches for linearly structured rank minimization, we do not (a) use the full SVD, nor (b) resort to augmented Lagrangian techniques, nor (c) solve linear systems per iteration. Instead, we formulate the problem differently so that it is amenable to a generalized conditional gradient method, which results in a practical improvement with low per iteration computational cost. Numerical results show that our approach significan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02447","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-18T01:33:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Edcs/aF69EZPZ59lAdYC4wqfOXqg7JW5KK/dVPf3KRvBVN7j7mEdERy3Xk+ZjWPB0A0hlfJqFMgkJZiFBH/CAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:36:45.491959Z"},"content_sha256":"d2f8d4a998e7a08b34bafa233953e276d3877b0803119b00e0e9c0508abceb25","schema_version":"1.0","event_id":"sha256:d2f8d4a998e7a08b34bafa233953e276d3877b0803119b00e0e9c0508abceb25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZAOGAB3I4WTDAZMGOKVGKXUWPG/bundle.json","state_url":"https://pith.science/pith/ZAOGAB3I4WTDAZMGOKVGKXUWPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZAOGAB3I4WTDAZMGOKVGKXUWPG/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-28T23:36:45Z","links":{"resolver":"https://pith.science/pith/ZAOGAB3I4WTDAZMGOKVGKXUWPG","bundle":"https://pith.science/pith/ZAOGAB3I4WTDAZMGOKVGKXUWPG/bundle.json","state":"https://pith.science/pith/ZAOGAB3I4WTDAZMGOKVGKXUWPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZAOGAB3I4WTDAZMGOKVGKXUWPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZAOGAB3I4WTDAZMGOKVGKXUWPG","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":"dd007e3dbc1ca8373aaca36504a6a70d01c9c1ebbc9cfd69fe1f26a8a45742cb","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-08T17:04:54Z","title_canon_sha256":"a32114a246507f21ae30298460f7681adfa68055faba616ee62851fb0b9db3dd"},"schema_version":"1.0","source":{"id":"1509.02447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02447","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02447v1","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02447","created_at":"2026-05-18T01:33:40Z"},{"alias_kind":"pith_short_12","alias_value":"ZAOGAB3I4WTD","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZAOGAB3I4WTDAZMG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZAOGAB3I","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:d2f8d4a998e7a08b34bafa233953e276d3877b0803119b00e0e9c0508abceb25","target":"graph","created_at":"2026-05-18T01:33:40Z","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":"We study the problem of finding structured low-rank matrices using nuclear norm regularization where the structure is encoded by a linear map. In contrast to most known approaches for linearly structured rank minimization, we do not (a) use the full SVD, nor (b) resort to augmented Lagrangian techniques, nor (c) solve linear systems per iteration. Instead, we formulate the problem differently so that it is amenable to a generalized conditional gradient method, which results in a practical improvement with low per iteration computational cost. Numerical results show that our approach significan","authors_text":"Adams Wei Yu, Jaime G. Carbonell, Suvrit Sra, Wanli Ma, Yaoliang Yu","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-08T17:04:54Z","title":"Efficient Structured Matrix Rank Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02447","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:7c167bb6d22bbf627457466e765f242695eafd0962cf931efb912f2a856dd01e","target":"record","created_at":"2026-05-18T01:33:40Z","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":"dd007e3dbc1ca8373aaca36504a6a70d01c9c1ebbc9cfd69fe1f26a8a45742cb","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-08T17:04:54Z","title_canon_sha256":"a32114a246507f21ae30298460f7681adfa68055faba616ee62851fb0b9db3dd"},"schema_version":"1.0","source":{"id":"1509.02447","kind":"arxiv","version":1}},"canonical_sha256":"c81c600768e5a630658672aa655e9679bf5cf05d81ad6ef65e83f856c180e1c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c81c600768e5a630658672aa655e9679bf5cf05d81ad6ef65e83f856c180e1c9","first_computed_at":"2026-05-18T01:33:40.865737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:40.865737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8+3l16Lgj75liTT3fSd9loTLU8hWF1cSlrnawS7FaJt4zDZmhVbpdHhg8/0g+RkgHsLMe14r1/zMM+QOBQarCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:40.866186Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c167bb6d22bbf627457466e765f242695eafd0962cf931efb912f2a856dd01e","sha256:d2f8d4a998e7a08b34bafa233953e276d3877b0803119b00e0e9c0508abceb25"],"state_sha256":"c49e72d2f809d7a9e4aacec2bb81513d10f4c7f2a63c4f674373ea403ad3ec90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x1OEX4ljaDl+bOxbQD5R+65Q/6SLMkHFa/cb1SZX8rffyfJN5CraB490M0s2njIpsP6aiPIljHSe9ZLB/STpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:36:45.495511Z","bundle_sha256":"03cb46203095f3b4a5215bdc5f7d6edb4fae3ff8725b7214511717d41ff9624a"}}