{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZN2EGA3G6WVGOAI3GFAFAGHCOV","short_pith_number":"pith:ZN2EGA3G","canonical_record":{"source":{"id":"1206.1402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-06-07T05:14:22Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"84bb185b14b2167769cb0fe8c91ab85a5871555f0dedcbf6e0a1793982b72c36","abstract_canon_sha256":"a78ebb0b8c092e7d79ef328d2bab87936e3eb292f81cecd7cd4cecef09d4b77a"},"schema_version":"1.0"},"canonical_sha256":"cb74430366f5aa67011b31405018e275462b46c9cabcf3dbe9f0ce24eff4a8c9","source":{"kind":"arxiv","id":"1206.1402","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1402","created_at":"2026-05-18T03:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1402v1","created_at":"2026-05-18T03:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1402","created_at":"2026-05-18T03:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZN2EGA3G6WVG","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZN2EGA3G6WVGOAI3","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZN2EGA3G","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZN2EGA3G6WVGOAI3GFAFAGHCOV","target":"record","payload":{"canonical_record":{"source":{"id":"1206.1402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-06-07T05:14:22Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"84bb185b14b2167769cb0fe8c91ab85a5871555f0dedcbf6e0a1793982b72c36","abstract_canon_sha256":"a78ebb0b8c092e7d79ef328d2bab87936e3eb292f81cecd7cd4cecef09d4b77a"},"schema_version":"1.0"},"canonical_sha256":"cb74430366f5aa67011b31405018e275462b46c9cabcf3dbe9f0ce24eff4a8c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:05.215828Z","signature_b64":"5G2DCxHbLJ3fjYE3nWfFS7+7mFWopIDtXZPTYOSY3HCVaerdSr1aLWlH8EWA2aRVp+3xFg3GiEmy/HLDYMCFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb74430366f5aa67011b31405018e275462b46c9cabcf3dbe9f0ce24eff4a8c9","last_reissued_at":"2026-05-18T03:54:05.215184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:05.215184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.1402","source_version":1,"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-18T03:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNoQKn0aNqsifDx7Cm1LUVGFvvvAPLlWVtigt0UfDBwZJKVGUtMhR0PwvhbKeM5hlog8AmRJWHKFeXmJcLCaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:17:40.760340Z"},"content_sha256":"608728b9cc1b5d5b87b23111df0c668b8f4b92326958151977e67266632b7e2e","schema_version":"1.0","event_id":"sha256:608728b9cc1b5d5b87b23111df0c668b8f4b92326958151977e67266632b7e2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZN2EGA3G6WVGOAI3GFAFAGHCOV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Greedy Algorithm for Multiple Sparse Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ali Jalali, Sujay Sanghavi","submitted_at":"2012-06-07T05:14:22Z","abstract_excerpt":"This paper proposes a new algorithm for multiple sparse regression in high dimensions, where the task is to estimate the support and values of several (typically related) sparse vectors from a few noisy linear measurements. Our algorithm is a \"forward-backward\" greedy procedure that -- uniquely -- operates on two distinct classes of objects. In particular, we organize our target sparse vectors as a matrix; our algorithm involves iterative addition and removal of both (a) individual elements, and (b) entire rows (corresponding to shared features), of the matrix.\n  Analytically, we establish tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1402","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"},"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-18T03:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ZnAb72dG1frncDe3emp/9KS5RJlGEDga7qYKBqXUmfe59FsaiMZXd8SkHC1ZVhbfTZrQgJdI9ffG1fwWPAJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:17:40.760733Z"},"content_sha256":"21dfb6c63e8ae4469ae89d84478d7ffcad5f2fd837d108965bd0657d0298759a","schema_version":"1.0","event_id":"sha256:21dfb6c63e8ae4469ae89d84478d7ffcad5f2fd837d108965bd0657d0298759a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZN2EGA3G6WVGOAI3GFAFAGHCOV/bundle.json","state_url":"https://pith.science/pith/ZN2EGA3G6WVGOAI3GFAFAGHCOV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZN2EGA3G6WVGOAI3GFAFAGHCOV/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-26T23:17:40Z","links":{"resolver":"https://pith.science/pith/ZN2EGA3G6WVGOAI3GFAFAGHCOV","bundle":"https://pith.science/pith/ZN2EGA3G6WVGOAI3GFAFAGHCOV/bundle.json","state":"https://pith.science/pith/ZN2EGA3G6WVGOAI3GFAFAGHCOV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZN2EGA3G6WVGOAI3GFAFAGHCOV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZN2EGA3G6WVGOAI3GFAFAGHCOV","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":"a78ebb0b8c092e7d79ef328d2bab87936e3eb292f81cecd7cd4cecef09d4b77a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-06-07T05:14:22Z","title_canon_sha256":"84bb185b14b2167769cb0fe8c91ab85a5871555f0dedcbf6e0a1793982b72c36"},"schema_version":"1.0","source":{"id":"1206.1402","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1402","created_at":"2026-05-18T03:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1402v1","created_at":"2026-05-18T03:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1402","created_at":"2026-05-18T03:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZN2EGA3G6WVG","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZN2EGA3G6WVGOAI3","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZN2EGA3G","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:21dfb6c63e8ae4469ae89d84478d7ffcad5f2fd837d108965bd0657d0298759a","target":"graph","created_at":"2026-05-18T03:54:05Z","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 proposes a new algorithm for multiple sparse regression in high dimensions, where the task is to estimate the support and values of several (typically related) sparse vectors from a few noisy linear measurements. Our algorithm is a \"forward-backward\" greedy procedure that -- uniquely -- operates on two distinct classes of objects. In particular, we organize our target sparse vectors as a matrix; our algorithm involves iterative addition and removal of both (a) individual elements, and (b) entire rows (corresponding to shared features), of the matrix.\n  Analytically, we establish tha","authors_text":"Ali Jalali, Sujay Sanghavi","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-06-07T05:14:22Z","title":"A New Greedy Algorithm for Multiple Sparse Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1402","kind":"arxiv","version":1},"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:608728b9cc1b5d5b87b23111df0c668b8f4b92326958151977e67266632b7e2e","target":"record","created_at":"2026-05-18T03:54:05Z","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":"a78ebb0b8c092e7d79ef328d2bab87936e3eb292f81cecd7cd4cecef09d4b77a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-06-07T05:14:22Z","title_canon_sha256":"84bb185b14b2167769cb0fe8c91ab85a5871555f0dedcbf6e0a1793982b72c36"},"schema_version":"1.0","source":{"id":"1206.1402","kind":"arxiv","version":1}},"canonical_sha256":"cb74430366f5aa67011b31405018e275462b46c9cabcf3dbe9f0ce24eff4a8c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb74430366f5aa67011b31405018e275462b46c9cabcf3dbe9f0ce24eff4a8c9","first_computed_at":"2026-05-18T03:54:05.215184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:05.215184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5G2DCxHbLJ3fjYE3nWfFS7+7mFWopIDtXZPTYOSY3HCVaerdSr1aLWlH8EWA2aRVp+3xFg3GiEmy/HLDYMCFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:05.215828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.1402","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:608728b9cc1b5d5b87b23111df0c668b8f4b92326958151977e67266632b7e2e","sha256:21dfb6c63e8ae4469ae89d84478d7ffcad5f2fd837d108965bd0657d0298759a"],"state_sha256":"8ca41fb2e0ecac77d365660153a70b7ff70b94b3376755c4c2ebb7df6b20948f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KkhYxyIYTVtgAiZfSF3H3yK4Dz0DNKADCqMtsyOyY99hIE8tR/ANe0PKqigcM4GjoFp7IklkalnXhbquj18RAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:17:40.764031Z","bundle_sha256":"86785aa9f22803791f6ab64e790893795bea2f65380d94c35c0d66159ecb2e27"}}