{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TJNZWC77KCWVWIW7RENAULFGU6","short_pith_number":"pith:TJNZWC77","canonical_record":{"source":{"id":"1605.03234","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-10T22:48:14Z","cross_cats_sorted":["cs.CV","math.IT","math.OC"],"title_canon_sha256":"e1661b548e01384232d074d32539a67f6c73916a83591825b0ecc9cfb9f87d3d","abstract_canon_sha256":"8a667c633e77e57a2d07d9d9ecce63e66be7a546ac3394ce1011fd15951a4a69"},"schema_version":"1.0"},"canonical_sha256":"9a5b9b0bff50ad5b22df891a0a2ca6a78da6ed775626363551fc48d36ca71b71","source":{"kind":"arxiv","id":"1605.03234","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03234","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03234v2","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03234","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"TJNZWC77KCWV","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TJNZWC77KCWVWIW7","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TJNZWC77","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TJNZWC77KCWVWIW7RENAULFGU6","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03234","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-10T22:48:14Z","cross_cats_sorted":["cs.CV","math.IT","math.OC"],"title_canon_sha256":"e1661b548e01384232d074d32539a67f6c73916a83591825b0ecc9cfb9f87d3d","abstract_canon_sha256":"8a667c633e77e57a2d07d9d9ecce63e66be7a546ac3394ce1011fd15951a4a69"},"schema_version":"1.0"},"canonical_sha256":"9a5b9b0bff50ad5b22df891a0a2ca6a78da6ed775626363551fc48d36ca71b71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:34.294611Z","signature_b64":"Eu71EWmouyoeoQSzyVCzgA+2tXI3dHIjvRnHJtytZzTulNlQHoO7uX/M0duNWP724uOimrpZyHB3LHG9F7LECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a5b9b0bff50ad5b22df891a0a2ca6a78da6ed775626363551fc48d36ca71b71","last_reissued_at":"2026-05-18T00:52:34.294129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:34.294129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03234","source_version":2,"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:52:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHsV9MLyNgeGkJ4gvVDLTVS4v/pF8ue/ye10KT8wXypm5aawYkK+2lyL+/pLBy4XNJFe655dmdTpb3pvT5g6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:28:04.180484Z"},"content_sha256":"ee4ddcf4a52bd842c5afbbbd4d7f51d1755cc5ba8f6d9a159795c41c1fafd407","schema_version":"1.0","event_id":"sha256:ee4ddcf4a52bd842c5afbbbd4d7f51d1755cc5ba8f6d9a159795c41c1fafd407"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TJNZWC77KCWVWIW7RENAULFGU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Measurement Bounds for Sparse Signal Reconstruction with Multiple Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Andre Kaup, Huynh Van Luong, Jurgen Seiler, Nikos Deligiannis, Soren Forchhammer","submitted_at":"2016-05-10T22:48:14Z","abstract_excerpt":"In the context of compressed sensing (CS), this paper considers the problem of reconstructing sparse signals with the aid of other given correlated sources as multiple side information. To address this problem, we theoretically study a generic \\textcolor{black}{weighted $n$-$\\ell_{1}$ minimization} framework and propose a reconstruction algorithm that leverages multiple side information signals (RAMSI). The proposed RAMSI algorithm computes adaptively optimal weights among the side information signals at every reconstruction iteration. In addition, we establish theoretical bounds on the number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03234","kind":"arxiv","version":2},"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:52:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYEjQ9ygDA0leeWr+2N1CDm2b7eeaejpY/RSXFX0n6XK8RbcsPg5qNeRVzRtYcIGDAQLjtmxc+VN12JbaiAKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:28:04.180857Z"},"content_sha256":"0de18836607f5408c9729af4233509799188c7cdfa3b57d5c6e770551ce71e25","schema_version":"1.0","event_id":"sha256:0de18836607f5408c9729af4233509799188c7cdfa3b57d5c6e770551ce71e25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJNZWC77KCWVWIW7RENAULFGU6/bundle.json","state_url":"https://pith.science/pith/TJNZWC77KCWVWIW7RENAULFGU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJNZWC77KCWVWIW7RENAULFGU6/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-20T04:28:04Z","links":{"resolver":"https://pith.science/pith/TJNZWC77KCWVWIW7RENAULFGU6","bundle":"https://pith.science/pith/TJNZWC77KCWVWIW7RENAULFGU6/bundle.json","state":"https://pith.science/pith/TJNZWC77KCWVWIW7RENAULFGU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJNZWC77KCWVWIW7RENAULFGU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TJNZWC77KCWVWIW7RENAULFGU6","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":"8a667c633e77e57a2d07d9d9ecce63e66be7a546ac3394ce1011fd15951a4a69","cross_cats_sorted":["cs.CV","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-10T22:48:14Z","title_canon_sha256":"e1661b548e01384232d074d32539a67f6c73916a83591825b0ecc9cfb9f87d3d"},"schema_version":"1.0","source":{"id":"1605.03234","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03234","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03234v2","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03234","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"TJNZWC77KCWV","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TJNZWC77KCWVWIW7","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TJNZWC77","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:0de18836607f5408c9729af4233509799188c7cdfa3b57d5c6e770551ce71e25","target":"graph","created_at":"2026-05-18T00:52:34Z","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 the context of compressed sensing (CS), this paper considers the problem of reconstructing sparse signals with the aid of other given correlated sources as multiple side information. To address this problem, we theoretically study a generic \\textcolor{black}{weighted $n$-$\\ell_{1}$ minimization} framework and propose a reconstruction algorithm that leverages multiple side information signals (RAMSI). The proposed RAMSI algorithm computes adaptively optimal weights among the side information signals at every reconstruction iteration. In addition, we establish theoretical bounds on the number","authors_text":"Andre Kaup, Huynh Van Luong, Jurgen Seiler, Nikos Deligiannis, Soren Forchhammer","cross_cats":["cs.CV","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-10T22:48:14Z","title":"Measurement Bounds for Sparse Signal Reconstruction with Multiple Side Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03234","kind":"arxiv","version":2},"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:ee4ddcf4a52bd842c5afbbbd4d7f51d1755cc5ba8f6d9a159795c41c1fafd407","target":"record","created_at":"2026-05-18T00:52:34Z","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":"8a667c633e77e57a2d07d9d9ecce63e66be7a546ac3394ce1011fd15951a4a69","cross_cats_sorted":["cs.CV","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-10T22:48:14Z","title_canon_sha256":"e1661b548e01384232d074d32539a67f6c73916a83591825b0ecc9cfb9f87d3d"},"schema_version":"1.0","source":{"id":"1605.03234","kind":"arxiv","version":2}},"canonical_sha256":"9a5b9b0bff50ad5b22df891a0a2ca6a78da6ed775626363551fc48d36ca71b71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a5b9b0bff50ad5b22df891a0a2ca6a78da6ed775626363551fc48d36ca71b71","first_computed_at":"2026-05-18T00:52:34.294129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:34.294129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Eu71EWmouyoeoQSzyVCzgA+2tXI3dHIjvRnHJtytZzTulNlQHoO7uX/M0duNWP724uOimrpZyHB3LHG9F7LECg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:34.294611Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03234","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee4ddcf4a52bd842c5afbbbd4d7f51d1755cc5ba8f6d9a159795c41c1fafd407","sha256:0de18836607f5408c9729af4233509799188c7cdfa3b57d5c6e770551ce71e25"],"state_sha256":"eec30d332c10cbe8c6828666d69e175e0fa0f22a21219f2efba1788bfd3c5b8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2dC2CcyNNo6Z5vvnc7z7/4RCzcxdNFmjILJvH8Qs3zI28PHe5oqlXqXeq+G4dVUPAoN+40CyO+1jjP5en+tnAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:28:04.182850Z","bundle_sha256":"e54e3dd729c5cf52d9eaa7ca2b647c43b27ce76ff82b61b06544da3caec36aa5"}}