{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GRWDC3EHN4ADZDTBLZVF37WL6J","short_pith_number":"pith:GRWDC3EH","canonical_record":{"source":{"id":"1703.07171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-21T12:35:01Z","cross_cats_sorted":[],"title_canon_sha256":"f267fbfffdfe6156954bfb0318c57470cabbbb909dc6733e5deddbbb7f28af10","abstract_canon_sha256":"7e8bc2efb73ea7938b751cd29ab3179e4c2081885ece670f167f08859c07703f"},"schema_version":"1.0"},"canonical_sha256":"346c316c876f003c8e615e6a5dfecbf244e1281b1a8a812358549b89ba77447f","source":{"kind":"arxiv","id":"1703.07171","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07171","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07171v1","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07171","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"GRWDC3EHN4AD","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GRWDC3EHN4ADZDTB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GRWDC3EH","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GRWDC3EHN4ADZDTBLZVF37WL6J","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-21T12:35:01Z","cross_cats_sorted":[],"title_canon_sha256":"f267fbfffdfe6156954bfb0318c57470cabbbb909dc6733e5deddbbb7f28af10","abstract_canon_sha256":"7e8bc2efb73ea7938b751cd29ab3179e4c2081885ece670f167f08859c07703f"},"schema_version":"1.0"},"canonical_sha256":"346c316c876f003c8e615e6a5dfecbf244e1281b1a8a812358549b89ba77447f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:11.119009Z","signature_b64":"lJrBJcawHetCoQwzDe7kZXYwW8lc2XBQcihQdU2o8RV9FldNHSOMOg+b7xfsMLdUjEd9AjwJh8nlfNfDvTIBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"346c316c876f003c8e615e6a5dfecbf244e1281b1a8a812358549b89ba77447f","last_reissued_at":"2026-05-18T00:48:11.118433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:11.118433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07171","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:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j1kMmOlHR5nkE7A/ZUFoNeXMlAVbtbGOw7MT1MW7oOxug5PkiJ2Zkvele/A9bIehyzxkwBj+2XLtGSuq0UUwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:59:31.907351Z"},"content_sha256":"cc77b307a8b307bddae23fb780f0c5063cc638a083bba8ded021f880500d0f41","schema_version":"1.0","event_id":"sha256:cc77b307a8b307bddae23fb780f0c5063cc638a083bba8ded021f880500d0f41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GRWDC3EHN4ADZDTBLZVF37WL6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Convex Rank/Sparsity Regularization and Local Minima","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carl Olsson, Fredrik Andersson, Marcus Carlsson, Viktor Larsson","submitted_at":"2017-03-21T12:35:01Z","abstract_excerpt":"This paper considers the problem of recovering either a low rank matrix or a sparse vector from observations of linear combinations of the vector or matrix elements. Recent methods replace the non-convex regularization with $\\ell_1$ or nuclear norm relaxations. It is well known that this approach can be guaranteed to recover a near optimal solutions if a so called restricted isometry property (RIP) holds. On the other hand it is also known to perform soft thresholding which results in a shrinking bias which can degrade the solution.\n  In this paper we study an alternative non-convex regulariza"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07171","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:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/vIJ9jYaLGho+UQAmIXsFVcXN1pwdTrdcjMryh4Z0/ERmjcAb5S9RExmpIT1srNu4vBsFBCFOZhCXPY4RjTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:59:31.908025Z"},"content_sha256":"64b2cbcd8986c0f802f8cfb29e20467838579768a2bcf0cde2d5553786ece917","schema_version":"1.0","event_id":"sha256:64b2cbcd8986c0f802f8cfb29e20467838579768a2bcf0cde2d5553786ece917"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRWDC3EHN4ADZDTBLZVF37WL6J/bundle.json","state_url":"https://pith.science/pith/GRWDC3EHN4ADZDTBLZVF37WL6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRWDC3EHN4ADZDTBLZVF37WL6J/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-06T21:59:31Z","links":{"resolver":"https://pith.science/pith/GRWDC3EHN4ADZDTBLZVF37WL6J","bundle":"https://pith.science/pith/GRWDC3EHN4ADZDTBLZVF37WL6J/bundle.json","state":"https://pith.science/pith/GRWDC3EHN4ADZDTBLZVF37WL6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRWDC3EHN4ADZDTBLZVF37WL6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GRWDC3EHN4ADZDTBLZVF37WL6J","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":"7e8bc2efb73ea7938b751cd29ab3179e4c2081885ece670f167f08859c07703f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-21T12:35:01Z","title_canon_sha256":"f267fbfffdfe6156954bfb0318c57470cabbbb909dc6733e5deddbbb7f28af10"},"schema_version":"1.0","source":{"id":"1703.07171","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07171","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07171v1","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07171","created_at":"2026-05-18T00:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"GRWDC3EHN4AD","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GRWDC3EHN4ADZDTB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GRWDC3EH","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:64b2cbcd8986c0f802f8cfb29e20467838579768a2bcf0cde2d5553786ece917","target":"graph","created_at":"2026-05-18T00:48:11Z","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 paper considers the problem of recovering either a low rank matrix or a sparse vector from observations of linear combinations of the vector or matrix elements. Recent methods replace the non-convex regularization with $\\ell_1$ or nuclear norm relaxations. It is well known that this approach can be guaranteed to recover a near optimal solutions if a so called restricted isometry property (RIP) holds. On the other hand it is also known to perform soft thresholding which results in a shrinking bias which can degrade the solution.\n  In this paper we study an alternative non-convex regulariza","authors_text":"Carl Olsson, Fredrik Andersson, Marcus Carlsson, Viktor Larsson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-21T12:35:01Z","title":"Non-Convex Rank/Sparsity Regularization and Local Minima"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07171","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:cc77b307a8b307bddae23fb780f0c5063cc638a083bba8ded021f880500d0f41","target":"record","created_at":"2026-05-18T00:48:11Z","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":"7e8bc2efb73ea7938b751cd29ab3179e4c2081885ece670f167f08859c07703f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-21T12:35:01Z","title_canon_sha256":"f267fbfffdfe6156954bfb0318c57470cabbbb909dc6733e5deddbbb7f28af10"},"schema_version":"1.0","source":{"id":"1703.07171","kind":"arxiv","version":1}},"canonical_sha256":"346c316c876f003c8e615e6a5dfecbf244e1281b1a8a812358549b89ba77447f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"346c316c876f003c8e615e6a5dfecbf244e1281b1a8a812358549b89ba77447f","first_computed_at":"2026-05-18T00:48:11.118433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:11.118433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lJrBJcawHetCoQwzDe7kZXYwW8lc2XBQcihQdU2o8RV9FldNHSOMOg+b7xfsMLdUjEd9AjwJh8nlfNfDvTIBDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:11.119009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07171","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc77b307a8b307bddae23fb780f0c5063cc638a083bba8ded021f880500d0f41","sha256:64b2cbcd8986c0f802f8cfb29e20467838579768a2bcf0cde2d5553786ece917"],"state_sha256":"3b548b32530c30dbde711b59350d0874c00858503afcdf2b91dffb398316dc7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OAIHvAQ4STOfYsr4ZnaMQRWAh4QMDXIWPJ2K59upsVXkx3i2Wf1OCYe1jYpgYyWXKmadW5Che4A07m75jDuLCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:59:31.911946Z","bundle_sha256":"4d48b7ff575436a4527d540b28907b8821571b574856f1e917dd77739c1b531f"}}