Pith. sign in

Paper Citation Record · LEDGER

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound

As of 20 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 1 inbound Pith citation observation for arXiv:2501.07903.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2501.07903 v1

Coverage vector

measured 57 of 57 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-10T20:43:03.152300Z

measured 58 of 58 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-06-26T08:53:49.813049Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-07-04T10:19:48.028651Z

Reference resolution

57 of 57 outbound references displayed

  • verified exact0
  • verified fuzzy7
  • unresolved50
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation d9f1a423-3a19-46da-9cda-c4fa845c2d64 · outbound

This paper cites , " * write output.state after.block = add.period write newline.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound , " * write output.state after.block = add.period write newline

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-10T20:43:02.851188Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T20:43:02.851188Z digest=sha256:190c9c54d809a79af75b399d2c48213632f881139f4a509c63c84a3dcf487c2b

Observation 11078ea4-f477-46b1-8d8e-6884decf7b5f · outbound

This paper cites write newline.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound write newline

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-10T20:43:02.857441Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T20:43:02.857441Z digest=sha256:95ff38db9c65eeefa4204523a61e17b922b3491fb0d7bb5d10a6ed7b5d54cf20

Observation 0e802b5c-f846-43b5-b0fc-8a072ec20831 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 3

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:04.103993Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.863275Z digest=sha256:47cb29275369096092e038e604b0435bc2d140cc9d1ca2e0a27fca328ba61430

Observation 9b06ed3d-e73f-4bff-a442-4227b6ddec4b · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 4

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:04.087651Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.871351Z digest=sha256:e042a99dfe8c6c4829c642a69e27ddb8508a565236af7bcbfa5cd958d05582c9

Observation 96e07195-b748-4d4c-84d3-e8b5d834926b · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 5

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:04.070989Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.876819Z digest=sha256:49cdaba030d188c4fbad6a135c39e046d577887e8d0c21ccb33e71ef91e35a4c

Observation 8c1a3573-1cae-432c-b5d6-79d0c8009fa4 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 6

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:04.054593Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.882041Z digest=sha256:63ec88570c2555be67c25178e26f683f827b12c7facad2d0036f145a7099217d

Observation 2212d336-f020-48dc-aefe-6b466399a257 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 7

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:04.038656Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.887218Z digest=sha256:ccaf38d07c99c22f10e97eeaba63bf93e455b5031088bdc952bd667f4200ec56

Observation e4ed139f-42be-4ce4-a4db-4a4b4e68a9fe · outbound

This paper cites B.; D \' i az-Rodr \' i guez, N.; Del Ser, J.; Bennetot, A.; Tabik, S.; Barbado, A.; Garc \' i a, S.; Gil-L \' o pez, S.; Molina, D.; Benjamins, R.; Chatila, R.; and Herrera, F.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound B.; D \' i az-Rodr \' i guez, N.; Del Ser, J.; Bennetot, A.; Tabik, S.; Barbado, A.; Garc \' i a, S.; Gil-L \' o pez, S.; Molina, D.; Benjamins, R.; Chatila, R.; and Herrera, F

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T20:43:04.020859Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.892372Z digest=sha256:3d016d1886c8ee59057f0d2969f8fe47314cfe97a471aa7c077408cd0771b2e9

Observation e3bc9536-9058-47f6-a36a-bfff4582c519 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 9

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:04.001923Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.898473Z digest=sha256:44d573fcf78efa12699276fd1c44bbe28ab7f20ae9d01f3817a7bad79f2528fa

Observation a08de068-6048-4e07-a315-1e4c9dc9e759 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 10

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.985395Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.903389Z digest=sha256:32b50c717ada4c3c23f10869bdfb5489eebd7b58d4604c0613e18f381d6a6557

Observation 7d73d96d-2f7a-4096-841a-a07f587fda92 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 11

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.969303Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.908794Z digest=sha256:1231368ff5054a2db34082af7b572624cae62479e5346379fc2b53b08c8e7c5b

Observation 12103e49-6d97-4811-9162-4e8cd4ec6533 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 12

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.951256Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.914020Z digest=sha256:42b922cee278dc4b79bf415e3cc54602cc16867684b668ddc5b4415867a3a708

Observation dd728e7b-5201-4e42-b91b-9ff075bf4f99 · outbound

This paper cites H.; Olshen, R.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound H.; Olshen, R

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T20:43:03.935367Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.918983Z digest=sha256:818b443fbe89271b8645c53578857eac2db2bddc8b4545e0622901431c4b62b2

Observation 30978d85-bcff-49f6-b7f9-b42155b0f058 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 14

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.919886Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.923924Z digest=sha256:a2faac1aa74c95fb311b959229d5b9afea0c04b946542312985d3cf7426f09f2

Observation 8de368ff-52c1-401f-a3c7-00fd9cd26e0c · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 15

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.902794Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.930181Z digest=sha256:f4e23b9b7cc1d6504df19b71a33d7b9497edda852eeee04ebba12a2c6de36efc

Observation 1175d261-517a-4971-bcb4-f8073824d4a9 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 16

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.885452Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.935218Z digest=sha256:593bcdc94a2dfa84af9be8705c345b31610909ea2c09fff3f4a3f95d890b419a

Observation 013fad9b-7a0c-41e3-8daa-5d61535b0018 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 17

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.865986Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.940014Z digest=sha256:e3ab0564e78ab1c77983b73f9c49fb5d263de224b1c55185d4940a330b4cd477

Observation 37818010-f8c4-477a-afb4-86ebb0f1e9d1 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 18

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.846915Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.945186Z digest=sha256:563bf8ff949a7e61c6379a21be61aced8d383b98bfc96ca5ad7ee4007cbaf34e

Observation 6d9e653f-a4e6-45d2-b8d4-8cff01e21c4e · outbound

This paper cites G.; and Pedreira, C.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound G.; and Pedreira, C

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T20:43:03.828931Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.950422Z digest=sha256:8c9f2200998c18072d98819f825167fa43fba7c67be8caaf2cd5786844c27ed7

Observation d726a28b-f05a-47d3-b4ae-07fc2e9c76d7 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 20

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.811674Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.956222Z digest=sha256:cf33425a8964e75813ecef2795119efc6e061b626797227466a6e5509e53287b

Observation 7024c6f8-0143-4be7-99e9-70f0942e0c8b · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 21

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.794045Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.960887Z digest=sha256:1df1c4772c62813d1e69dbb25a1df1674efb916e4bec46021db3391c18c72df1

Observation 6371b513-c70e-45c0-9b13-c2c5da8160d0 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-10T20:43:02.965488Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T20:43:02.965488Z digest=sha256:7ce1163f200dca7470d85480e92dcc8d8e0a7c10429933195e2793c2e9db32b5

Observation 864ad67b-e14f-4645-adf4-f0f2f8262871 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 23

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.759732Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.970166Z digest=sha256:a43e102eafce21fd049d5a4ed87387089e436a3cf7ba9ecead6393bc0f4f2cc3

Observation 102bc4fe-9fa8-41b7-ac30-ef2a3ddf78cc · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 24

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.743550Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.975231Z digest=sha256:5e824e981f305d6f21482eb3f58c8aec42688b295e3179336baa58d355bd9862

Observation 98fc52b0-a549-41d8-af30-b0ad277796b9 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 25

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.726815Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.980240Z digest=sha256:fad4776ec586311fc418f4c4b96dfb091357680bcc237cabb2c12090d67edd48

Observation 7ba3687c-29f9-4525-800c-d0702ceef925 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 26

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.710673Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.985052Z digest=sha256:fb0641a26d75000619cf8d437c85f1b298f902e6e26835e7dc72216f1d87007a

Observation bc632741-f47f-430e-8ba3-37b059016b73 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 27

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.692472Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.989674Z digest=sha256:341990dccc303f32b34d3505e5397a63a6fcd02a3bb374504c1eb838da371d8f

Observation ff8e75c7-db6a-4ce0-8fc0-d402edfc74c2 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 28

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.674891Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.995209Z digest=sha256:081e255d24a5b049926197c3e182dd9dc2de63ed4f4bdb46031f6d9e12709385

Observation 83339c7e-57ce-41d2-9a7b-34e1a21f64f5 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 29

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.657119Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.999649Z digest=sha256:4e64bfd09a4f169fbcea5915d939cbdb68ef1c881112fd2bc7f82a0468c334ef

Observation eb60dc13-065d-49e9-a18e-fd27e580ddf1 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 30

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.640847Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.004296Z digest=sha256:36b360e19ac423554a9b83e18114c087f35e4efc3b43de00ac5408d0c241a5ca

Observation 5c9d83ab-a67f-490d-926d-2e8970e13a88 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 31

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.624826Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.009620Z digest=sha256:f75212c42aa8cc3932df9277e3844a6cdcd7f9c39d3ea06d884871e867891ebc

Observation d262170b-7397-4a4c-9bf6-8c0e9f02eff0 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 32

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.609031Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.014741Z digest=sha256:ae98af8fd7fbc97ff64e25b6577f35be33d19058c3fb8d1a75d453191fcf79c7

Observation 90b7b07f-5994-4c43-9abb-b71917fd8b05 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 33

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.593655Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.020940Z digest=sha256:021f11c74ae848ccd438f9758e05be210755252f05f6fe8d002dde91b2dafb04

Observation fcdef80c-24eb-42a4-8f1f-ebba13be3fe0 · outbound

This paper cites T.; and Hermes, C.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound T.; and Hermes, C

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T20:43:03.576924Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.026845Z digest=sha256:dda4a635f200b0a78386a4a7355f9b73147854c5ba043738bdeb71f24c5247cc

Observation 41b4c6f9-c6f3-4ac8-a99c-b09c6457a77e · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 35

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.561279Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.033968Z digest=sha256:0e138c74a5a31f9d31066a1c0ef54422202c31f72da3ccc1e1986ffc068ae966

Observation 80522130-c2fe-41cd-9d35-89134afbcfdb · outbound

This paper cites J.; Stappers, B.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound J.; Stappers, B

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T20:43:03.545115Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.040070Z digest=sha256:20f197d25c7a7b8ca07ad16e49490350e4d3a3eb89ec6492122aa4991b4e61a7

Observation 2decb52e-eeb1-4947-98d0-8f907d938ed9 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 37

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.529030Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.045757Z digest=sha256:6e9d7dc836aed44dd0463615422594aa6f15daaef26d6712dfd5166f34cd123e

Observation 89024d8f-97ca-491e-aec5-ba95bf1c85f1 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 38

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.513373Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.053292Z digest=sha256:83064e71acf38fce7ab6baede04a8320cfff09789f28b4fb4be597df7bda1bf9

Observation 5ac27c08-0b97-4f73-a43c-492935af3dd4 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 39

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.497597Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.058543Z digest=sha256:2e26e86b6702fecb59b3c77e89fbe9e56a4697d752fbcb57ace8de852f1ca544

Observation 2eb1d5be-9e67-41f6-bdad-e852c86a9d88 · outbound

This paper cites K.; and Salzberg, S.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound K.; and Salzberg, S

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T20:43:03.482616Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.064295Z digest=sha256:76c21f845166baf5e5b9c7e9f87d685f6b086fc0760ee20bbbd3356235355a97

Observation b3b843ba-4385-4b5e-93f2-f136413e6a60 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 41

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.467467Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.069229Z digest=sha256:622245d16d0da181b803511eaeac43044038389f1d49e27ad6b6c4912d799f0a

Observation 00328540-2c35-4125-8261-3a9e4eb0f10a · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 42

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.451010Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.074323Z digest=sha256:950c2654ec66887a8a38b22966034cf7bd0431c3905752bfcfa5a598816d0b3d

Observation ee32da83-a4aa-4420-a669-43498ef4b3d7 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 43

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.435241Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.079183Z digest=sha256:66b90bc28a8c3c8744655a33f3c4c5641415bc1d090b000f7263a68ca10d8a88

Observation e10c42c9-b251-4c2e-83af-4e3268aec651 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 44

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.419188Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.084637Z digest=sha256:8eb8113af55bf97587334a3e94461db13a27a12c839e7333021cd5df9330f919

Observation ce6c4ec0-7e7a-4008-b1b3-57e9fd46423d · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 45

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.403997Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.090245Z digest=sha256:00bc43cf7845a4fb1126fee93c040a5506364f648a991767207d09582d11a6a3

Observation a62e4cae-4e19-4d68-b919-8dbe3a927863 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 46

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.388465Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.095702Z digest=sha256:4ba19fd38392efdf1b1035eb3a19ddf52c7e97c9401d8f9f3bd76d6034f26119

Observation ae5c3ea1-ba98-426a-8539-cc9d726b158a · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 47

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.370817Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.100701Z digest=sha256:a72d4bea6db1985e362277f5b6d002c8e7119e257d7250482b8ca679de8daf26

Observation 81b321c2-21c4-419a-a6f1-5ff02562ea1c · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 48

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.351433Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.105658Z digest=sha256:5917ba4ee72a156b82a37462a81e3b9a43bda819a14c3e3fa6bd7ca97880ab9a

Observation f5dc84ee-2774-4cc8-95c8-dc711e57f119 · outbound

This paper cites P.; Jain, V.; Chaudhari, S.; Kraemer, F.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound P.; Jain, V.; Chaudhari, S.; Kraemer, F

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T20:43:03.331149Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.110652Z digest=sha256:cedab49714f269fc11e201558dbbec2629d5a06797498ceddfddbbe71c769bbd

Observation 4d48eaf7-2673-4a48-b040-bead737f93a6 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 50

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.313820Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.115800Z digest=sha256:1891be68fda46945a0a860ab4d701cc0fdc221b00e2e3be4fb47b9d97e30dd3d

Observation aa8cf464-59e0-4754-a141-4326703c5799 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 51

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.296880Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.121289Z digest=sha256:e3f7ee8e71189ad0e3ab57a75de3c0fc409a40cfba7f358f3cbdbda58f36c1cb

Observation c6375683-e7de-46c5-8c47-4658d76f118e · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 52

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.278469Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.126444Z digest=sha256:32aad7bc3567c399864856dcf50120060733fbc15eee4e91f3dd556be04bb3e1

Observation ef4047f5-f81c-4306-bb36-f96a2aba05b8 · outbound

This paper cites Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance.

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.

source=arxiv_source observed=2026-08-10T20:43:03.131600Z digest=sha256:a790f84070c51f424909b5ca34eb4468ab9a9038c28b636e8d0e5b3e72322ee3

Observation 89f852b0-fe02-4011-844f-d7232523ac4e · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 54

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.262137Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.137454Z digest=sha256:251e3ae0e8d9b52dca97143357cc88c0e79c38a6743492b736ca4e949d2c0d83

Observation 402f1f28-e018-43c2-afde-fbaa3391abbc · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 55

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.244968Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.142735Z digest=sha256:dd32b9e0c586aeaaf11dab2e037a55171eb078ed639c906ce51a9340bc20c280

Observation 6ddb1358-fb67-4ede-b05a-ce8d462f1480 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 56

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.228933Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.147597Z digest=sha256:e117f20917799c0c4de2a07d6534384d6cab1e207cea7594a52b438a366982a0

Observation accfa9f0-8152-48db-a370-ac75766f7262 · outbound

This paper cites an unresolved cited work.

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound Unresolved cited work

Reference 57

Resolution
unresolved
raw_fallback, observed 2026-08-10T20:43:03.212265Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.152300Z digest=sha256:85a11bdb59c91fe458565d1df5f64fa435e616e1a7c0faf93900da7442d7ffae

Pith citing papers

Observation 7d8e0e4b-2eae-4f36-aac1-b90999388717 · inbound

A Spectral Theory of Normalized Corrected GNN Propagation cites this paper.

A Spectral Theory of Normalized Corrected GNN Propagation Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound

Reference 53

Resolution
verified exact
arxiv_id, observed 2026-07-04T10:19:48.029951Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=arxiv_source observed=2026-06-26T08:53:49.813049Z digest=sha256:15b53f0e053965a3f9c59c7fb72ce89b08f9a85435c4ddfd1940979c6cc9c632