{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UTEXHPURLNGXOQ2Z2NZJVX3TJT","short_pith_number":"pith:UTEXHPUR","canonical_record":{"source":{"id":"2607.28170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-30T13:08:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b2c0f13e2ba50dbf28d69fd90c8352ad5f86486c86c7e33b72fe429e9cb2f012","abstract_canon_sha256":"e4368477c8965f61b89eebae497fe70e01392403abad4f366d1a3442ac0b367b"},"schema_version":"1.0"},"canonical_sha256":"a4c973be915b4d774359d3729adf734ccd795b34b1416ee7969f7d1ad630d31a","source":{"kind":"arxiv","id":"2607.28170","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28170","created_at":"2026-07-31T01:36:11Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28170v1","created_at":"2026-07-31T01:36:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28170","created_at":"2026-07-31T01:36:11Z"},{"alias_kind":"pith_short_12","alias_value":"UTEXHPURLNGX","created_at":"2026-07-31T01:36:11Z"},{"alias_kind":"pith_short_16","alias_value":"UTEXHPURLNGXOQ2Z","created_at":"2026-07-31T01:36:11Z"},{"alias_kind":"pith_short_8","alias_value":"UTEXHPUR","created_at":"2026-07-31T01:36:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UTEXHPURLNGXOQ2Z2NZJVX3TJT","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-30T13:08:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b2c0f13e2ba50dbf28d69fd90c8352ad5f86486c86c7e33b72fe429e9cb2f012","abstract_canon_sha256":"e4368477c8965f61b89eebae497fe70e01392403abad4f366d1a3442ac0b367b"},"schema_version":"1.0"},"canonical_sha256":"a4c973be915b4d774359d3729adf734ccd795b34b1416ee7969f7d1ad630d31a","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4c973be915b4d774359d3729adf734ccd795b34b1416ee7969f7d1ad630d31a","last_reissued_at":"2026-07-31T01:36:11.663789Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:36:11.663789Z"},"source_kind":"arxiv","source_id":"2607.28170","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-07-31T01:36:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kvk9z++3pw4R7aQApm6QGjplH6WuA6QhlB3nSZylMaSZnqZklqfXTC9ick6usnI5RU/AsgsveuTPObQDRMgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T12:40:34.079079Z"},"content_sha256":"4ffb25255bef77b26fedc2dd24be0a76dbb3a01ce29551c1d9d95ba5b2a47e7c","schema_version":"1.0","event_id":"sha256:4ffb25255bef77b26fedc2dd24be0a76dbb3a01ce29551c1d9d95ba5b2a47e7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UTEXHPURLNGXOQ2Z2NZJVX3TJT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Search Strategies for Optimal Classification and Regression Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Emir Demirovi\\'c, Jacobus G. M. van der Linden, Mim van den Bos","submitted_at":"2026-07-30T13:08:21Z","abstract_excerpt":"Optimal decision trees (ODTs) are compact, interpretable machine learning models that globally optimize a given objective, but their scalability remains challenging. While recent work has proposed a variety of search strategies to improve scalability, the precise contribution of each strategy remains unclear. To address this gap, we introduce a general algorithmic framework for ODTs that instantiates previously used search strategies and enables the definition of new ones. This provides a common lens through which to understand and compare different strategies, which we use to empirically inve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28170","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.28170/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-31T01:36:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+AUcjODeVqoM1Hr5YqHul2aWq5CBevJ2tgBFgtC5jiXmBztxwbgGBLDu6AUmV9uRiXL0IE0CBo84kJGRZsW9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T12:40:34.079993Z"},"content_sha256":"7c15440280cd56994e75f61a317c43f87a04b34e171023ff37800a0c7f8a7f70","schema_version":"1.0","event_id":"sha256:7c15440280cd56994e75f61a317c43f87a04b34e171023ff37800a0c7f8a7f70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTEXHPURLNGXOQ2Z2NZJVX3TJT/bundle.json","state_url":"https://pith.science/pith/UTEXHPURLNGXOQ2Z2NZJVX3TJT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTEXHPURLNGXOQ2Z2NZJVX3TJT/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-01T12:40:34Z","links":{"resolver":"https://pith.science/pith/UTEXHPURLNGXOQ2Z2NZJVX3TJT","bundle":"https://pith.science/pith/UTEXHPURLNGXOQ2Z2NZJVX3TJT/bundle.json","state":"https://pith.science/pith/UTEXHPURLNGXOQ2Z2NZJVX3TJT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTEXHPURLNGXOQ2Z2NZJVX3TJT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UTEXHPURLNGXOQ2Z2NZJVX3TJT","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":"e4368477c8965f61b89eebae497fe70e01392403abad4f366d1a3442ac0b367b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-30T13:08:21Z","title_canon_sha256":"b2c0f13e2ba50dbf28d69fd90c8352ad5f86486c86c7e33b72fe429e9cb2f012"},"schema_version":"1.0","source":{"id":"2607.28170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28170","created_at":"2026-07-31T01:36:11Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28170v1","created_at":"2026-07-31T01:36:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28170","created_at":"2026-07-31T01:36:11Z"},{"alias_kind":"pith_short_12","alias_value":"UTEXHPURLNGX","created_at":"2026-07-31T01:36:11Z"},{"alias_kind":"pith_short_16","alias_value":"UTEXHPURLNGXOQ2Z","created_at":"2026-07-31T01:36:11Z"},{"alias_kind":"pith_short_8","alias_value":"UTEXHPUR","created_at":"2026-07-31T01:36:11Z"}],"graph_snapshots":[{"event_id":"sha256:7c15440280cd56994e75f61a317c43f87a04b34e171023ff37800a0c7f8a7f70","target":"graph","created_at":"2026-07-31T01:36:11Z","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/2607.28170/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimal decision trees (ODTs) are compact, interpretable machine learning models that globally optimize a given objective, but their scalability remains challenging. While recent work has proposed a variety of search strategies to improve scalability, the precise contribution of each strategy remains unclear. To address this gap, we introduce a general algorithmic framework for ODTs that instantiates previously used search strategies and enables the definition of new ones. This provides a common lens through which to understand and compare different strategies, which we use to empirically inve","authors_text":"Emir Demirovi\\'c, Jacobus G. M. van der Linden, Mim van den Bos","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-30T13:08:21Z","title":"Search Strategies for Optimal Classification and Regression Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28170","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:4ffb25255bef77b26fedc2dd24be0a76dbb3a01ce29551c1d9d95ba5b2a47e7c","target":"record","created_at":"2026-07-31T01:36:11Z","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":"e4368477c8965f61b89eebae497fe70e01392403abad4f366d1a3442ac0b367b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-30T13:08:21Z","title_canon_sha256":"b2c0f13e2ba50dbf28d69fd90c8352ad5f86486c86c7e33b72fe429e9cb2f012"},"schema_version":"1.0","source":{"id":"2607.28170","kind":"arxiv","version":1}},"canonical_sha256":"a4c973be915b4d774359d3729adf734ccd795b34b1416ee7969f7d1ad630d31a","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4c973be915b4d774359d3729adf734ccd795b34b1416ee7969f7d1ad630d31a","first_computed_at":"2026-07-31T01:36:11.663789Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:36:11.663789Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ffb25255bef77b26fedc2dd24be0a76dbb3a01ce29551c1d9d95ba5b2a47e7c","sha256:7c15440280cd56994e75f61a317c43f87a04b34e171023ff37800a0c7f8a7f70"],"state_sha256":"cef46e102b312ea451dc2d746111852230092cfb68d12a8d2e90c2dcd71e69bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wRqEwS4cx7jRkM7cW4OFrkzCazhCf5ZXaP39nJIrrZnUWSg4ccLvrqc0hBRReAfB54vqRu89WM2Qc9H6nd9CBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T12:40:34.084798Z","bundle_sha256":"08ee0ca3fdfdb5b02a0860ef9fe6a7ccc505be688bea3da83d4f9db4e2c2ebde"}}