{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:HGNDFVR6DQ3NXUCESCPFTOYFSB","short_pith_number":"pith:HGNDFVR6","canonical_record":{"source":{"id":"2002.09142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-21T05:58:17Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"55821d59085122892eebb1ea50723f0e064f89f636ae44a1c667090c7c135c2c","abstract_canon_sha256":"e05374f51095aa7e2067e8383dd4b8bb5b43192737fdc219c2c3258866433978"},"schema_version":"1.0"},"canonical_sha256":"399a32d63e1c36dbd044909e59bb059079c6a5d6c3499651772f0e0ebea0c14e","source":{"kind":"arxiv","id":"2002.09142","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.09142","created_at":"2026-07-05T01:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"2002.09142v2","created_at":"2026-07-05T01:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.09142","created_at":"2026-07-05T01:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"HGNDFVR6DQ3N","created_at":"2026-07-05T01:02:29Z"},{"alias_kind":"pith_short_16","alias_value":"HGNDFVR6DQ3NXUCE","created_at":"2026-07-05T01:02:29Z"},{"alias_kind":"pith_short_8","alias_value":"HGNDFVR6","created_at":"2026-07-05T01:02:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:HGNDFVR6DQ3NXUCESCPFTOYFSB","target":"record","payload":{"canonical_record":{"source":{"id":"2002.09142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-21T05:58:17Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"55821d59085122892eebb1ea50723f0e064f89f636ae44a1c667090c7c135c2c","abstract_canon_sha256":"e05374f51095aa7e2067e8383dd4b8bb5b43192737fdc219c2c3258866433978"},"schema_version":"1.0"},"canonical_sha256":"399a32d63e1c36dbd044909e59bb059079c6a5d6c3499651772f0e0ebea0c14e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:02:29.616150Z","signature_b64":"C1aPg+y9E+gJoC9OBoSAHpZFKohg4uVYYcBawQjtAhAiZnmQ7ifN5NuKOLxFtA0yJEotbrFJJuizIIUW1MSJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"399a32d63e1c36dbd044909e59bb059079c6a5d6c3499651772f0e0ebea0c14e","last_reissued_at":"2026-07-05T01:02:29.615768Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:02:29.615768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.09142","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:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Dp8JTs6kPvakntOuNvsTPg1l3X7eHDgiszuxXpQHD7Kvjcpq0Fd47OflYLEx9DjbjDcDmdI/xGb5voX0rC8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:37:37.619401Z"},"content_sha256":"6620b6e7ae125c504647879d2df2dbba264f680e422b95f2dcb93c4233fc016a","schema_version":"1.0","event_id":"sha256:6620b6e7ae125c504647879d2df2dbba264f680e422b95f2dcb93c4233fc016a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:HGNDFVR6DQ3NXUCESCPFTOYFSB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Optimal Classification Trees: Strong Max-Flow Formulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Andres Gomez, Phebe Vayanos, Sina Aghaei","submitted_at":"2020-02-21T05:58:17Z","abstract_excerpt":"We consider the problem of learning optimal binary classification trees. Literature on the topic has burgeoned in recent years, motivated both by the empirical suboptimality of heuristic approaches and the tremendous improvements in mixed-integer programming (MIP) technology. Yet, existing approaches from the literature do not leverage the power of MIP to its full extent. Indeed, they rely on weak formulations, resulting in slow convergence and large optimality gaps. To fill this gap in the literature, we propose a flow-based MIP formulation for optimal binary classification trees that has a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.09142","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/2002.09142/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:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QqZmJCEA2WOrdmOpLpLXkRFsfaTA177qWtXFHIZFgkEDnOp5sxfG1V1/QPDgyDUNrFw3MZVnQm/LM4itqPELCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:37:37.619772Z"},"content_sha256":"85bfd4501c93198ec7213365f3f9a5248c0dd784e32207b32e9880d8992da63e","schema_version":"1.0","event_id":"sha256:85bfd4501c93198ec7213365f3f9a5248c0dd784e32207b32e9880d8992da63e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGNDFVR6DQ3NXUCESCPFTOYFSB/bundle.json","state_url":"https://pith.science/pith/HGNDFVR6DQ3NXUCESCPFTOYFSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGNDFVR6DQ3NXUCESCPFTOYFSB/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-06T20:37:37Z","links":{"resolver":"https://pith.science/pith/HGNDFVR6DQ3NXUCESCPFTOYFSB","bundle":"https://pith.science/pith/HGNDFVR6DQ3NXUCESCPFTOYFSB/bundle.json","state":"https://pith.science/pith/HGNDFVR6DQ3NXUCESCPFTOYFSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGNDFVR6DQ3NXUCESCPFTOYFSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:HGNDFVR6DQ3NXUCESCPFTOYFSB","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":"e05374f51095aa7e2067e8383dd4b8bb5b43192737fdc219c2c3258866433978","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-21T05:58:17Z","title_canon_sha256":"55821d59085122892eebb1ea50723f0e064f89f636ae44a1c667090c7c135c2c"},"schema_version":"1.0","source":{"id":"2002.09142","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.09142","created_at":"2026-07-05T01:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"2002.09142v2","created_at":"2026-07-05T01:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.09142","created_at":"2026-07-05T01:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"HGNDFVR6DQ3N","created_at":"2026-07-05T01:02:29Z"},{"alias_kind":"pith_short_16","alias_value":"HGNDFVR6DQ3NXUCE","created_at":"2026-07-05T01:02:29Z"},{"alias_kind":"pith_short_8","alias_value":"HGNDFVR6","created_at":"2026-07-05T01:02:29Z"}],"graph_snapshots":[{"event_id":"sha256:85bfd4501c93198ec7213365f3f9a5248c0dd784e32207b32e9880d8992da63e","target":"graph","created_at":"2026-07-05T01:02:29Z","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/2002.09142/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of learning optimal binary classification trees. Literature on the topic has burgeoned in recent years, motivated both by the empirical suboptimality of heuristic approaches and the tremendous improvements in mixed-integer programming (MIP) technology. Yet, existing approaches from the literature do not leverage the power of MIP to its full extent. Indeed, they rely on weak formulations, resulting in slow convergence and large optimality gaps. To fill this gap in the literature, we propose a flow-based MIP formulation for optimal binary classification trees that has a s","authors_text":"Andres Gomez, Phebe Vayanos, Sina Aghaei","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-21T05:58:17Z","title":"Learning Optimal Classification Trees: Strong Max-Flow Formulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.09142","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:6620b6e7ae125c504647879d2df2dbba264f680e422b95f2dcb93c4233fc016a","target":"record","created_at":"2026-07-05T01:02:29Z","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":"e05374f51095aa7e2067e8383dd4b8bb5b43192737fdc219c2c3258866433978","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-21T05:58:17Z","title_canon_sha256":"55821d59085122892eebb1ea50723f0e064f89f636ae44a1c667090c7c135c2c"},"schema_version":"1.0","source":{"id":"2002.09142","kind":"arxiv","version":2}},"canonical_sha256":"399a32d63e1c36dbd044909e59bb059079c6a5d6c3499651772f0e0ebea0c14e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"399a32d63e1c36dbd044909e59bb059079c6a5d6c3499651772f0e0ebea0c14e","first_computed_at":"2026-07-05T01:02:29.615768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:02:29.615768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C1aPg+y9E+gJoC9OBoSAHpZFKohg4uVYYcBawQjtAhAiZnmQ7ifN5NuKOLxFtA0yJEotbrFJJuizIIUW1MSJDw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:02:29.616150Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.09142","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6620b6e7ae125c504647879d2df2dbba264f680e422b95f2dcb93c4233fc016a","sha256:85bfd4501c93198ec7213365f3f9a5248c0dd784e32207b32e9880d8992da63e"],"state_sha256":"325a6993026cbd3a990f9fcbb32c664a4d3c35435d56d0bbe29d6fb0c6f50075"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BhBM8632YKUazU0o/eWTLncuvJ6H4EYZmDLYMeh5y2C6DmAQVFL9MBejR8IZDdeoT5UDJ864jdWEettqEcmlBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:37:37.621729Z","bundle_sha256":"f70825556c4c7df7606213ce272f9cd0fa9bf36df2f88ab63a0080d118002261"}}