{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MA3CPDHD5IKHWG3OVWF3CZUVSC","short_pith_number":"pith:MA3CPDHD","schema_version":"1.0","canonical_sha256":"6036278ce3ea147b1b6ead8bb16695909ef243e33a4f78acfd1f260a9fdd8e84","source":{"kind":"arxiv","id":"1312.4426","version":1},"attestation_state":"computed","paper":{"title":"Optimization for Compressed Sensing: the Simplex Method and Kronecker Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Han Liu, Kevin Lin, Lie Wang, Robert Vanderbei","submitted_at":"2013-12-16T16:51:51Z","abstract_excerpt":"In this paper we present two new approaches to efficiently solve large-scale compressed sensing problems. These two ideas are independent of each other and can therefore be used either separately or together. We consider all possibilities.\n  For the first approach, we note that the zero vector can be taken as the initial basic (infeasible) solution for the linear programming problem and therefore, if the true signal is very sparse, some variants of the simplex method can be expected to take only a small number of pivots to arrive at a solution. We implemented one such variant and demonstrate a"},"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":"1312.4426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-16T16:51:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9c5e0f77296ab2d9c9a9b1a3d13b0b7d52e6327c287b65714ad9102f3854398f","abstract_canon_sha256":"01e5f04e3196ff54805968fc8f5e099ee90a69c7cd55d98011c61077fede710d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:34.428264Z","signature_b64":"mKoVFhxmtq57rw4cprg0aW7TULS/+xOjAhvr3HDbteaHrdQhcYUVobqDYyRqh2wvX5AZq32zXs66CwV3Ux+CAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6036278ce3ea147b1b6ead8bb16695909ef243e33a4f78acfd1f260a9fdd8e84","last_reissued_at":"2026-05-18T03:04:34.425759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:34.425759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization for Compressed Sensing: the Simplex Method and Kronecker Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Han Liu, Kevin Lin, Lie Wang, Robert Vanderbei","submitted_at":"2013-12-16T16:51:51Z","abstract_excerpt":"In this paper we present two new approaches to efficiently solve large-scale compressed sensing problems. These two ideas are independent of each other and can therefore be used either separately or together. We consider all possibilities.\n  For the first approach, we note that the zero vector can be taken as the initial basic (infeasible) solution for the linear programming problem and therefore, if the true signal is very sparse, some variants of the simplex method can be expected to take only a small number of pivots to arrive at a solution. We implemented one such variant and demonstrate a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4426","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.4426","created_at":"2026-05-18T03:04:34.427359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4426v1","created_at":"2026-05-18T03:04:34.427359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4426","created_at":"2026-05-18T03:04:34.427359+00:00"},{"alias_kind":"pith_short_12","alias_value":"MA3CPDHD5IKH","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"MA3CPDHD5IKHWG3O","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"MA3CPDHD","created_at":"2026-05-18T12:27:51.066281+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/MA3CPDHD5IKHWG3OVWF3CZUVSC","json":"https://pith.science/pith/MA3CPDHD5IKHWG3OVWF3CZUVSC.json","graph_json":"https://pith.science/api/pith-number/MA3CPDHD5IKHWG3OVWF3CZUVSC/graph.json","events_json":"https://pith.science/api/pith-number/MA3CPDHD5IKHWG3OVWF3CZUVSC/events.json","paper":"https://pith.science/paper/MA3CPDHD"},"agent_actions":{"view_html":"https://pith.science/pith/MA3CPDHD5IKHWG3OVWF3CZUVSC","download_json":"https://pith.science/pith/MA3CPDHD5IKHWG3OVWF3CZUVSC.json","view_paper":"https://pith.science/paper/MA3CPDHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4426&json=true","fetch_graph":"https://pith.science/api/pith-number/MA3CPDHD5IKHWG3OVWF3CZUVSC/graph.json","fetch_events":"https://pith.science/api/pith-number/MA3CPDHD5IKHWG3OVWF3CZUVSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MA3CPDHD5IKHWG3OVWF3CZUVSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MA3CPDHD5IKHWG3OVWF3CZUVSC/action/storage_attestation","attest_author":"https://pith.science/pith/MA3CPDHD5IKHWG3OVWF3CZUVSC/action/author_attestation","sign_citation":"https://pith.science/pith/MA3CPDHD5IKHWG3OVWF3CZUVSC/action/citation_signature","submit_replication":"https://pith.science/pith/MA3CPDHD5IKHWG3OVWF3CZUVSC/action/replication_record"}},"created_at":"2026-05-18T03:04:34.427359+00:00","updated_at":"2026-05-18T03:04:34.427359+00:00"}