{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IA5EEBRCGDENIFYJAPCGFQ24AG","short_pith_number":"pith:IA5EEBRC","canonical_record":{"source":{"id":"1310.6062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-22T21:27:18Z","cross_cats_sorted":[],"title_canon_sha256":"05bd2d7177dfd79d56746af4a56f542479587c309a1d11ae24e0dc82e0ca5dc3","abstract_canon_sha256":"3b7e42f9310c07b4d0162642b85ad0173a0d0563f70ef4c4bc6af819542e30ec"},"schema_version":"1.0"},"canonical_sha256":"403a42062230c8d4170903c462c35c019ac185f6976ed2ff2d9c1f8e0d2629c6","source":{"kind":"arxiv","id":"1310.6062","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6062","created_at":"2026-05-18T03:09:21Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6062v1","created_at":"2026-05-18T03:09:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6062","created_at":"2026-05-18T03:09:21Z"},{"alias_kind":"pith_short_12","alias_value":"IA5EEBRCGDEN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IA5EEBRCGDENIFYJ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IA5EEBRC","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IA5EEBRCGDENIFYJAPCGFQ24AG","target":"record","payload":{"canonical_record":{"source":{"id":"1310.6062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-22T21:27:18Z","cross_cats_sorted":[],"title_canon_sha256":"05bd2d7177dfd79d56746af4a56f542479587c309a1d11ae24e0dc82e0ca5dc3","abstract_canon_sha256":"3b7e42f9310c07b4d0162642b85ad0173a0d0563f70ef4c4bc6af819542e30ec"},"schema_version":"1.0"},"canonical_sha256":"403a42062230c8d4170903c462c35c019ac185f6976ed2ff2d9c1f8e0d2629c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:21.574204Z","signature_b64":"EH2sRwGRKmrAGZRZcbYz2R8ipC2bFU+pCIymfFKjKNxdUMu6zhBlNpEdy3a+HWdzhc6sRkQiPIvVyv6TKwEeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"403a42062230c8d4170903c462c35c019ac185f6976ed2ff2d9c1f8e0d2629c6","last_reissued_at":"2026-05-18T03:09:21.573628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:21.573628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.6062","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:09:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q6HCtSdvAP8UTy6kx5OVsTcn49uiU4qZxtWjGSyrnwdPiuWhyluq/abaJvIcBhXhNNhpSmkE0WADohSRE+pvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:16:45.955800Z"},"content_sha256":"160381c81447a27ebb36f0a05103715c35958fd3fe4d5f3349acddb9b5808057","schema_version":"1.0","event_id":"sha256:160381c81447a27ebb36f0a05103715c35958fd3fe4d5f3349acddb9b5808057"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IA5EEBRCGDENIFYJAPCGFQ24AG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combined l_1 and greedy l_0 penalized least squares for linear model selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Jan Mielniczuk, Piotr Pokarowski","submitted_at":"2013-10-22T21:27:18Z","abstract_excerpt":"We introduce a computationally effective algorithm for a linear model selection consisting of three steps: screening--ordering--selection (SOS). Screening of predictors is based on the thresholded Lasso that is l_1 penalized least squares. The screened predictors are then fitted using least squares (LS) and ordered with respect to their t statistics. Finally, a model is selected using greedy generalized information criterion (GIC) that is l_0 penalized LS in a nested family induced by the ordering. We give non-asymptotic upper bounds on error probability of each step of the SOS algorithm in te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6062","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:09:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Rfbd6ZL6JZAZ4G1wC8qzIuw1MQM73y9RcDXdVBE3sGsx7zFpaf+cl9gyTllYcTMglJ8/ymZNq1uSl7bARBGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:16:45.956428Z"},"content_sha256":"3f27f2fce1e688271a9e89f19991a89cf8e4bd03223c4fe8ba5ae71e6f921cd1","schema_version":"1.0","event_id":"sha256:3f27f2fce1e688271a9e89f19991a89cf8e4bd03223c4fe8ba5ae71e6f921cd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IA5EEBRCGDENIFYJAPCGFQ24AG/bundle.json","state_url":"https://pith.science/pith/IA5EEBRCGDENIFYJAPCGFQ24AG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IA5EEBRCGDENIFYJAPCGFQ24AG/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-07T18:16:45Z","links":{"resolver":"https://pith.science/pith/IA5EEBRCGDENIFYJAPCGFQ24AG","bundle":"https://pith.science/pith/IA5EEBRCGDENIFYJAPCGFQ24AG/bundle.json","state":"https://pith.science/pith/IA5EEBRCGDENIFYJAPCGFQ24AG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IA5EEBRCGDENIFYJAPCGFQ24AG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IA5EEBRCGDENIFYJAPCGFQ24AG","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":"3b7e42f9310c07b4d0162642b85ad0173a0d0563f70ef4c4bc6af819542e30ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-22T21:27:18Z","title_canon_sha256":"05bd2d7177dfd79d56746af4a56f542479587c309a1d11ae24e0dc82e0ca5dc3"},"schema_version":"1.0","source":{"id":"1310.6062","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6062","created_at":"2026-05-18T03:09:21Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6062v1","created_at":"2026-05-18T03:09:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6062","created_at":"2026-05-18T03:09:21Z"},{"alias_kind":"pith_short_12","alias_value":"IA5EEBRCGDEN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IA5EEBRCGDENIFYJ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IA5EEBRC","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:3f27f2fce1e688271a9e89f19991a89cf8e4bd03223c4fe8ba5ae71e6f921cd1","target":"graph","created_at":"2026-05-18T03:09:21Z","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 introduce a computationally effective algorithm for a linear model selection consisting of three steps: screening--ordering--selection (SOS). Screening of predictors is based on the thresholded Lasso that is l_1 penalized least squares. The screened predictors are then fitted using least squares (LS) and ordered with respect to their t statistics. Finally, a model is selected using greedy generalized information criterion (GIC) that is l_0 penalized LS in a nested family induced by the ordering. We give non-asymptotic upper bounds on error probability of each step of the SOS algorithm in te","authors_text":"Jan Mielniczuk, Piotr Pokarowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-22T21:27:18Z","title":"Combined l_1 and greedy l_0 penalized least squares for linear model selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6062","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:160381c81447a27ebb36f0a05103715c35958fd3fe4d5f3349acddb9b5808057","target":"record","created_at":"2026-05-18T03:09:21Z","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":"3b7e42f9310c07b4d0162642b85ad0173a0d0563f70ef4c4bc6af819542e30ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-22T21:27:18Z","title_canon_sha256":"05bd2d7177dfd79d56746af4a56f542479587c309a1d11ae24e0dc82e0ca5dc3"},"schema_version":"1.0","source":{"id":"1310.6062","kind":"arxiv","version":1}},"canonical_sha256":"403a42062230c8d4170903c462c35c019ac185f6976ed2ff2d9c1f8e0d2629c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"403a42062230c8d4170903c462c35c019ac185f6976ed2ff2d9c1f8e0d2629c6","first_computed_at":"2026-05-18T03:09:21.573628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:21.573628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EH2sRwGRKmrAGZRZcbYz2R8ipC2bFU+pCIymfFKjKNxdUMu6zhBlNpEdy3a+HWdzhc6sRkQiPIvVyv6TKwEeCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:21.574204Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6062","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:160381c81447a27ebb36f0a05103715c35958fd3fe4d5f3349acddb9b5808057","sha256:3f27f2fce1e688271a9e89f19991a89cf8e4bd03223c4fe8ba5ae71e6f921cd1"],"state_sha256":"5935ce4a5a878038ef12687b00e989896abf4233468c3dc229c341b7ed27d52c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e/3eOFSW6BviTSWTkqZ75XdMAE29mKnySh6tFGMRrHnGE77c4oogPpcHCWWN0LdCDOsyi4ROItjUwBVr5641CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:16:45.960483Z","bundle_sha256":"e22cf066559c483a034244be11a93f3a905829826b0d573961c0164e7348b059"}}