{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5ARMXEYOWBM2SFHKIHBSEYCAZA","short_pith_number":"pith:5ARMXEYO","canonical_record":{"source":{"id":"1701.07920","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-27T01:43:10Z","cross_cats_sorted":[],"title_canon_sha256":"5c8acac70a8a86df796e636c9547f197971ca17554ce2871c692c29e8048cc66","abstract_canon_sha256":"f513a7e361fead5b99681e0bb3341777e494e7fbf0aa01440a8bca256e2a2c12"},"schema_version":"1.0"},"canonical_sha256":"e822cb930eb059a914ea41c3226040c803edb33fa925427dcdfa9e2b8d2a84c6","source":{"kind":"arxiv","id":"1701.07920","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07920","created_at":"2026-07-05T01:32:39Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07920v2","created_at":"2026-07-05T01:32:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07920","created_at":"2026-07-05T01:32:39Z"},{"alias_kind":"pith_short_12","alias_value":"5ARMXEYOWBM2","created_at":"2026-07-05T01:32:39Z"},{"alias_kind":"pith_short_16","alias_value":"5ARMXEYOWBM2SFHK","created_at":"2026-07-05T01:32:39Z"},{"alias_kind":"pith_short_8","alias_value":"5ARMXEYO","created_at":"2026-07-05T01:32:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5ARMXEYOWBM2SFHKIHBSEYCAZA","target":"record","payload":{"canonical_record":{"source":{"id":"1701.07920","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-27T01:43:10Z","cross_cats_sorted":[],"title_canon_sha256":"5c8acac70a8a86df796e636c9547f197971ca17554ce2871c692c29e8048cc66","abstract_canon_sha256":"f513a7e361fead5b99681e0bb3341777e494e7fbf0aa01440a8bca256e2a2c12"},"schema_version":"1.0"},"canonical_sha256":"e822cb930eb059a914ea41c3226040c803edb33fa925427dcdfa9e2b8d2a84c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:32:39.761693Z","signature_b64":"xhjabF6N2yHt+X8zqYpbyVBENDQhn5EDSWSgtrH3fd2HVkTUESql4E5NTus7t+sQ/S4kDoPYivIP2OOxQeEMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e822cb930eb059a914ea41c3226040c803edb33fa925427dcdfa9e2b8d2a84c6","last_reissued_at":"2026-07-05T01:32:39.761281Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:32:39.761281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.07920","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-07-05T01:32:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ENDOCqFHmt6CNZe2/6Y2mDAK1D0DTUwOR4JRP4y0zfbHFDdKL40wlh4U9VT2umA1wWncaI956/TChVD1QExDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:51:26.892920Z"},"content_sha256":"d26ad66b607e6cfaa50984702ab7e8bab62021ea66f8573d84271ef4d06925e4","schema_version":"1.0","event_id":"sha256:d26ad66b607e6cfaa50984702ab7e8bab62021ea66f8573d84271ef4d06925e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5ARMXEYOWBM2SFHKIHBSEYCAZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subset Selection for Multiple Linear Regression via Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Diego Klabjan, Young Woong Park","submitted_at":"2017-01-27T01:43:10Z","abstract_excerpt":"Subset selection in multiple linear regression aims to choose a subset of candidate explanatory variables that tradeoff fitting error (explanatory power) and model complexity (number of variables selected). We build mathematical programming models for regression subset selection based on mean square and absolute errors, and minimal-redundancy-maximal-relevance criteria. The proposed models are tested using a linear-program-based branch-and-bound algorithm with tailored valid inequalities and big M values and are compared against the algorithms in the literature. For high dimensional cases, an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07920","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1701.07920/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:32:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YON+oOVdyurb4sg2KEPckR80PrJ2W2YhQ/8PkOlxpWTikhnTxK/P4SR6k4DttlzSPRudFrTQ9g5LSbaWG/MdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:51:26.893302Z"},"content_sha256":"cdd0e35c16a43b65dd8f2bbc4358f20548cae48543fca34528a84ff19844628e","schema_version":"1.0","event_id":"sha256:cdd0e35c16a43b65dd8f2bbc4358f20548cae48543fca34528a84ff19844628e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ARMXEYOWBM2SFHKIHBSEYCAZA/bundle.json","state_url":"https://pith.science/pith/5ARMXEYOWBM2SFHKIHBSEYCAZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ARMXEYOWBM2SFHKIHBSEYCAZA/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-07-09T06:51:26Z","links":{"resolver":"https://pith.science/pith/5ARMXEYOWBM2SFHKIHBSEYCAZA","bundle":"https://pith.science/pith/5ARMXEYOWBM2SFHKIHBSEYCAZA/bundle.json","state":"https://pith.science/pith/5ARMXEYOWBM2SFHKIHBSEYCAZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ARMXEYOWBM2SFHKIHBSEYCAZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5ARMXEYOWBM2SFHKIHBSEYCAZA","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":"f513a7e361fead5b99681e0bb3341777e494e7fbf0aa01440a8bca256e2a2c12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-27T01:43:10Z","title_canon_sha256":"5c8acac70a8a86df796e636c9547f197971ca17554ce2871c692c29e8048cc66"},"schema_version":"1.0","source":{"id":"1701.07920","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07920","created_at":"2026-07-05T01:32:39Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07920v2","created_at":"2026-07-05T01:32:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07920","created_at":"2026-07-05T01:32:39Z"},{"alias_kind":"pith_short_12","alias_value":"5ARMXEYOWBM2","created_at":"2026-07-05T01:32:39Z"},{"alias_kind":"pith_short_16","alias_value":"5ARMXEYOWBM2SFHK","created_at":"2026-07-05T01:32:39Z"},{"alias_kind":"pith_short_8","alias_value":"5ARMXEYO","created_at":"2026-07-05T01:32:39Z"}],"graph_snapshots":[{"event_id":"sha256:cdd0e35c16a43b65dd8f2bbc4358f20548cae48543fca34528a84ff19844628e","target":"graph","created_at":"2026-07-05T01:32:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1701.07920/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Subset selection in multiple linear regression aims to choose a subset of candidate explanatory variables that tradeoff fitting error (explanatory power) and model complexity (number of variables selected). We build mathematical programming models for regression subset selection based on mean square and absolute errors, and minimal-redundancy-maximal-relevance criteria. The proposed models are tested using a linear-program-based branch-and-bound algorithm with tailored valid inequalities and big M values and are compared against the algorithms in the literature. For high dimensional cases, an ","authors_text":"Diego Klabjan, Young Woong Park","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-27T01:43:10Z","title":"Subset Selection for Multiple Linear Regression via Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07920","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:d26ad66b607e6cfaa50984702ab7e8bab62021ea66f8573d84271ef4d06925e4","target":"record","created_at":"2026-07-05T01:32:39Z","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":"f513a7e361fead5b99681e0bb3341777e494e7fbf0aa01440a8bca256e2a2c12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-27T01:43:10Z","title_canon_sha256":"5c8acac70a8a86df796e636c9547f197971ca17554ce2871c692c29e8048cc66"},"schema_version":"1.0","source":{"id":"1701.07920","kind":"arxiv","version":2}},"canonical_sha256":"e822cb930eb059a914ea41c3226040c803edb33fa925427dcdfa9e2b8d2a84c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e822cb930eb059a914ea41c3226040c803edb33fa925427dcdfa9e2b8d2a84c6","first_computed_at":"2026-07-05T01:32:39.761281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:32:39.761281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xhjabF6N2yHt+X8zqYpbyVBENDQhn5EDSWSgtrH3fd2HVkTUESql4E5NTus7t+sQ/S4kDoPYivIP2OOxQeEMDg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:32:39.761693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07920","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d26ad66b607e6cfaa50984702ab7e8bab62021ea66f8573d84271ef4d06925e4","sha256:cdd0e35c16a43b65dd8f2bbc4358f20548cae48543fca34528a84ff19844628e"],"state_sha256":"9103e9b7d779d80f88fd0f18b0795f717bbdf8f3a3508c18af3d079db146a926"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Siymh+EbFFJiVXi8g/okXMGaL53Ihxz+3+OFsKob35QBlPYM/VvGRw5MHPXaoX/VHtZK5c6zR9UOSO88cKpQBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T06:51:26.895548Z","bundle_sha256":"33b90cdbaa1279ac5b2d62426d76568d33b41a587db5ce7f05f5dc9290570cf1"}}