{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E2HUCX34ONTQM6W3C2IHDXTDA6","short_pith_number":"pith:E2HUCX34","canonical_record":{"source":{"id":"1808.02435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-07T15:59:17Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a382477285107743ba4f64d95234cb8d1fff4765aaa46945ee4432a9e8d0096c","abstract_canon_sha256":"70a02410806a516ac8969a64880a858fd061e112283e50d24c307e10c8a38e9a"},"schema_version":"1.0"},"canonical_sha256":"268f415f7c7367067adb169071de6307b109ae0702976245f31906eecdf3201f","source":{"kind":"arxiv","id":"1808.02435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02435","created_at":"2026-05-18T00:08:37Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02435v1","created_at":"2026-05-18T00:08:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02435","created_at":"2026-05-18T00:08:37Z"},{"alias_kind":"pith_short_12","alias_value":"E2HUCX34ONTQ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E2HUCX34ONTQM6W3","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E2HUCX34","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E2HUCX34ONTQM6W3C2IHDXTDA6","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-07T15:59:17Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a382477285107743ba4f64d95234cb8d1fff4765aaa46945ee4432a9e8d0096c","abstract_canon_sha256":"70a02410806a516ac8969a64880a858fd061e112283e50d24c307e10c8a38e9a"},"schema_version":"1.0"},"canonical_sha256":"268f415f7c7367067adb169071de6307b109ae0702976245f31906eecdf3201f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:37.044834Z","signature_b64":"N2v+3umwiQzj7HIuV9Qq95/A1cfvVDwAm/VK/yMh4bSPDAr/sPPDjk15wkiX/vdmRuXYg4LlzUUsxcj04BEUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"268f415f7c7367067adb169071de6307b109ae0702976245f31906eecdf3201f","last_reissued_at":"2026-05-18T00:08:37.044178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:37.044178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02435","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-18T00:08:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UqqadZGzN9IsUMprnVQiFUU4KgXSqUfsw8Iugpf2Grd2k9y2oz8rfoXIdXuSNV1dEKayBmgKLWvSUdj1drPWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:48:36.324606Z"},"content_sha256":"933bf7f129f3960b5fd04a5b96f21e112cb2e463ef8ca08f3a7ee8479625a480","schema_version":"1.0","event_id":"sha256:933bf7f129f3960b5fd04a5b96f21e112cb2e463ef8ca08f3a7ee8479625a480"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E2HUCX34ONTQM6W3C2IHDXTDA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mixed Integer Linear Programming for Feature Selection in Support Vector Machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Antonio M. Rodr\\'iguez-Ch\\'ia, Luisa I. Mart\\'inez-Merino, Martine Labb\\'e","submitted_at":"2018-08-07T15:59:17Z","abstract_excerpt":"This work focuses on support vector machine (SVM) with feature selection. A MILP formulation is proposed for the problem. The choice of suitable features to construct the separating hyperplanes has been modelled in this formulation by including a budget constraint that sets in advance a limit on the number of features to be used in the classification process. We propose both an exact and a heuristic procedure to solve this formulation in an efficient way. Finally, the validation of the model is done by checking it with some well-known data sets and comparing it with classical classification me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02435","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-18T00:08:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aL7CmGzI+GFCxAVaSCnwZpfgCukVs57knNGeqZcd/aDuiwkfQDMYnhpNCuOLbxocBf/StjOoLC8EMdNC6vaFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:48:36.324950Z"},"content_sha256":"78c500ab83328bb6be58fbd1d7dcfd729f001a505426f3db3f7ffd77e54cfeb5","schema_version":"1.0","event_id":"sha256:78c500ab83328bb6be58fbd1d7dcfd729f001a505426f3db3f7ffd77e54cfeb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2HUCX34ONTQM6W3C2IHDXTDA6/bundle.json","state_url":"https://pith.science/pith/E2HUCX34ONTQM6W3C2IHDXTDA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2HUCX34ONTQM6W3C2IHDXTDA6/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-24T19:48:36Z","links":{"resolver":"https://pith.science/pith/E2HUCX34ONTQM6W3C2IHDXTDA6","bundle":"https://pith.science/pith/E2HUCX34ONTQM6W3C2IHDXTDA6/bundle.json","state":"https://pith.science/pith/E2HUCX34ONTQM6W3C2IHDXTDA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2HUCX34ONTQM6W3C2IHDXTDA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E2HUCX34ONTQM6W3C2IHDXTDA6","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":"70a02410806a516ac8969a64880a858fd061e112283e50d24c307e10c8a38e9a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-07T15:59:17Z","title_canon_sha256":"a382477285107743ba4f64d95234cb8d1fff4765aaa46945ee4432a9e8d0096c"},"schema_version":"1.0","source":{"id":"1808.02435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02435","created_at":"2026-05-18T00:08:37Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02435v1","created_at":"2026-05-18T00:08:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02435","created_at":"2026-05-18T00:08:37Z"},{"alias_kind":"pith_short_12","alias_value":"E2HUCX34ONTQ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E2HUCX34ONTQM6W3","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E2HUCX34","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:78c500ab83328bb6be58fbd1d7dcfd729f001a505426f3db3f7ffd77e54cfeb5","target":"graph","created_at":"2026-05-18T00:08:37Z","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":"This work focuses on support vector machine (SVM) with feature selection. A MILP formulation is proposed for the problem. The choice of suitable features to construct the separating hyperplanes has been modelled in this formulation by including a budget constraint that sets in advance a limit on the number of features to be used in the classification process. We propose both an exact and a heuristic procedure to solve this formulation in an efficient way. Finally, the validation of the model is done by checking it with some well-known data sets and comparing it with classical classification me","authors_text":"Antonio M. Rodr\\'iguez-Ch\\'ia, Luisa I. Mart\\'inez-Merino, Martine Labb\\'e","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-07T15:59:17Z","title":"Mixed Integer Linear Programming for Feature Selection in Support Vector Machine"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02435","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:933bf7f129f3960b5fd04a5b96f21e112cb2e463ef8ca08f3a7ee8479625a480","target":"record","created_at":"2026-05-18T00:08:37Z","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":"70a02410806a516ac8969a64880a858fd061e112283e50d24c307e10c8a38e9a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-07T15:59:17Z","title_canon_sha256":"a382477285107743ba4f64d95234cb8d1fff4765aaa46945ee4432a9e8d0096c"},"schema_version":"1.0","source":{"id":"1808.02435","kind":"arxiv","version":1}},"canonical_sha256":"268f415f7c7367067adb169071de6307b109ae0702976245f31906eecdf3201f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"268f415f7c7367067adb169071de6307b109ae0702976245f31906eecdf3201f","first_computed_at":"2026-05-18T00:08:37.044178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:37.044178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N2v+3umwiQzj7HIuV9Qq95/A1cfvVDwAm/VK/yMh4bSPDAr/sPPDjk15wkiX/vdmRuXYg4LlzUUsxcj04BEUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:37.044834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:933bf7f129f3960b5fd04a5b96f21e112cb2e463ef8ca08f3a7ee8479625a480","sha256:78c500ab83328bb6be58fbd1d7dcfd729f001a505426f3db3f7ffd77e54cfeb5"],"state_sha256":"da374f50857b95dbc4972e11b08c79591ebec51d36258237e2c19b10c06c9f33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1XrU/uRsL4Itmd+Ykd0awfgCIkhiELcz2AsyhXOvRQpsRNJiGw9I9AdRqknpZp1YHRkDCNLaC9hJ04+ko6ACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:48:36.326884Z","bundle_sha256":"43052015dff8a1d8b1002174156c95557a547c48a4209df5380ac60b7452aba5"}}