{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E3BZPSCXAW3MLQGZLL4INSZCXN","short_pith_number":"pith:E3BZPSCX","schema_version":"1.0","canonical_sha256":"26c397c85705b6c5c0d95af886cb22bb4f26675d9ebdbbcec0a5c337c035292f","source":{"kind":"arxiv","id":"1609.09530","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.09530","created_at":"2026-05-18T00:44:19.744773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.09530v4","created_at":"2026-05-18T00:44:19.744773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09530","created_at":"2026-05-18T00:44:19.744773+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3BZPSCXAW3M","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3BZPSCXAW3MLQGZ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3BZPSCX","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E3BZPSCXAW3MLQGZLL4INSZCXN","json":"https://pith.science/pith/E3BZPSCXAW3MLQGZLL4INSZCXN.json","graph_json":"https://pith.science/api/pith-number/E3BZPSCXAW3MLQGZLL4INSZCXN/graph.json","events_json":"https://pith.science/api/pith-number/E3BZPSCXAW3MLQGZLL4INSZCXN/events.json","paper":"https://pith.science/paper/E3BZPSCX"},"agent_actions":{"view_html":"https://pith.science/pith/E3BZPSCXAW3MLQGZLL4INSZCXN","download_json":"https://pith.science/pith/E3BZPSCXAW3MLQGZLL4INSZCXN.json","view_paper":"https://pith.science/paper/E3BZPSCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.09530&json=true","fetch_graph":"https://pith.science/api/pith-number/E3BZPSCXAW3MLQGZLL4INSZCXN/graph.json","fetch_events":"https://pith.science/api/pith-number/E3BZPSCXAW3MLQGZLL4INSZCXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3BZPSCXAW3MLQGZLL4INSZCXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3BZPSCXAW3MLQGZLL4INSZCXN/action/storage_attestation","attest_author":"https://pith.science/pith/E3BZPSCXAW3MLQGZLL4INSZCXN/action/author_attestation","sign_citation":"https://pith.science/pith/E3BZPSCXAW3MLQGZLL4INSZCXN/action/citation_signature","submit_replication":"https://pith.science/pith/E3BZPSCXAW3MLQGZLL4INSZCXN/action/replication_record"}},"created_at":"2026-05-18T00:44:19.744773+00:00","updated_at":"2026-05-18T00:44:19.744773+00:00"}