{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:F7H7JHBBU6QY6UYV562UTFUI4Z","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":"0dabb2253fc0fb853e701b07c7b604697bf352050fb55efc58b999deac8d1ffb","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-22T14:11:13Z","title_canon_sha256":"1fbf2fb0b2c0559a8240e106b1c0889ae5d8d192d51d407517ad57c38e29a84a"},"schema_version":"1.0","source":{"id":"2001.08025","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.08025","created_at":"2026-07-05T05:23:42Z"},{"alias_kind":"arxiv_version","alias_value":"2001.08025v3","created_at":"2026-07-05T05:23:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.08025","created_at":"2026-07-05T05:23:42Z"},{"alias_kind":"pith_short_12","alias_value":"F7H7JHBBU6QY","created_at":"2026-07-05T05:23:42Z"},{"alias_kind":"pith_short_16","alias_value":"F7H7JHBBU6QY6UYV","created_at":"2026-07-05T05:23:42Z"},{"alias_kind":"pith_short_8","alias_value":"F7H7JHBB","created_at":"2026-07-05T05:23:42Z"}],"graph_snapshots":[{"event_id":"sha256:62870a2296c048ed213bc02c0841719ee9af7ce2316641f487ab82b8c44f501a","target":"graph","created_at":"2026-07-05T05:23:42Z","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/2001.08025/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The optimal binning is the optimal discretization of a variable into bins given a discrete or continuous numeric target. We present a rigorous and extensible mathematical programming formulation for solving the optimal binning problem for a binary, continuous and multi-class target type, incorporating constraints not previously addressed. For all three target types, we introduce a convex mixed-integer programming formulation. Several algorithmic enhancements, such as automatic determination of the most suitable monotonic trend via a Machine-Learning-based classifier and implementation aspects ","authors_text":"Guillermo Navas-Palencia","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-22T14:11:13Z","title":"Optimal binning: mathematical programming formulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.08025","kind":"arxiv","version":3},"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:f81c3cc970a0c19a2ff771d74de49390a4790382ea56c6720e526f133101f90b","target":"record","created_at":"2026-07-05T05:23:42Z","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":"0dabb2253fc0fb853e701b07c7b604697bf352050fb55efc58b999deac8d1ffb","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-22T14:11:13Z","title_canon_sha256":"1fbf2fb0b2c0559a8240e106b1c0889ae5d8d192d51d407517ad57c38e29a84a"},"schema_version":"1.0","source":{"id":"2001.08025","kind":"arxiv","version":3}},"canonical_sha256":"2fcff49c21a7a18f5315efb5499688e667e722e65413f08df78202deef2e9c2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fcff49c21a7a18f5315efb5499688e667e722e65413f08df78202deef2e9c2f","first_computed_at":"2026-07-05T05:23:42.254914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:23:42.254914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pEsg5rbRhVkhWHBU3YGv829SfOESIq+CFyN2qASlz6VlL0CjPZTYD4xbROWLBHY04c+pwtiBtErxz21APEnkCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:23:42.255281Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.08025","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f81c3cc970a0c19a2ff771d74de49390a4790382ea56c6720e526f133101f90b","sha256:62870a2296c048ed213bc02c0841719ee9af7ce2316641f487ab82b8c44f501a"],"state_sha256":"c246cacbd21785abc4cc2aa242cf28f1668e98c687e77dd5bd35f2aec2fd8d0c"}