{"as_of":"2026-08-11T17:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:da382aeff4c1548895a7933e92dfd8642bafe63bd1a02f538a6abc1d38ce141f","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:43:03.152300Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T08:53:49.813049Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T10:19:48.028651Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"cited_work":{"arxiv_id":"2501.07903","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.07903","snapshot_observed_at":"2026-07-04T10:19:48.028651Z","title":"arXiv preprint arXiv:2501.07903 , year=","venue":null,"work_id":"e2423129-6d6e-457c-acdf-45c9b65dbc0c","year":null},"citing_paper":{"arxiv_id":"2606.23572","last_updated":"2026-06-22T16:38:50Z","snapshot_observed_at":"2026-07-06T23:58:16.163783Z","submitted_at":"2026-06-22T16:38:50Z","title":"A Spectral Theory of Normalized Corrected GNN Propagation","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-06-26T08:53:49.813049Z"},"links":{"cited_paper":"/paper/2501.07903","citing_paper":"/paper/2606.23572"},"observation_digest":"sha256:76cdc5b909fc38fec7750df94d808314b1066686f41d43a33eda454495d68f23","observation_id":"7d8e0e4b-2eae-4f36-aac1-b90999388717","resolution":{"observed_at":"2026-07-04T10:19:48.029951Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.07903/citation-record","integrity":"/paper/2501.07903/integrity","json":"/paper/2501.07903/citation-record.json","paper":"/paper/2501.07903"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:02.851188Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.851188Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:ccd7f8b946e33bc8ab67ba4f97d20ac7a277127a7c0c0cc7bdaf1f0bc0fcfd1a","observation_id":"d9f1a423-3a19-46da-9cda-c4fa845c2d64","resolution":{"observed_at":"2026-08-10T20:43:02.851188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:02.857441Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.857441Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:1d288205cdde6f0737ba3d4d4f81e7cae9d3739eceda37018d9220463f1c28da","observation_id":"11078ea4-f477-46b1-8d8e-6884decf7b5f","resolution":{"observed_at":"2026-08-10T20:43:02.857441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:04.098949Z","title":null,"venue":null,"work_id":"6bc38a9f-fdd0-4d38-8300-ff3d91584286","year":2024},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.863275Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:c82b87da1b7f1b94edefd3f071d73ac0f86b2d08c9bc67336ba1c58e79536061","observation_id":"0e802b5c-f846-43b5-b0fc-8a072ec20831","resolution":{"observed_at":"2026-08-10T20:43:04.103993Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:04.082210Z","title":null,"venue":null,"work_id":"bc76d16d-335c-46a0-9f40-237bebe91931","year":2020},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.871351Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:ebcc54acfbe212bf965f1c8659b090aa3d9b4c8eab90787d4e575a782a1b1dad","observation_id":"9b06ed3d-e73f-4bff-a442-4227b6ddec4b","resolution":{"observed_at":"2026-08-10T20:43:04.087651Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:04.066462Z","title":null,"venue":null,"work_id":"98222a1b-baa7-4776-b133-6f368bf0cfc0","year":2020},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.876819Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:11579fff9fcd631531e7a8e4522fe32d369450e574714cf1b30c101a70e32a60","observation_id":"96e07195-b748-4d4c-84d3-e8b5d834926b","resolution":{"observed_at":"2026-08-10T20:43:04.070989Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:04.050021Z","title":null,"venue":null,"work_id":"d8107402-ffab-4ac5-a212-17534adad2c5","year":2024},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.882041Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:1ae294415beca95db1971f8b49e392e507eced18ca184bf1ed76cd556bec5312","observation_id":"8c1a3573-1cae-432c-b5d6-79d0c8009fa4","resolution":{"observed_at":"2026-08-10T20:43:04.054593Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:04.032489Z","title":null,"venue":null,"work_id":"124bd27e-84ce-4043-ac47-e27b78bb6868","year":2023},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.887218Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:4829854877fddbb65e1cf96219b3fde97240f9848f132f14533b6b982cd409c1","observation_id":"2212d336-f020-48dc-aefe-6b466399a257","resolution":{"observed_at":"2026-08-10T20:43:04.038656Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:04.013513Z","title":"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","venue":null,"work_id":"281189ed-cd3a-47f7-a7b8-828d231663b0","year":2020},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.892372Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:88dbc1cd57e485daf0e602dc9eaebb4e99410c9db04a631e0feaa7466a4610f0","observation_id":"e4ed139f-42be-4ce4-a4db-4a4b4e68a9fe","resolution":{"observed_at":"2026-08-10T20:43:04.020859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.996539Z","title":null,"venue":null,"work_id":"3f1a73ef-457d-456c-b1b6-df63b94532c4","year":2020},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.898473Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:2671ba29c9b203dc5f98c28e3c915e2ac33f09a4a2e3190e9c0723ca610213ae","observation_id":"e3bc9536-9058-47f6-a36a-bfff4582c519","resolution":{"observed_at":"2026-08-10T20:43:04.001923Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.980535Z","title":null,"venue":null,"work_id":"c3e596ca-5e35-447c-9a33-b49afe58fc40","year":2017},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.903389Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:5d5dc77cbd1a7776b3e593a7a75ce56936c9b0f07ef621c8409bcba946daaf49","observation_id":"a08de068-6048-4e07-a315-1e4c9dc9e759","resolution":{"observed_at":"2026-08-10T20:43:03.985395Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.963806Z","title":null,"venue":null,"work_id":"c51dfffc-b299-4c9e-98a1-d97342beb549","year":2012},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.908794Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:4774f75732523370280f3146dc7e3d02ca309d79ab0f0fdf0fe7d8f8f0804882","observation_id":"7d73d96d-2f7a-4096-841a-a07f587fda92","resolution":{"observed_at":"2026-08-10T20:43:03.969303Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.946295Z","title":null,"venue":null,"work_id":"9f07a412-afe1-4dda-add5-4c1c523b4e7d","year":2007},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.914020Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:6150b2419a2d9d09670f00deb1bb64f5836915d4a0a853ff99daa442828bea65","observation_id":"12103e49-6d97-4811-9162-4e8cd4ec6533","resolution":{"observed_at":"2026-08-10T20:43:03.951256Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.930927Z","title":"H.; Olshen, R","venue":null,"work_id":"eeb2325a-d8ce-43ae-9173-ede8246d6b23","year":1984},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.918983Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:c08c7649ef8c7d77b2b50605afb822bd5ebc1f2fffafe8e7ec281718f7a132db","observation_id":"dd728e7b-5201-4e42-b91b-9ff075bf4f99","resolution":{"observed_at":"2026-08-10T20:43:03.935367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.914119Z","title":null,"venue":null,"work_id":"181ddbe4-0716-4e95-933e-48e274773cf2","year":1990},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.923924Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:cf80f5e157433f1dade37db3225b2a8f16bdca709365a395465654af64a2699e","observation_id":"30978d85-bcff-49f6-b7f9-b42155b0f058","resolution":{"observed_at":"2026-08-10T20:43:03.919886Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.897502Z","title":null,"venue":null,"work_id":"9ff2c2ab-5436-48b0-a601-853a8cce3328","year":2010},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.930181Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:70eb382b81851fea5becfe18bf331aa4967cf25d2fc759aba84f73109632b5de","observation_id":"8de368ff-52c1-401f-a3c7-00fd9cd26e0c","resolution":{"observed_at":"2026-08-10T20:43:03.902794Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.879119Z","title":null,"venue":null,"work_id":"e32de282-e689-430b-8794-705380c5c5f6","year":2016},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.935218Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:2531ff617fe61c7ae5e3143865943cd62f512dc5e30cc57368bfc276eea1079a","observation_id":"1175d261-517a-4971-bcb4-f8073824d4a9","resolution":{"observed_at":"2026-08-10T20:43:03.885452Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.859686Z","title":null,"venue":null,"work_id":"acb73aca-06da-4770-b438-dba23b13a027","year":2019},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.940014Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:87ffa377874d92b1318e1893c9ea4ca0a657eb8f36685a5dc5b390ab31846df9","observation_id":"013fad9b-7a0c-41e3-8daa-5d61535b0018","resolution":{"observed_at":"2026-08-10T20:43:03.865986Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.840998Z","title":null,"venue":null,"work_id":"a7c0cf70-b654-45d9-a942-c6361a1a055e","year":2020},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.945186Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:1a0e9af437196414592147348df2edaf52c32858e8b96427e1a0bd1ee96e0c1e","observation_id":"37818010-f8c4-477a-afb4-86ebb0f1e9d1","resolution":{"observed_at":"2026-08-10T20:43:03.846915Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.823437Z","title":"G.; and Pedreira, C","venue":null,"work_id":"364e99c1-0cc4-44b2-804c-aed1d3ac7dc3","year":2023},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.950422Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:19a632b93c71e75ba0ed6c9e231063c6271c5c92cd3794120ab2a75b8cab4718","observation_id":"6d9e653f-a4e6-45d2-b8d4-8cff01e21c4e","resolution":{"observed_at":"2026-08-10T20:43:03.828931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.806399Z","title":null,"venue":null,"work_id":"80229402-e4d7-43ea-a8ca-3f4ec5cfa580","year":2023},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.956222Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:83c9ee404d0ac398d41f5ee48f3ec16c69a9a86aac73e482d06c156c8eeace42","observation_id":"d726a28b-f05a-47d3-b4ae-07fc2e9c76d7","resolution":{"observed_at":"2026-08-10T20:43:03.811674Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.788262Z","title":null,"venue":null,"work_id":"71be1881-eb2f-41ab-9a6f-828786975dc4","year":2022},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.960887Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:9d8c594fda95205628985ead859408855d2075c34c6ef3e72a8338b272ad517a","observation_id":"7024c6f8-0143-4be7-99e9-70f0942e0c8b","resolution":{"observed_at":"2026-08-10T20:43:03.794045Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:02.965488Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.965488Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:3fe66040f0cadbe53868037071e46f4772de8309c836dcc07b5cfdf7de815e60","observation_id":"6371b513-c70e-45c0-9b13-c2c5da8160d0","resolution":{"observed_at":"2026-08-10T20:43:02.965488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.754727Z","title":null,"venue":null,"work_id":"ff2c54d1-1ff5-49b1-ba1b-8b63a0f80e07","year":2020},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.970166Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:57822500a6db04cbb8efb0c72ce0f9d2f809aca21278d925fd27f72c44e65756","observation_id":"864ad67b-e14f-4645-adf4-f0f2f8262871","resolution":{"observed_at":"2026-08-10T20:43:03.759732Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.738304Z","title":null,"venue":null,"work_id":"53c2beaf-d485-4580-a545-94299c323604","year":2021},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.975231Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:e8af83700f6fe51ed4cb8761feab8b7275c2c821aa3e4e42e1976b8363cf34ee","observation_id":"102bc4fe-9fa8-41b7-ac30-ef2a3ddf78cc","resolution":{"observed_at":"2026-08-10T20:43:03.743550Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.722085Z","title":null,"venue":null,"work_id":"08e90824-6ab4-400d-b793-cb0202bb535f","year":2020},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.980240Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:bfc407d76632028941f14451f6a01d5e1a8c7fed628dedbcd61ae84cde47ccdd","observation_id":"98fc52b0-a549-41d8-af30-b0ad277796b9","resolution":{"observed_at":"2026-08-10T20:43:03.726815Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.705725Z","title":null,"venue":null,"work_id":"3e7877db-b109-4511-a456-fde2ec33a496","year":2019},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.985052Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:1b91c56ac2a781a7a457cd8135c5dc45c572264f1e4a9166882f2eca86c2043d","observation_id":"7ba3687c-29f9-4525-800c-d0702ceef925","resolution":{"observed_at":"2026-08-10T20:43:03.710673Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.687060Z","title":null,"venue":null,"work_id":"b67bd634-380b-40af-bc1b-c8f7b5bd4dd0","year":2022},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.989674Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:bce264e51be24a9bde95de2e1e3fbe7c0c191335e9ca8963348b60d3fb35b29d","observation_id":"bc632741-f47f-430e-8ba3-37b059016b73","resolution":{"observed_at":"2026-08-10T20:43:03.692472Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.668673Z","title":null,"venue":null,"work_id":"14900b46-9d67-4002-9bdf-8508bf8c9d6b","year":1976},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.995209Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:f4b3ce66926727b3381842747f51d22ff0a72ef12f45b96091831274836eeeaf","observation_id":"ff8e75c7-db6a-4ce0-8fc0-d402edfc74c2","resolution":{"observed_at":"2026-08-10T20:43:03.674891Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.652041Z","title":null,"venue":null,"work_id":"0d41845f-110b-4420-9412-403977fb5e79","year":2020},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:02.999649Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:0f8480d3a5c851cc5be78e9f478d715d800c7f626657679650817e59a16ba392","observation_id":"83339c7e-57ce-41d2-9a7b-34e1a21f64f5","resolution":{"observed_at":"2026-08-10T20:43:03.657119Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.635784Z","title":null,"venue":null,"work_id":"f681ff4d-4e0a-4f84-b620-058c50115c7a","year":2014},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.004296Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:eb8b8d82061f1ce247cbbba03bc9b9e67c3906a6a401cc75ae72b240ef6ef13e","observation_id":"eb60dc13-065d-49e9-a18e-fd27e580ddf1","resolution":{"observed_at":"2026-08-10T20:43:03.640847Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.619906Z","title":null,"venue":null,"work_id":"2d9813cc-8aef-4366-add8-bc8287ce42d6","year":2022},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.009620Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:d0d3f4475754ea2276ac6d894de7b8debd1c10c984bca69f40bf6bfd620f23a5","observation_id":"5c9d83ab-a67f-490d-926d-2e8970e13a88","resolution":{"observed_at":"2026-08-10T20:43:03.624826Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.603947Z","title":null,"venue":null,"work_id":"e9d79f4e-904f-49ae-a228-5c320e710cc1","year":2020},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.014741Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:8d1bc2f48452fab0d449508dd87152ffd686773928fc58802f95aff463fd69af","observation_id":"d262170b-7397-4a4c-9bf6-8c0e9f02eff0","resolution":{"observed_at":"2026-08-10T20:43:03.609031Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.588786Z","title":null,"venue":null,"work_id":"ee314d2e-4724-43d7-a7c4-b68caaafb377","year":2020},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.020940Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:31dda6475a1b629f523fff77121e5bfc8988568a6685f76e82c4363aed248365","observation_id":"90b7b07f-5994-4c43-9abb-b71917fd8b05","resolution":{"observed_at":"2026-08-10T20:43:03.593655Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.572533Z","title":"T.; and Hermes, C","venue":null,"work_id":"3f51dd7b-67f1-465f-a41d-be8315378990","year":2024},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.026845Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:12235d3214d47e1d2fa084ffc4e11fbda40589a5dbb1bd966e2adaecde13af3e","observation_id":"fcdef80c-24eb-42a4-8f1f-ebba13be3fe0","resolution":{"observed_at":"2026-08-10T20:43:03.576924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.556351Z","title":null,"venue":null,"work_id":"34e7ca39-3de2-442d-9cd3-c34a020599c4","year":2013},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.033968Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:a8ed29a4d0cfc79ca6c69dacb1e06f1465a53f3a170d85fe0004d31f53756803","observation_id":"41b4c6f9-c6f3-4ac8-a99c-b09c6457a77e","resolution":{"observed_at":"2026-08-10T20:43:03.561279Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.539639Z","title":"J.; Stappers, B","venue":null,"work_id":"199c4838-4bb5-447a-92ef-4005bb125ba9","year":2016},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.040070Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:9b7eb5f462e431d33eafd44df83cfb2d0998a05edee04e73cd8e4611bf90a0f7","observation_id":"80522130-c2fe-41cd-9d35-89134afbcfdb","resolution":{"observed_at":"2026-08-10T20:43:03.545115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.524225Z","title":null,"venue":null,"work_id":"3c81d1b0-1566-4c31-9408-8b4966985102","year":1995},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.045757Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:88d00ab338b55ece1ebffcd044e6314fc5672e4ad2c8d410e64e6290c0d5ca7c","observation_id":"2decb52e-eeb1-4947-98d0-8f907d938ed9","resolution":{"observed_at":"2026-08-10T20:43:03.529030Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.508003Z","title":null,"venue":null,"work_id":"28f2847f-545a-43fb-b0f2-6f0aa0ebab7c","year":2022},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.053292Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:5d5735bbe4b05611f078330665f2e0c4bde46d8965ba60c763d4569fe00d9e2f","observation_id":"89024d8f-97ca-491e-aec5-ba95bf1c85f1","resolution":{"observed_at":"2026-08-10T20:43:03.513373Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.492760Z","title":null,"venue":null,"work_id":"a0dfc63e-9f03-4a8f-8c40-23a26669287f","year":2022},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.058543Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:4822269fafbb158671859fade07362faaa0a589629398d2f69676bda8339e37d","observation_id":"5ac27c08-0b97-4f73-a43c-492935af3dd4","resolution":{"observed_at":"2026-08-10T20:43:03.497597Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.478093Z","title":"K.; and Salzberg, S","venue":null,"work_id":"b5cf9055-3d65-4ff1-a48e-0ac178af3491","year":1995},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.064295Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:41a299ed3da065d96904fb6c636d02ec6590f24e5cfdac0bd25ab9611556965f","observation_id":"2eb1d5be-9e67-41f6-bdad-e852c86a9d88","resolution":{"observed_at":"2026-08-10T20:43:03.482616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.461729Z","title":null,"venue":null,"work_id":"9cd6e791-fe5c-4a71-bfe6-ff1157872d48","year":2018},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.069229Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:966b16b4154f0aecf9d7413973c7f5781298821ff4b9993444dbc2d8107c0540","observation_id":"b3b843ba-4385-4b5e-93f2-f136413e6a60","resolution":{"observed_at":"2026-08-10T20:43:03.467467Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.446213Z","title":null,"venue":null,"work_id":"406928c7-3f15-409e-b1db-5fc68cb11065","year":2007},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.074323Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:df8cdacfed05a7d816258de5a4f985cbc75e32dadb5749edae6df174e5c398f5","observation_id":"00328540-2c35-4125-8261-3a9e4eb0f10a","resolution":{"observed_at":"2026-08-10T20:43:03.451010Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.430019Z","title":null,"venue":null,"work_id":"529e0630-d725-42ba-b937-5791ae8971b7","year":2010},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.079183Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:db10e33e99f0c8aa1011a6fcf09196e015ff7c5e9f50024965145b10c54f833c","observation_id":"ee32da83-a4aa-4420-a669-43498ef4b3d7","resolution":{"observed_at":"2026-08-10T20:43:03.435241Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.414159Z","title":null,"venue":null,"work_id":"ba1f3c0c-58d9-41fa-8759-ab755cb9fa61","year":1993},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.084637Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:052bde4eb656ccb008424e99f065c416b63b2a782064598e40fce60874ff7036","observation_id":"e10c42c9-b251-4c2e-83af-4e3268aec651","resolution":{"observed_at":"2026-08-10T20:43:03.419188Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.399525Z","title":null,"venue":null,"work_id":"dcd837d5-3643-4d88-b72f-61412d9f692e","year":2013},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.090245Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:62a50d464867d367b0d1608d6347c9cd5bc70d761232f25b509b794e58d99429","observation_id":"ce6c4ec0-7e7a-4008-b1b3-57e9fd46423d","resolution":{"observed_at":"2026-08-10T20:43:03.403997Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.383305Z","title":null,"venue":null,"work_id":"a68878b2-e221-4fd8-8220-6abb5c4e25ca","year":2019},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.095702Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:fae1fb12e16ac82cbca66447311ea840304c69cfc8bb93b7442f817af6d64364","observation_id":"a62e4cae-4e19-4d68-b919-8dbe3a927863","resolution":{"observed_at":"2026-08-10T20:43:03.388465Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.365599Z","title":null,"venue":null,"work_id":"b1baa67f-8d6f-4066-8c30-19b781c576dc","year":2021},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.100701Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:fe5919b8c42c2c7cdf14baa68da6d402d63a3cc09c42e31dc5d02b4041675937","observation_id":"ae5c3ea1-ba98-426a-8539-cc9d726b158a","resolution":{"observed_at":"2026-08-10T20:43:03.370817Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.343395Z","title":null,"venue":null,"work_id":"85fc8443-3ce2-48f3-a3d2-e216244d1869","year":2023},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.105658Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:4b1421e9ab6693d4ac34224fdd9b8cea7dcedfd807a04a6ce501a7e5485a27b5","observation_id":"81b321c2-21c4-419a-a6f1-5ff02562ea1c","resolution":{"observed_at":"2026-08-10T20:43:03.351433Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.326121Z","title":"P.; Jain, V.; Chaudhari, S.; Kraemer, F","venue":null,"work_id":"7d7106aa-183c-4283-87d7-9e6723db791b","year":2018},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.110652Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:e6b59b786048594b5739ae445e21feef0e1239b5fdeab1d80ba6a6e17adbfd9d","observation_id":"f5dc84ee-2774-4cc8-95c8-dc711e57f119","resolution":{"observed_at":"2026-08-10T20:43:03.331149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.308692Z","title":null,"venue":null,"work_id":"e478d97d-4073-4af9-ac55-f57b37f54018","year":2018},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.115800Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:76df350eb9d5c2c698d5b8cc60e2d52771d843f3b6c6ec8a2b62adafe65d9f14","observation_id":"4d48eaf7-2673-4a48-b040-bead737f93a6","resolution":{"observed_at":"2026-08-10T20:43:03.313820Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.291086Z","title":null,"venue":null,"work_id":"7b2b7979-aa10-4f0f-810a-965ba9fcf8a1","year":2024},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.121289Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:1936ad9bf1bba58c7cc28d196d759f4c3f076eff2b3da02668fbe09ab9b40d7d","observation_id":"aa8cf464-59e0-4754-a141-4326703c5799","resolution":{"observed_at":"2026-08-10T20:43:03.296880Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.273429Z","title":null,"venue":null,"work_id":"07e4be43-d4d8-45d5-b7d3-f22f3e6bf257","year":2023},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.126444Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:d77a4512cc99dfde33d7968fd44240b708b4724333dfc0478375c84649949057","observation_id":"c6375683-e7de-46c5-8c47-4658d76f118e","resolution":{"observed_at":"2026-08-10T20:43:03.278469Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12788","last_updated":"2026-08-06T11:43:28Z","snapshot_observed_at":"2026-08-09T23:11:52.745760Z","submitted_at":"2024-09-19T13:55:29Z","title":"Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12788","snapshot_observed_at":"2026-08-10T20:43:03.131600Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.131600Z"},"links":{"cited_paper":"/paper/2409.12788","citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:34800d83a9a7e85d83d807bc8610d197950deef1838912c7ba72c229ec39e917","observation_id":"ef4047f5-f81c-4306-bb36-f96a2aba05b8","resolution":{"observed_at":"2026-08-10T20:43:03.131600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.256683Z","title":null,"venue":null,"work_id":"57228e09-3e68-4ba2-bf44-d8b864c11765","year":2020},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.137454Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:739c1c8271933d24c68e8c7e2c2e5901cbdfe7c911e6314d881d3f6753e1502c","observation_id":"89f852b0-fe02-4011-844f-d7232523ac4e","resolution":{"observed_at":"2026-08-10T20:43:03.262137Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.240057Z","title":null,"venue":null,"work_id":"5a45eabb-c623-4f40-9fd2-1371949c35a8","year":2017},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.142735Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:39fec2c88c6b0565b28a29fa25f3e322efc53a9d02974c20f039cef281b7f37e","observation_id":"402f1f28-e018-43c2-afde-fbaa3391abbc","resolution":{"observed_at":"2026-08-10T20:43:03.244968Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.224242Z","title":null,"venue":null,"work_id":"590a4618-9081-4295-b365-f54d4e0a9903","year":2019},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.147597Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:9009749f9c6cf08e32bd14fc09cbcc8995cb51b6515c7c36c00aa04ec6c475d4","observation_id":"6ddb1358-fb67-4ede-b05a-ce8d462f1480","resolution":{"observed_at":"2026-08-10T20:43:03.228933Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T20:43:03.205987Z","title":null,"venue":null,"work_id":"448c2d6b-580c-4023-a491-c240230ee998","year":2023},"citing_paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-10T20:43:03.152300Z"},"links":{"citing_paper":"/paper/2501.07903"},"observation_digest":"sha256:a1c278a1b2628fe763b51251931ba453f1e4da880d35e0a809ad4ea3f7a0544b","observation_id":"accfa9f0-8152-48db-a370-ac75766f7262","resolution":{"observed_at":"2026-08-10T20:43:03.212265Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.07903","last_updated":"2025-01-14T07:46:33Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T20:28:38.456848Z","submitted_at":"2025-01-14T07:46:33Z","title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":50,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":57},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"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."}