{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FV7Y4FLD6YGYOSQBFA6QSXEWYE","short_pith_number":"pith:FV7Y4FLD","canonical_record":{"source":{"id":"1408.5250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-22T10:23:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"337503a17c5ae6c9c532f4d5f450bf525b169774152d50291c04caeb119f30f8","abstract_canon_sha256":"78694aafa1a5e390237f58cd56641a2f45711c1ffdd6ce27490a818eea3a6ab5"},"schema_version":"1.0"},"canonical_sha256":"2d7f8e1563f60d874a01283d095c96c1207a81b07415c88e071283b1fdcb82f5","source":{"kind":"arxiv","id":"1408.5250","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5250","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5250v1","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5250","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"FV7Y4FLD6YGY","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FV7Y4FLD6YGYOSQB","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FV7Y4FLD","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FV7Y4FLD6YGYOSQBFA6QSXEWYE","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-22T10:23:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"337503a17c5ae6c9c532f4d5f450bf525b169774152d50291c04caeb119f30f8","abstract_canon_sha256":"78694aafa1a5e390237f58cd56641a2f45711c1ffdd6ce27490a818eea3a6ab5"},"schema_version":"1.0"},"canonical_sha256":"2d7f8e1563f60d874a01283d095c96c1207a81b07415c88e071283b1fdcb82f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:33.606871Z","signature_b64":"mMrfwmAWeMwRGfLkvOkj4jnGjvuM6nFC86/pIy800Qlk3Qom15ZD/7vmVYBEJ7wuqvf5lMaPGfaptujrGbJRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d7f8e1563f60d874a01283d095c96c1207a81b07415c88e071283b1fdcb82f5","last_reissued_at":"2026-05-18T02:44:33.606260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:33.606260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5250","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-18T02:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cWaaFGbp2qbBZcXuYdmfv+LwqdgGkdZ6a04JtaHNplFHl1ktbXXuOvOrpZRm5Xf7zSRnuk5Eq3VVt0NCw9T0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:34:28.235909Z"},"content_sha256":"8801d742eb8d3a1db358592529443e51f5ec6ba9fa25dbbbc695751e30496b21","schema_version":"1.0","event_id":"sha256:8801d742eb8d3a1db358592529443e51f5ec6ba9fa25dbbbc695751e30496b21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FV7Y4FLD6YGYOSQBFA6QSXEWYE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressed Sensing with Prior Information: Optimal Strategies, Geometry, and Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joao F. C. Mota, Miguel R. D. Rodrigues, Nikos Deligiannis","submitted_at":"2014-08-22T10:23:49Z","abstract_excerpt":"We address the problem of compressed sensing (CS) with prior information: reconstruct a target CS signal with the aid of a similar signal that is known beforehand, our prior information. We integrate the additional knowledge of the similar signal into CS via L1-L1 and L1-L2 minimization. We then establish bounds on the number of measurements required by these problems to successfully reconstruct the original signal. Our bounds and geometrical interpretations reveal that if the prior information has good enough quality, L1-L1 minimization improves the performance of CS dramatically. In contrast"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5250","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-18T02:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oLtGM49bPVB1c2FerLyZoudlZk6oQn2QQemAgkUBsxCH/8cFM99SHMfmdZeqRMMly89FKAGONeOiQAOKnFAqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:34:28.236261Z"},"content_sha256":"b5c9c00eb3259d07b9be50508c1e3d0cae4cafa7bcd16aa4964ae51c2bb11381","schema_version":"1.0","event_id":"sha256:b5c9c00eb3259d07b9be50508c1e3d0cae4cafa7bcd16aa4964ae51c2bb11381"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FV7Y4FLD6YGYOSQBFA6QSXEWYE/bundle.json","state_url":"https://pith.science/pith/FV7Y4FLD6YGYOSQBFA6QSXEWYE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FV7Y4FLD6YGYOSQBFA6QSXEWYE/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-28T13:34:28Z","links":{"resolver":"https://pith.science/pith/FV7Y4FLD6YGYOSQBFA6QSXEWYE","bundle":"https://pith.science/pith/FV7Y4FLD6YGYOSQBFA6QSXEWYE/bundle.json","state":"https://pith.science/pith/FV7Y4FLD6YGYOSQBFA6QSXEWYE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FV7Y4FLD6YGYOSQBFA6QSXEWYE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FV7Y4FLD6YGYOSQBFA6QSXEWYE","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":"78694aafa1a5e390237f58cd56641a2f45711c1ffdd6ce27490a818eea3a6ab5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-22T10:23:49Z","title_canon_sha256":"337503a17c5ae6c9c532f4d5f450bf525b169774152d50291c04caeb119f30f8"},"schema_version":"1.0","source":{"id":"1408.5250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5250","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5250v1","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5250","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"FV7Y4FLD6YGY","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FV7Y4FLD6YGYOSQB","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FV7Y4FLD","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:b5c9c00eb3259d07b9be50508c1e3d0cae4cafa7bcd16aa4964ae51c2bb11381","target":"graph","created_at":"2026-05-18T02:44:33Z","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":"We address the problem of compressed sensing (CS) with prior information: reconstruct a target CS signal with the aid of a similar signal that is known beforehand, our prior information. We integrate the additional knowledge of the similar signal into CS via L1-L1 and L1-L2 minimization. We then establish bounds on the number of measurements required by these problems to successfully reconstruct the original signal. Our bounds and geometrical interpretations reveal that if the prior information has good enough quality, L1-L1 minimization improves the performance of CS dramatically. In contrast","authors_text":"Joao F. C. Mota, Miguel R. D. Rodrigues, Nikos Deligiannis","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-22T10:23:49Z","title":"Compressed Sensing with Prior Information: Optimal Strategies, Geometry, and Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5250","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:8801d742eb8d3a1db358592529443e51f5ec6ba9fa25dbbbc695751e30496b21","target":"record","created_at":"2026-05-18T02:44:33Z","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":"78694aafa1a5e390237f58cd56641a2f45711c1ffdd6ce27490a818eea3a6ab5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-22T10:23:49Z","title_canon_sha256":"337503a17c5ae6c9c532f4d5f450bf525b169774152d50291c04caeb119f30f8"},"schema_version":"1.0","source":{"id":"1408.5250","kind":"arxiv","version":1}},"canonical_sha256":"2d7f8e1563f60d874a01283d095c96c1207a81b07415c88e071283b1fdcb82f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d7f8e1563f60d874a01283d095c96c1207a81b07415c88e071283b1fdcb82f5","first_computed_at":"2026-05-18T02:44:33.606260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:33.606260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mMrfwmAWeMwRGfLkvOkj4jnGjvuM6nFC86/pIy800Qlk3Qom15ZD/7vmVYBEJ7wuqvf5lMaPGfaptujrGbJRBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:33.606871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8801d742eb8d3a1db358592529443e51f5ec6ba9fa25dbbbc695751e30496b21","sha256:b5c9c00eb3259d07b9be50508c1e3d0cae4cafa7bcd16aa4964ae51c2bb11381"],"state_sha256":"8d384d78ffb3901891f6034ec65c03304780a8278edd35d5ebc704effa5ac8d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZNcVGoWNOQqrIu2kzsZj4NQmdFxEhczRY6oZlXfMThC/xEUd74fLAitko/4EQnmBSsM8+I1f8MSQMAk9v8CAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:34:28.238259Z","bundle_sha256":"7b62370ca68d7e192cb8cd12f7cd1962d0fc862ae7718b88c830a752de60543f"}}