{"as_of":"2026-08-18T05:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a1489fd8c98e6017b7ebdbb34db1b9feecebbce89e7358a0607748f878b474d0","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T04:41:16.214559Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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.01264/citation-record","integrity":"/paper/2412.01264/integrity","json":"/paper/2412.01264/citation-record.json","paper":"/paper/2412.01264"},"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-12T04:41:16.859295Z","title":"Min--max and min--max regret versions of combinatorial optimization problems: A survey","venue":null,"work_id":"524b7dc4-4454-4b93-ad67-7b34218fdc5b","year":2009},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.062630Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:085cb187885c54bddd563bb9ce97600dff4dbc9583ebad56767b587a68251bfc","observation_id":"85c9321a-80ad-4201-9c6b-98b57c11cdc3","resolution":{"observed_at":"2026-08-12T04:41:16.862998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.847953Z","title":"Optimal policy trees","venue":null,"work_id":"8a4b521f-b939-4e2a-a439-b31a0abe0347","year":2022},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.067281Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:166fbfe01ac623699441609fa7b61393a5a993aca764c3c0567ee77ced2ffe09","observation_id":"ffe943b2-eb48-46d8-8def-3160fffc91a5","resolution":{"observed_at":"2026-08-12T04:41:16.851206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.836289Z","title":"A framework for data-driven explainability in mathematical optimization","venue":null,"work_id":"cfb2452b-e051-43e8-8c58-bc414c739e3a","year":2024},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.071538Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:76a13d729eec39b2fd1c3d0dfb3e75b379ef18cd56243146195fe2bf982d1a3b","observation_id":"0260257b-6b16-4de8-a258-ca741d8e94a8","resolution":{"observed_at":"2026-08-12T04:41:16.839592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.823459Z","title":"Strong optimal classification trees","venue":null,"work_id":"5bbad94b-d4a2-49ed-b856-e93cc68a0b86","year":2024},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.075637Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:60bc4dfaa791362abf2e255167e194bd00043bdaba84b8ab8cbaca9b2690e0e0","observation_id":"02c3737a-b5a7-4b2b-94cf-68f03bd0996d","resolution":{"observed_at":"2026-08-12T04:41:16.827823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.810117Z","title":"Explainable predict-and-optimize","venue":null,"work_id":"36405d09-6511-4f61-ba5b-32404edbfeea","year":2023},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.079899Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:1d2502e33893cd7aedcd40727a5dab87f37afa86c770abe47e29ae486706adcf","observation_id":"5f0e18d4-cb7a-4246-8293-09cb386db984","resolution":{"observed_at":"2026-08-12T04:41:16.814732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.796817Z","title":"Decision trees: from efficient prediction to responsible AI","venue":null,"work_id":"f50e53af-8a51-4a81-a81f-ff442fb24f12","year":2023},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.083919Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:758e768af240934e7e3c6ac71d638fd8e310079563de0753e399201c127ad55e","observation_id":"2c1da620-f3db-4aa3-a8dd-6b669ff0c2b0","resolution":{"observed_at":"2026-08-12T04:41:16.800933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.784859Z","title":"Interpretable operations research for high-stakes decisions: Designing the Greek COVID -19 testing system","venue":null,"work_id":"e2092fa3-85d7-4f16-a2d9-68b6852c3b98","year":2022},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.088243Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:4ae914c3f9e8a3e5e1f2f60ad0a9abc099b3312c6d8b2b805b1511c64f256ec0","observation_id":"1bfa3258-73cf-4910-b99a-6270c2c942c6","resolution":{"observed_at":"2026-08-12T04:41:16.789072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.17299","last_updated":"2023-05-26T23:00:19Z","snapshot_observed_at":"2026-08-16T15:29:08.180263Z","submitted_at":"2023-05-26T23:00:19Z","title":"Improving Stability in Decision Tree Models","version":1},"cited_work":{"arxiv_id":"2305.17299","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.17299","snapshot_observed_at":"2026-08-12T04:41:16.402322Z","title":"Improving Stability in Decision Tree Models","venue":"stat.ML","work_id":"f27e06b7-3080-47b6-8608-af8e1c2f1788","year":2023},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.092004Z"},"links":{"cited_paper":"/paper/2305.17299","citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:a0eee95ea11e19e09851a9455c4ac383af8b819499d359478064abf60b33fee2","observation_id":"d83e366c-81bf-476b-b661-d7c09234cf32","resolution":{"observed_at":"2026-08-12T04:41:16.406397Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.772720Z","title":"Optimal prescriptive trees","venue":null,"work_id":"7b330248-79aa-4456-9967-cfb645abdafa","year":2019},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.096023Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:489d4279e6198117668371778b8b666e57885ba0b6d393e36d8d6fe81af0a98b","observation_id":"3fd45c46-aa09-4871-8591-84bc47d94653","resolution":{"observed_at":"2026-08-12T04:41:16.776429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.759618Z","title":"Data-driven robust optimization","venue":null,"work_id":"78e09edd-eeab-4158-bd35-951353d2c3b2","year":2018},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.099778Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:618ef4324aff32b5302e0ca2b02a0af3cb404512db00f2309f365f6e8c11d012","observation_id":"62d601b8-c420-4967-918d-131a11db0884","resolution":{"observed_at":"2026-08-12T04:41:16.764303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.748419Z","title":"Interpretable clustering: an optimization approach","venue":null,"work_id":"43faa874-c5d6-4b4b-ae71-46c9de47300d","year":2021},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.103914Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:a9498795a8f42ce55604917169690f75342c5c37aba7966ae132e4e73a6cef25","observation_id":"6d82eb41-1225-4ee3-9d69-d54289c993df","resolution":{"observed_at":"2026-08-12T04:41:16.752334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.737150Z","title":"Robust discrete optimization and network flows","venue":null,"work_id":"aab9503c-5cef-4bdb-89ab-77223ba9e62d","year":2003},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.107997Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:3064891eaebd8deb56c852b04c4cf68d85cb8dafc46b1d4d116db776e13618f4","observation_id":"0dfbc796-25f7-436c-aa09-be3db3236d6f","resolution":{"observed_at":"2026-08-12T04:41:16.740904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.725626Z","title":"The price of robustness","venue":null,"work_id":"681a85b2-1ccb-49c9-990c-db24c8cf3e71","year":2004},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.111857Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:f21e977b0499701309aad8654e7b6ebda6bdee1b019a7c2041eeb4f62a5ab6f9","observation_id":"d65a71a4-0ef9-4e36-9333-7dbbf97f1704","resolution":{"observed_at":"2026-08-12T04:41:16.729229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.714557Z","title":"Algorithms and uncertainty sets for data-driven robust shortest path problems","venue":null,"work_id":"b02b802b-f85d-4eed-bdf1-cd82022c2d01","year":2019},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.115614Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:3ffafa8187d286ea845921c1faf826e67f84871b82a97ead966c682e9ef1fe54","observation_id":"7df391ff-2da1-4966-92ee-1d8d4a587bed","resolution":{"observed_at":"2026-08-12T04:41:16.718157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.703030Z","title":"Explainable interactive evolutionary multiobjective optimization","venue":null,"work_id":"5a68a6f1-2d02-4718-b1b3-89e5e2786ca8","year":2024},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.119618Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:77ec6684a6421a74031de66eacfb21f90ef2350cb464a68302f1ee35e3b378de","observation_id":"1dd6318e-f864-4b8a-9961-302a4bbd9e0e","resolution":{"observed_at":"2026-08-12T04:41:16.706493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.691684Z","title":"On clustering and interpreting with rules by means of mathematical optimization","venue":null,"work_id":"09cb03b7-c7e3-479f-8946-91790d947c74","year":2023},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.123437Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:9e4ade37cb8dd29992944d2a22aaf747d4a71db39cc77f216f6f7207cbaff02d","observation_id":"2c473475-027e-4989-bcc8-18e4762cc1e7","resolution":{"observed_at":"2026-08-12T04:41:16.695546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.679944Z","title":"Argumentation for explainable scheduling","venue":null,"work_id":"0ef2f89e-8ede-478f-8be5-e5245dbeb3d9","year":2019},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.126766Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:4fd6aea8aee3f0c489a4de0f0271166af3726dd5ebd86dae38a860116839016a","observation_id":"428cf85f-9854-4c21-8cd1-f307aeffffa0","resolution":{"observed_at":"2026-08-12T04:41:16.683967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.668785Z","title":"Mi s i \\'c","venue":null,"work_id":"95d7b556-4cee-4781-9e54-a9f5c2f7e256","year":2022},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.130298Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:64ed63552af985e25a1d524273ea2f7ea1a7ff2b6c17b6c00ad0c2fbc66687eb","observation_id":"d5ff3bb3-45f4-4bf2-9d94-b2a0e23334dc","resolution":{"observed_at":"2026-08-12T04:41:16.672284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.655210Z","title":"Costa and Carlos E","venue":null,"work_id":"6cf7e89b-8eed-4a3b-989b-109ea77565a7","year":2023},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.133690Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:15ee2e68f0e9754078af8e5ed3f4da0a402a7f2b81f69d234a81d26e71cd5032","observation_id":"42f1872b-4116-43b3-8e16-4a380a56fdb3","resolution":{"observed_at":"2026-08-12T04:41:16.659809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.642416Z","title":"Robust decision trees against adversarial examples","venue":null,"work_id":"4f3830ca-d90f-4755-8ea1-886a052c7ed0","year":2019},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.137176Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:0a8832b6e49a5091190d407e18dad5802555f003d2ddb319a41c1e10519bdcfa","observation_id":"14b4b06c-b14d-45cc-861b-b48c6f258cc3","resolution":{"observed_at":"2026-08-12T04:41:16.646357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.631376Z","title":"predict, then optimize","venue":null,"work_id":"a5bbebab-0289-4200-a975-76825128ccd4","year":2022},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.140466Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:bb184d9a5d3276e619bbdca4bf97cc4e48ba47f304997c1f8b66e76855d741e4","observation_id":"77c89d36-f1f9-4ee0-bc01-22064fe82c11","resolution":{"observed_at":"2026-08-12T04:41:16.635397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.619620Z","title":"Explainable data-driven optimization: from context to decision and back again","venue":null,"work_id":"36ec5fed-7c65-4be4-af00-af599e04d950","year":2023},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.143474Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:45493b300b77b7bcfbd575dd086f637261cedc1b42fcb0d964e3fea5a70a7c75","observation_id":"d487b078-f1e1-42aa-ada1-ca7291fafc78","resolution":{"observed_at":"2026-08-12T04:41:16.623832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.607114Z","title":"A framework for inherently interpretable optimization models","venue":null,"work_id":"2e9a0d6f-d2ba-4dc7-87d2-de7f94354507","year":2023},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.146767Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:b6e16399027df3cca477d2bda8da6a67a0d9a1a51b0112025f1c44d5e62677aa","observation_id":"eb3ea978-57f4-448b-8666-a72217c20513","resolution":{"observed_at":"2026-08-12T04:41:16.611122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.595128Z","title":"An Introduction to Robust Combinatorial Optimization","venue":null,"work_id":"87bcf01f-c0c5-426d-8cea-2fea0804d71e","year":2024},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.150156Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:176f010eeef0a28be23eeb2f1dc6051ee786bd33d3773bd53dd821570703921b","observation_id":"cffda35b-22e6-4adf-a8a1-4d766e36f04a","resolution":{"observed_at":"2026-08-12T04:41:16.599033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2409.01869","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T04:41:16.380306Z","title":"Feature-based interpretable surrogates for optimization","venue":null,"work_id":"960abcd6-11c0-4e57-bf6f-e99ff181464f","year":2024},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.153759Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:ddd251eda66a68f15f1cb66d7bcd1aca9bad4226776512c457180340643e9151","observation_id":"bfda48a3-3c69-4c08-9a4d-e0f0c34937be","resolution":{"observed_at":"2026-08-12T04:41:16.388657Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.583129Z","title":"Garey and David S","venue":null,"work_id":"626fdc48-42c9-42ce-a1e4-2429f91b43a7","year":1979},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.157539Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:f4709e87f12ac456266ae2e2d69e8236554f6678414cd4cb5d48e77c21b0b93a","observation_id":"3b9b1e4e-2ae5-49cc-8828-5723ad54ba92","resolution":{"observed_at":"2026-08-12T04:41:16.587222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.570677Z","title":"Gurobi Optimizer Reference Manual , 2024","venue":null,"work_id":"0009add1-e7a1-4536-87db-69c047f9c70d","year":2024},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.161511Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:f480f52b7eee5051d946e6f0c7c439f326955658ce4ac2c26efb65f0d116d255","observation_id":"fa0cda9e-4070-4aa4-b96c-26d56befba28","resolution":{"observed_at":"2026-08-12T04:41:16.573908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.559840Z","title":"Gorissen, \\.I hsan Yan ko g lu, and Dick den Hertog","venue":null,"work_id":"9e2a9cc1-d7f7-4380-ba8c-9cc32cc8fe2c","year":2015},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.165458Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:ae71c7835445860bc855bc9102c07458a7fe3ae1804d010227f3773df6a84ce3","observation_id":"50f366b3-700a-4bb8-932a-15851ff0b04d","resolution":{"observed_at":"2026-08-12T04:41:16.563050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.548885Z","title":"Hagberg, Daniel A","venue":null,"work_id":"dabd3457-191e-4b12-9755-4f3fe7af41d5","year":2008},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.169245Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:a66bb098635e9c15eefc6340c30783e33e203268a5523eaf0a38767df2f78385","observation_id":"e7881dd7-5d35-4048-a0e7-c27fc99aa6b2","resolution":{"observed_at":"2026-08-12T04:41:16.552147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.537384Z","title":"Optimal robust classification trees","venue":null,"work_id":"3c8ede33-0c8e-4854-b062-3fe1090d983c","year":2022},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.172937Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:01e4253e037f02277fa46f8464bab4d06b0aaecbdce9c490f99c53a52512befd","observation_id":"8fb12c10-0c26-4acb-8f5a-05a326c4e9ad","resolution":{"observed_at":"2026-08-12T04:41:16.541324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.525557Z","title":"Christopher Beck","venue":null,"work_id":"13929a49-015d-4518-9fe4-abaeb3727447","year":2023},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.176677Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:9c8a01d3fccb9263cfe17a3e7b9ccf516f82c4838d99daed66483cacbc1a8e3e","observation_id":"5d48c688-4ee6-4153-a6a7-f6352657fda0","resolution":{"observed_at":"2026-08-12T04:41:16.529770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15431","last_updated":"2024-05-24T10:58:00Z","snapshot_observed_at":"2026-08-16T13:49:48.211495Z","submitted_at":"2024-05-24T10:58:00Z","title":"Counterfactual Explanations for Linear Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15431","snapshot_observed_at":"2026-08-12T04:41:16.180631Z","title":"\\.I lker Birbil, and Dick den Hertog","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.180631Z"},"links":{"cited_paper":"/paper/2405.15431","citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:fab078774a00c20b914dfc1d4988f84a8489937ad64cd11ba552d2ec8d626f75","observation_id":"8fd897d5-a1dd-4b26-a87c-37c9a84706b0","resolution":{"observed_at":"2026-08-12T04:41:16.180631Z","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-12T04:41:16.512727Z","title":"The multiple-choice knapsack problem","venue":null,"work_id":"645e118e-a13a-47fb-8c82-184afb6900de","year":2004},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.184623Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:836bea3d70a6def96088bd9f67f19f3f8cd001a4e9508fecaf17758ea9c88f08","observation_id":"ec6290b9-2e44-49bc-b9e0-881cf71e4869","resolution":{"observed_at":"2026-08-12T04:41:16.517118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.499739Z","title":null,"venue":null,"work_id":"c8394f94-1eb8-492c-8a93-9c2928c0b0d3","year":1976},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.188648Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:2ca0df6902dfb1388f67903e34627757c89efe94d9c7ab0251eb8a44ac7ee1df","observation_id":"f02cff52-1502-4683-ab0f-56e1a830c035","resolution":{"observed_at":"2026-08-12T04:41:16.503986Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.488101Z","title":"Robust decision trees for the multi-mode project scheduling problem with a resource investment objective and uncertain activity duration","venue":null,"work_id":"5023e8e7-3673-43bb-816c-9192b5a56168","year":2024},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.192160Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:ce5ddb52e261a8f063f771b70f0fe77eb9f37ffdfac0c9a506a7f1ff4c85b6f0","observation_id":"d0a32d09-67bc-4f13-9131-9e4cbbd6da04","resolution":{"observed_at":"2026-08-12T04:41:16.492159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.475624Z","title":"Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead","venue":null,"work_id":"361ad3ef-ad3b-4fd1-af06-3459d395f09c","year":2019},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.195965Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:ba95e6f76e331c438e647f431dda1dcecff9d1b3e4e3ae4306c58fad34c0b7f9","observation_id":"94e24c5e-79f4-4266-944f-7135c35d6b96","resolution":{"observed_at":"2026-08-12T04:41:16.479830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.464555Z","title":"Zoltners","venue":null,"work_id":"1ac29fdc-18fc-4520-b919-717636090045","year":1979},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.199720Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:9b099ff1620e27d7936d138f58b5e28a8e4976d7db7add22f284cef96545e54f","observation_id":"9a4b2938-69c0-43c6-8fd4-8c7d1c621db7","resolution":{"observed_at":"2026-08-12T04:41:16.468292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.450668Z","title":"Explaining solutions to multi-stage stochastic optimization problems to decision makers","venue":null,"work_id":"a14c5f50-b97a-490c-9a33-f9de30b2a796","year":2022},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.203432Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:8d9bfb668e016f2b48007ca873854b90287f5185707154b28c3b5ac3b684730e","observation_id":"4b3e4a7b-028a-42aa-ad5e-96a468ef0882","resolution":{"observed_at":"2026-08-12T04:41:16.455183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.438564Z","title":"Efficient training of robust decision trees against adversarial examples","venue":null,"work_id":"75828aeb-df39-4079-b9c5-8c879c8f2eee","year":2021},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.207480Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:cc57b26a3f94fd9640d257fc86ba7e9614594c34ee48693796b79221926e4c69","observation_id":"e77f2832-9c6e-499a-ac12-c3ed3a1f27d9","resolution":{"observed_at":"2026-08-12T04:41:16.442728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.426434Z","title":"Robust optimal classification trees against adversarial examples","venue":null,"work_id":"8d1f4726-bfff-461c-9245-60f2171bc68c","year":2022},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.211049Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:b2a12e7715eda842e00ab59d68639889d7fb511c9141ebd7df4736755e9c3560","observation_id":"1fff7b6c-e496-4d05-a5ff-894bcd70b130","resolution":{"observed_at":"2026-08-12T04:41:16.430336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T04:41:16.414831Z","title":"Solving two-stage robust optimization problems using a column-and-constraint generation method","venue":null,"work_id":"42473f31-1ac1-4d7d-a337-e46b9a9e2f29","year":2013},"citing_paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-12T04:41:16.214559Z"},"links":{"citing_paper":"/paper/2412.01264"},"observation_digest":"sha256:1d03d62b74469e41b5eb163bdb0ee421728767e2898fa1cc25b312635923338b","observation_id":"44d83737-b42f-4f26-9ef8-fa6ae24683c8","resolution":{"observed_at":"2026-08-12T04:41:16.418727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.01264","last_updated":"2024-12-02T08:31:48Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T04:29:16.187092Z","submitted_at":"2024-12-02T08:31:48Z","title":"Towards Robust Interpretable Surrogates for Optimization"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":2,"verified_fuzzy":37},"total_outbound_references":41},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2412.01264."}