{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JVQ7TPBXKCSZP7YX5EHDA422GL","short_pith_number":"pith:JVQ7TPBX","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"},"canonical_sha256":"4d61f9bc3750a597ff17e90e30735a32ed0205150b029a7b9110f7652d37dc2f","source":{"kind":"arxiv","id":"1307.2009","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2009","created_at":"2026-05-18T00:24:25Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2009v2","created_at":"2026-05-18T00:24:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2009","created_at":"2026-05-18T00:24:25Z"},{"alias_kind":"pith_short_12","alias_value":"JVQ7TPBXKCSZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JVQ7TPBXKCSZP7YX","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JVQ7TPBX","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JVQ7TPBXKCSZP7YX5EHDA422GL","target":"record","payload":{"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"},"canonical_sha256":"4d61f9bc3750a597ff17e90e30735a32ed0205150b029a7b9110f7652d37dc2f","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"},"source_kind":"arxiv","source_id":"1307.2009","source_version":2,"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:24:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gLb+c7zWWo8d8eXEM6wMFvJsWIy18o8AkDE+4gvc2wgXOXY0QSkut3vfw172LbwIAejMGuSsxhZFsZewWLmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:52:48.257527Z"},"content_sha256":"f659843246208bbddd9cff42ecb99b3d6bdcc3985c4725a241cc3ac441efb521","schema_version":"1.0","event_id":"sha256:f659843246208bbddd9cff42ecb99b3d6bdcc3985c4725a241cc3ac441efb521"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JVQ7TPBXKCSZP7YX5EHDA422GL","target":"graph","payload":{"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"},"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:24:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"htyByL7B11/lUvAT6iXBXrtckdsSp+YWcobQ1+mL3sGXKXvyq+LzOLBmAzLFS3qAjRydfj+aZD2BUvsy1BnoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:52:48.258016Z"},"content_sha256":"8e73c8fb7126444369fc7ba72256bb8b2ffaf37691fd2bf2a2533e00256260f8","schema_version":"1.0","event_id":"sha256:8e73c8fb7126444369fc7ba72256bb8b2ffaf37691fd2bf2a2533e00256260f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JVQ7TPBXKCSZP7YX5EHDA422GL/bundle.json","state_url":"https://pith.science/pith/JVQ7TPBXKCSZP7YX5EHDA422GL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JVQ7TPBXKCSZP7YX5EHDA422GL/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-27T13:52:48Z","links":{"resolver":"https://pith.science/pith/JVQ7TPBXKCSZP7YX5EHDA422GL","bundle":"https://pith.science/pith/JVQ7TPBXKCSZP7YX5EHDA422GL/bundle.json","state":"https://pith.science/pith/JVQ7TPBXKCSZP7YX5EHDA422GL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JVQ7TPBXKCSZP7YX5EHDA422GL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JVQ7TPBXKCSZP7YX5EHDA422GL","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":"79d9d2a1b593e78c9fd47a6bbc39558dc0cdfd3482845ca86a516adb71f84f7d","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-08T09:58:18Z","title_canon_sha256":"4aadc8a1a4626056f6b22d61f6fcab187329c836a4325eace023ee628a5621f2"},"schema_version":"1.0","source":{"id":"1307.2009","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2009","created_at":"2026-05-18T00:24:25Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2009v2","created_at":"2026-05-18T00:24:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2009","created_at":"2026-05-18T00:24:25Z"},{"alias_kind":"pith_short_12","alias_value":"JVQ7TPBXKCSZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JVQ7TPBXKCSZP7YX","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JVQ7TPBX","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:8e73c8fb7126444369fc7ba72256bb8b2ffaf37691fd2bf2a2533e00256260f8","target":"graph","created_at":"2026-05-18T00:24:25Z","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":"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","authors_text":"D. Russell Luke, Patrick Neumann, Robert Hesse","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-08T09:58:18Z","title":"Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2009","kind":"arxiv","version":2},"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:f659843246208bbddd9cff42ecb99b3d6bdcc3985c4725a241cc3ac441efb521","target":"record","created_at":"2026-05-18T00:24:25Z","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":"79d9d2a1b593e78c9fd47a6bbc39558dc0cdfd3482845ca86a516adb71f84f7d","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-08T09:58:18Z","title_canon_sha256":"4aadc8a1a4626056f6b22d61f6fcab187329c836a4325eace023ee628a5621f2"},"schema_version":"1.0","source":{"id":"1307.2009","kind":"arxiv","version":2}},"canonical_sha256":"4d61f9bc3750a597ff17e90e30735a32ed0205150b029a7b9110f7652d37dc2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d61f9bc3750a597ff17e90e30735a32ed0205150b029a7b9110f7652d37dc2f","first_computed_at":"2026-05-18T00:24:25.522922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:25.522922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+MK5hNMFGH/iYS4RAe4MlnGnWlY/Z/rXaimkETKvmvZdN/30IyoWPC4gKBP2C4w7iORC8NerOGscbDEGXgh9Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:25.523348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2009","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f659843246208bbddd9cff42ecb99b3d6bdcc3985c4725a241cc3ac441efb521","sha256:8e73c8fb7126444369fc7ba72256bb8b2ffaf37691fd2bf2a2533e00256260f8"],"state_sha256":"e69db77fe2f980593d39a5b68bc00aed5f8359b82625d8c8a71999cf5b902af0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AnsYmBq7lgDjho056kbHfER2zbcaaxTi5qfyEu0OFTQvBD8Yiq0i95jUO1Wkoo85V3tk3EMuu8V0nMbZGAefCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:52:48.261785Z","bundle_sha256":"f40119b260c4997264b5db531c3324c8a1d2ed326f5de6b667363e98d96b2ed8"}}