{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JVQ7TPBXKCSZP7YX5EHDA422GL","short_pith_number":"pith:JVQ7TPBX","schema_version":"1.0","canonical_sha256":"4d61f9bc3750a597ff17e90e30735a32ed0205150b029a7b9110f7652d37dc2f","source":{"kind":"arxiv","id":"1307.2009","version":2},"attestation_state":"computed","paper":{"title":"Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"D. Russell Luke, Patrick Neumann, Robert Hesse","submitted_at":"2013-07-08T09:58:18Z","abstract_excerpt":"The problem of finding a vector with the fewest nonzero elements that satisfies an underdetermined system of linear equations is an NP-complete problem that is typically solved numerically via convex heuristics or nicely-behaved nonconvex relaxations. In this work we consider elementary methods based on projections for solving a sparse feasibility problem without employing convex heuristics. In a recent paper Bauschke, Luke, Phan and Wang (2014) showed that, locally, the fundamental method of alternating projections must converge linearly to a solution to the sparse feasibility problem with an"},"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":"1307.2009","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-08T09:58:18Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"4aadc8a1a4626056f6b22d61f6fcab187329c836a4325eace023ee628a5621f2","abstract_canon_sha256":"79d9d2a1b593e78c9fd47a6bbc39558dc0cdfd3482845ca86a516adb71f84f7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:25.523348Z","signature_b64":"+MK5hNMFGH/iYS4RAe4MlnGnWlY/Z/rXaimkETKvmvZdN/30IyoWPC4gKBP2C4w7iORC8NerOGscbDEGXgh9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d61f9bc3750a597ff17e90e30735a32ed0205150b029a7b9110f7652d37dc2f","last_reissued_at":"2026-05-18T00:24:25.522922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:25.522922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"D. Russell Luke, Patrick Neumann, Robert Hesse","submitted_at":"2013-07-08T09:58:18Z","abstract_excerpt":"The problem of finding a vector with the fewest nonzero elements that satisfies an underdetermined system of linear equations is an NP-complete problem that is typically solved numerically via convex heuristics or nicely-behaved nonconvex relaxations. In this work we consider elementary methods based on projections for solving a sparse feasibility problem without employing convex heuristics. In a recent paper Bauschke, Luke, Phan and Wang (2014) showed that, locally, the fundamental method of alternating projections must converge linearly to a solution to the sparse feasibility problem with an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2009","kind":"arxiv","version":2},"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":"1307.2009","created_at":"2026-05-18T00:24:25.522982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2009v2","created_at":"2026-05-18T00:24:25.522982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2009","created_at":"2026-05-18T00:24:25.522982+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVQ7TPBXKCSZ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVQ7TPBXKCSZP7YX","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVQ7TPBX","created_at":"2026-05-18T12:27:49.015174+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/JVQ7TPBXKCSZP7YX5EHDA422GL","json":"https://pith.science/pith/JVQ7TPBXKCSZP7YX5EHDA422GL.json","graph_json":"https://pith.science/api/pith-number/JVQ7TPBXKCSZP7YX5EHDA422GL/graph.json","events_json":"https://pith.science/api/pith-number/JVQ7TPBXKCSZP7YX5EHDA422GL/events.json","paper":"https://pith.science/paper/JVQ7TPBX"},"agent_actions":{"view_html":"https://pith.science/pith/JVQ7TPBXKCSZP7YX5EHDA422GL","download_json":"https://pith.science/pith/JVQ7TPBXKCSZP7YX5EHDA422GL.json","view_paper":"https://pith.science/paper/JVQ7TPBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2009&json=true","fetch_graph":"https://pith.science/api/pith-number/JVQ7TPBXKCSZP7YX5EHDA422GL/graph.json","fetch_events":"https://pith.science/api/pith-number/JVQ7TPBXKCSZP7YX5EHDA422GL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVQ7TPBXKCSZP7YX5EHDA422GL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVQ7TPBXKCSZP7YX5EHDA422GL/action/storage_attestation","attest_author":"https://pith.science/pith/JVQ7TPBXKCSZP7YX5EHDA422GL/action/author_attestation","sign_citation":"https://pith.science/pith/JVQ7TPBXKCSZP7YX5EHDA422GL/action/citation_signature","submit_replication":"https://pith.science/pith/JVQ7TPBXKCSZP7YX5EHDA422GL/action/replication_record"}},"created_at":"2026-05-18T00:24:25.522982+00:00","updated_at":"2026-05-18T00:24:25.522982+00:00"}