Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance
As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2409.12788.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-10T20:43:03.131600Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-07-10T18:57:31.645844Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation ef4047f5-f81c-4306-bb36-f96a2aba05b8 · inbound
Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound cites this paper.
Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance
Reference 53
- Resolution
- unresolved
- no resolver link, observed 2026-08-10T20:43:03.131600Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 668cb147-0a08-4ccd-b4dd-16c028bf69eb · inbound
CLARITree: Cholesky and Lookahead Accelerations for Regression with Interpretable Piecewise Linear Trees cites this paper.
CLARITree: Cholesky and Lookahead Accelerations for Regression with Interpretable Piecewise Linear Trees Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance
Reference 36
- Resolution
- metadata mismatch
- arxiv_id, observed 2026-07-03T13:38:19.204225Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 69aca67d-d26c-4615-b202-7edf52f30982 · inbound
Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives cites this paper.
Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance
Reference 11
- Resolution
- verified exact
- local_arxiv, observed 2026-07-10T18:57:31.647199Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.