{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GZSLIMSSW35CA5MFHX6OVAY4SB","short_pith_number":"pith:GZSLIMSS","canonical_record":{"source":{"id":"1811.08778","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2018-11-21T15:20:18Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ac42738f9f86212bd3dae0a0a3e5456fa54814647c950160c9d48fb146569a72","abstract_canon_sha256":"08b06ce563ca7d4302715fb066e8f1f6722e13ee2613c26c0aa5065752a2fc5c"},"schema_version":"1.0"},"canonical_sha256":"3664b43252b6fa2075853dfcea831c904c8f85da76a345cbf123ac244a627728","source":{"kind":"arxiv","id":"1811.08778","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08778","created_at":"2026-05-17T23:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08778v3","created_at":"2026-05-17T23:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08778","created_at":"2026-05-17T23:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"GZSLIMSSW35C","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GZSLIMSSW35CA5MF","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GZSLIMSS","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GZSLIMSSW35CA5MFHX6OVAY4SB","target":"record","payload":{"canonical_record":{"source":{"id":"1811.08778","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2018-11-21T15:20:18Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ac42738f9f86212bd3dae0a0a3e5456fa54814647c950160c9d48fb146569a72","abstract_canon_sha256":"08b06ce563ca7d4302715fb066e8f1f6722e13ee2613c26c0aa5065752a2fc5c"},"schema_version":"1.0"},"canonical_sha256":"3664b43252b6fa2075853dfcea831c904c8f85da76a345cbf123ac244a627728","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:09.380069Z","signature_b64":"kQKSu85yWRlu+ByIhzpea1ndOQHEt35VQpFgfkhI8en5loHkRf4xQgzUewETUqj8rnFLbr27qFcLr3uDcswMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3664b43252b6fa2075853dfcea831c904c8f85da76a345cbf123ac244a627728","last_reissued_at":"2026-05-17T23:45:09.379299Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:09.379299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.08778","source_version":3,"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-17T23:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IycTSSDCDiINA3MoDj2sgEyOTQn/MQtfa3dwr8gjxOGbQ7Wd76Bs9uCOyCrOcNoxYjnFOfAY/DFLXfqB3xDUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:41:54.171082Z"},"content_sha256":"724d9f9c391124edf01a7ceae505343dd2382870685ece6f1364ea5183393a41","schema_version":"1.0","event_id":"sha256:724d9f9c391124edf01a7ceae505343dd2382870685ece6f1364ea5183393a41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GZSLIMSSW35CA5MFHX6OVAY4SB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconstruction of jointly sparse vectors via manifold optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NA","authors_text":"Armenak Petrosyan, Clayton Webster, Hoang Tran","submitted_at":"2018-11-21T15:20:18Z","abstract_excerpt":"In this paper, we consider the challenge of reconstructing jointly sparse vectors from linear measurements. Firstly, we show that by utilizing the rank of the output data matrix we can reduce the problem to a full column rank case. This result reveals a reduction in the computational complexity of the original problem and enables a simple implementation of joint sparse recovery algorithms for full-rank setting. Secondly, we propose a new method for joint sparse recovery in the form of a non-convex optimization problem on a non-compact Stiefel manifold. In our numerical experiments our method o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08778","kind":"arxiv","version":3},"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-17T23:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25G0sG84yflMZyaKG7qfzE4Vcm0bCww1MHEPVEhSTW0IljYhok8hG0wcYV6YOyzodW2Z7A33FPkwj0vSTq4bDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:41:54.171442Z"},"content_sha256":"cc200b2f1690176c8debf8b5f8c3ba25abf2c34a31d6039528a98dc651b9d2b2","schema_version":"1.0","event_id":"sha256:cc200b2f1690176c8debf8b5f8c3ba25abf2c34a31d6039528a98dc651b9d2b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZSLIMSSW35CA5MFHX6OVAY4SB/bundle.json","state_url":"https://pith.science/pith/GZSLIMSSW35CA5MFHX6OVAY4SB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZSLIMSSW35CA5MFHX6OVAY4SB/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-27T09:41:54Z","links":{"resolver":"https://pith.science/pith/GZSLIMSSW35CA5MFHX6OVAY4SB","bundle":"https://pith.science/pith/GZSLIMSSW35CA5MFHX6OVAY4SB/bundle.json","state":"https://pith.science/pith/GZSLIMSSW35CA5MFHX6OVAY4SB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZSLIMSSW35CA5MFHX6OVAY4SB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GZSLIMSSW35CA5MFHX6OVAY4SB","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":"08b06ce563ca7d4302715fb066e8f1f6722e13ee2613c26c0aa5065752a2fc5c","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2018-11-21T15:20:18Z","title_canon_sha256":"ac42738f9f86212bd3dae0a0a3e5456fa54814647c950160c9d48fb146569a72"},"schema_version":"1.0","source":{"id":"1811.08778","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08778","created_at":"2026-05-17T23:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08778v3","created_at":"2026-05-17T23:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08778","created_at":"2026-05-17T23:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"GZSLIMSSW35C","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GZSLIMSSW35CA5MF","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GZSLIMSS","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:cc200b2f1690176c8debf8b5f8c3ba25abf2c34a31d6039528a98dc651b9d2b2","target":"graph","created_at":"2026-05-17T23:45:09Z","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 challenge of reconstructing jointly sparse vectors from linear measurements. Firstly, we show that by utilizing the rank of the output data matrix we can reduce the problem to a full column rank case. This result reveals a reduction in the computational complexity of the original problem and enables a simple implementation of joint sparse recovery algorithms for full-rank setting. Secondly, we propose a new method for joint sparse recovery in the form of a non-convex optimization problem on a non-compact Stiefel manifold. In our numerical experiments our method o","authors_text":"Armenak Petrosyan, Clayton Webster, Hoang Tran","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2018-11-21T15:20:18Z","title":"Reconstruction of jointly sparse vectors via manifold optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08778","kind":"arxiv","version":3},"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:724d9f9c391124edf01a7ceae505343dd2382870685ece6f1364ea5183393a41","target":"record","created_at":"2026-05-17T23:45:09Z","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":"08b06ce563ca7d4302715fb066e8f1f6722e13ee2613c26c0aa5065752a2fc5c","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2018-11-21T15:20:18Z","title_canon_sha256":"ac42738f9f86212bd3dae0a0a3e5456fa54814647c950160c9d48fb146569a72"},"schema_version":"1.0","source":{"id":"1811.08778","kind":"arxiv","version":3}},"canonical_sha256":"3664b43252b6fa2075853dfcea831c904c8f85da76a345cbf123ac244a627728","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3664b43252b6fa2075853dfcea831c904c8f85da76a345cbf123ac244a627728","first_computed_at":"2026-05-17T23:45:09.379299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:09.379299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kQKSu85yWRlu+ByIhzpea1ndOQHEt35VQpFgfkhI8en5loHkRf4xQgzUewETUqj8rnFLbr27qFcLr3uDcswMBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:09.380069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08778","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:724d9f9c391124edf01a7ceae505343dd2382870685ece6f1364ea5183393a41","sha256:cc200b2f1690176c8debf8b5f8c3ba25abf2c34a31d6039528a98dc651b9d2b2"],"state_sha256":"98a6ef22cf917f3a86fbe03d7c662ac098c7ad31d40542032beecafca99bd42c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ad0+WWEYbTc49tLikCLg+TKJozXVGUJrUC14ZbdWoFTelN4q/fPn+E2naVz4OZ0BofT6fw1lH/7cOFlewxEYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T09:41:54.173492Z","bundle_sha256":"6629f3d8925b7b9da57881cb0279590e48efc05e1930e9679dff46bc1f02a51a"}}