{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:E3BZPSCXAW3MLQGZLL4INSZCXN","short_pith_number":"pith:E3BZPSCX","canonical_record":{"source":{"id":"1609.09530","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-29T21:06:12Z","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"title_canon_sha256":"91158281e8a87a3e65b84d955558b2ec261663b0c8eed78d34af0de1d6b54aad","abstract_canon_sha256":"c332e8c9b6cd91cd3f48f271844f5e7c5a411543d7735a82eea510b25052dc66"},"schema_version":"1.0"},"canonical_sha256":"26c397c85705b6c5c0d95af886cb22bb4f26675d9ebdbbcec0a5c337c035292f","source":{"kind":"arxiv","id":"1609.09530","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09530","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09530v4","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09530","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"E3BZPSCXAW3M","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3BZPSCXAW3MLQGZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3BZPSCX","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:E3BZPSCXAW3MLQGZLL4INSZCXN","target":"record","payload":{"canonical_record":{"source":{"id":"1609.09530","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-29T21:06:12Z","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"title_canon_sha256":"91158281e8a87a3e65b84d955558b2ec261663b0c8eed78d34af0de1d6b54aad","abstract_canon_sha256":"c332e8c9b6cd91cd3f48f271844f5e7c5a411543d7735a82eea510b25052dc66"},"schema_version":"1.0"},"canonical_sha256":"26c397c85705b6c5c0d95af886cb22bb4f26675d9ebdbbcec0a5c337c035292f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:19.745340Z","signature_b64":"8+3kP8aY/lh985bRktHvA1yVvRjSZpE7E3frrWMuXA5IjTloorhCBEaABnmPxXIaNsByXByeg3RnQT83qxDTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26c397c85705b6c5c0d95af886cb22bb4f26675d9ebdbbcec0a5c337c035292f","last_reissued_at":"2026-05-18T00:44:19.744683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:19.744683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.09530","source_version":4,"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:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zoPW3/mm3ASmWfrkPJdGU0g9HPEZSWHULN/cbB2vgY10dpHSfrkf4w6HmHLegfOY4V1MkuRW49PLghitz6GjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:36:52.251467Z"},"content_sha256":"bd22c2ab456584a2894c180958f50a2717f94746b574da5b8e16100b6a8f7993","schema_version":"1.0","event_id":"sha256:bd22c2ab456584a2894c180958f50a2717f94746b574da5b8e16100b6a8f7993"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:E3BZPSCXAW3MLQGZLL4INSZCXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast L1-L2 minimization via a proximal operator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NA"],"primary_cat":"math.OC","authors_text":"Ming Yan, Yifei Lou","submitted_at":"2016-09-29T21:06:12Z","abstract_excerpt":"This paper aims to develop new and fast algorithms for recovering a sparse vector from a small number of measurements, which is a fundamental problem in the field of compressive sensing (CS). Currently, CS favors incoherent systems, in which any two measurements are as little correlated as possible. In reality, however, many problems are coherent, and conventional methods such as $L_1$ minimization do not work well. Recently, the difference of the $L_1$ and $L_2$ norms, denoted as $L_1$-$L_2$, is shown to have superior performance over the classic $L_1$ method, but it is computationally expens"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09530","kind":"arxiv","version":4},"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:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rm5f5Wlm1198+91Hbc/U+MyEvtwec1bpnyYlE2SgYWkSVQDEZI78owTnWSfwroqCt2dCORH5eMK2PvtcBxweBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:36:52.252176Z"},"content_sha256":"09a47c45d0896efe1661c4c870968327d164d8088a820b48adce3ca3dcaab7d4","schema_version":"1.0","event_id":"sha256:09a47c45d0896efe1661c4c870968327d164d8088a820b48adce3ca3dcaab7d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3BZPSCXAW3MLQGZLL4INSZCXN/bundle.json","state_url":"https://pith.science/pith/E3BZPSCXAW3MLQGZLL4INSZCXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3BZPSCXAW3MLQGZLL4INSZCXN/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-26T01:36:52Z","links":{"resolver":"https://pith.science/pith/E3BZPSCXAW3MLQGZLL4INSZCXN","bundle":"https://pith.science/pith/E3BZPSCXAW3MLQGZLL4INSZCXN/bundle.json","state":"https://pith.science/pith/E3BZPSCXAW3MLQGZLL4INSZCXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3BZPSCXAW3MLQGZLL4INSZCXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:E3BZPSCXAW3MLQGZLL4INSZCXN","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":"c332e8c9b6cd91cd3f48f271844f5e7c5a411543d7735a82eea510b25052dc66","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-29T21:06:12Z","title_canon_sha256":"91158281e8a87a3e65b84d955558b2ec261663b0c8eed78d34af0de1d6b54aad"},"schema_version":"1.0","source":{"id":"1609.09530","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09530","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09530v4","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09530","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"E3BZPSCXAW3M","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3BZPSCXAW3MLQGZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3BZPSCX","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:09a47c45d0896efe1661c4c870968327d164d8088a820b48adce3ca3dcaab7d4","target":"graph","created_at":"2026-05-18T00:44:19Z","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":"This paper aims to develop new and fast algorithms for recovering a sparse vector from a small number of measurements, which is a fundamental problem in the field of compressive sensing (CS). Currently, CS favors incoherent systems, in which any two measurements are as little correlated as possible. In reality, however, many problems are coherent, and conventional methods such as $L_1$ minimization do not work well. Recently, the difference of the $L_1$ and $L_2$ norms, denoted as $L_1$-$L_2$, is shown to have superior performance over the classic $L_1$ method, but it is computationally expens","authors_text":"Ming Yan, Yifei Lou","cross_cats":["cs.IT","math.IT","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-29T21:06:12Z","title":"Fast L1-L2 minimization via a proximal operator"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09530","kind":"arxiv","version":4},"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:bd22c2ab456584a2894c180958f50a2717f94746b574da5b8e16100b6a8f7993","target":"record","created_at":"2026-05-18T00:44:19Z","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":"c332e8c9b6cd91cd3f48f271844f5e7c5a411543d7735a82eea510b25052dc66","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-29T21:06:12Z","title_canon_sha256":"91158281e8a87a3e65b84d955558b2ec261663b0c8eed78d34af0de1d6b54aad"},"schema_version":"1.0","source":{"id":"1609.09530","kind":"arxiv","version":4}},"canonical_sha256":"26c397c85705b6c5c0d95af886cb22bb4f26675d9ebdbbcec0a5c337c035292f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26c397c85705b6c5c0d95af886cb22bb4f26675d9ebdbbcec0a5c337c035292f","first_computed_at":"2026-05-18T00:44:19.744683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:19.744683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8+3kP8aY/lh985bRktHvA1yVvRjSZpE7E3frrWMuXA5IjTloorhCBEaABnmPxXIaNsByXByeg3RnQT83qxDTDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:19.745340Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09530","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd22c2ab456584a2894c180958f50a2717f94746b574da5b8e16100b6a8f7993","sha256:09a47c45d0896efe1661c4c870968327d164d8088a820b48adce3ca3dcaab7d4"],"state_sha256":"c0e666a60bccb1fb41924fca966aa81d0c73aee66d5b1c68d00d37bf3b4eeb5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CsahPvKbIUpiT6/iJegXVGe0WGbyeGA65drk6dCKCqvT+9IXQwA6L/0/fpTAjPGc5piJ1wB3FK1rz89LpPosDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:36:52.256074Z","bundle_sha256":"7458dd3dfd4cf8caf47af929527234a9d6e191bf647a0092cace6e1ceca8fdf9"}}