Pith. sign in

Paper Citation Record · LEDGER

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

As of 11 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-11T06:34:44.6726+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:ccd7f8b946e33bc8ab67ba4f97d20ac7a277127a7c0c0cc7bdaf1f0bc0fcfd1a

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:1d288205cdde6f0737ba3d4d4f81e7cae9d3739eceda37018d9220463f1c28da

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.876819Z digest=sha256:11579fff9fcd631531e7a8e4522fe32d369450e574714cf1b30c101a70e32a60

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.882041Z digest=sha256:1ae294415beca95db1971f8b49e392e507eced18ca184bf1ed76cd556bec5312

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.892372Z digest=sha256:88dbc1cd57e485daf0e602dc9eaebb4e99410c9db04a631e0feaa7466a4610f0

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.898473Z digest=sha256:2671ba29c9b203dc5f98c28e3c915e2ac33f09a4a2e3190e9c0723ca610213ae

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.903389Z digest=sha256:5d5dc77cbd1a7776b3e593a7a75ce56936c9b0f07ef621c8409bcba946daaf49

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.908794Z digest=sha256:4774f75732523370280f3146dc7e3d02ca309d79ab0f0fdf0fe7d8f8f0804882

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.914020Z digest=sha256:6150b2419a2d9d09670f00deb1bb64f5836915d4a0a853ff99daa442828bea65

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.935218Z digest=sha256:2531ff617fe61c7ae5e3143865943cd62f512dc5e30cc57368bfc276eea1079a

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.945186Z digest=sha256:1a0e9af437196414592147348df2edaf52c32858e8b96427e1a0bd1ee96e0c1e

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.950422Z digest=sha256:19a632b93c71e75ba0ed6c9e231063c6271c5c92cd3794120ab2a75b8cab4718

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.960887Z digest=sha256:9d8c594fda95205628985ead859408855d2075c34c6ef3e72a8338b272ad517a

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:3fe66040f0cadbe53868037071e46f4772de8309c836dcc07b5cfdf7de815e60

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:02.999649Z digest=sha256:0f8480d3a5c851cc5be78e9f478d715d800c7f626657679650817e59a16ba392

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.020940Z digest=sha256:31dda6475a1b629f523fff77121e5bfc8988568a6685f76e82c4363aed248365

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.040070Z digest=sha256:9b7eb5f462e431d33eafd44df83cfb2d0998a05edee04e73cd8e4611bf90a0f7

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.045757Z digest=sha256:88d00ab338b55ece1ebffcd044e6314fc5672e4ad2c8d410e64e6290c0d5ca7c

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.053292Z digest=sha256:5d5735bbe4b05611f078330665f2e0c4bde46d8965ba60c763d4569fe00d9e2f

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.058543Z digest=sha256:4822269fafbb158671859fade07362faaa0a589629398d2f69676bda8339e37d

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.064295Z digest=sha256:41a299ed3da065d96904fb6c636d02ec6590f24e5cfdac0bd25ab9611556965f

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.069229Z digest=sha256:966b16b4154f0aecf9d7413973c7f5781298821ff4b9993444dbc2d8107c0540

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.084637Z digest=sha256:052bde4eb656ccb008424e99f065c416b63b2a782064598e40fce60874ff7036

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.090245Z digest=sha256:62a50d464867d367b0d1608d6347c9cd5bc70d761232f25b509b794e58d99429

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.105658Z digest=sha256:4b1421e9ab6693d4ac34224fdd9b8cea7dcedfd807a04a6ce501a7e5485a27b5

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.115800Z digest=sha256:76df350eb9d5c2c698d5b8cc60e2d52771d843f3b6c6ec8a2b62adafe65d9f14

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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:34800d83a9a7e85d83d807bc8610d197950deef1838912c7ba72c229ec39e917

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-10T20:43:03.137454Z digest=sha256:739c1c8271933d24c68e8c7e2c2e5901cbdfe7c911e6314d881d3f6753e1502c

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

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

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-06-26T08:53:49.813049Z digest=sha256:76cdc5b909fc38fec7750df94d808314b1066686f41d43a33eda454495d68f23