{"as_of":"2026-08-10T00:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5b5b3c10ab3415538fff382d740035e67a6106f460b414851f00bdac081bce02","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-09T06:31:02.800959+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:b08d04b56d0c322cba9ef7103c532d7d93cb8435f05f7b8dd65e24be9a7f0e4c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:4b431010112a270a884601fd6033913c329c518e295a6a132c33df2f8751f2be","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:5cede0da2b030af094cb99df4d3f235b448202f88d3a8445b4fb21cde302c8d4","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:227a8e46015dc39ebbf14d09a9d5fce22aa50d04e498558f4a567dcb622f7ed1","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:10c6457dcf2757b29a321516a9d783cc959274204e8796c2123a740f76fb53d2","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-06T10:06:25.277680Z","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:be3c2faf76156b4f18cdc5d3d28a97b080f0e0e3d421eea7f2633fcbb4adaed5","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:b5e9e6e7dd99bb091ced53d1fd5a19d2553b78635d873457061458dbfd1edf49","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:f20fbc541bd61515575c5a9216360400f49483de73cae25eda750f1be0e8fcfa","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:44cbdd8a118f488616d62583f97d50c6f7646b448423756bbaefbc4edbbd9ba6","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:14faeaf0731f1ed082aa81b37471e558b56245a869c37af8e161c8365249b374","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-06T10:35:16.950050Z","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:a1e887402d18aafd2525e20d5def8c1bf31e4aae8b5fd5ab62a2a558e954331e","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:867736d8cc7502c5c3655b94fa6c72f62f10e657714c21b591613a10078be5b0","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:bf1f2e15f0ef95a732aa947daedf35681e9b97f9a34b59db46bc8e9aafeaf376","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:ae181199e8d6bc93afceac53808c86fc4d671ffbf416e3a39bcbe8c69e9656fc","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:dd2070ab7ba4d9ae9fca155b2e4ad56dae2858fade14747191d6e4133c4a2276","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:a0aafe606e7f6f7de88badb021dee0a2622a9e196e5b7f2fa84167ba6622e021","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:c0fbe792b5d74f31cd9ad95b505aa1518390a37306704aac1e1a00397c500d17","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:08a581fe76259efb4099f2fd43a1d9a5de08708d9309c9649c0620ec9d26cb77","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:b609899d055a506246437dcb786a5dd291374925b0efe10defaead06a612c429","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:cdeaac78816bd367652c16cd6932138dfcddb1c84b32183216dfa4d82bdff703","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:1ae0bbeaa730500d9949ea01351f23002c4e3407165f43c7d52e2fa11b1e9979","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:1ce4f89d99b38e5988b57c1655b9ce0ca9ebd7cb536073b3724d27bc4b05b25a","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:57b7cc6967f6f75522688a93a1d78188b275482d0b6b9ab23029f308a56d7b66","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:9eab8f0e539d79be9624f40b2e138f5bd3ee27e84badfbb2dd79ab6e27c95f62","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:d426acfc911071c675857877bbd9d6eff19f286d6bcac94e0ddfcb8e9607bfee","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:49b6df2f79fa78db7c3c3133510f9976859d25d9e0b3ae22a5d447b6853e855c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:59fbbf2efda99e3e27d0a9bf85d3ddfd9eabb6e68b047cc327a4de93b6d9aee6","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:b1d009e03b30aab38938cae561a2d69e95046032874a5b0a523fc4321b38037f","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:9b5bdf9acd3d10844d41dcb64dc426af294c8ba29736d223b2bd4b2feb878b9d","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:85ba68a9c415f78b14e33ad79afb1d6c3117128d6badf982722a996aecb02c03","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:b257a1c9803ed6484b092b13b9cc36ef828fc53ffd0ec0b30fd5f21b579dc254","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:1a93afabacd0c73d044f34d493c0600b1181e45580e09825d0936cae7d2a7d5a","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:a88c188330a5e9fbc8223e65dee07570afda5e914be68cb5a272d0f22d58e655","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:62df344091c3ab7ab48cf3f3e709fddd731cdaa3173114c0942feb05de4f0a6d","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:a181b64b81736ce103100493b85878700abeb6e562b85cb6344c016803585e66","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:95fa49235a2a1ea2646c4d72b1911c8848aa7c3c6d6dc9dea74943936f86f2ec","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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:92a514cda58b77cd766ddbb5f941cdc8419700f6df91727f995be6e6a0ac3b15","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2605.06561."}