{"as_of":"2026-08-07T21:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1b1270a1c7b04af500c5647c7dd51cddc43d0486daf505c77001e35fd7a6cf47","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:27:25.720299Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":71,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.02997","last_updated":"2024-07-15T19:00:47Z","snapshot_observed_at":"2026-07-06T15:23:21.708631Z","submitted_at":"2023-05-04T17:04:41Z","title":"When Do Neural Nets Outperform Boosted Trees on Tabular Data?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.02997","snapshot_observed_at":"2026-08-07T15:27:25.720299Z","title":"Hrushikesh Narhar Mhaskar and Devidas V","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15228","last_updated":"2025-05-21T07:59:12Z","snapshot_observed_at":"2026-08-07T15:19:32.261593Z","submitted_at":"2025-05-21T07:59:12Z","title":"Degree-Optimized Cumulative Polynomial Kolmogorov-Arnold Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:27:25.720299Z"},"links":{"cited_paper":"/paper/2305.02997","citing_paper":"/paper/2505.15228"},"observation_digest":"sha256:a18e36ed7282316267f03f9b9f9d989fc1437ab427ec8d06f25cba15e6d7261d","observation_id":"304980eb-1945-4675-ab72-c24602fe1f0f","resolution":{"observed_at":"2026-08-07T15:27:25.720299Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02997","last_updated":"2024-07-15T19:00:47Z","snapshot_observed_at":"2026-07-06T15:23:21.708631Z","submitted_at":"2023-05-04T17:04:41Z","title":"When Do Neural Nets Outperform Boosted Trees on Tabular Data?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.02997","snapshot_observed_at":"2026-08-07T04:45:19.869101Z","title":"2023, arXiv e-prints, arXiv:2305.02997, doi: 10.48550/arXiv.2305.02997 M¨ oller, A., Peloton, J., Ishida, E","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.09778","last_updated":"2025-09-08T09:08:12Z","snapshot_observed_at":"2026-08-07T04:38:14.101655Z","submitted_at":"2025-06-11T14:18:39Z","title":"The ATLAS Virtual Research Assistant","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:45:19.869101Z"},"links":{"cited_paper":"/paper/2305.02997","citing_paper":"/paper/2506.09778"},"observation_digest":"sha256:fb070a79fb93b90115175508adba11c400eaca88871d70dab550a8c285c3dbfc","observation_id":"30480d1b-bef4-4a28-8931-2893239ab205","resolution":{"observed_at":"2026-08-07T04:45:19.869101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02997","last_updated":"2024-07-15T19:00:47Z","snapshot_observed_at":"2026-07-06T15:23:21.708631Z","submitted_at":"2023-05-04T17:04:41Z","title":"When Do Neural Nets Outperform Boosted Trees on Tabular Data?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.02997","snapshot_observed_at":"2026-08-06T22:44:05.361071Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-06T22:38:52.744094Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:05.361071Z"},"links":{"cited_paper":"/paper/2305.02997","citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:3ffae3b5b32505476bccd91ed4846ce99551f11e3e9c22c3ae65a43720848391","observation_id":"edd440ea-9030-48c4-aa55-b60cb2a8626c","resolution":{"observed_at":"2026-08-06T22:44:05.361071Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02997","last_updated":"2024-07-15T19:00:47Z","snapshot_observed_at":"2026-07-06T15:23:21.708631Z","submitted_at":"2023-05-04T17:04:41Z","title":"When Do Neural Nets Outperform Boosted Trees on Tabular Data?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.02997","snapshot_observed_at":"2026-08-06T18:36:47.933777Z","title":"P., Feuer, B., Hegde, C., Ramakrishnan, G., Goldblum, M., and White, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07829","last_updated":"2025-07-10T15:01:31Z","snapshot_observed_at":"2026-08-07T18:02:16.058291Z","submitted_at":"2025-07-10T15:01:31Z","title":"Towards Benchmarking Foundation Models for Tabular Data With Text","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T18:36:47.933777Z"},"links":{"cited_paper":"/paper/2305.02997","citing_paper":"/paper/2507.07829"},"observation_digest":"sha256:4f1a677b139ddcdd5d852ef6a5346edf904644468997e5af845f04d3d35472ad","observation_id":"3c40f97a-7d09-4260-87f3-95a17bc30202","resolution":{"observed_at":"2026-08-06T18:36:47.933777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02997","last_updated":"2024-07-15T19:00:47Z","snapshot_observed_at":"2026-07-06T15:23:21.708631Z","submitted_at":"2023-05-04T17:04:41Z","title":"When Do Neural Nets Outperform Boosted Trees on Tabular Data?","version":4},"cited_work":{"arxiv_id":"2305.02997","doi":"10.48550/arxiv.2305.02997","metadata_source":"arxiv_reference","pith_arxiv_id":"2305.02997","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Multi-fidelity B ayesian optimization with unreliable information sources","venue":"arXiv (Cornell University)","work_id":"13d9bb0a-0bf3-40db-a964-d23503a30173","year":2023},"citing_paper":{"arxiv_id":"2605.04895","last_updated":"2026-05-06T13:27:00Z","snapshot_observed_at":"2026-07-06T23:17:38.226365Z","submitted_at":"2026-05-06T13:27:00Z","title":"Regime-Conditioned Evaluation in Multi-Context Bayesian Optimization","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-08T16:43:07.439427Z"},"links":{"cited_paper":"/paper/2305.02997","citing_paper":"/paper/2605.04895"},"observation_digest":"sha256:5b7dc9ca4e2ad159986ae03e06e81416f05e615c19936d0381e60c8d5c9455a2","observation_id":"4daf73d0-48fe-4be8-aa2c-3b1397919581","resolution":{"observed_at":"2026-05-08T16:48:28.640725Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.02997/citation-record","integrity":"/paper/2305.02997/integrity","json":"/paper/2305.02997/citation-record.json","paper":"/paper/2305.02997"},"outbound":[],"paper":{"arxiv_id":"2305.02997","last_updated":"2024-07-15T19:00:47Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T15:23:21.708631Z","submitted_at":"2023-05-04T17:04:41Z","title":"When Do Neural Nets Outperform Boosted Trees on Tabular Data?"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2305.02997."}