{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:F7H7JHBBU6QY6UYV562UTFUI4Z","short_pith_number":"pith:F7H7JHBB","canonical_record":{"source":{"id":"2001.08025","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-22T14:11:13Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"1fbf2fb0b2c0559a8240e106b1c0889ae5d8d192d51d407517ad57c38e29a84a","abstract_canon_sha256":"0dabb2253fc0fb853e701b07c7b604697bf352050fb55efc58b999deac8d1ffb"},"schema_version":"1.0"},"canonical_sha256":"2fcff49c21a7a18f5315efb5499688e667e722e65413f08df78202deef2e9c2f","source":{"kind":"arxiv","id":"2001.08025","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:F7H7JHBBU6QY6UYV562UTFUI4Z","target":"record","payload":{"canonical_record":{"source":{"id":"2001.08025","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-22T14:11:13Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"1fbf2fb0b2c0559a8240e106b1c0889ae5d8d192d51d407517ad57c38e29a84a","abstract_canon_sha256":"0dabb2253fc0fb853e701b07c7b604697bf352050fb55efc58b999deac8d1ffb"},"schema_version":"1.0"},"canonical_sha256":"2fcff49c21a7a18f5315efb5499688e667e722e65413f08df78202deef2e9c2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:42.255281Z","signature_b64":"pEsg5rbRhVkhWHBU3YGv829SfOESIq+CFyN2qASlz6VlL0CjPZTYD4xbROWLBHY04c+pwtiBtErxz21APEnkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fcff49c21a7a18f5315efb5499688e667e722e65413f08df78202deef2e9c2f","last_reissued_at":"2026-07-05T05:23:42.254914Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:42.254914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.08025","source_version":3,"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-05T05:23:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pevm2N1IIij1HnXYusmbhVxX1K8MGGqL3G8MvWXErptN9NVV0197LJ26mPo67qk4SefPX7K9aG+5k2pMc7g6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T15:18:52.057261Z"},"content_sha256":"f81c3cc970a0c19a2ff771d74de49390a4790382ea56c6720e526f133101f90b","schema_version":"1.0","event_id":"sha256:f81c3cc970a0c19a2ff771d74de49390a4790382ea56c6720e526f133101f90b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:F7H7JHBBU6QY6UYV562UTFUI4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal binning: mathematical programming formulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Guillermo Navas-Palencia","submitted_at":"2020-01-22T14:11:13Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.08025","kind":"arxiv","version":3},"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/2001.08025/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-05T05:23:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VVWt2955XgxZaVBRnpGev36iBQA5Gs55RvfwnJ4qbmA7qFt9bcNRe1RxQnb1fpWtHcXXt7OTUEqrZBrqEq1wDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T15:18:52.057788Z"},"content_sha256":"62870a2296c048ed213bc02c0841719ee9af7ce2316641f487ab82b8c44f501a","schema_version":"1.0","event_id":"sha256:62870a2296c048ed213bc02c0841719ee9af7ce2316641f487ab82b8c44f501a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7H7JHBBU6QY6UYV562UTFUI4Z/bundle.json","state_url":"https://pith.science/pith/F7H7JHBBU6QY6UYV562UTFUI4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7H7JHBBU6QY6UYV562UTFUI4Z/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-08-22T15:18:52Z","links":{"resolver":"https://pith.science/pith/F7H7JHBBU6QY6UYV562UTFUI4Z","bundle":"https://pith.science/pith/F7H7JHBBU6QY6UYV562UTFUI4Z/bundle.json","state":"https://pith.science/pith/F7H7JHBBU6QY6UYV562UTFUI4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7H7JHBBU6QY6UYV562UTFUI4Z/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hg1O2rDt3mxwhO9e21wgy4/uOpv/zk2mtlGub5vrvErwfig0PX73cAo9qU8iToG5hGUmqWdOKQaoab3pt6I4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T15:18:52.063329Z","bundle_sha256":"87bb986a9c22b4b4a40082b936539856707d238ab8185967923c93153e1d8e34"}}