{"as_of":"2026-08-08T17:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5b6d54a7b8b823cf73def8417fe7da834f1b683a67f72722dd9cc77cac3c1d41","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T23:05:57.024334Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2508.05957/citation-record","integrity":"/paper/2508.05957/integrity","json":"/paper/2508.05957/citation-record.json","paper":"/paper/2508.05957"},"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-05T23:05:57.395395Z","title":"Castelvecchi, ``Can we open the black box of ai?'' Nature News, vol","venue":null,"work_id":"01939721-4026-4210-a5d7-53ce7c98e468","year":2016},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.941401Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:d78b34d276924ae29d513f1a0c41ddf41e8fb0ae0b9f9594286962a7bc466850","observation_id":"34732834-8e17-48b1-8f83-2ab1c2e7cce0","resolution":{"observed_at":"2026-08-05T23:05:57.398156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.386957Z","title":"Rudin, ``Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead,'' Nature Machine Intelligence, vol","venue":null,"work_id":"a75744d2-e9dd-4a43-8a80-e078279a2770","year":2019},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.944734Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:bde0e4600df5677e979550976566d1835da5f69afa1a11009ba584932213e404","observation_id":"f8bc826c-90ce-4434-89ea-0ba22925895b","resolution":{"observed_at":"2026-08-05T23:05:57.389961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.378980Z","title":"Blockeel, L","venue":null,"work_id":"b15a09a1-a8e9-4a6d-8df8-0f06b4b118fc","year":2023},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.948041Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:90726e09984be361be7e5ab91e256b7bf92d1cfac35ac77008bafabafcac5692","observation_id":"cae13036-1b06-4e14-bee0-a2a7593b0d5a","resolution":{"observed_at":"2026-08-05T23:05:57.381545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.371067Z","title":null,"venue":null,"work_id":"2e5d6d06-0e5d-44a1-8192-ee3c218bd9f7","year":2024},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.951026Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:497ea797f2cc73b9f1adb88a5215e4286c8fbea223c000be76035528b3529293","observation_id":"f35501d5-5de8-4208-a5d7-6523b2527837","resolution":{"observed_at":"2026-08-05T23:05:57.373678Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.362518Z","title":null,"venue":null,"work_id":"acbc5e9c-c2fa-4be2-8b7f-6fb64c2b03bd","year":1991},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.954200Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:1c1b68714a82c156d983d657c9f02330d18670f4e7924686d5b1619d69710c6b","observation_id":"00aea9e8-0ac0-4b16-8cd8-a9dfa35a59b3","resolution":{"observed_at":"2026-08-05T23:05:57.365299Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.352913Z","title":"Bramer, ``Pre-pruning classification trees to reduce overfitting in noisy domains,'' in International Conference on Intelligent Data Engineering and Automated Learning","venue":null,"work_id":"dd4b044b-cc4c-4e86-a5f0-8686615be23d","year":2002},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.957214Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:1a9ef0cc818aaa0b54ebe20ee88e7c403f43316619a0746de74bc248c653954f","observation_id":"78ad5946-406b-4bd7-9697-2a4b1f0fa780","resolution":{"observed_at":"2026-08-05T23:05:57.356186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.344262Z","title":"Bertsekas, Reinforcement learning and optimal control","venue":null,"work_id":"81be2efa-32e9-43c1-ba94-f4886b173016","year":2019},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.960287Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:4c6d26b3b863af6681d3bc1af3293f77748559fb8344968df837b5c8bcfd2731","observation_id":"6fe39adf-0a81-4313-9e79-ec21b078ec36","resolution":{"observed_at":"2026-08-05T23:05:57.347281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.335734Z","title":"Deliu, ``Reinforcement learning for sequential decision making in population research,'' Quality & Quantity, vol","venue":null,"work_id":"bae8f195-8072-4ee1-98eb-5ccfcfb6cd9e","year":2024},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.963054Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:f0af0ef23aab25449ea61ef57babd1fc8e43b44b0d142c1ca760c9769167b7c1","observation_id":"1358d66d-4d03-4c7d-a5e1-e6d2134d9f0d","resolution":{"observed_at":"2026-08-05T23:05:57.338706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:56.965768Z","title":"Breiman, J","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.965768Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:b7b57dd9a65d0a67d0654cfe60b618096d36f936cc8824d1d67a829e84db6560","observation_id":"6be2662d-04be-42bb-92b2-ae9cadadb6bc","resolution":{"observed_at":"2026-08-05T23:05:56.965768Z","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-05T23:05:57.327623Z","title":"Esposito, D","venue":null,"work_id":"336d5a11-d542-4b1b-8053-0ab0d0e57599","year":1997},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.968620Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:b8184d70285c13b9398b5fb022b3e8998c85d71d0935521f3df57b31845bc71a","observation_id":"7ac697ef-64da-435e-bbef-63cd54d4dff7","resolution":{"observed_at":"2026-08-05T23:05:57.330299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.319400Z","title":null,"venue":null,"work_id":"c0b7c535-9169-481d-b225-0ed7d0a46b50","year":2002},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.971424Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:b4be4c636cae379036417d24d239fdcf41e59273b563bbbc6985a00e785ab78a","observation_id":"4c7f4542-dcb6-4dbb-a35a-a760bf3f8de1","resolution":{"observed_at":"2026-08-05T23:05:57.322132Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.11527","last_updated":"2019-06-27T09:59:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2019-06-27T09:59:44Z","title":"Hyp-RL : Hyperparameter Optimization by Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"1906.11527","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.11527","snapshot_observed_at":"2026-08-05T23:05:57.202463Z","title":"Hyp-RL : Hyperparameter Optimization by Reinforcement Learning","venue":"cs.LG","work_id":"819b6a56-4ce9-43c2-91a7-1b11b08b6962","year":2019},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.973990Z"},"links":{"cited_paper":"/paper/1906.11527","citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:7b4783aa208a0134cfcdfdd0d0b523633d364e34dd95fbde3d865e6e190afbc3","observation_id":"2fbd054a-8c4a-4721-9133-5de1e9ede508","resolution":{"observed_at":"2026-08-05T23:05:57.206189Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.311149Z","title":"Khurana, H","venue":null,"work_id":"9c9d390a-be0c-419c-baf4-269ef79958c3","year":2018},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.977368Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:76fb09e935d4f33ec749bc92c55984d2af0a351267c90ad478fdde14506155cc","observation_id":"f5b3a7a3-c3f7-4158-89ca-a6b2a1658758","resolution":{"observed_at":"2026-08-05T23:05:57.313920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01578","last_updated":"2017-02-15T05:28:05Z","snapshot_observed_at":"2026-07-06T05:17:29.499249Z","submitted_at":"2016-11-05T00:41:37Z","title":"Neural Architecture Search with Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.01578","snapshot_observed_at":"2026-08-05T23:05:56.979934Z","title":"Zoph and Q","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.979934Z"},"links":{"cited_paper":"/paper/1611.01578","citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:02b09cec13df86e9818bb91c237c8cf1cc78a4b21126aa4a574ea345c590ba08","observation_id":"375254ab-f028-4faf-a114-c40d00135b07","resolution":{"observed_at":"2026-08-05T23:05:56.979934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.11417","last_updated":"2024-12-17T04:04:12Z","snapshot_observed_at":"2026-08-06T11:52:14.662008Z","submitted_at":"2024-12-16T03:33:49Z","title":"RL-LLM-DT: An Automatic Decision Tree Generation Method Based on RL Evaluation and LLM Enhancement","version":2},"cited_work":{"arxiv_id":"2412.11417","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.11417","snapshot_observed_at":"2026-08-05T23:05:57.178299Z","title":"RL-LLM-DT: An Automatic Decision Tree Generation Method Based on RL Evaluation and LLM Enhancement","venue":"cs.AI","work_id":"de9f6c79-1790-4cce-bee9-706cf8e66b55","year":2024},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.982882Z"},"links":{"cited_paper":"/paper/2412.11417","citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:df28ca2e9e9707213179e11ea9e4855b73ee6f3f1e260a4b6542e25677ebc28a","observation_id":"706dfce6-7892-42bf-b350-c2ebf1cbde03","resolution":{"observed_at":"2026-08-05T23:05:57.183612Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.302734Z","title":"Auer, ``Finite-time analysis of the multiarmed bandit problem,'' 2002","venue":null,"work_id":"d8fadd00-6df4-4ad6-86c8-d2fb4e177a11","year":2002},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.985720Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:a99589ff68f8437dd0d516157388e44aabc082b569ea32471b675969be98f47e","observation_id":"984d3581-4257-47b5-9b64-6966ee77d04c","resolution":{"observed_at":"2026-08-05T23:05:57.305524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.294430Z","title":"Agrawal and N","venue":null,"work_id":"b52f9f72-1419-429c-b20c-db348d4d6741","year":2012},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.988402Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:61dc48f79530bc02f96d165c61e369a69139508af0a74dbdf3fc80179a90c3d4","observation_id":"57a619c9-bc42-414a-bdb3-ef23d5c9cc79","resolution":{"observed_at":"2026-08-05T23:05:57.297184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.286320Z","title":null,"venue":null,"work_id":"84a7c846-8f06-45a1-b6e7-3d444187f0d9","year":2021},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.990946Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:46c5dfc5c068542f120167106bb3374ebf88f14cf845ccdd0c7e4d72c83821ac","observation_id":"56175669-c0ec-400e-9f7e-9d04ece8eb96","resolution":{"observed_at":"2026-08-05T23:05:57.289005Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.277141Z","title":"Nowakowski, L","venue":null,"work_id":"2fee4a6b-97a7-41d9-945c-48c515e8c1bc","year":2023},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.993750Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:9efe6fe2f35dbc42b380f1c0ca9cf9c8b4a22230713ddc6c719e02dc21459abd","observation_id":"d0697673-7dc1-4d60-8268-d91f05187290","resolution":{"observed_at":"2026-08-05T23:05:57.280551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.19251","last_updated":"2024-06-27T15:18:21Z","snapshot_observed_at":"2026-07-06T18:38:00.379225Z","submitted_at":"2024-06-27T15:18:21Z","title":"AutoRAG-HP: Automatic Online Hyper-Parameter Tuning for Retrieval-Augmented Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.19251","snapshot_observed_at":"2026-08-05T23:05:56.996553Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.996553Z"},"links":{"cited_paper":"/paper/2406.19251","citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:9720282925a0b000250d64efeee06d52d00e7ceeba1b0640592377a303006e39","observation_id":"6e5e4275-4949-4f60-b61d-1f40e2973ea0","resolution":{"observed_at":"2026-08-05T23:05:56.996553Z","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-05T23:05:57.268590Z","title":"Ameen and S","venue":null,"work_id":"9ad6633c-7e48-4923-8bae-c65a30ccc1ac","year":2020},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:56.999843Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:aa21e672cf341d6c56e5359403b2399c77b243cd4f66dbeddd99cf3dd42b5c27","observation_id":"ff04a988-4945-4f04-a549-a980935fbd45","resolution":{"observed_at":"2026-08-05T23:05:57.271346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.259799Z","title":"Tiwari, R","venue":null,"work_id":"6826b081-8a91-4bde-a51f-616ba2e6cede","year":2022},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:57.002568Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:4b070e75b55cc8b513dca22c395466a5731cd836cf9c91155f48b04f48fa00ad","observation_id":"e9051f43-5adf-4ad3-a6ca-6bf70d3486ad","resolution":{"observed_at":"2026-08-05T23:05:57.262501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.250191Z","title":"Lomax and S","venue":null,"work_id":"4fa04e1c-b82a-4a71-bd78-1a236a294c14","year":2017},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:57.005341Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:342a191679f40eb4c61efbe50a2a477346589cf39b41864922240c2024a31d8c","observation_id":"86fbae82-670e-48e0-9dfd-b383079d03d8","resolution":{"observed_at":"2026-08-05T23:05:57.253375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.007930Z","title":"Wolberg, O","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:57.007930Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:add94141f522ec1b857099dcceeac40ea439d2db4f305e8cff420ed1776baae1","observation_id":"6178df41-fef2-4825-9768-192338a5a196","resolution":{"observed_at":"2026-08-05T23:05:57.007930Z","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-05T23:05:57.241107Z","title":null,"venue":null,"work_id":"6647160e-18c0-46a2-822d-37a0db1f69bd","year":1988},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:57.010678Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:05a0a32a490d005610477c574f71ef207dabdf838040779724080f313da0c882","observation_id":"fb3d1e18-7fb8-42cc-a2f2-fbd95d7bb6d0","resolution":{"observed_at":"2026-08-05T23:05:57.244075Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.231807Z","title":"Cukierski, ``Titanic - machine learning from disaster,'' https://kaggle.com/competitions/titanic, 2012, kaggle","venue":null,"work_id":"ec184509-8f27-4980-99f9-191d72f41941","year":2012},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:57.013542Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:2ec2be7b8b21ae9acf774c19cf29970bd2ecfd84bae4f8c3ab87af7fe6209b84","observation_id":"fe5dfd14-0ac2-481f-b2ab-d43b52ef579a","resolution":{"observed_at":"2026-08-05T23:05:57.234889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.016101Z","title":"Sigillito, S","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:57.016101Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:42a07c0561b038e6c4666518334b60074ad223e614e1aeafa01791aabd5f6066","observation_id":"25ec9b33-d532-4060-b08b-316e83224efe","resolution":{"observed_at":"2026-08-05T23:05:57.016101Z","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-05T23:05:57.222039Z","title":"Dal Pozzolo, O","venue":null,"work_id":"4f19c20f-9ada-414f-80db-81232b2e8d40","year":2015},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:57.018778Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:7120f35b060c77b819086fc67737544871449cb5a840211ea5ad3c2d3c903942","observation_id":"a67919a3-a797-4f4f-996b-dba4cbb66be2","resolution":{"observed_at":"2026-08-05T23:05:57.224965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.212891Z","title":null,"venue":null,"work_id":"bab354af-b85b-42ba-8d5e-e1025f335ff3","year":2005},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:57.021564Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:983fbfcc263eaadf595b5aeb79c652285544c9f2c872aef8109ebc4c3095b9ca","observation_id":"7ee0ace4-104f-4f05-8436-24535c6c11ed","resolution":{"observed_at":"2026-08-05T23:05:57.215927Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T23:05:57.024334Z","title":"\"6o Effk p ^ O>ddd :ͶsΆ !Dll B &&j4 g uO6L . =M","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T23:05:57.024334Z"},"links":{"citing_paper":"/paper/2508.05957"},"observation_digest":"sha256:66e8dd920d4e81c5c29c107b6d8dc112bcefec04d178c48c27f4ece631758334","observation_id":"c46e9f1e-93a6-454a-b785-ea63f3a84d1b","resolution":{"observed_at":"2026-08-05T23:05:57.024334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.05957","last_updated":"2025-08-08T02:43:45Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T13:57:09.870710Z","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":2,"verified_fuzzy":16},"total_outbound_references":30},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2508.05957."}