{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4UGZMIWXKFJRVFHSJLAVI67YIA","short_pith_number":"pith:4UGZMIWX","canonical_record":{"source":{"id":"1704.05397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-18T15:39:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2fb95439d1c169b81498045153646b882ec954502f7df8e12ab639223d320a00","abstract_canon_sha256":"1c94a67885f54a1dd7f4e4500e1b3d026aa4a9245979d5e8e135292184f5a822"},"schema_version":"1.0"},"canonical_sha256":"e50d9622d751531a94f24ac1547bf84022a0cb5faebb23b2c618e29330c174c9","source":{"kind":"arxiv","id":"1704.05397","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05397","created_at":"2026-05-18T00:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05397v1","created_at":"2026-05-18T00:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05397","created_at":"2026-05-18T00:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"4UGZMIWXKFJR","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4UGZMIWXKFJRVFHS","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4UGZMIWX","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4UGZMIWXKFJRVFHSJLAVI67YIA","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-18T15:39:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2fb95439d1c169b81498045153646b882ec954502f7df8e12ab639223d320a00","abstract_canon_sha256":"1c94a67885f54a1dd7f4e4500e1b3d026aa4a9245979d5e8e135292184f5a822"},"schema_version":"1.0"},"canonical_sha256":"e50d9622d751531a94f24ac1547bf84022a0cb5faebb23b2c618e29330c174c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:09.303369Z","signature_b64":"ykG4OjA63aevzH6rsdKRe7g78+7sc7hz3w+FUPOiT+yXXHG+BIonQdBfRnX4oAjVvvh79a2/wd2Tv8704swfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e50d9622d751531a94f24ac1547bf84022a0cb5faebb23b2c618e29330c174c9","last_reissued_at":"2026-05-18T00:46:09.302948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:09.302948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05397","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-18T00:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GWSrL8mCFiMPO3b8Rk5WS1oexMsd9mnQcjh6meyi9SAQ4+3HrEa7Qh+/ycNvt1I1P/Xv8nOI+N11LiINuUYkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:38:46.954827Z"},"content_sha256":"a019df9bf86b04f1fc367d516cbbaa0fe3421308cb1cd288830b249262606642","schema_version":"1.0","event_id":"sha256:a019df9bf86b04f1fc367d516cbbaa0fe3421308cb1cd288830b249262606642"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4UGZMIWXKFJRVFHSJLAVI67YIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to exploit prior information in low-complexity models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farzan Haddadi, Sajad Daei","submitted_at":"2017-04-18T15:39:35Z","abstract_excerpt":"Compressed Sensing refers to extracting a low-dimensional structured signal of interest from its incomplete random linear observations. A line of recent work has studied that, with the extra prior information about the signal, one can recover the signal with much fewer observations. For this purpose, the general approach is to solve weighted convex function minimization problem. In such settings, the convex function is chosen to promote the low-dimensional structure and the optimal weights are so chosen to reduce the number of measurements required for the optimization problem. In this paper, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05397","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-18T00:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SYOjoZicNE8nBoLd9OOK8DtsLp6jhX4uA1W/4DPv7I1WRhO3bg4nd1J+C/L5Rw+2ZerNZWwwBVNBKPa9x5RpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:38:46.955489Z"},"content_sha256":"58ab2b737a705d0784a996b5343d6475355a21de24a1382f6d84cf02b405b002","schema_version":"1.0","event_id":"sha256:58ab2b737a705d0784a996b5343d6475355a21de24a1382f6d84cf02b405b002"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4UGZMIWXKFJRVFHSJLAVI67YIA/bundle.json","state_url":"https://pith.science/pith/4UGZMIWXKFJRVFHSJLAVI67YIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4UGZMIWXKFJRVFHSJLAVI67YIA/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-27T22:38:46Z","links":{"resolver":"https://pith.science/pith/4UGZMIWXKFJRVFHSJLAVI67YIA","bundle":"https://pith.science/pith/4UGZMIWXKFJRVFHSJLAVI67YIA/bundle.json","state":"https://pith.science/pith/4UGZMIWXKFJRVFHSJLAVI67YIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4UGZMIWXKFJRVFHSJLAVI67YIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4UGZMIWXKFJRVFHSJLAVI67YIA","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":"1c94a67885f54a1dd7f4e4500e1b3d026aa4a9245979d5e8e135292184f5a822","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-18T15:39:35Z","title_canon_sha256":"2fb95439d1c169b81498045153646b882ec954502f7df8e12ab639223d320a00"},"schema_version":"1.0","source":{"id":"1704.05397","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05397","created_at":"2026-05-18T00:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05397v1","created_at":"2026-05-18T00:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05397","created_at":"2026-05-18T00:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"4UGZMIWXKFJR","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4UGZMIWXKFJRVFHS","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4UGZMIWX","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:58ab2b737a705d0784a996b5343d6475355a21de24a1382f6d84cf02b405b002","target":"graph","created_at":"2026-05-18T00:46: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":"Compressed Sensing refers to extracting a low-dimensional structured signal of interest from its incomplete random linear observations. A line of recent work has studied that, with the extra prior information about the signal, one can recover the signal with much fewer observations. For this purpose, the general approach is to solve weighted convex function minimization problem. In such settings, the convex function is chosen to promote the low-dimensional structure and the optimal weights are so chosen to reduce the number of measurements required for the optimization problem. In this paper, ","authors_text":"Farzan Haddadi, Sajad Daei","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-18T15:39:35Z","title":"How to exploit prior information in low-complexity models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05397","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:a019df9bf86b04f1fc367d516cbbaa0fe3421308cb1cd288830b249262606642","target":"record","created_at":"2026-05-18T00:46: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":"1c94a67885f54a1dd7f4e4500e1b3d026aa4a9245979d5e8e135292184f5a822","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-18T15:39:35Z","title_canon_sha256":"2fb95439d1c169b81498045153646b882ec954502f7df8e12ab639223d320a00"},"schema_version":"1.0","source":{"id":"1704.05397","kind":"arxiv","version":1}},"canonical_sha256":"e50d9622d751531a94f24ac1547bf84022a0cb5faebb23b2c618e29330c174c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e50d9622d751531a94f24ac1547bf84022a0cb5faebb23b2c618e29330c174c9","first_computed_at":"2026-05-18T00:46:09.302948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:09.302948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ykG4OjA63aevzH6rsdKRe7g78+7sc7hz3w+FUPOiT+yXXHG+BIonQdBfRnX4oAjVvvh79a2/wd2Tv8704swfBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:09.303369Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05397","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a019df9bf86b04f1fc367d516cbbaa0fe3421308cb1cd288830b249262606642","sha256:58ab2b737a705d0784a996b5343d6475355a21de24a1382f6d84cf02b405b002"],"state_sha256":"cc1123b9d662ba449e5b377f31704c7a300fab1b139792ae9fc3b290861a1ae5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ra8HhSn2eXtGmyLgDbzgSxw3Lt0/lT9Xe4/eWtpE9VKxdd5clt5UtmA/HA1GLdQGM+qfiynCXCl22Skv01R/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:38:46.958883Z","bundle_sha256":"e27728c0bd961bb83f70bb9941a64188318cb6e28731017db95fe4d4a6c46bdd"}}