{"as_of":"2026-08-13T21:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5bc15c86eec55e929e62379c0329c8c56b2f9e20609279c0b1cbd13199a6a799","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T12:24:27.709344Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2605.06561/citation-record","integrity":"/paper/2605.06561/integrity","json":"/paper/2605.06561/citation-record.json","paper":"/paper/2605.06561"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the 38th International Conference on Machine Learning , pages =","venue":null,"work_id":"39f842b1-1754-4fba-ba5c-e848ef55df0f","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:0b362ad90357bea8a3eb571854413c922a86da973fd211b5d9c9174e780697a0","observation_id":"64f69f01-f01e-48b9-b30d-4e2b3ede7e68","resolution":{"observed_at":"2026-05-26T13:27:24.653370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Proceedings of the 28th European Conference on Artificial Intelligence , year =","venue":null,"work_id":"84533ce7-4730-4835-afac-57c06993ae27","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:ea4728b4abfd9c94d34321656cb8e08f03220cd466fbf586f5602d48970e8139","observation_id":"f36ac868-a446-481c-900a-4482c573f3c6","resolution":{"observed_at":"2026-05-26T13:27:24.657028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Harvard Jounal of Law & Technology , volume =","venue":null,"work_id":"f30a522f-1a59-4c7f-848e-73cc76944fdf","year":2017},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:43d2377e8037a8856addd19d286dfc4b0c439f513c8cd069832264bb17ac5d21","observation_id":"445215eb-a4ff-4cea-a464-d48482dfadf7","resolution":{"observed_at":"2026-05-26T13:27:24.660474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"ACM Computing Surveys , volume =","venue":null,"work_id":"f509e944-0d26-465e-b776-471a3bac6489","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:ea32a081b90d08a8876e50ca896ccac03d2f70e2b4e4ca35e6118572225ceed1","observation_id":"0103cb26-2a7f-4a42-9e55-65296550b2b5","resolution":{"observed_at":"2026-05-26T13:27:24.663672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"International conference on artificial intelligence and statistics , pages =","venue":null,"work_id":"8c3380e4-1313-4820-8dab-220d6d619d31","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:1e537575a95a5d532787cac09d6b631ca60acb273305e46629d961f8e48be569","observation_id":"ce18e635-c3bf-475a-b6e7-04d435d9d5cd","resolution":{"observed_at":"2026-05-26T13:27:24.667266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.10596","last_updated":"2022-11-15T20:57:53Z","snapshot_observed_at":"2026-08-12T19:57:46.086924Z","submitted_at":"2020-10-20T20:08:42Z","title":"Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Review","version":3},"cited_work":{"arxiv_id":"2010.10596","doi":"10.48550/arxiv.2010.10596","metadata_source":"arxiv_reference","pith_arxiv_id":"2010.10596","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"& Hines, K","venue":"arXiv (Cornell University)","work_id":"c26cf6f9-998c-44ee-9593-cde016a9c1e3","year":2010},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"cited_paper":"/paper/2010.10596","citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:e5c6a04f676745b9b9cb442e886b0b40492f6cc74b3586e36f8a22b36e56bc06","observation_id":"b0f6a8c1-4d97-4587-943f-bd9a3047a12b","resolution":{"observed_at":"2026-05-11T19:16:09.371044Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"ACM Computing Surveys , volume =","venue":null,"work_id":"3ae957f7-d68c-41b3-80bf-ad838bfce290","year":2024},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:13f7ef4a49c483d867d7c73caf8c2f6a14d888aa2d5584bc5bb0cadf46e792f5","observation_id":"4096eed0-bf49-4c9d-a432-31034d6cddda","resolution":{"observed_at":"2026-05-26T13:27:24.749816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"2019 , eprint =","venue":null,"work_id":"0b8ae1e2-d55b-40e7-bb06-d4d94e530da9","year":2019},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:ac7650fb20f662fa11a0aeb167ec0960a22516cb0883f62da0dcfce620d78f59","observation_id":"71e450e1-9b6a-47b9-8877-8f2a472fa262","resolution":{"observed_at":"2026-05-26T13:27:24.752546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"FACE: Feasible and Actionable Counterfactual Explanations , booktitle =","venue":null,"work_id":"f3c8fc38-2915-435c-96a1-34d9371c4061","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:78af5f80af616c6872ea03ae195c1165610f6c61702880f16711340d78cc2f2b","observation_id":"b63b5102-7a94-418e-9ce6-31a9bb182cf7","resolution":{"observed_at":"2026-05-26T13:27:24.737457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"2020 , eprint =","venue":null,"work_id":"bf9ea656-ddd1-48f8-b4ae-53ba5bbc7adc","year":2020},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:7cf1f8b1548b7a13bb531ad7124cc221dd36c0b4680953f517ee69cb6767f8b9","observation_id":"88d63e88-c4d3-499b-a025-26d0f8c13c39","resolution":{"observed_at":"2026-05-26T13:27:24.740259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.10123","last_updated":"2021-01-25T14:31:13Z","snapshot_observed_at":"2026-08-13T20:25:21.048609Z","submitted_at":"2021-01-25T14:31:13Z","title":"Conditional Generative Models for Counterfactual Explanations","version":1},"cited_work":{"arxiv_id":"2101.10123","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.10123","snapshot_observed_at":"2026-07-03T17:58:46.780005Z","title":"arXiv preprint arXiv:2101.10123 , year =","venue":null,"work_id":"9b679868-d30d-4b2c-bf30-73d8b12625d3","year":2021},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"cited_paper":"/paper/2101.10123","citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:8dc55b4c8025bc5a313f0498a361dadf38a8d668f2ec87065c0bf706ddfb69fc","observation_id":"85ac7932-677a-43e5-a7c2-edb561a34280","resolution":{"observed_at":"2026-05-11T19:16:09.383387Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"ICML Workshop on Algorithmic Recourse , year =","venue":null,"work_id":"10aa9f40-c454-483f-ac6a-7e5d4b40f746","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:1e7f5270620d5ed03feb925c7bdf9ffe4883587ceb92397921f0b8e6f44b1184","observation_id":"c2af0238-7653-4627-ad10-dba38034ac1b","resolution":{"observed_at":"2026-05-26T13:27:24.743526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Uncertainty in Artificial Intelligence , pages =","venue":null,"work_id":"7fac1e1a-2c9e-4d64-8218-6f1693b90ff9","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:6e2f33e6d54e9ed8ce1b609948fedda0a315fed33e7027723327777644d8b8ff","observation_id":"729d14ff-eb3d-472f-afe6-55340501bf51","resolution":{"observed_at":"2026-05-26T13:27:24.731704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"1984 , publisher =","venue":null,"work_id":"a4463737-d097-4f8a-bce7-114170ef0bad","year":1984},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:1ec4b31c47e0e422cddeae86f685f515aa172926e9070d629448af159ffbb3a6","observation_id":"7245aeec-17ba-4d59-bb42-5d79d37f8f19","resolution":{"observed_at":"2026-05-26T13:27:24.734674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Random Forests , volume =","venue":null,"work_id":"57790e87-2242-40b6-85ff-20c4b21a430b","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:908b96baa1a4bf67f74cc60b4089f071973a3c36a5b267addeafc42898021a98","observation_id":"65d7bfdf-62a9-44c2-b7ed-198389530aaa","resolution":{"observed_at":"2026-05-26T13:27:24.726067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Friedman , journal =","venue":null,"work_id":"ff1001b6-8b1c-4da3-a1f4-cc0217d8cc8b","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:d481abcc4592c215f850b422809b9d8ec56039574d303b66d717f2799a150bfe","observation_id":"828655b9-6152-465e-b75e-7943d6f4b194","resolution":{"observed_at":"2026-05-26T13:27:24.720293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Interpretable Predictions of Tree-based Ensembles via Actionable Feature Tweaking , booktitle =","venue":null,"work_id":"59ed466c-a225-4130-803d-1f0d4f890f4d","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:0d004636b00b4ceee2a92b3fe8abda5ca8a4ec448eb76633823b703bec655686","observation_id":"1b56b5d7-3da6-45b1-a5e4-9282f0e4170a","resolution":{"observed_at":"2026-05-26T13:27:24.723020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Proceedings of the Thirty-Sixth AAAI conference on artificial intelligence , volume =","venue":null,"work_id":"6e0cee01-d95d-4197-aabe-b3ce33e89620","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:88dd7627066301cc8adb9bea4b00de27aa429901bd97a14f2492ad223fe2ccd6","observation_id":"4dfc6bc3-2d0d-44ac-82b4-1b1773193778","resolution":{"observed_at":"2026-05-26T13:27:24.728863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Proceedings of the 22nd","venue":null,"work_id":"97def719-0f63-472e-bfea-a084945405dc","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:eef39afba330c72f5efee607dbe46999ff1899c5234e2117e466ec5e355e2624","observation_id":"99275075-21ed-4faa-b913-1977b659934b","resolution":{"observed_at":"2026-05-26T13:27:24.746627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"2006 , publisher=","venue":null,"work_id":"6d81502b-af04-4d5b-889c-5959894f4b97","year":2006},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:5928ab0f5ede94a3f3b835b98ed8f35454cc37db4df49dc5fbe01e2565681113","observation_id":"b1f23dbc-3dc9-4900-95f7-42cc02c8087b","resolution":{"observed_at":"2026-05-26T13:27:24.755429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"2008 Eighth","venue":null,"work_id":"738d3a99-126c-41fc-8031-c6b9db800703","year":2008},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:1c56f47c7001f138c6aef1464c648b6ec9c831b90064624dfb5aa05b66945b6f","observation_id":"cb1aa614-ade8-4f24-82d4-4ac6c8c0f42a","resolution":{"observed_at":"2026-05-26T13:27:24.706761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence , author =","venue":null,"work_id":"883c04bd-7efb-45c8-9b1d-7e56c93cd55b","year":2023},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:61108324776bb32412fb14ff6e334f5c041cf9e2d74ef2549260870b4ea65c75","observation_id":"f8b175b9-cdeb-4080-8409-ae01d1cc4434","resolution":{"observed_at":"2026-05-26T13:27:24.709535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"2025 , issn =","venue":null,"work_id":"c609ed9a-c7fe-45f2-8257-96daa8a27bf6","year":2025},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:8b2d2bcb264466876f92df231cb4f79f19c78edef205efc31ca6a5891b61f3c1","observation_id":"c1fc2305-1e4c-45f2-9469-7b165f05f3df","resolution":{"observed_at":"2026-05-26T13:27:24.701343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Computer Aided Verification , volume =","venue":null,"work_id":"571a2966-a1a4-4c27-afed-e5000bef1eaa","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:6fc25efcf53fdd5b284e8970cea947c8afed4d468b1a0a1c3c2c86946b9ecfda","observation_id":"f26389f4-64d7-4d56-9d76-5cf24f2328f2","resolution":{"observed_at":"2026-05-26T13:27:24.692388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"CP-SAT , version =","venue":null,"work_id":"45178de7-f4b2-4148-93f5-4ccf640b3a97","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:b1dffa5b77bc357e54a7152bc5cc2253dc7bbe789186cb7f6b1774f1a0a04267","observation_id":"e9f0891a-710e-4fd2-a0f0-a1e74d914886","resolution":{"observed_at":"2026-05-26T13:27:24.695363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Scikit-learn: Machine Learning in Python , journal =","venue":null,"work_id":"9d062878-abfb-4cb4-a647-8bdb9b6166e4","year":2011},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:119f7ebce61308935275d1e259a8c1df61434bcd61f27d7e9f6b538be3f47ad9","observation_id":"f4e4d5f0-fe5c-4d06-bae4-52e16317749d","resolution":{"observed_at":"2026-05-26T13:27:24.698523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"2026 , eprint=","venue":null,"work_id":"eb7cd0c2-d53b-421d-81c4-93170bb5e8dc","year":2026},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:8f0188e8a9646fb8065bfe109b0ecd921539f9d458c7bf8ba63ec1ab876e7db9","observation_id":"1eb42781-02cd-45b5-8748-123199259b85","resolution":{"observed_at":"2026-05-26T13:27:24.703959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Data Mining and Knowledge Discovery , volume=","venue":null,"work_id":"60bd49d0-259b-4bc7-9418-76411f5a31cd","year":2024},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:9ee1d4545f7082120cf6380b4b363564ed6cb19898f233b740cbe8e9fcc44ba8","observation_id":"2eafbd13-7475-4723-9c6f-68f984aad69a","resolution":{"observed_at":"2026-05-26T13:27:24.717796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining , pages=","venue":null,"work_id":"585ea208-b180-450c-a335-4aeee783f187","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:d857fd26f0412ca6df898d1263dc5f80765553a3df89e889423fa6fa8d21d647","observation_id":"f1807551-42e9-45d1-8532-23147983fcb2","resolution":{"observed_at":"2026-05-26T13:27:24.689423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Information Fusion , volume=","venue":null,"work_id":"06fe204b-78e3-4fb5-b498-b1a4d4ecf231","year":2020},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:b3f14786a66b0ce46cb04042c8100bc31e0991df549663750efa7db4886c376e","observation_id":"1b8c949a-725a-4683-80f1-e1a5f27828a6","resolution":{"observed_at":"2026-05-26T13:27:24.686497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"SMT Workshop 2015 , year=","venue":null,"work_id":"70976256-e57a-4e98-ba55-a8002f971d18","year":2015},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:84c74fc2b3e34299fac658b4b6ae8e0b716fbca1312a676323765ba112efeb05","observation_id":"f0d05454-32ad-488d-91ec-904d85623c4c","resolution":{"observed_at":"2026-05-26T13:27:24.715147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"2008 , booktitle =","venue":null,"work_id":"d4bc875b-a586-470e-9314-f822600018af","year":2008},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:eea1adc76398a82185402369c350a9aa6057fc8ce8e0ab1254107b875ab1080d","observation_id":"4fdf82b3-0ef5-4407-80b6-a834afc5632b","resolution":{"observed_at":"2026-05-26T13:27:24.683715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Translating Pseudo-Boolean Constraints into","venue":null,"work_id":"6e410c51-1841-4895-b075-34eb21ac6939","year":null},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:9116d068dc7a6e84c355637d0c92ca9b263d0ed418098ebab57d2aba7de33b64","observation_id":"e95206e7-402d-4d0e-b88b-7c8b5cb0c477","resolution":{"observed_at":"2026-05-26T13:27:24.670904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Theory and Applications of Satisfiability Testing -- SAT 2015 , volume=","venue":null,"work_id":"a9767420-aff5-469a-94e8-4505318539d5","year":2015},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:b5dc021176963efbce4c2c5a395d29d015bb80f8fddcf88d941c9e87dd8ed5be","observation_id":"4dd4fd8b-e3e2-4830-b129-868685c04018","resolution":{"observed_at":"2026-05-26T13:27:24.680655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"and Martins, Pedro and Schiffer, Maximilian and Serra, Thiago and Vidal, Thibaut , title =","venue":null,"work_id":"d6ad2084-e074-4506-95d6-8dba06ab1ebe","year":2023},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:7d6128dccc5470f3295e24c02dd4c7893f4b6f50a3ff0417d625da043b59b3e2","observation_id":"0b092ca9-f28b-443c-8c10-9e29e31c634f","resolution":{"observed_at":"2026-05-26T13:27:24.712686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"2010 , howpublished =","venue":null,"work_id":"578225aa-3071-40c6-8311-ff0b6aba02c4","year":2010},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:501f08e27803577311addd14d839bf3b745b6709810579967c0979d5f4f0c203","observation_id":"44a19db3-b93c-4d61-8184-c00b5ae20190","resolution":{"observed_at":"2026-05-26T13:27:24.674295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"1990 , howpublished =","venue":null,"work_id":"5b089ecd-29b5-4fa0-8bd8-12a9bb3211ad","year":1990},"citing_paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:27.709344Z"},"links":{"citing_paper":"/paper/2605.06561"},"observation_digest":"sha256:1ce54d52c8a3b8d3bc1823b02ba2eb4bf98d53b204afd0703d866e0633b0f261","observation_id":"25fb7118-4f20-4288-bdde-bf5f2fbc1078","resolution":{"observed_at":"2026-05-26T13:27:24.677606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.06561","last_updated":"2026-05-07T16:54:38Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:54:38Z","title":"Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":35},"total_outbound_references":37},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2605.06561."}