{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PCDJJJNKK62YZNGUMVBW2UHI3E","short_pith_number":"pith:PCDJJJNK","canonical_record":{"source":{"id":"1504.01158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-05T20:38:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5df74836dd86b0d94bb03e9164bb435708ee9968a0a4844ae0839b2c63daf531","abstract_canon_sha256":"0835f85ebf323fd7506e8516fe2c2a4ae960fdb040219525bed43fea0064381a"},"schema_version":"1.0"},"canonical_sha256":"788694a5aa57b58cb4d465436d50e8d9204abe9f232de38c0519a6bab37c45fb","source":{"kind":"arxiv","id":"1504.01158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01158","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01158v1","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01158","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"PCDJJJNKK62Y","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PCDJJJNKK62YZNGU","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PCDJJJNK","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PCDJJJNKK62YZNGUMVBW2UHI3E","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-05T20:38:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5df74836dd86b0d94bb03e9164bb435708ee9968a0a4844ae0839b2c63daf531","abstract_canon_sha256":"0835f85ebf323fd7506e8516fe2c2a4ae960fdb040219525bed43fea0064381a"},"schema_version":"1.0"},"canonical_sha256":"788694a5aa57b58cb4d465436d50e8d9204abe9f232de38c0519a6bab37c45fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:50.812616Z","signature_b64":"Jq1I/NHT2wz4TEluXdvrbSXUVOvM1r20cdOY6FtBfTddxnqIHd84l4zpXD+f+Z598WVzkVe3HRv7z7sGfuwQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"788694a5aa57b58cb4d465436d50e8d9204abe9f232de38c0519a6bab37c45fb","last_reissued_at":"2026-05-18T00:57:50.812028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:50.812028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01158","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:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7IZnulTrPkC8WaFFTuptHMVrkf9lkWHoMqUPiXJp9sPyP+vHFUS3dvtC/OyUJ14HpDgLbSgw67pdNzkUJzJhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:03:58.951589Z"},"content_sha256":"56b61361f9e2bb38d7f8e335f54627dd21823bf3cbda9da1a4d0c0ab90fd37d7","schema_version":"1.0","event_id":"sha256:56b61361f9e2bb38d7f8e335f54627dd21823bf3cbda9da1a4d0c0ab90fd37d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PCDJJJNKK62YZNGUMVBW2UHI3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Concave Rank Approximation for Recovering Low-Rank Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Massoud Babaie-Zadeh, Mikael Skoglund, Mohammadreza Malek-Mohammadi","submitted_at":"2015-04-05T20:38:42Z","abstract_excerpt":"In this paper, we propose a new algorithm for recovery of low-rank matrices from compressed linear measurements. The underlying idea of this algorithm is to closely approximate the rank function with a smooth function of singular values, and then minimize the resulting approximation subject to the linear constraints. The accuracy of the approximation is controlled via a scaling parameter $\\delta$, where a smaller $\\delta$ corresponds to a more accurate fitting. The consequent optimization problem for any finite $\\delta$ is nonconvex. Therefore, in order to decrease the risk of ending up in loc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01158","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:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wc7DZd+jYohTIOpwUzGlCtRH8BfJTCBuBYjPHHCQRYpWK8dlwAByP2UTftuhkQ8HvP11iGnVFGcy8tRGw2zvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:03:58.951922Z"},"content_sha256":"cebf0b65372692b482b502da558e7d80594d655ca457e50731db813635700cb3","schema_version":"1.0","event_id":"sha256:cebf0b65372692b482b502da558e7d80594d655ca457e50731db813635700cb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCDJJJNKK62YZNGUMVBW2UHI3E/bundle.json","state_url":"https://pith.science/pith/PCDJJJNKK62YZNGUMVBW2UHI3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCDJJJNKK62YZNGUMVBW2UHI3E/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-30T14:03:58Z","links":{"resolver":"https://pith.science/pith/PCDJJJNKK62YZNGUMVBW2UHI3E","bundle":"https://pith.science/pith/PCDJJJNKK62YZNGUMVBW2UHI3E/bundle.json","state":"https://pith.science/pith/PCDJJJNKK62YZNGUMVBW2UHI3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCDJJJNKK62YZNGUMVBW2UHI3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PCDJJJNKK62YZNGUMVBW2UHI3E","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":"0835f85ebf323fd7506e8516fe2c2a4ae960fdb040219525bed43fea0064381a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-05T20:38:42Z","title_canon_sha256":"5df74836dd86b0d94bb03e9164bb435708ee9968a0a4844ae0839b2c63daf531"},"schema_version":"1.0","source":{"id":"1504.01158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01158","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01158v1","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01158","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"PCDJJJNKK62Y","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PCDJJJNKK62YZNGU","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PCDJJJNK","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:cebf0b65372692b482b502da558e7d80594d655ca457e50731db813635700cb3","target":"graph","created_at":"2026-05-18T00:57:50Z","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":"In this paper, we propose a new algorithm for recovery of low-rank matrices from compressed linear measurements. The underlying idea of this algorithm is to closely approximate the rank function with a smooth function of singular values, and then minimize the resulting approximation subject to the linear constraints. The accuracy of the approximation is controlled via a scaling parameter $\\delta$, where a smaller $\\delta$ corresponds to a more accurate fitting. The consequent optimization problem for any finite $\\delta$ is nonconvex. Therefore, in order to decrease the risk of ending up in loc","authors_text":"Massoud Babaie-Zadeh, Mikael Skoglund, Mohammadreza Malek-Mohammadi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-05T20:38:42Z","title":"Iterative Concave Rank Approximation for Recovering Low-Rank Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01158","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:56b61361f9e2bb38d7f8e335f54627dd21823bf3cbda9da1a4d0c0ab90fd37d7","target":"record","created_at":"2026-05-18T00:57:50Z","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":"0835f85ebf323fd7506e8516fe2c2a4ae960fdb040219525bed43fea0064381a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-05T20:38:42Z","title_canon_sha256":"5df74836dd86b0d94bb03e9164bb435708ee9968a0a4844ae0839b2c63daf531"},"schema_version":"1.0","source":{"id":"1504.01158","kind":"arxiv","version":1}},"canonical_sha256":"788694a5aa57b58cb4d465436d50e8d9204abe9f232de38c0519a6bab37c45fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"788694a5aa57b58cb4d465436d50e8d9204abe9f232de38c0519a6bab37c45fb","first_computed_at":"2026-05-18T00:57:50.812028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:50.812028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jq1I/NHT2wz4TEluXdvrbSXUVOvM1r20cdOY6FtBfTddxnqIHd84l4zpXD+f+Z598WVzkVe3HRv7z7sGfuwQDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:50.812616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56b61361f9e2bb38d7f8e335f54627dd21823bf3cbda9da1a4d0c0ab90fd37d7","sha256:cebf0b65372692b482b502da558e7d80594d655ca457e50731db813635700cb3"],"state_sha256":"8bed56430672e582949112490d1194b17434dff47f3cba32abdaddb71eb706e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tEP1zV1Xan/fev7ZAlrRB/RaJ4QiN/ftWk6BRYb0+0pEKJzdVu9qXyQhf8mjEOSwZlJ9GHxcRE6yr/f3Nz2LCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:03:58.953919Z","bundle_sha256":"14c558d5cd1e0917c1cac150b5eb23963fdc078b2f527bca2ecec7e54427c747"}}