{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HI5THGUT2R3FD4HIZHOQGOZUNT","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":"1b33c5ffba143746f59c9974d74b22c04a4afefe28cbca74fb46dba396a44ad3","cross_cats_sorted":["cond-mat.stat-mech","cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-01T05:19:54Z","title_canon_sha256":"1fcbb5129569cd4cd1c05e2fccedb889e62a946be1943bd90120c95d1b8965d8"},"schema_version":"1.0","source":{"id":"2605.00414","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.00414","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.00414v2","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.00414","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"HI5THGUT2R3F","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"HI5THGUT2R3FD4HI","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"HI5THGUT","created_at":"2026-05-22T01:04:03Z"}],"graph_snapshots":[{"event_id":"sha256:ea998ee9a9fb1b45372295b9040cb69c8ac9840362f63c01616534a75b044a11","target":"graph","created_at":"2026-05-22T01:04:03Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"establishing a crisp mathematical correspondence between hierarchical decision trees and diffusion processes in appropriate limiting regimes. Our unification reveals a shared optimization principle: Global Trajectory Score Matching (GTSM), for which gradient boosting (in an idealized version) is asymptotically optimal."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The limiting regimes invoked for the correspondence are appropriate and yield a meaningful practical unification without additional unstated assumptions that would break the link between trees and diffusion processes."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Decision trees and diffusion models are unified through limiting-regime correspondence under Global Trajectory Score Matching, yielding TreeFlow for competitive tabular generation with 2x speedup and DSMTREE for distilling tree logic into neural nets with near-teacher performance."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Decision trees correspond to diffusion processes in limiting regimes and share the Global Trajectory Score Matching optimization principle."}],"snapshot_sha256":"5e9231befdf61c3159074cef0b50737339abdd73a6ed85eb45c3ee0c174e5bda"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T19:43:08.333619Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T18:11:15.502851Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.00414/integrity.json","findings":[],"snapshot_sha256":"03c00b6cd7aef3dd625f8eabf41712cbeb85413998d44e0c0d93dc25de9ab440","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decision trees and diffusion models are ostensibly disparate model classes, one discrete and hierarchical, the other continuous and dynamic. This work unifies the two by establishing a crisp mathematical correspondence between hierarchical decision trees and diffusion processes in appropriate limiting regimes. Our unification reveals a shared optimization principle: \\emph{Global Trajectory Score Matching (GTSM)}, for which gradient boosting (in an idealized version) is asymptotically optimal. We underscore the conceptual value of our work through two key practical instantiations: \\treeflow, wh","authors_text":"Sai Niranjan Ramachandran, Suvrit Sra","cross_cats":["cond-mat.stat-mech","cs.AI"],"headline":"Decision trees correspond to diffusion processes in limiting regimes and share the Global Trajectory Score Matching optimization principle.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-01T05:19:54Z","title":"Trees to Flows and Back: Unifying Decision Trees and Diffusion Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.00414","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-09T20:07:03.260456Z","id":"a86c2f09-1701-4a41-83df-0f276c8a74dd","model_set":{"reader":"grok-4.3"},"one_line_summary":"Decision trees and diffusion models are unified through limiting-regime correspondence under Global Trajectory Score Matching, yielding TreeFlow for competitive tabular generation with 2x speedup and DSMTREE for distilling tree logic into neural nets with near-teacher performance.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Decision trees correspond to diffusion processes in limiting regimes and share the Global Trajectory Score Matching optimization principle.","strongest_claim":"establishing a crisp mathematical correspondence between hierarchical decision trees and diffusion processes in appropriate limiting regimes. Our unification reveals a shared optimization principle: Global Trajectory Score Matching (GTSM), for which gradient boosting (in an idealized version) is asymptotically optimal.","weakest_assumption":"The limiting regimes invoked for the correspondence are appropriate and yield a meaningful practical unification without additional unstated assumptions that would break the link between trees and diffusion processes."}},"verdict_id":"a86c2f09-1701-4a41-83df-0f276c8a74dd"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:69f6035e4c780688c03d02034989d3c84d898384f25937e9bf002540f6ed29bc","target":"record","created_at":"2026-05-22T01:04:03Z","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":"1b33c5ffba143746f59c9974d74b22c04a4afefe28cbca74fb46dba396a44ad3","cross_cats_sorted":["cond-mat.stat-mech","cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-01T05:19:54Z","title_canon_sha256":"1fcbb5129569cd4cd1c05e2fccedb889e62a946be1943bd90120c95d1b8965d8"},"schema_version":"1.0","source":{"id":"2605.00414","kind":"arxiv","version":2}},"canonical_sha256":"3a3b339a93d47651f0e8c9dd033b346cf6878b75d1fd9de402fd14c7e91a42cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a3b339a93d47651f0e8c9dd033b346cf6878b75d1fd9de402fd14c7e91a42cc","first_computed_at":"2026-05-22T01:04:03.843430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:03.843430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ea1d8UwxuICqLfi9hjgle0o60p8Yz1XHdNObv79T80TX8AS/ZHMBltWuLLH+taDq9VxEiqrKvncsDU3oaF5nBg==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:03.844217Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.00414","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69f6035e4c780688c03d02034989d3c84d898384f25937e9bf002540f6ed29bc","sha256:ea998ee9a9fb1b45372295b9040cb69c8ac9840362f63c01616534a75b044a11"],"state_sha256":"2d8d6805bfb353a322a93ebfe223eb2864fbdd63df21d398793cabc996a846ef"}