{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:E7MFHUNY27M7BHK33PYQBW74D6","short_pith_number":"pith:E7MFHUNY","canonical_record":{"source":{"id":"1511.04056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-12T20:32:28Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"d3eaf5f7c99cf82369d0a76e4bdb3953fcbc63289126f8e9f06843caa1ef01cb","abstract_canon_sha256":"c09d6c055bf217fd4b46e547dec865a0270e56bd9a62a95ae1958714a60e4d22"},"schema_version":"1.0"},"canonical_sha256":"27d853d1b8d7d9f09d5bdbf100dbfc1fb03d8d62f9d6a9373602d660f608f5da","source":{"kind":"arxiv","id":"1511.04056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04056","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04056v1","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04056","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"pith_short_12","alias_value":"E7MFHUNY27M7","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"E7MFHUNY27M7BHK3","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"E7MFHUNY","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:E7MFHUNY27M7BHK33PYQBW74D6","target":"record","payload":{"canonical_record":{"source":{"id":"1511.04056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-12T20:32:28Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"d3eaf5f7c99cf82369d0a76e4bdb3953fcbc63289126f8e9f06843caa1ef01cb","abstract_canon_sha256":"c09d6c055bf217fd4b46e547dec865a0270e56bd9a62a95ae1958714a60e4d22"},"schema_version":"1.0"},"canonical_sha256":"27d853d1b8d7d9f09d5bdbf100dbfc1fb03d8d62f9d6a9373602d660f608f5da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:06.107595Z","signature_b64":"unFwYK2MEGbpIv5mmaSHeyImKBl81UEJcxEXIRWbbuc+Gtil8/qDeONfYVdG93OjCqYcq6/Pua6Rty7xWFZ/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27d853d1b8d7d9f09d5bdbf100dbfc1fb03d8d62f9d6a9373602d660f608f5da","last_reissued_at":"2026-05-18T01:27:06.106852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:06.106852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.04056","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-18T01:27:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hHzjeNFwnDfn2QeL2vrfxNVn4Og1XpaKiOAIPzqH2qzJDHJQqcG13ZqGPE2SNwhCOxqYyt8pY7+4ZSduYQQOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:42:41.614883Z"},"content_sha256":"dc995dd7b1d7ee712bb9f66cdd8f95a6db956d0a24b1c4addcf1f59c8836b377","schema_version":"1.0","event_id":"sha256:dc995dd7b1d7ee712bb9f66cdd8f95a6db956d0a24b1c4addcf1f59c8836b377"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:E7MFHUNY27M7BHK33PYQBW74D6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient non-greedy optimization of decision trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"David J. Fleet, Matthew Johnson, Maxwell D. Collins, Mohammad Norouzi, Pushmeet Kohli","submitted_at":"2015-11-12T20:32:28Z","abstract_excerpt":"Decision trees and randomized forests are widely used in computer vision and machine learning. Standard algorithms for decision tree induction optimize the split functions one node at a time according to some splitting criteria. This greedy procedure often leads to suboptimal trees. In this paper, we present an algorithm for optimizing the split functions at all levels of the tree jointly with the leaf parameters, based on a global objective. We show that the problem of finding optimal linear-combination (oblique) splits for decision trees is related to structured prediction with latent variab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04056","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-18T01:27:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7eomY7Xxt20+fe0mDU3AvZ+fR9Vmsk6KLxz7AU6HzMon6vMfa2apNS1G1D/GIGERHHTj6fqjDmC6Tyn/pehACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:42:41.615224Z"},"content_sha256":"ab0ebb0a87e84c0dc9c5002a19afc50b86e0b9a4c4ca9418b9801427569cdfa2","schema_version":"1.0","event_id":"sha256:ab0ebb0a87e84c0dc9c5002a19afc50b86e0b9a4c4ca9418b9801427569cdfa2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7MFHUNY27M7BHK33PYQBW74D6/bundle.json","state_url":"https://pith.science/pith/E7MFHUNY27M7BHK33PYQBW74D6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7MFHUNY27M7BHK33PYQBW74D6/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-02T18:42:41Z","links":{"resolver":"https://pith.science/pith/E7MFHUNY27M7BHK33PYQBW74D6","bundle":"https://pith.science/pith/E7MFHUNY27M7BHK33PYQBW74D6/bundle.json","state":"https://pith.science/pith/E7MFHUNY27M7BHK33PYQBW74D6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7MFHUNY27M7BHK33PYQBW74D6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E7MFHUNY27M7BHK33PYQBW74D6","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":"c09d6c055bf217fd4b46e547dec865a0270e56bd9a62a95ae1958714a60e4d22","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-12T20:32:28Z","title_canon_sha256":"d3eaf5f7c99cf82369d0a76e4bdb3953fcbc63289126f8e9f06843caa1ef01cb"},"schema_version":"1.0","source":{"id":"1511.04056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04056","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04056v1","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04056","created_at":"2026-05-18T01:27:06Z"},{"alias_kind":"pith_short_12","alias_value":"E7MFHUNY27M7","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"E7MFHUNY27M7BHK3","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"E7MFHUNY","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:ab0ebb0a87e84c0dc9c5002a19afc50b86e0b9a4c4ca9418b9801427569cdfa2","target":"graph","created_at":"2026-05-18T01:27:06Z","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":"Decision trees and randomized forests are widely used in computer vision and machine learning. Standard algorithms for decision tree induction optimize the split functions one node at a time according to some splitting criteria. This greedy procedure often leads to suboptimal trees. In this paper, we present an algorithm for optimizing the split functions at all levels of the tree jointly with the leaf parameters, based on a global objective. We show that the problem of finding optimal linear-combination (oblique) splits for decision trees is related to structured prediction with latent variab","authors_text":"David J. Fleet, Matthew Johnson, Maxwell D. Collins, Mohammad Norouzi, Pushmeet Kohli","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-12T20:32:28Z","title":"Efficient non-greedy optimization of decision trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04056","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:dc995dd7b1d7ee712bb9f66cdd8f95a6db956d0a24b1c4addcf1f59c8836b377","target":"record","created_at":"2026-05-18T01:27:06Z","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":"c09d6c055bf217fd4b46e547dec865a0270e56bd9a62a95ae1958714a60e4d22","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-12T20:32:28Z","title_canon_sha256":"d3eaf5f7c99cf82369d0a76e4bdb3953fcbc63289126f8e9f06843caa1ef01cb"},"schema_version":"1.0","source":{"id":"1511.04056","kind":"arxiv","version":1}},"canonical_sha256":"27d853d1b8d7d9f09d5bdbf100dbfc1fb03d8d62f9d6a9373602d660f608f5da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27d853d1b8d7d9f09d5bdbf100dbfc1fb03d8d62f9d6a9373602d660f608f5da","first_computed_at":"2026-05-18T01:27:06.106852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:06.106852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"unFwYK2MEGbpIv5mmaSHeyImKBl81UEJcxEXIRWbbuc+Gtil8/qDeONfYVdG93OjCqYcq6/Pua6Rty7xWFZ/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:06.107595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.04056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc995dd7b1d7ee712bb9f66cdd8f95a6db956d0a24b1c4addcf1f59c8836b377","sha256:ab0ebb0a87e84c0dc9c5002a19afc50b86e0b9a4c4ca9418b9801427569cdfa2"],"state_sha256":"3c7eaff2e9fec3c8bb1676c605a6e8d0345df7fe01d4c02396a7b3a0d2f5e485"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ucbTZoAViiFXLy4Os6xk3qpxz9x5YxwgZNwhl/DB9mrco4GY0sRYKV+KoY+Wsz1Dz0ebbKbtAm8YrCCurnDBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:42:41.617070Z","bundle_sha256":"7c4b9f14bd3a9be987699e231078a81db72bdacf935790e0b073e29d8bbab695"}}