{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:B6HWS5WAWSDINNRJ56JGBF55HW","short_pith_number":"pith:B6HWS5WA","canonical_record":{"source":{"id":"1904.07893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-16T18:01:12Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"cdb2dfaa2ae310a8493ed53e2733b93bbff2c0924c91678a2e3f9def3e3799f5","abstract_canon_sha256":"95b5444365616bba23b261999074c50a9ef3f022f4af01d33416123c62aa935d"},"schema_version":"1.0"},"canonical_sha256":"0f8f6976c0b48686b629ef926097bd3d83ab2f665e083360e6600560f854808e","source":{"kind":"arxiv","id":"1904.07893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07893","created_at":"2026-05-17T23:44:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07893v1","created_at":"2026-05-17T23:44:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07893","created_at":"2026-05-17T23:44:54Z"},{"alias_kind":"pith_short_12","alias_value":"B6HWS5WAWSDI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B6HWS5WAWSDINNRJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B6HWS5WA","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:B6HWS5WAWSDINNRJ56JGBF55HW","target":"record","payload":{"canonical_record":{"source":{"id":"1904.07893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-16T18:01:12Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"cdb2dfaa2ae310a8493ed53e2733b93bbff2c0924c91678a2e3f9def3e3799f5","abstract_canon_sha256":"95b5444365616bba23b261999074c50a9ef3f022f4af01d33416123c62aa935d"},"schema_version":"1.0"},"canonical_sha256":"0f8f6976c0b48686b629ef926097bd3d83ab2f665e083360e6600560f854808e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:54.252024Z","signature_b64":"SiSxIqN6X08RBOuWxiG/DJ50Uy3aTtZQ9yaIT8LUXkFc0omHLmXnEwFTlDZ65YyOcRKhrAhFft6ovazg44+vDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f8f6976c0b48686b629ef926097bd3d83ab2f665e083360e6600560f854808e","last_reissued_at":"2026-05-17T23:44:54.251578Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:54.251578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.07893","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-17T23:44:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btZ39OaXuXQNpBKF6eYYi/3a0jWLLl3oCvpjAZuvHvTFsODVVsYDs/7AWdwEsjSieIgz4BsWBkGbIMzPqS0gBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:39:19.665790Z"},"content_sha256":"c1cb8e1fbc005f3ef929f9d1b8c838311e4d584aa23d3f541f8a94a7f024f0d1","schema_version":"1.0","event_id":"sha256:c1cb8e1fbc005f3ef929f9d1b8c838311e4d584aa23d3f541f8a94a7f024f0d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:B6HWS5WAWSDINNRJ56JGBF55HW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous structures in convex signal recovery - revisiting the convex combination of norms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Martin Kliesch, Peter Jung, Stanislaw J. Szarek","submitted_at":"2019-04-16T18:01:12Z","abstract_excerpt":"In compressed sensing one uses known structures of otherwise unknown signals to recover them from as few linear observations as possible. The structure comes in form of some compressibility including different notions of sparsity and low rankness. In many cases convex relaxations allow to efficiently solve the inverse problems using standard convex solvers at almost-optimal sampling rates. A standard practice to account for multiple simultaneous structures in convex optimization is to add further regularizers or constraints. From the compressed sensing perspective there is then the hope to als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07893","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-17T23:44:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u2/jaroTUIdEPA8RpjLpqqdQw+/z5in9/v1bV4N9AudVq2QstRVCJMXn3TzwW3NMOSkFkEFMoYFUBVM/kduiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:39:19.666543Z"},"content_sha256":"5360bc383f941618878d5769e83d4953a1adc6c886633434e8bdb1a6ca8cbbae","schema_version":"1.0","event_id":"sha256:5360bc383f941618878d5769e83d4953a1adc6c886633434e8bdb1a6ca8cbbae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B6HWS5WAWSDINNRJ56JGBF55HW/bundle.json","state_url":"https://pith.science/pith/B6HWS5WAWSDINNRJ56JGBF55HW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B6HWS5WAWSDINNRJ56JGBF55HW/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-31T01:39:19Z","links":{"resolver":"https://pith.science/pith/B6HWS5WAWSDINNRJ56JGBF55HW","bundle":"https://pith.science/pith/B6HWS5WAWSDINNRJ56JGBF55HW/bundle.json","state":"https://pith.science/pith/B6HWS5WAWSDINNRJ56JGBF55HW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B6HWS5WAWSDINNRJ56JGBF55HW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:B6HWS5WAWSDINNRJ56JGBF55HW","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":"95b5444365616bba23b261999074c50a9ef3f022f4af01d33416123c62aa935d","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-16T18:01:12Z","title_canon_sha256":"cdb2dfaa2ae310a8493ed53e2733b93bbff2c0924c91678a2e3f9def3e3799f5"},"schema_version":"1.0","source":{"id":"1904.07893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07893","created_at":"2026-05-17T23:44:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07893v1","created_at":"2026-05-17T23:44:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07893","created_at":"2026-05-17T23:44:54Z"},{"alias_kind":"pith_short_12","alias_value":"B6HWS5WAWSDI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B6HWS5WAWSDINNRJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B6HWS5WA","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:5360bc383f941618878d5769e83d4953a1adc6c886633434e8bdb1a6ca8cbbae","target":"graph","created_at":"2026-05-17T23:44:54Z","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 compressed sensing one uses known structures of otherwise unknown signals to recover them from as few linear observations as possible. The structure comes in form of some compressibility including different notions of sparsity and low rankness. In many cases convex relaxations allow to efficiently solve the inverse problems using standard convex solvers at almost-optimal sampling rates. A standard practice to account for multiple simultaneous structures in convex optimization is to add further regularizers or constraints. From the compressed sensing perspective there is then the hope to als","authors_text":"Martin Kliesch, Peter Jung, Stanislaw J. Szarek","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-16T18:01:12Z","title":"Simultaneous structures in convex signal recovery - revisiting the convex combination of norms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07893","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:c1cb8e1fbc005f3ef929f9d1b8c838311e4d584aa23d3f541f8a94a7f024f0d1","target":"record","created_at":"2026-05-17T23:44:54Z","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":"95b5444365616bba23b261999074c50a9ef3f022f4af01d33416123c62aa935d","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-16T18:01:12Z","title_canon_sha256":"cdb2dfaa2ae310a8493ed53e2733b93bbff2c0924c91678a2e3f9def3e3799f5"},"schema_version":"1.0","source":{"id":"1904.07893","kind":"arxiv","version":1}},"canonical_sha256":"0f8f6976c0b48686b629ef926097bd3d83ab2f665e083360e6600560f854808e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f8f6976c0b48686b629ef926097bd3d83ab2f665e083360e6600560f854808e","first_computed_at":"2026-05-17T23:44:54.251578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:54.251578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SiSxIqN6X08RBOuWxiG/DJ50Uy3aTtZQ9yaIT8LUXkFc0omHLmXnEwFTlDZ65YyOcRKhrAhFft6ovazg44+vDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:54.252024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1cb8e1fbc005f3ef929f9d1b8c838311e4d584aa23d3f541f8a94a7f024f0d1","sha256:5360bc383f941618878d5769e83d4953a1adc6c886633434e8bdb1a6ca8cbbae"],"state_sha256":"e652656acf55339e2cdfa5cd29eae17d3934c15918bba6b6d3bcb9dec6308b47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YZngYp8HzpRG2F3O5fDu96nSuZwTvQIeDMGf77Xr0OV3y+6AXIkx8nLmFO99QdVrKUXshaDSLPk5vpuGwuPHBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:39:19.670217Z","bundle_sha256":"99e6f5017cd980d5bc7e9fff12499af1dedae19171e46ee2895ad706da6d6e17"}}