{"as_of":"2026-08-12T10:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3a3179dd2ee1d52b3415368b99df733615feb51c81e5a4224a6f0e44b8aa6820","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:44:05.592838Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.20814/citation-record","integrity":"/paper/2506.20814/integrity","json":"/paper/2506.20814/citation-record.json","paper":"/paper/2506.20814"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:44:07.556140Z","title":"Pervasive and Mobile Computing 104, 101973 (2024)","venue":null,"work_id":"acff6d24-8c59-4b1d-af41-0aa4ed112cc4","year":2024},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:03.944959Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:86316fa8907d9b66db0aca02400c2c07417af3366320f4b4f42eb1241a296270","observation_id":"4f0991c9-4155-497e-a5c6-f427633c7b0f","resolution":{"observed_at":"2026-08-06T22:44:07.625969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.03731","last_updated":"2021-11-22T13:58:04Z","snapshot_observed_at":"2026-08-10T01:03:56.491176Z","submitted_at":"2017-08-11T23:28:48Z","title":"OpenML Benchmarking Suites","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.03731","snapshot_observed_at":"2026-08-06T22:44:04.015420Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:04.015420Z"},"links":{"cited_paper":"/paper/1708.03731","citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:7d959899891f31018d1a020e9c1eaae917031a88c4fddabe1836c0b94b47d614","observation_id":"e6fd2e48-71af-495a-89f6-08793036b644","resolution":{"observed_at":"2026-08-06T22:44:04.015420Z","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-06T22:44:04.146627Z","title":"Machine learning45, 5–32 (2001)","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:04.146627Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:25628e64d66012b42a239023132ed6af53b62740293cbba71b0a80ba2ff5f962","observation_id":"0eab8e98-2c8c-4c44-8861-947a8a8b52d2","resolution":{"observed_at":"2026-08-06T22:44:04.146627Z","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-06T22:44:07.345978Z","title":"In: Sixth International Conference on Data Mining (ICDM’06)","venue":null,"work_id":"01f78938-9eef-4283-8614-ec4296cbdec2","year":null},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:04.293795Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:f8ab0401f76de551c1fc1228293195780520286fd2a20df0db5de76780cf36d2","observation_id":"5389a55d-6292-463e-8ded-3df284ff3c18","resolution":{"observed_at":"2026-08-06T22:44:07.431884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T22:44:07.156325Z","title":"In: Proceedings of the twenty-first international conference on Machine learning","venue":null,"work_id":"5c2c88e2-167d-4ccb-ba02-6eb28889c1a4","year":2004},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:04.409851Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:738b600f57b21f41821e6a01e228edff8adebe746ea55e0e84ddf545963eeb18","observation_id":"77d5ce0d-2a4c-4dda-a514-9329e1537cbb","resolution":{"observed_at":"2026-08-06T22:44:07.219622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T22:44:07.019973Z","title":"Neural computing and applications22, 673–688 (2013)","venue":null,"work_id":"d50b5015-0e87-4735-8848-a0f49a4ea128","year":2013},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:04.545802Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:8e16859b4de3f3e1fc1792a9290d8c6ca2386101ebdddb447f0233a15423cd7d","observation_id":"d29e9e3f-c565-42eb-9d45-b5ad323677c8","resolution":{"observed_at":"2026-08-06T22:44:07.077655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T22:44:04.636106Z","title":"In: Proceedings of the 22nd ACM SIGKDD International Con- ference on Knowledge Discovery and Data Mining","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:04.636106Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:12e4e3a76e076c19076b4ccd7087caefaf1cc2ebecd3722a7a8378b5d3c53ee7","observation_id":"e3752ef8-1117-47fb-9e2b-3aeeca205e28","resolution":{"observed_at":"2026-08-06T22:44:04.636106Z","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-06T22:44:06.869700Z","title":"Pattern recognition48(5), 1925–1935 (2015)","venue":null,"work_id":"24315663-88ae-4474-87e6-6ece95791476","year":2015},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:04.707825Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:5ad3edaf5a529e3d1f0e415a26d58b60e51da47a70b03ef0465815f9e1da1326","observation_id":"c75db7b2-a5f2-49e5-b65a-388d88b66369","resolution":{"observed_at":"2026-08-06T22:44:06.941049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T22:44:06.766594Z","title":"Ensemble machine learn- ing: Methods and applications pp","venue":null,"work_id":"9e3ea5b0-137d-45b8-ad30-77c659226098","year":2012},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:04.794701Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:84541faae3400c6d5a4782a93e4f572633a3f2263179983cb891749e71b6ba9c","observation_id":"a058c5e1-8808-4180-831a-a1ab3d8e0892","resolution":{"observed_at":"2026-08-06T22:44:06.818115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T22:44:04.857702Z","title":"In: International work- shop on multiple classifier systems","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:04.857702Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:5b1136de3327188e8ce6f908e428dfc59edcfad6eabe938d9862208b1309ea83","observation_id":"7a524d5b-83c1-4406-99e3-41e02712e64a","resolution":{"observed_at":"2026-08-06T22:44:04.857702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-08-08T18:42:25.777499Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-08-06T22:44:04.913416Z","title":"arXiv preprint arXiv:2404.14618 (2024)","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-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:04.913416Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:9901a0e096b3849c81bf92ff446c234afbe9d48481ce9d08d898f9f19c7d3b7b","observation_id":"2802386e-945a-48bf-86ad-3d2abdc552f9","resolution":{"observed_at":"2026-08-06T22:44:04.913416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.06505","last_updated":"2020-03-13T23:10:39Z","snapshot_observed_at":"2026-08-11T01:55:19.859576Z","submitted_at":"2020-03-13T23:10:39Z","title":"AutoGluon-Tabular: Robust and Accurate AutoML for Structured Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.06505","snapshot_observed_at":"2026-08-06T22:44:05.037737Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:05.037737Z"},"links":{"cited_paper":"/paper/2003.06505","citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:d3ecca4f746abfeb70cb85db3fca8caa91d6d9a5d9322cfc69b598434171b2e4","observation_id":"062da00c-42e3-4dea-9a8d-fd9240d604b2","resolution":{"observed_at":"2026-08-06T22:44:05.037737Z","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-06T22:44:05.110002Z","title":"Journal of Machine Learning Research 23(261), 1–61 (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:05.110002Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:b72d17ea4734ea939384e060f9d453ecef3612e2cd42bd71f43ee7fa8ff71c59","observation_id":"d03ad751-c7b0-4bd4-8283-6dff553584ef","resolution":{"observed_at":"2026-08-06T22:44:05.110002Z","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-06T22:44:05.172184Z","title":"Journal of computer and system sciences55(1), 119–139 (1997)","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:05.172184Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:dc75a447b8b9a620bc12c9e49d3f4f9775c4abf48680fbfd23a8603321515f8e","observation_id":"3f19760b-1982-4139-93dd-e3dc1f97aac8","resolution":{"observed_at":"2026-08-06T22:44:05.172184Z","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-06T22:44:06.596519Z","title":"Pattern Recognition34(9), 1879–1881 (2001)","venue":null,"work_id":"81f15dd8-5051-4ebc-ac73-40559bec1377","year":2001},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:05.235462Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:2e538bfd13d4cd377741b65fc4f18fc93b7ec046d496eefe500112a16608f113","observation_id":"562dec42-5173-4987-a30c-8e23fc9f2fae","resolution":{"observed_at":"2026-08-06T22:44:06.660043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T22:44:06.473591Z","title":"Pattern recognition41(5), 1718–1731 (2008)","venue":null,"work_id":"21e4bdf6-8344-4899-8837-79416f463109","year":2008},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:05.295453Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:0f15fb998db9b4ac6355d51c19463ba28e010b3ce0c9919b30de5dca0dc25bf3","observation_id":"ee9981aa-7c7e-41d5-9ee0-d71cfd5c74ae","resolution":{"observed_at":"2026-08-06T22:44:06.529414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-10T01:05:03.922701Z","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:ce7290cd0e3384db4a0f92fa4840e004f164a256fc7a5becb54d75ece7041146","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:44:06.302587Z","title":"In: International Conference on Machine Learning","venue":null,"work_id":"6aa8a033-b6da-4541-a7b3-f48c8d5f1b24","year":2017},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:05.418258Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:bb5db74a75f13fab6928701a78c1bc716df55371bdceadbb61adabe31ea8ed5c","observation_id":"d12b4a81-a257-48ba-86a0-7fec8b0e9536","resolution":{"observed_at":"2026-08-06T22:44:06.374444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.06212","last_updated":"2016-03-20T13:32:27Z","snapshot_observed_at":"2026-07-06T04:50:04.982482Z","submitted_at":"2016-03-20T13:32:27Z","title":"Evaluation of a Tree-based Pipeline Optimization Tool for Automating Data Science","version":1},"cited_work":{"arxiv_id":"1603.06212","doi":null,"metadata_source":"pith","pith_arxiv_id":"1603.06212","snapshot_observed_at":"2026-08-06T22:44:05.712217Z","title":"Evaluation of a Tree-based Pipeline Optimization Tool for Automating Data Science","venue":"cs.NE","work_id":"8ca5067e-2b0a-49c6-b63e-c0d19adc4628","year":2016},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:05.496014Z"},"links":{"cited_paper":"/paper/1603.06212","citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:95116679be3e098a7ec50ece00059bb88ce7013ccfdde87a82bab3dfe9bef036","observation_id":"7b7a31ea-2197-4e5e-9a5a-c70c65d88265","resolution":{"observed_at":"2026-08-06T22:44:05.767153Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T22:44:06.130834Z","title":"Wiley interdisciplinary reviews: data min- ing and knowledge discovery5(1), 21–34 (2015)","venue":null,"work_id":"a38cba76-99be-4a2d-8b69-cf911eb969e1","year":2015},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:05.530974Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:12ab4b36f4a7b03d81757267493c4c3030ca00cadd973669093356785a6e6ea0","observation_id":"ef1dc717-33d8-4321-8feb-46828f7b4960","resolution":{"observed_at":"2026-08-06T22:44:06.207922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-06T22:44:06.022227Z","title":"IEEE transactions on pattern analysis and machine intelligence 19(4), 405–410 (1997)","venue":null,"work_id":"3866bdf1-42a1-438b-9dd4-ef12e8fda414","year":1997},"citing_paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T22:44:05.592838Z"},"links":{"citing_paper":"/paper/2506.20814"},"observation_digest":"sha256:414d291106f599cb603e0dc67d123b3fa3300da3e8e37b0338ae42b6876c5228","observation_id":"6e195b9a-cb9e-491c-9972-48887603d603","resolution":{"observed_at":"2026-08-06T22:44:06.060142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.20814","last_updated":"2025-06-25T20:26:04Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T01:05:03.922701Z","submitted_at":"2025-06-25T20:26:04Z","title":"Divide, Specialize, and Route: A New Approach to Efficient Ensemble Learning"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":11},"total_outbound_references":21},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2506.20814."}