{"as_of":"2026-08-18T19:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e144e768bb45b81ba01382837ec49a954d516cb598fafcec9e6a571c2c6af4d9","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T22:17:35.720546Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2412.03722/citation-record","integrity":"/paper/2412.03722/integrity","json":"/paper/2412.03722/citation-record.json","paper":"/paper/2412.03722"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.439872Z","title":"Optimal classification trees","venue":null,"work_id":"1b28a171-951e-4471-abd6-70e62eddef09","year":2017},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.530605Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:4a311335b6dfed3e77b3a5e978679f61c28749a8e7069b68a9221e4ae074a209","observation_id":"c379ed02-e987-40dc-9f12-5b6482bf4c8d","resolution":{"observed_at":"2026-08-11T22:17:36.446762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.416244Z","title":"Optimal arrangements of hyperplanes for SVM-based multiclass classification","venue":null,"work_id":"5474a826-e470-4589-a85c-953b1b6cd2bb","year":2020},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.539648Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:71d58640baa56bce70d00aa5ab1d77803af09952750252ae684d74da4c55c02f","observation_id":"5347cf58-ca26-49b7-b4f7-9254336d4cbc","resolution":{"observed_at":"2026-08-11T22:17:36.423074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.10502","last_updated":"2024-11-29T12:48:55Z","snapshot_observed_at":"2026-08-18T16:33:45.518874Z","submitted_at":"2022-11-18T20:33:08Z","title":"A Mathematical Programming Approach to Optimal Classification Forests","version":3},"cited_work":{"arxiv_id":"2211.10502","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.10502","snapshot_observed_at":"2026-08-11T22:17:35.802597Z","title":"A Mathematical Programming Approach to Optimal Classification Forests","venue":"math.OC","work_id":"94637953-b60f-4dd9-a218-eba08a91c098","year":2022},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.552420Z"},"links":{"cited_paper":"/paper/2211.10502","citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:26f1b0fa47913cbd34ca7a3c47ff2708ec50b2bd1fe6f0032e40268b26c0e170","observation_id":"b5212c88-8e0c-4026-aae1-31c9cc263d16","resolution":{"observed_at":"2026-08-11T22:17:35.811358Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.393947Z","title":"On minimal extended representations of generalized power cones","venue":null,"work_id":"dd92f2b3-a406-4a12-9a75-cda13cebc3d9","year":2024},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.558924Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:5651a6a5c0227d80026c3fdfc480899a0d393911139a1e72a1dbf55c1624e049","observation_id":"21ed2b08-573b-4a83-bca1-f1e21707158e","resolution":{"observed_at":"2026-08-11T22:17:36.399921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.370893Z","title":"Revisiting several problems and algorithms in continuous location with ℓτ norms","venue":null,"work_id":"3812eba1-b8eb-4943-a98f-168010875309","year":2014},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.564741Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:db25199ea3ff76f1c266e8d080c577bece0159df90a33153c496d1cfb0d98c8f","observation_id":"16629931-e12f-4f3c-ba00-4fbeb2d339f8","resolution":{"observed_at":"2026-08-11T22:17:36.376759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.353200Z","title":"Generating collec- tive counterfactual explanations in score-based classification via mathematical optimization","venue":null,"work_id":"861c58ff-9fd4-4675-a5f2-13501f9016cc","year":2024},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.570962Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:f85cb3596a4f967c70cc7a9ea5d6d3f9071427e2b92e17bb544824e5135d5359","observation_id":"c244bb35-9aa0-4db6-9a01-e90ba4fb26f6","resolution":{"observed_at":"2026-08-11T22:17:36.359361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.331014Z","title":"Extracting tree-structured representations of trained networks","venue":null,"work_id":"c644074e-c957-4a65-8a2a-b199611ea06d","year":1995},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.576899Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:3e85f8a3b926920a438865f00be43c8236f983a3126866020536feebbbc32cfb","observation_id":"3e1ad8f6-ec71-4c23-89c1-78fedbb84d64","resolution":{"observed_at":"2026-08-11T22:17:36.336391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.311821Z","title":"Multi-objective counter- factual explanations, in: International Conference on Parallel Problem Solving from Nature, Springer","venue":null,"work_id":"ed819ef1-f78f-4295-988a-ff4c02ad9b00","year":2020},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.582261Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:504d237ea903c3072cf09c2e456e40e793b43553970fe0a611a9e99d208038a0","observation_id":"d01bfeee-ce2f-4b4a-815c-86ed15ac83b4","resolution":{"observed_at":"2026-08-11T22:17:36.317138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.294265Z","title":"Obesity level estimation software based on decision trees","venue":null,"work_id":"962423ef-7dd3-42b3-a7ec-3f9043eb4c3d","year":2019},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.587124Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:8d74e223b34c71f6ae1fc9845bfcf7301e52b18bd651de088ebb02f7c097e923","observation_id":"2a6471d6-6083-413b-9258-39aec005fd5d","resolution":{"observed_at":"2026-08-11T22:17:36.300151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.274353Z","title":"Robust counter- factual explanations for tree-based ensembles, in: International conference on machine learning, PMLR","venue":null,"work_id":"49f71bf6-8df0-42b5-9530-c52982d43a92","year":2022},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.591965Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:d14f4245f3fef0d2bb52eadcf5e7073bb0effb433a0881211625bd478f183742","observation_id":"20051cf9-69b5-4432-8f73-be5cda1533d6","resolution":{"observed_at":"2026-08-11T22:17:36.280686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.254232Z","title":"New algorithmic framework for conditional value at risk: Application to stochastic fixed-charge transportation","venue":null,"work_id":"7db79abc-ddcf-4471-a71d-fb09272a0779","year":2019},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.597782Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:4792dcce606b3a0a3bf3c0b52fccf98c2e898709e91c91829b26e1191a84b42c","observation_id":"ba2a6593-7d6d-439a-b3c0-e6790e0c2ce4","resolution":{"observed_at":"2026-08-11T22:17:36.260843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.230963Z","title":"Conditional value-at-risk beyond finance: a survey","venue":null,"work_id":"0b412748-2067-4725-8f3d-d2ce3c79f351","year":2020},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.603740Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:81063a06654b31010ab2633db1da943585c696156300730bbec0cd204a921a46","observation_id":"715283dd-e501-44cd-9a7a-cb92875b3399","resolution":{"observed_at":"2026-08-11T22:17:36.238263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.203759Z","title":"Capturing users’ reality: A novel approach to generate coherent counterfactual explanations","venue":null,"work_id":"9aa8d806-521a-4d31-b894-ad316c64482d","year":2021},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.609268Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:55b0343d9fde4fd63271063af12cbd09391da3cce900ce0059ff08763dd1e33d","observation_id":"8b208908-1a59-4ade-96dc-d46d218ff397","resolution":{"observed_at":"2026-08-11T22:17:36.212894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.175138Z","title":"Sick and de- pressed? the causal impact of a diabetes diagnosis on depression","venue":null,"work_id":"19d5e5bd-74a0-4def-89bb-4a5fd7120f83","year":2023},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.615236Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:ae0328707d7b40b76a297794dc18dd71d37f1b2d541a20cb34041f6c52dab854","observation_id":"aa186a78-476f-4ae6-bb87-d3722ccaa4cb","resolution":{"observed_at":"2026-08-11T22:17:36.183642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.147898Z","title":"Shutting down to save lives: A regression discontinuity analysis of non-essential business closure","venue":null,"work_id":"a7908140-41d6-495e-b253-3ccde17e5f2f","year":2024},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.621332Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:5197b874d48931d88e81fa3177ca7e5bed6ee4707e98bb3ca327bbb3cbcfdd0e","observation_id":"982255dc-652c-4e0d-a865-795052223de0","resolution":{"observed_at":"2026-08-11T22:17:36.157040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.121860Z","title":"Counterfactual explanations and how to find them: liter- ature review and benchmarking","venue":null,"work_id":"072dfef1-f763-4db6-92a5-ed1170d97ff1","year":2024},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.629835Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:e1eb8a9dc28b9a9e3d7f50b49c6c22bd58087895ca657862905bf1a6cc17132a","observation_id":"afaf28ab-1e70-48b2-b6a5-1ab3d9774052","resolution":{"observed_at":"2026-08-11T22:17:36.129473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.104962Z","title":"Distribution- aware counterfactual explanation by mixed-integer linear optimization","venue":null,"work_id":"640de515-9c6c-4974-b90a-dcc6a6874c44","year":2021},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.636527Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:2fc1923190661c97413f9033b81f5d73f19104b4d199a559bd761732e013c0e3","observation_id":"2939b227-a9b0-4021-a287-af12e478eefa","resolution":{"observed_at":"2026-08-11T22:17:36.109810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.083197Z","title":null,"venue":null,"work_id":"730eda70-6c43-4b6c-af70-6ada46ec22bd","year":2020},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.641778Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:142011edf96dd3520141c328a1a0f4c59e6a71d33d1a010b8e3a1d5a22e78e98","observation_id":"b21ffbc5-adc3-4801-95cc-d919d5323e0f","resolution":{"observed_at":"2026-08-11T22:17:36.088537Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.055714Z","title":"Extracting decision trees from trained neural networks","venue":null,"work_id":"d6c08a9f-29b3-418f-98c8-edf364c6df97","year":1999},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.647794Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:83e1c262360d094c65c7620e7c0af808beffbb02c16a40ccd8f303c213f9fdb4","observation_id":"0f4a9c17-2bab-4da6-957c-24b61169cc4f","resolution":{"observed_at":"2026-08-11T22:17:36.064072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.024638Z","title":"A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem","venue":null,"work_id":"050488ae-520d-4686-9fc2-db909e4dfb34","year":2023},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.655318Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:6c52569c6e86490d6883ef3f0ea49f5ec4bab580fb510a7537b1fdd596f72330","observation_id":"79390734-37f6-4166-b78e-8946176e7b2b","resolution":{"observed_at":"2026-08-11T22:17:36.041351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:36.000357Z","title":"Risk-averse two- stage stochastic programming for assembly line reconfiguration with dynamic lot sizes","venue":null,"work_id":"51e3adaa-cc59-45e4-bd1d-e17dbc3ffcb6","year":2024},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.662552Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:059f577eb10f68de1d4a0fc495fa98761e332faa2f8decbddeafa00684fcf7c5","observation_id":"3ae708b0-5819-4c08-a82e-159c493b8460","resolution":{"observed_at":"2026-08-11T22:17:36.006936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:35.981859Z","title":"Artificial intelligence and black-box medical decisions: accuracy versus explainability","venue":null,"work_id":"653cfd8b-a8c8-4fbf-9f28-b3c1ca981c8c","year":2019},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.668951Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:91041acecdbdc0f3c4b8959263696a9aa603a7cc4bc0a03c468078d774511a17","observation_id":"97a07748-52f8-44b1-bee2-7eb8360f6b4a","resolution":{"observed_at":"2026-08-11T22:17:35.988118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.03277","last_updated":"2020-06-12T23:46:46Z","snapshot_observed_at":"2026-08-17T21:47:44.641296Z","submitted_at":"2019-12-06T18:16:29Z","title":"Preserving Causal Constraints in Counterfactual Explanations for Machine Learning Classifiers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.03277","snapshot_observed_at":"2026-08-11T22:17:35.674341Z","title":"Preserving causal constraints in counterfactual explanations for machine learning classifiers","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.674341Z"},"links":{"cited_paper":"/paper/1912.03277","citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:8c1e6d771e0cae618ad5d8e1809913b4f149b9abe28dbe8df4f9fc4dcf9615a2","observation_id":"7a0bccc0-2573-4e83-8029-93135ad4802e","resolution":{"observed_at":"2026-08-11T22:17:35.674341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:35.964871Z","title":"Optimal counterfactual explanations in tree ensembles, in: International conference on machine learning, PMLR","venue":null,"work_id":"b6d96ff4-2f1c-4a37-8e28-f9afea688de7","year":2021},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.680013Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:091f3de7839c3e429e3a801208f527251500bc062b2f916069eeb11c5ba4188a","observation_id":"5c066203-556a-4197-9620-71437a4c141f","resolution":{"observed_at":"2026-08-11T22:17:35.970540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:35.945792Z","title":"Revisiting k-sum optimization","venue":null,"work_id":"064f9d5f-aa7f-40f8-8fd9-7cb16bf9ddff","year":2017},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.684412Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:014538e47b10b72971876f97f0778c409a2bf8fd92ddad5fea38f11b4dc02e14","observation_id":"769f5bc7-c228-4632-afbd-8867cd862307","resolution":{"observed_at":"2026-08-11T22:17:35.950755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:35.922371Z","title":"In- terpretable machine learning: Fundamental principles and 10 grand challenges","venue":null,"work_id":"2a67c898-e323-45ef-b3bf-7cf7b12d03a5","year":2022},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.690150Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:bfb460b98842a4f91104a50f5161eb458c59e9c2642ae459a7a8a9cb1fc7ccbe","observation_id":"5a22e348-5e2c-4261-b426-68fdc96439ea","resolution":{"observed_at":"2026-08-11T22:17:35.930636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:35.901385Z","title":"Interpretable counterfactual explanations guided by prototypes, in: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Springer","venue":null,"work_id":"f5679fd4-761c-4a1b-b82b-b821f0830fc4","year":2021},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.695927Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:8beb1b6c5520c949822f69fd673ff7569a6d59e9d60fe079a692b2184721a4fb","observation_id":"5183e37d-9fb2-45f3-967f-7b1267ecff66","resolution":{"observed_at":"2026-08-11T22:17:35.907465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:35.881032Z","title":"Counterfactual explanations and algorithmic recourses for machine learning: A review","venue":null,"work_id":"a7945811-9129-4328-8407-c8750a4bc30d","year":2024},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.706097Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:57f61d04479b33451118934e0f54cd271737071ec3ef5785dc6b759c0c5ad305","observation_id":"ef66beff-c3b3-4577-b268-f4a2bcff9756","resolution":{"observed_at":"2026-08-11T22:17:35.886795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:35.860983Z","title":"A survey of l1 regression","venue":null,"work_id":"3eed753d-7a02-4e92-85d9-3c22f42035c9","year":2013},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.714797Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:c5777ccfa5af6cdeb2a332e7e88681eb637dda54cf408c9b019736eb9421f8c8","observation_id":"2fca4247-e2cf-4223-88ff-a76d19f0a65b","resolution":{"observed_at":"2026-08-11T22:17:35.867332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T22:17:35.837798Z","title":"Robust regression and lasso","venue":null,"work_id":"2367df8f-fefc-4a01-b6c1-7d7534890c6d","year":2008},"citing_paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T22:17:35.720546Z"},"links":{"citing_paper":"/paper/2412.03722"},"observation_digest":"sha256:4d7edc674756fdd5f43135d743e408d1d3ad97a7f2982cb35dac14d6a36fcdff","observation_id":"23029be5-748b-452c-bc5e-a99f85888d39","resolution":{"observed_at":"2026-08-11T22:17:35.844877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.03722","last_updated":"2024-12-04T21:28:24Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T09:22:07.493432Z","submitted_at":"2024-12-04T21:28:24Z","title":"Optimal probabilistic feature shifts for reclassification in tree ensembles"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":27},"total_outbound_references":30},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2412.03722."}