{"as_of":"2026-08-11T20:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:662d4e3825b7f596aa151d61a0d089e4d381e9f285cddcf5a46081c474fc7dd5","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:43:03.131600Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T18:57:31.645844Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-11T19:36:00.521078Z","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:5c99d0c6bb3b052d26c7256bf04df22abcc9a6ef68688815770456b0cdf3b5cb","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":{"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":"2409.12788","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.12788","snapshot_observed_at":"2026-07-10T18:57:31.645844Z","title":"Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance","venue":"cs.LG","work_id":"54ecef2f-2ff5-4d91-b60b-86ef7d65384a","year":2024},"citing_paper":{"arxiv_id":"2606.12840","last_updated":"2026-06-11T03:07:51Z","snapshot_observed_at":"2026-08-02T23:30:51.222748Z","submitted_at":"2026-06-11T03:07:51Z","title":"CLARITree: Cholesky and Lookahead Accelerations for Regression with Interpretable Piecewise Linear Trees","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-27T07:45:07.747074Z"},"links":{"cited_paper":"/paper/2409.12788","citing_paper":"/paper/2606.12840"},"observation_digest":"sha256:65705415067d397dfececd48a26a2a36e397e5a7e582c9cc05fb2920d8e67671","observation_id":"668cb147-0a08-4ccd-b4dd-16c028bf69eb","resolution":{"observed_at":"2026-07-03T13:38:19.204225Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2409.12788","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.12788","snapshot_observed_at":"2026-07-10T18:57:31.645844Z","title":"Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance","venue":"cs.LG","work_id":"54ecef2f-2ff5-4d91-b60b-86ef7d65384a","year":2024},"citing_paper":{"arxiv_id":"2607.07762","last_updated":"2026-07-08T15:27:30Z","snapshot_observed_at":"2026-08-04T13:31:34.079041Z","submitted_at":"2026-07-08T15:27:30Z","title":"Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T18:50:14.375126Z"},"links":{"cited_paper":"/paper/2409.12788","citing_paper":"/paper/2607.07762"},"observation_digest":"sha256:9455e2eea30beaff43413d97120008d932650f8a05862348b9803ab92a662c87","observation_id":"69aca67d-d26c-4615-b202-7edf52f30982","resolution":{"observed_at":"2026-07-10T18:57:31.647199Z","resolver_source":"local_arxiv","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/2409.12788/citation-record","integrity":"/paper/2409.12788/integrity","json":"/paper/2409.12788/citation-record.json","paper":"/paper/2409.12788"},"outbound":[],"paper":{"arxiv_id":"2409.12788","last_updated":"2026-08-06T11:43:28Z","latest_version":3,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2409.12788."}