{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NZIS3ZTAZ3DUTOU5OJ3FQIAJIN","short_pith_number":"pith:NZIS3ZTA","canonical_record":{"source":{"id":"1203.1570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2012-03-07T19:14:32Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT","stat.ML"],"title_canon_sha256":"50c1ccd42d951d4ed41f0d9f1e5e1062b2167ab991b9b4bef468954ffb6d0b85","abstract_canon_sha256":"855ea92c001037ad82b00241e0342acd948489cd9314753082aea0d6b884bdf2"},"schema_version":"1.0"},"canonical_sha256":"6e512de660cec749ba9d72765820094369099c77a747a32ef98e9b76a53c680e","source":{"kind":"arxiv","id":"1203.1570","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1570","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1570v1","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1570","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"NZIS3ZTAZ3DU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NZIS3ZTAZ3DUTOU5","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NZIS3ZTA","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NZIS3ZTAZ3DUTOU5OJ3FQIAJIN","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2012-03-07T19:14:32Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT","stat.ML"],"title_canon_sha256":"50c1ccd42d951d4ed41f0d9f1e5e1062b2167ab991b9b4bef468954ffb6d0b85","abstract_canon_sha256":"855ea92c001037ad82b00241e0342acd948489cd9314753082aea0d6b884bdf2"},"schema_version":"1.0"},"canonical_sha256":"6e512de660cec749ba9d72765820094369099c77a747a32ef98e9b76a53c680e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:58.290479Z","signature_b64":"1305AydEVZvuVO5t+am2W9poU7XiZhATpUuruOu2Pvr42U7itZHDxvtyA0pjW6+4RiKO8F0qCQgqVITo/WocCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e512de660cec749ba9d72765820094369099c77a747a32ef98e9b76a53c680e","last_reissued_at":"2026-05-18T03:11:58.289724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:58.289724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1570","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-18T03:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPUxms0e4bmPuXpMR12BixR+sXIVLv0q2HrPOrFPoNevruNHAEuTBYHfw7IcJJMT50vn6FwmGN93e398XUWbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T15:49:37.788453Z"},"content_sha256":"245d4ddd004d0202d139c2e9d032d53671e11c720113561cb1960717ee90fe47","schema_version":"1.0","event_id":"sha256:245d4ddd004d0202d139c2e9d032d53671e11c720113561cb1960717ee90fe47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NZIS3ZTAZ3DUTOU5OJ3FQIAJIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"In-network Sparsity-regularized Rank Minimization: Algorithms and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT","stat.ML"],"primary_cat":"cs.MA","authors_text":"Georgios B. Giannakis, Gonzalo Mateos, Morteza Mardani","submitted_at":"2012-03-07T19:14:32Z","abstract_excerpt":"Given a limited number of entries from the superposition of a low-rank matrix plus the product of a known fat compression matrix times a sparse matrix, recovery of the low-rank and sparse components is a fundamental task subsuming compressed sensing, matrix completion, and principal components pursuit. This paper develops algorithms for distributed sparsity-regularized rank minimization over networks, when the nuclear- and $\\ell_1$-norm are used as surrogates to the rank and nonzero entry counts of the sought matrices, respectively. While nuclear-norm minimization has well-documented merits wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1570","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-18T03:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMwcLoktVmuaM1k+tMwjsBmNeq9bFgDaZ03gVjk/63qlm03Tz2fSiGhT/eVTXgV+vIu3kgIX270QYNNrORkaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T15:49:37.788911Z"},"content_sha256":"4981e5eeb1dd9a475611dc8a1f8071b39a1623de01a3ca9be0ba3f97423be817","schema_version":"1.0","event_id":"sha256:4981e5eeb1dd9a475611dc8a1f8071b39a1623de01a3ca9be0ba3f97423be817"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZIS3ZTAZ3DUTOU5OJ3FQIAJIN/bundle.json","state_url":"https://pith.science/pith/NZIS3ZTAZ3DUTOU5OJ3FQIAJIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZIS3ZTAZ3DUTOU5OJ3FQIAJIN/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-08-23T15:49:37Z","links":{"resolver":"https://pith.science/pith/NZIS3ZTAZ3DUTOU5OJ3FQIAJIN","bundle":"https://pith.science/pith/NZIS3ZTAZ3DUTOU5OJ3FQIAJIN/bundle.json","state":"https://pith.science/pith/NZIS3ZTAZ3DUTOU5OJ3FQIAJIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZIS3ZTAZ3DUTOU5OJ3FQIAJIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NZIS3ZTAZ3DUTOU5OJ3FQIAJIN","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":"855ea92c001037ad82b00241e0342acd948489cd9314753082aea0d6b884bdf2","cross_cats_sorted":["cs.IT","cs.NI","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2012-03-07T19:14:32Z","title_canon_sha256":"50c1ccd42d951d4ed41f0d9f1e5e1062b2167ab991b9b4bef468954ffb6d0b85"},"schema_version":"1.0","source":{"id":"1203.1570","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1570","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1570v1","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1570","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"NZIS3ZTAZ3DU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NZIS3ZTAZ3DUTOU5","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NZIS3ZTA","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:4981e5eeb1dd9a475611dc8a1f8071b39a1623de01a3ca9be0ba3f97423be817","target":"graph","created_at":"2026-05-18T03:11:58Z","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":"Given a limited number of entries from the superposition of a low-rank matrix plus the product of a known fat compression matrix times a sparse matrix, recovery of the low-rank and sparse components is a fundamental task subsuming compressed sensing, matrix completion, and principal components pursuit. This paper develops algorithms for distributed sparsity-regularized rank minimization over networks, when the nuclear- and $\\ell_1$-norm are used as surrogates to the rank and nonzero entry counts of the sought matrices, respectively. While nuclear-norm minimization has well-documented merits wh","authors_text":"Georgios B. Giannakis, Gonzalo Mateos, Morteza Mardani","cross_cats":["cs.IT","cs.NI","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2012-03-07T19:14:32Z","title":"In-network Sparsity-regularized Rank Minimization: Algorithms and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1570","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:245d4ddd004d0202d139c2e9d032d53671e11c720113561cb1960717ee90fe47","target":"record","created_at":"2026-05-18T03:11:58Z","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":"855ea92c001037ad82b00241e0342acd948489cd9314753082aea0d6b884bdf2","cross_cats_sorted":["cs.IT","cs.NI","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2012-03-07T19:14:32Z","title_canon_sha256":"50c1ccd42d951d4ed41f0d9f1e5e1062b2167ab991b9b4bef468954ffb6d0b85"},"schema_version":"1.0","source":{"id":"1203.1570","kind":"arxiv","version":1}},"canonical_sha256":"6e512de660cec749ba9d72765820094369099c77a747a32ef98e9b76a53c680e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e512de660cec749ba9d72765820094369099c77a747a32ef98e9b76a53c680e","first_computed_at":"2026-05-18T03:11:58.289724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:58.289724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1305AydEVZvuVO5t+am2W9poU7XiZhATpUuruOu2Pvr42U7itZHDxvtyA0pjW6+4RiKO8F0qCQgqVITo/WocCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:58.290479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1570","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:245d4ddd004d0202d139c2e9d032d53671e11c720113561cb1960717ee90fe47","sha256:4981e5eeb1dd9a475611dc8a1f8071b39a1623de01a3ca9be0ba3f97423be817"],"state_sha256":"036d2babbab8d1a55fc39d0066ac9dc179f62a602eed4b8d51adc9f3e620a0ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kITar5DHXNrwvXrf3y3Eg8r+bIbmTRbP38jE6VrYj5khzfzkeTpj9S7/Y/BJsF6PuB5XR0OP9FfNUD1Ffmz3BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T15:49:37.792527Z","bundle_sha256":"bcd4714ad6c503e3611e6ab7b33e6da4fb9f7293a516c09f38cb5fe02706c097"}}