{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Y2PLIBJE2WEJGNF4TLMDFOWI2V","short_pith_number":"pith:Y2PLIBJE","canonical_record":{"source":{"id":"1109.0730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-09-04T17:03:00Z","cross_cats_sorted":[],"title_canon_sha256":"17633d4a52870773b2347523755043b3dc3a91b2701864fd3868cb04d5ff013a","abstract_canon_sha256":"11dc7d71c818b624b439b36745f8abbbaf293a19fe4e72fd62b7b4041336d069"},"schema_version":"1.0"},"canonical_sha256":"c69eb40524d5889334bc9ad832bac8d550fa30bae5289c4e789037ca418edbfc","source":{"kind":"arxiv","id":"1109.0730","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0730","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0730v1","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0730","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"Y2PLIBJE2WEJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y2PLIBJE2WEJGNF4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y2PLIBJE","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Y2PLIBJE2WEJGNF4TLMDFOWI2V","target":"record","payload":{"canonical_record":{"source":{"id":"1109.0730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-09-04T17:03:00Z","cross_cats_sorted":[],"title_canon_sha256":"17633d4a52870773b2347523755043b3dc3a91b2701864fd3868cb04d5ff013a","abstract_canon_sha256":"11dc7d71c818b624b439b36745f8abbbaf293a19fe4e72fd62b7b4041336d069"},"schema_version":"1.0"},"canonical_sha256":"c69eb40524d5889334bc9ad832bac8d550fa30bae5289c4e789037ca418edbfc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:06.895865Z","signature_b64":"nnm77HaIbjFicKUD78WVUi8tFNCCjreLzf5Szy3zjHlTnPM29Ze4dNnWR1SY8DSPVBPQ3Qv8LoI2vcjjNNC5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c69eb40524d5889334bc9ad832bac8d550fa30bae5289c4e789037ca418edbfc","last_reissued_at":"2026-05-18T04:14:06.895331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:06.895331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.0730","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-18T04:14:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QkmvLjb1bxbUGyM9qJffMx+xPWqhhgelrsgqU7k4pFOp6OhdPJoDOjE5lNZxipblv50FPjaDrrvEFEnArk3BCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:41:58.828368Z"},"content_sha256":"5c37f5ff2d81a9d78163f74491e991bbea3b11604a429ac3cbc8cb41fef2b4e4","schema_version":"1.0","event_id":"sha256:5c37f5ff2d81a9d78163f74491e991bbea3b11604a429ac3cbc8cb41fef2b4e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Y2PLIBJE2WEJGNF4TLMDFOWI2V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variable Selection in High Dimensions with Random Designs and Orthogonal Matching Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Antony Joseph","submitted_at":"2011-09-04T17:03:00Z","abstract_excerpt":"The performance of Orthogonal Matching Pursuit (OMP) for variable selection is analyzed for random designs. When contrasted with the deterministic case, since the performance is here measured after averaging over the distribution of the design matrix, one can have far less stringent sparsity constraints on the coefficient vector. We demonstrate that for exact sparse vectors, the performance of the OMP is similar to known results on the Lasso algorithm [\\textit{IEEE Trans. Inform. Theory} \\textbf{55} (2009) 2183--2202]. Moreover, variable selection under a more relaxed sparsity assumption on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0730","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-18T04:14:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fWryLgHGa4gk+Dy6QdxKT3VghcG6Kn9j1PudTvDq5NCYnC8iXPS3HnrUdfNmi8kdnYq7fplR0LkOFKfBwZXeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:41:58.829028Z"},"content_sha256":"0e5b73dda988cdd85061e425eadbd26d181784c4b54e01b1fdc3038dbeaded81","schema_version":"1.0","event_id":"sha256:0e5b73dda988cdd85061e425eadbd26d181784c4b54e01b1fdc3038dbeaded81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2PLIBJE2WEJGNF4TLMDFOWI2V/bundle.json","state_url":"https://pith.science/pith/Y2PLIBJE2WEJGNF4TLMDFOWI2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2PLIBJE2WEJGNF4TLMDFOWI2V/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-27T12:41:58Z","links":{"resolver":"https://pith.science/pith/Y2PLIBJE2WEJGNF4TLMDFOWI2V","bundle":"https://pith.science/pith/Y2PLIBJE2WEJGNF4TLMDFOWI2V/bundle.json","state":"https://pith.science/pith/Y2PLIBJE2WEJGNF4TLMDFOWI2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2PLIBJE2WEJGNF4TLMDFOWI2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Y2PLIBJE2WEJGNF4TLMDFOWI2V","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":"11dc7d71c818b624b439b36745f8abbbaf293a19fe4e72fd62b7b4041336d069","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-09-04T17:03:00Z","title_canon_sha256":"17633d4a52870773b2347523755043b3dc3a91b2701864fd3868cb04d5ff013a"},"schema_version":"1.0","source":{"id":"1109.0730","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0730","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0730v1","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0730","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"Y2PLIBJE2WEJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y2PLIBJE2WEJGNF4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y2PLIBJE","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:0e5b73dda988cdd85061e425eadbd26d181784c4b54e01b1fdc3038dbeaded81","target":"graph","created_at":"2026-05-18T04:14:06Z","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 performance of Orthogonal Matching Pursuit (OMP) for variable selection is analyzed for random designs. When contrasted with the deterministic case, since the performance is here measured after averaging over the distribution of the design matrix, one can have far less stringent sparsity constraints on the coefficient vector. We demonstrate that for exact sparse vectors, the performance of the OMP is similar to known results on the Lasso algorithm [\\textit{IEEE Trans. Inform. Theory} \\textbf{55} (2009) 2183--2202]. Moreover, variable selection under a more relaxed sparsity assumption on th","authors_text":"Antony Joseph","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-09-04T17:03:00Z","title":"Variable Selection in High Dimensions with Random Designs and Orthogonal Matching Pursuit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0730","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:5c37f5ff2d81a9d78163f74491e991bbea3b11604a429ac3cbc8cb41fef2b4e4","target":"record","created_at":"2026-05-18T04:14:06Z","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":"11dc7d71c818b624b439b36745f8abbbaf293a19fe4e72fd62b7b4041336d069","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-09-04T17:03:00Z","title_canon_sha256":"17633d4a52870773b2347523755043b3dc3a91b2701864fd3868cb04d5ff013a"},"schema_version":"1.0","source":{"id":"1109.0730","kind":"arxiv","version":1}},"canonical_sha256":"c69eb40524d5889334bc9ad832bac8d550fa30bae5289c4e789037ca418edbfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c69eb40524d5889334bc9ad832bac8d550fa30bae5289c4e789037ca418edbfc","first_computed_at":"2026-05-18T04:14:06.895331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:06.895331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nnm77HaIbjFicKUD78WVUi8tFNCCjreLzf5Szy3zjHlTnPM29Ze4dNnWR1SY8DSPVBPQ3Qv8LoI2vcjjNNC5CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:06.895865Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.0730","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c37f5ff2d81a9d78163f74491e991bbea3b11604a429ac3cbc8cb41fef2b4e4","sha256:0e5b73dda988cdd85061e425eadbd26d181784c4b54e01b1fdc3038dbeaded81"],"state_sha256":"82f566e431b2add80309c0a4f250d5ec2bd7d4a1070f7fe14f275a0603bb0745"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CW7h3PlBzvWHyTfj3IxWf3uoIje48DYt4FrTv5sVqZErQGr6lhab3SnoWZ5ObU+mU4kgZhXFYpjMCtkZK9k5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:41:58.832503Z","bundle_sha256":"355a58af14d4069d90c40b6d2151d659d7cacfeffb95b19f64c48b2b3e08a568"}}