{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:H6F2SJH7ABZRS74AEEWMBPRGPK","short_pith_number":"pith:H6F2SJH7","canonical_record":{"source":{"id":"1211.5058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-21T15:24:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5b349de314f0fb286351027c670904754443e08616a8ef4496951312d702bf8c","abstract_canon_sha256":"2e06472629b1e1696ea3dc6fba0c292bee02b3277f1ac13d5a1fb8be3183ff9e"},"schema_version":"1.0"},"canonical_sha256":"3f8ba924ff0073197f80212cc0be267a95eac8fb939b6d633da6879a98a615fa","source":{"kind":"arxiv","id":"1211.5058","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5058","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5058v1","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5058","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"H6F2SJH7ABZR","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"H6F2SJH7ABZRS74A","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"H6F2SJH7","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:H6F2SJH7ABZRS74AEEWMBPRGPK","target":"record","payload":{"canonical_record":{"source":{"id":"1211.5058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-21T15:24:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5b349de314f0fb286351027c670904754443e08616a8ef4496951312d702bf8c","abstract_canon_sha256":"2e06472629b1e1696ea3dc6fba0c292bee02b3277f1ac13d5a1fb8be3183ff9e"},"schema_version":"1.0"},"canonical_sha256":"3f8ba924ff0073197f80212cc0be267a95eac8fb939b6d633da6879a98a615fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:15.147010Z","signature_b64":"riEQWcEzZU1SIZSb2YFj6MIGrsqmO9rW9AfDFevJfKAFz656cAozlC4QJHYj/quakjBuZA2xUOPuh7jeSzJcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f8ba924ff0073197f80212cc0be267a95eac8fb939b6d633da6879a98a615fa","last_reissued_at":"2026-05-18T03:40:15.146275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:15.146275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.5058","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:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Mi602olElYnTAykFXElpqExRXmgJCssJ9mokaXcZBx4MdJwmJI75iD6xVAM5udi8B/vZKydag2IiWaID3z3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:04:59.070450Z"},"content_sha256":"23a884d7898a25915a812422bfb66b1599df3a9db61f165e6d1eef6950a85eca","schema_version":"1.0","event_id":"sha256:23a884d7898a25915a812422bfb66b1599df3a9db61f165e6d1eef6950a85eca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:H6F2SJH7ABZRS74AEEWMBPRGPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressed Sensing of Simultaneous Low-Rank and Joint-Sparse Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Golbabaee, Pierre Vandergheynst","submitted_at":"2012-11-21T15:24:13Z","abstract_excerpt":"In this paper we consider the problem of recovering a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model that can efficiently restrict the degrees of freedom of the problem and is generic enough to find a lot of applications, for instance in multichannel signal compressed sensing (e.g. sensor networks, hyperspectral imaging) and compressive sparse principal component analysis (s-PCA). We assume data matrices have a simultaneous low-rank and joint sparse structure, and we propose a novel approach for efficient compressed sensing (CS) of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5058","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:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NVzji5EmJonUdc9qCc9j0+WaE9nZ7w5+9t015+x66ZMk2Zeq8kAF1ZSguJ+e7fYFClzExR2dmPhVYmLQbJFeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:04:59.070800Z"},"content_sha256":"79b22c40e29776bd21377dee978ab86f14bd5acba4cc1043862cb414b77f5082","schema_version":"1.0","event_id":"sha256:79b22c40e29776bd21377dee978ab86f14bd5acba4cc1043862cb414b77f5082"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6F2SJH7ABZRS74AEEWMBPRGPK/bundle.json","state_url":"https://pith.science/pith/H6F2SJH7ABZRS74AEEWMBPRGPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6F2SJH7ABZRS74AEEWMBPRGPK/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-21T23:04:59Z","links":{"resolver":"https://pith.science/pith/H6F2SJH7ABZRS74AEEWMBPRGPK","bundle":"https://pith.science/pith/H6F2SJH7ABZRS74AEEWMBPRGPK/bundle.json","state":"https://pith.science/pith/H6F2SJH7ABZRS74AEEWMBPRGPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6F2SJH7ABZRS74AEEWMBPRGPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:H6F2SJH7ABZRS74AEEWMBPRGPK","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":"2e06472629b1e1696ea3dc6fba0c292bee02b3277f1ac13d5a1fb8be3183ff9e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-21T15:24:13Z","title_canon_sha256":"5b349de314f0fb286351027c670904754443e08616a8ef4496951312d702bf8c"},"schema_version":"1.0","source":{"id":"1211.5058","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5058","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5058v1","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5058","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"H6F2SJH7ABZR","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"H6F2SJH7ABZRS74A","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"H6F2SJH7","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:79b22c40e29776bd21377dee978ab86f14bd5acba4cc1043862cb414b77f5082","target":"graph","created_at":"2026-05-18T03:40:15Z","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 consider the problem of recovering a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model that can efficiently restrict the degrees of freedom of the problem and is generic enough to find a lot of applications, for instance in multichannel signal compressed sensing (e.g. sensor networks, hyperspectral imaging) and compressive sparse principal component analysis (s-PCA). We assume data matrices have a simultaneous low-rank and joint sparse structure, and we propose a novel approach for efficient compressed sensing (CS) of","authors_text":"Mohammad Golbabaee, Pierre Vandergheynst","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-21T15:24:13Z","title":"Compressed Sensing of Simultaneous Low-Rank and Joint-Sparse Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5058","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:23a884d7898a25915a812422bfb66b1599df3a9db61f165e6d1eef6950a85eca","target":"record","created_at":"2026-05-18T03:40:15Z","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":"2e06472629b1e1696ea3dc6fba0c292bee02b3277f1ac13d5a1fb8be3183ff9e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-21T15:24:13Z","title_canon_sha256":"5b349de314f0fb286351027c670904754443e08616a8ef4496951312d702bf8c"},"schema_version":"1.0","source":{"id":"1211.5058","kind":"arxiv","version":1}},"canonical_sha256":"3f8ba924ff0073197f80212cc0be267a95eac8fb939b6d633da6879a98a615fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f8ba924ff0073197f80212cc0be267a95eac8fb939b6d633da6879a98a615fa","first_computed_at":"2026-05-18T03:40:15.146275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:15.146275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"riEQWcEzZU1SIZSb2YFj6MIGrsqmO9rW9AfDFevJfKAFz656cAozlC4QJHYj/quakjBuZA2xUOPuh7jeSzJcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:15.147010Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5058","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23a884d7898a25915a812422bfb66b1599df3a9db61f165e6d1eef6950a85eca","sha256:79b22c40e29776bd21377dee978ab86f14bd5acba4cc1043862cb414b77f5082"],"state_sha256":"df574bc93f7c9f2839e93e6903134897b281bbd033f900b3e30f13b85efff471"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sZncRSv75GPOCylg/OLFChfwwcPOwxl6fOjl6PCWGem7fZSLx2P/1QoQjOgvatuf3xkZ6UvhCHMh2GfOzWoqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:04:59.072805Z","bundle_sha256":"eae33892808879eb021322c34c21f02948e8b60eeae478334c94f321fb9c944e"}}