{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:THKVBL5JSNF24AXXPZMQ4LBL3O","short_pith_number":"pith:THKVBL5J","canonical_record":{"source":{"id":"1707.08692","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-07-27T03:04:28Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"60cd2ec2971f55e1d5548624d64aac8b3826b8a29de6fdda2753dd0d37a4166e","abstract_canon_sha256":"eb6d84224e9071a4b8278b8e2e70a67c021c0a0ee480cb1c37b972c4d8426d84"},"schema_version":"1.0"},"canonical_sha256":"99d550afa9934bae02f77e590e2c2bdb88c7eaa68001897438e3ab50dd39dc4d","source":{"kind":"arxiv","id":"1707.08692","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08692","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08692v2","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08692","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"THKVBL5JSNF2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"THKVBL5JSNF24AXX","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"THKVBL5J","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:THKVBL5JSNF24AXXPZMQ4LBL3O","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08692","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-07-27T03:04:28Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"60cd2ec2971f55e1d5548624d64aac8b3826b8a29de6fdda2753dd0d37a4166e","abstract_canon_sha256":"eb6d84224e9071a4b8278b8e2e70a67c021c0a0ee480cb1c37b972c4d8426d84"},"schema_version":"1.0"},"canonical_sha256":"99d550afa9934bae02f77e590e2c2bdb88c7eaa68001897438e3ab50dd39dc4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:11.684835Z","signature_b64":"Jk5luIku5YtRlpGOj+5sAJEHuDJGcuPwhf9Tu/XUOFBUHwT1x8L2KuoCNzoMzXR19/qtZeyaABq5o52ox5F9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99d550afa9934bae02f77e590e2c2bdb88c7eaa68001897438e3ab50dd39dc4d","last_reissued_at":"2026-05-18T00:39:11.684126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:11.684126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08692","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:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ig0Jvzs1af1kw09KfRq9CleaZRKsMladNo0IWkQQEBK4x3dYp7uF97OW+uVa12Kjbfyng0EKlv+uCciaZNDoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:41:12.319995Z"},"content_sha256":"765e225e520995de839f388bfaba10c82d13fbde312d5073f4075878295b2d4c","schema_version":"1.0","event_id":"sha256:765e225e520995de839f388bfaba10c82d13fbde312d5073f4075878295b2d4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:THKVBL5JSNF24AXXPZMQ4LBL3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extended Comparisons of Best Subset Selection, Forward Stepwise Selection, and the Lasso","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Robert Tibshirani, Ryan J. Tibshirani, Trevor Hastie","submitted_at":"2017-07-27T03:04:28Z","abstract_excerpt":"In exciting new work, Bertsimas et al. (2016) showed that the classical best subset selection problem in regression modeling can be formulated as a mixed integer optimization (MIO) problem. Using recent advances in MIO algorithms, they demonstrated that best subset selection can now be solved at much larger problem sizes that what was thought possible in the statistics community. They presented empirical comparisons of best subset selection with other popular variable selection procedures, in particular, the lasso and forward stepwise selection. Surprisingly (to us), their simulations suggeste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08692","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:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d2qWrYvR3DX3gzeYCudCbTj8lldchTM4+aIcM+6cMGqtgh47Mr8OsUGfRcmiSjiXzuP0Fh+HE44+5sZ6TCY6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:41:12.320355Z"},"content_sha256":"0e6a14f7d8abe987d77f687c2d1dd1846bfd35127ebfb9d9af55595474c88279","schema_version":"1.0","event_id":"sha256:0e6a14f7d8abe987d77f687c2d1dd1846bfd35127ebfb9d9af55595474c88279"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THKVBL5JSNF24AXXPZMQ4LBL3O/bundle.json","state_url":"https://pith.science/pith/THKVBL5JSNF24AXXPZMQ4LBL3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THKVBL5JSNF24AXXPZMQ4LBL3O/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-28T02:41:12Z","links":{"resolver":"https://pith.science/pith/THKVBL5JSNF24AXXPZMQ4LBL3O","bundle":"https://pith.science/pith/THKVBL5JSNF24AXXPZMQ4LBL3O/bundle.json","state":"https://pith.science/pith/THKVBL5JSNF24AXXPZMQ4LBL3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THKVBL5JSNF24AXXPZMQ4LBL3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:THKVBL5JSNF24AXXPZMQ4LBL3O","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":"eb6d84224e9071a4b8278b8e2e70a67c021c0a0ee480cb1c37b972c4d8426d84","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-07-27T03:04:28Z","title_canon_sha256":"60cd2ec2971f55e1d5548624d64aac8b3826b8a29de6fdda2753dd0d37a4166e"},"schema_version":"1.0","source":{"id":"1707.08692","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08692","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08692v2","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08692","created_at":"2026-05-18T00:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"THKVBL5JSNF2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"THKVBL5JSNF24AXX","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"THKVBL5J","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:0e6a14f7d8abe987d77f687c2d1dd1846bfd35127ebfb9d9af55595474c88279","target":"graph","created_at":"2026-05-18T00:39:11Z","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":"In exciting new work, Bertsimas et al. (2016) showed that the classical best subset selection problem in regression modeling can be formulated as a mixed integer optimization (MIO) problem. Using recent advances in MIO algorithms, they demonstrated that best subset selection can now be solved at much larger problem sizes that what was thought possible in the statistics community. They presented empirical comparisons of best subset selection with other popular variable selection procedures, in particular, the lasso and forward stepwise selection. Surprisingly (to us), their simulations suggeste","authors_text":"Robert Tibshirani, Ryan J. Tibshirani, Trevor Hastie","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-07-27T03:04:28Z","title":"Extended Comparisons of Best Subset Selection, Forward Stepwise Selection, and the Lasso"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08692","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:765e225e520995de839f388bfaba10c82d13fbde312d5073f4075878295b2d4c","target":"record","created_at":"2026-05-18T00:39:11Z","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":"eb6d84224e9071a4b8278b8e2e70a67c021c0a0ee480cb1c37b972c4d8426d84","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-07-27T03:04:28Z","title_canon_sha256":"60cd2ec2971f55e1d5548624d64aac8b3826b8a29de6fdda2753dd0d37a4166e"},"schema_version":"1.0","source":{"id":"1707.08692","kind":"arxiv","version":2}},"canonical_sha256":"99d550afa9934bae02f77e590e2c2bdb88c7eaa68001897438e3ab50dd39dc4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99d550afa9934bae02f77e590e2c2bdb88c7eaa68001897438e3ab50dd39dc4d","first_computed_at":"2026-05-18T00:39:11.684126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:11.684126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jk5luIku5YtRlpGOj+5sAJEHuDJGcuPwhf9Tu/XUOFBUHwT1x8L2KuoCNzoMzXR19/qtZeyaABq5o52ox5F9BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:11.684835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08692","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:765e225e520995de839f388bfaba10c82d13fbde312d5073f4075878295b2d4c","sha256:0e6a14f7d8abe987d77f687c2d1dd1846bfd35127ebfb9d9af55595474c88279"],"state_sha256":"7520b2528e88cbf389982cc2a763608c6c8e3e5a9d919f7dea7342022e2cc617"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/cxsnWwWBdKcaOAlZxrHdmyELTxjur0OhOPpdiLFvUno6UYxKiKWESwbkYWjT1JQwYjXwuQYWFg12M1OuBn3DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:41:12.322353Z","bundle_sha256":"1f900a6d681e05bab65e2c93c017a2a982391f4e3d20d29f22702cc3b04625cd"}}