{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:4NVIOSPHI6LBMAPLEHNM3EKXDO","short_pith_number":"pith:4NVIOSPH","canonical_record":{"source":{"id":"1012.3880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-12-17T14:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"3225e3c670e224e98ae17f3597f26e412ede01d3ae0d79d779e212955c4a4cc7","abstract_canon_sha256":"141430c9873a5e7ecac2b024246b691c010ea714c72298d4ac9e9934ef79398b"},"schema_version":"1.0"},"canonical_sha256":"e36a8749e747961601eb21dacd91571b90bb4e700ffde6d26c7a46708c4dffd5","source":{"kind":"arxiv","id":"1012.3880","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3880","created_at":"2026-05-18T04:33:03Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3880v1","created_at":"2026-05-18T04:33:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3880","created_at":"2026-05-18T04:33:03Z"},{"alias_kind":"pith_short_12","alias_value":"4NVIOSPHI6LB","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"4NVIOSPHI6LBMAPL","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"4NVIOSPH","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:4NVIOSPHI6LBMAPLEHNM3EKXDO","target":"record","payload":{"canonical_record":{"source":{"id":"1012.3880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-12-17T14:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"3225e3c670e224e98ae17f3597f26e412ede01d3ae0d79d779e212955c4a4cc7","abstract_canon_sha256":"141430c9873a5e7ecac2b024246b691c010ea714c72298d4ac9e9934ef79398b"},"schema_version":"1.0"},"canonical_sha256":"e36a8749e747961601eb21dacd91571b90bb4e700ffde6d26c7a46708c4dffd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:03.707785Z","signature_b64":"fahY9q6N78pS8y18duqrqtEo36SXpneA0V0oO0gKRvnNJfLUo98SLPmSBn/GAZ7Mbt3GktA6N6swC2wJcdrZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e36a8749e747961601eb21dacd91571b90bb4e700ffde6d26c7a46708c4dffd5","last_reissued_at":"2026-05-18T04:33:03.707350Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:03.707350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.3880","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:33:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lKsYMqKgnEMmLV5gaJF+sIAXPXabcrxh1CUly/vyCOecr3aOoEo6MWi3ZBD4+v0dPSlMhpulHJw2/7yppk1tDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:17:34.546725Z"},"content_sha256":"3fce831d6f0f717ab90b39ff7567cb7d98c389ae3c085666e837a483d8da2477","schema_version":"1.0","event_id":"sha256:3fce831d6f0f717ab90b39ff7567cb7d98c389ae3c085666e837a483d8da2477"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:4NVIOSPHI6LBMAPLEHNM3EKXDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ultra-high Dimensional Multiple Output Learning With Simultaneous Orthogonal Matching Pursuit: A Sure Screening Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Eric P. Xing, Mladen Kolar","submitted_at":"2010-12-17T14:05:42Z","abstract_excerpt":"We propose a novel application of the Simultaneous Orthogonal Matching Pursuit (S-OMP) procedure for sparsistant variable selection in ultra-high dimensional multi-task regression problems. Screening of variables, as introduced in \\cite{fan08sis}, is an efficient and highly scalable way to remove many irrelevant variables from the set of all variables, while retaining all the relevant variables. S-OMP can be applied to problems with hundreds of thousands of variables and once the number of variables is reduced to a manageable size, a more computationally demanding procedure can be used to iden"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3880","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:33:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZOYTnESqAVj4Swgtrv7M9BKTS24CHLFmWnXLL0RQFg7nP6OaCkZoY4A5qpt+2wjT5E581Y090IWfGFyt8l8rDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:17:34.547076Z"},"content_sha256":"bbf556c84e18237394b7aa3f3748f9d37539087bf9f88cfe52771aae97e831aa","schema_version":"1.0","event_id":"sha256:bbf556c84e18237394b7aa3f3748f9d37539087bf9f88cfe52771aae97e831aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NVIOSPHI6LBMAPLEHNM3EKXDO/bundle.json","state_url":"https://pith.science/pith/4NVIOSPHI6LBMAPLEHNM3EKXDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NVIOSPHI6LBMAPLEHNM3EKXDO/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-06-01T05:17:34Z","links":{"resolver":"https://pith.science/pith/4NVIOSPHI6LBMAPLEHNM3EKXDO","bundle":"https://pith.science/pith/4NVIOSPHI6LBMAPLEHNM3EKXDO/bundle.json","state":"https://pith.science/pith/4NVIOSPHI6LBMAPLEHNM3EKXDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NVIOSPHI6LBMAPLEHNM3EKXDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:4NVIOSPHI6LBMAPLEHNM3EKXDO","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":"141430c9873a5e7ecac2b024246b691c010ea714c72298d4ac9e9934ef79398b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-12-17T14:05:42Z","title_canon_sha256":"3225e3c670e224e98ae17f3597f26e412ede01d3ae0d79d779e212955c4a4cc7"},"schema_version":"1.0","source":{"id":"1012.3880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3880","created_at":"2026-05-18T04:33:03Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3880v1","created_at":"2026-05-18T04:33:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3880","created_at":"2026-05-18T04:33:03Z"},{"alias_kind":"pith_short_12","alias_value":"4NVIOSPHI6LB","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"4NVIOSPHI6LBMAPL","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"4NVIOSPH","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:bbf556c84e18237394b7aa3f3748f9d37539087bf9f88cfe52771aae97e831aa","target":"graph","created_at":"2026-05-18T04:33:03Z","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":"We propose a novel application of the Simultaneous Orthogonal Matching Pursuit (S-OMP) procedure for sparsistant variable selection in ultra-high dimensional multi-task regression problems. Screening of variables, as introduced in \\cite{fan08sis}, is an efficient and highly scalable way to remove many irrelevant variables from the set of all variables, while retaining all the relevant variables. S-OMP can be applied to problems with hundreds of thousands of variables and once the number of variables is reduced to a manageable size, a more computationally demanding procedure can be used to iden","authors_text":"Eric P. Xing, Mladen Kolar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-12-17T14:05:42Z","title":"Ultra-high Dimensional Multiple Output Learning With Simultaneous Orthogonal Matching Pursuit: A Sure Screening Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3880","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:3fce831d6f0f717ab90b39ff7567cb7d98c389ae3c085666e837a483d8da2477","target":"record","created_at":"2026-05-18T04:33:03Z","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":"141430c9873a5e7ecac2b024246b691c010ea714c72298d4ac9e9934ef79398b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-12-17T14:05:42Z","title_canon_sha256":"3225e3c670e224e98ae17f3597f26e412ede01d3ae0d79d779e212955c4a4cc7"},"schema_version":"1.0","source":{"id":"1012.3880","kind":"arxiv","version":1}},"canonical_sha256":"e36a8749e747961601eb21dacd91571b90bb4e700ffde6d26c7a46708c4dffd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e36a8749e747961601eb21dacd91571b90bb4e700ffde6d26c7a46708c4dffd5","first_computed_at":"2026-05-18T04:33:03.707350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:03.707350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fahY9q6N78pS8y18duqrqtEo36SXpneA0V0oO0gKRvnNJfLUo98SLPmSBn/GAZ7Mbt3GktA6N6swC2wJcdrZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:03.707785Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.3880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fce831d6f0f717ab90b39ff7567cb7d98c389ae3c085666e837a483d8da2477","sha256:bbf556c84e18237394b7aa3f3748f9d37539087bf9f88cfe52771aae97e831aa"],"state_sha256":"b717f61346841135da58b138ab811549669ea01a527b31737a405151bdbbf504"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Yz0B1UwQdjCzwbsqLby8oMU7l/4SsezDawlF9DQUY4uJfjXz20g1unOKB9h589JTQklAxWo3d/qgHBSMePLDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:17:34.549902Z","bundle_sha256":"839cf03f1ba22e86c461abe7e01e80cc333f200fc6ef31aedcc4f6e1f6e7512e"}}