{"as_of":"2026-08-08T05:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aad57b70fb79f3fc4048f4f2c300c8dd60db4d238ffe10c10dbc96ce1e6eb761","coverage":[{"denominator":66,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":66,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:09:11.471675Z","state":"measured"},{"denominator":68,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":68,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T19:15:52.773579Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-13T16:53:00.131840Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"cited_work":{"arxiv_id":"2506.03531","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.03531","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","venue":null,"work_id":"e9b86904-f0a0-4cfb-bfd3-2f60fab25de3","year":2025},"citing_paper":{"arxiv_id":"2604.03871","last_updated":"2026-04-04T21:34:54Z","snapshot_observed_at":"2026-08-06T22:35:43.972494Z","submitted_at":"2026-04-04T21:34:54Z","title":"Efficient Convexification of Kolmogorov-Arnold Networks with Polynomial Functional Forms Via a Continuous Graham Scan Approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-13T16:50:37.170135Z"},"links":{"cited_paper":"/paper/2506.03531","citing_paper":"/paper/2604.03871"},"observation_digest":"sha256:f1894691e3be6e05c979c14f383129e67df3aa8428c941f02a74d3fd3185338f","observation_id":"91e7bad2-a7ed-4d48-bbd8-0efe35bf3a39","resolution":{"observed_at":"2026-05-13T16:53:00.133364Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03531","snapshot_observed_at":"2026-07-13T19:15:52.773579Z","title":"Conformal mixed-integer constraint learning with feasibility guarantees,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.00002","last_updated":"2026-03-25T03:34:11Z","snapshot_observed_at":"2026-08-07T22:26:37.217811Z","submitted_at":"2026-03-25T03:34:11Z","title":"Position Paper: Post-Solve Robustness in Decision Engines: Feasible Regions and Smoothness Under Perturbations","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-13T19:15:52.773579Z"},"links":{"cited_paper":"/paper/2506.03531","citing_paper":"/paper/2606.00002"},"observation_digest":"sha256:adf2b11de18cd9146759116e517f31016ece510d84d1e819fc575e89dc4308b2","observation_id":"e9fb9abc-3f9f-4fb1-a06f-9eec52656d97","resolution":{"observed_at":"2026-07-13T19:15:52.773579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.03531/citation-record","integrity":"/paper/2506.03531/integrity","json":"/paper/2506.03531/citation-record.json","paper":"/paper/2506.03531"},"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-07T11:09:23.455434Z","title":"Optimization with constraint learning: A framework and survey.European Journal of Operational Research, 314(1):1–14, 2024","venue":null,"work_id":"43c332d6-7286-4cf8-a844-68de8ceecd9a","year":2024},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:04.106032Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:c6d4aa9358c7608f93db7bf81a74c20d66abec5b73e180ce703574e21f297423","observation_id":"6ad5dd20-7dbe-40ba-b45a-aea57da938d3","resolution":{"observed_at":"2026-08-07T11:09:23.557627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.03244","last_updated":"2024-03-26T20:35:45Z","snapshot_observed_at":"2026-07-06T17:12:18.575364Z","submitted_at":"2024-01-06T15:55:14Z","title":"Artificial Intelligence for Operations Research: Revolutionizing the Operations Research Process","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.03244","snapshot_observed_at":"2026-08-07T11:09:04.246324Z","title":"Artificial intelligence for operations research: Revolutionizing the operations research process","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:04.246324Z"},"links":{"cited_paper":"/paper/2401.03244","citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:84d4eb3656ec8d5c2012130237e1b5ff2747a78a6e68e51a9bf91a8d18e4c77f","observation_id":"87042e38-55fd-4ebd-8f33-deee3550c6ba","resolution":{"observed_at":"2026-08-07T11:09:04.246324Z","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-07T11:09:23.295725Z","title":null,"venue":null,"work_id":"02ac93ff-d114-4e8a-a364-cf5cde8b8b32","year":2024},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:04.397887Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:f4594fa0b60fd8d72a23dca150f5229e5aa2d6fd4f0d19ade3e10f7a38bd21e2","observation_id":"02fa8c2f-f8ad-4987-aa21-780f957bff83","resolution":{"observed_at":"2026-08-07T11:09:23.384181Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:23.088561Z","title":"Advances in surrogate based modeling, feasibility analysis, and optimization: A review.Computers & Chemical Engineering, 108: 250–267, 2018","venue":null,"work_id":"f97e806b-4e9b-43a1-9231-693fa64551e0","year":2018},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:04.520980Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:de17cb21e92570ec47c4a2db062fbea9730c8ebb81810fd385ad1c78bd636cc7","observation_id":"2ae3ed46-40be-4b40-a166-c865446da5bd","resolution":{"observed_at":"2026-08-07T11:09:23.212275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:22.898143Z","title":"Machine learning-based surrogate modeling for data- driven optimization: a comparison of subset selection for regression techniques.Optimization Letters, 14(4):989–1010, 2020","venue":null,"work_id":"f0a2faba-a56c-4816-9fe3-ca196237b284","year":2020},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:04.624980Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:b4429cfbdcc1d4ecf616297f38f69cdd15c9e9c1257778cb8248023cd12ba809","observation_id":"9145fde5-753a-4f14-9eb7-025f5b3377a8","resolution":{"observed_at":"2026-08-07T11:09:22.957961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:22.644057Z","title":"A surrogate-based framework for feasibility-driven optimization of expensive simulations.AIChE Journal, 70(5):e18364, 2024","venue":null,"work_id":"5bda1648-8f2e-4f00-a788-e1441e875d98","year":2024},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:04.743441Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:5d85a4569f3c1dd1590d006a4065d60930ec1e1b883536098f5d27a8f5cb294c","observation_id":"29958b1a-f2d8-4156-b47e-bd3033359484","resolution":{"observed_at":"2026-08-07T11:09:22.786974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:22.394242Z","title":"Mixed-integer optimization with constraint learning.Operations Research, 73(2):1011–1028, 2025","venue":null,"work_id":"8e59ef74-af7d-4b96-945d-66c7458df25e","year":2025},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:04.866969Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:6b118fa10cfb50107eaad7cd9146bd2467117ffec9587ae3e57f19906cdcfa3c","observation_id":"f8749fa4-4802-4558-9d0d-ab9c983224ad","resolution":{"observed_at":"2026-08-07T11:09:22.527972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:22.157475Z","title":"Deep neural networks and mixed integer linear optimization","venue":null,"work_id":"305cc581-d071-4eca-8ba7-780c6593ead4","year":2018},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:04.981840Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:fe2204bfc3bb5d98c0eae4fb1a16ab6faf9d7dd608916f268cd5f5d3e3c183a0","observation_id":"b855a0b2-8368-4c7c-a65e-d7b9dea35f58","resolution":{"observed_at":"2026-08-07T11:09:22.290662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:21.876180Z","title":"Relu networks as surrogate models in mixed-integer linear programs.Computers & Chemical Engineering, 131:106580, 2019","venue":null,"work_id":"9dd6ec68-f168-43af-a553-43a4105dd70a","year":2019},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:05.196097Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:605fe6007c534022cefae4f28a18c96118c44320be291a5183e3674b6d2f80c9","observation_id":"19c27ba3-d6fc-4a92-bf81-3836c31eec92","resolution":{"observed_at":"2026-08-07T11:09:21.990521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:21.618211Z","title":"Strong mixed-integer programming formulations for trained neural networks.Mathematical Programming, 183(1):3–39, 2020","venue":null,"work_id":"5ee49751-c668-4b1b-abf7-36a100cfa76c","year":2020},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:05.319009Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:044fb8138466a937701de28bbad6241e819cfc7ff656419379f6ad129651035b","observation_id":"b6663556-74e5-48f1-8447-a9791e730835","resolution":{"observed_at":"2026-08-07T11:09:21.702195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:21.338510Z","title":"Mixed-integer convex nonlinear optimization with gradient-boosted trees embedded.IN- FORMS Journal on Computing, 33(3):1103–1119, 2021","venue":null,"work_id":"72a40c18-d7ce-41e4-b6ef-c99f4b6bd615","year":2021},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:05.401993Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:5af9afd52ee2c8a704a156639ae8b7ec9c5045265c290be8277ce228b7cc88c9","observation_id":"15fdbf11-5e21-4a9e-b965-0618b8243ce8","resolution":{"observed_at":"2026-08-07T11:09:21.476346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:21.026937Z","title":"Tree ensemble kernels for bayesian optimization with known constraints over mixed-feature spaces.Advances in Neural Information Processing Systems, 35:37401–37415, 2022","venue":null,"work_id":"c451e1a9-f71b-4f8b-ad05-5cdcb0564983","year":2022},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:05.484069Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:3dd93ba43e7b35dd4da6ab61de323f2c6a4746a7b767bcb5d06bc33b1489f5c1","observation_id":"d57c0655-d978-4685-a44c-f84735562fa1","resolution":{"observed_at":"2026-08-07T11:09:21.173468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:20.767494Z","title":"Regression and classification using optimal decision trees","venue":null,"work_id":"41286409-1485-49d1-ae92-b5025cad73e4","year":2017},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:05.544886Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:97e242d6ad917441ec36a10c5f4884b5c6073fc7a820427d7868570c3133aec5","observation_id":"e17343b5-59df-4021-831d-d5ec5a00a84e","resolution":{"observed_at":"2026-08-07T11:09:20.921718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:20.541996Z","title":"Embedding decision trees and random forests in constraint programming","venue":null,"work_id":"0f458b99-67b5-4ef0-862e-ab67d43a11e9","year":2015},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:05.647749Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:1416dd364ab4ed4f66a7aeb286ce7e4c546ea597b8f0de49c7adfc9a0c05e9f5","observation_id":"320ce0dc-211d-456a-8913-7191cbf43d8b","resolution":{"observed_at":"2026-08-07T11:09:20.663844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:20.306952Z","title":"Optimizing objective functions determined from random forests.Available at SSRN 2986630, 2017","venue":null,"work_id":"9e41bf20-da77-4215-8ff3-0535b2d265c3","year":2017},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:05.717480Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:8b0af22409c59d7f9ffc3092f0a7c9d92f81dfe59cd034261d4cc8ea597fedc4","observation_id":"47632fe0-ec5d-4b45-8766-c5c4c29a2cde","resolution":{"observed_at":"2026-08-07T11:09:20.398445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:20.102162Z","title":"Optimization of tree ensembles.Operations Research, 68(5):1605–1624, 2020","venue":null,"work_id":"1c3ee1f4-5784-4e2a-bf80-3464d3debb2e","year":2020},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:05.788612Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:d702880be97d050ba8ce125f676dda0b3eff04930eef6afe186393033d11ad7c","observation_id":"2fbffa00-19b2-41c3-8cd0-6ed32489b63c","resolution":{"observed_at":"2026-08-07T11:09:20.196987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:19.882673Z","title":"Linear model decision trees as surrogates in optimization of engineering applications.Computers & Chemical Engineering, 178:108347, 2023","venue":null,"work_id":"84fa9cfc-0b2c-499c-bd89-138e1bcb2dec","year":2023},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:05.888797Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:676de1b41064216e3292253e40b5962e84b38d53b57dde60ddd69cef95343913","observation_id":"16733866-bf3f-42dc-8c33-9e22dfcba66e","resolution":{"observed_at":"2026-08-07T11:09:20.009263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:19.647207Z","title":"The trust region filter strategy: Survey of a rigorous approach for optimization with surrogate models.Digital Chemical Engineering, page 100197, 2024","venue":null,"work_id":"6fc5a684-3920-4813-98f0-5414073ee3d6","year":2024},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:06.014753Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:e024952e5f2599ff8539967dfd362b4be1b01265f4399c0095788b11e91712a4","observation_id":"23968612-19a9-46ef-aee4-a204ba64432f","resolution":{"observed_at":"2026-08-07T11:09:19.763426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:19.421840Z","title":"Optimizing over an ensemble of trained neural networks.INFORMS Journal on Computing, 35(3):652–674, 2023","venue":null,"work_id":"57c7ca19-5a93-4d2f-9094-c45fe6e709be","year":2023},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:06.132287Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:53ff2086aa82ab65575d8f0c35b60d6e047513b713a314b279ac672d7fccf24d","observation_id":"946275d6-d948-4c25-9548-cd942efe9619","resolution":{"observed_at":"2026-08-07T11:09:19.517412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:19.204645Z","title":"A unified view of piecewise linear neural network verification.Advances in neural information processing systems, 31, 2018","venue":null,"work_id":"d5be6590-23e8-4e64-a926-1b75d1cc65c7","year":2018},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:06.249558Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:6fd823ed54c9504b9633e80eba43d1dca2ee87705a85a4095375eed9369c857c","observation_id":"2c040cee-6074-4726-8523-5e1d76267497","resolution":{"observed_at":"2026-08-07T11:09:19.310708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.07356","last_updated":"2019-02-18T04:39:10Z","snapshot_observed_at":"2026-07-06T06:10:21.255556Z","submitted_at":"2017-11-20T15:05:33Z","title":"Evaluating Robustness of Neural Networks with Mixed Integer Programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.07356","snapshot_observed_at":"2026-08-07T11:09:06.368110Z","title":"Evaluating robustness of neural networks with mixed integer programming.arXiv preprint arXiv:1711.07356, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:06.368110Z"},"links":{"cited_paper":"/paper/1711.07356","citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:55c4100949fbdd6cad44fd675c49aed2d3893311c5131c3fca7cb22fded24d22","observation_id":"72e99312-d191-4458-b393-89c1b1abecf6","resolution":{"observed_at":"2026-08-07T11:09:06.368110Z","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-07T11:09:18.958471Z","title":"Maximum resilience of artificial neural networks","venue":null,"work_id":"581f16ec-c108-4f98-960b-2b1f35289300","year":2017},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:06.469356Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:bd7c42d76923560116fea73147e8a2b5f5d9b96b0dfbb7b05a858ca699224d06","observation_id":"9aa46894-0b7b-4a89-b88a-410840c90691","resolution":{"observed_at":"2026-08-07T11:09:19.092983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.07351","last_updated":"2017-06-22T14:59:49Z","snapshot_observed_at":"2026-07-06T05:48:00.958213Z","submitted_at":"2017-06-22T14:59:49Z","title":"An approach to reachability analysis for feed-forward ReLU neural networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.07351","snapshot_observed_at":"2026-08-07T11:09:06.573196Z","title":"An approach to reachability analysis for feed-forward relu neural networks.arXiv preprint arXiv:1706.07351, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:06.573196Z"},"links":{"cited_paper":"/paper/1706.07351","citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:d112213a348ae3d6bf5e23d00240a6a8ad5ab6eb0056317d7a9d99b4f58330df","observation_id":"9ca55678-d130-4d03-8bff-b25d2d5ce0a8","resolution":{"observed_at":"2026-08-07T11:09:06.573196Z","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-07T11:09:18.831441Z","title":"Efficient verification of relu-based neural networks via dependency analysis","venue":null,"work_id":"e5464482-7b1a-4a49-95ec-86799bc060cb","year":2020},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:06.656583Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:4811535073e680593ef7392bd25934a9dfb0b6d9a85a20ea04662d68db298a72","observation_id":"8a956914-f36a-4f64-a471-eabe0d43e7b3","resolution":{"observed_at":"2026-08-07T11:09:18.881995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.13824","last_updated":"2021-03-16T16:35:00Z","snapshot_observed_at":"2026-08-07T19:55:18.267566Z","submitted_at":"2020-11-27T16:42:12Z","title":"Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.13824","snapshot_observed_at":"2026-08-07T11:09:06.756849Z","title":"Fast and complete: Enabling complete neural network verification with rapid and massively parallel incomplete verifiers.arXiv preprint arXiv:2011.13824, 2020","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:06.756849Z"},"links":{"cited_paper":"/paper/2011.13824","citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:5b9f0e68f72f52f4b09905d96558a4ce82a81e210135fff66b342ef74a1345b5","observation_id":"2767abf3-9192-4cef-a3f2-d5180c25c90d","resolution":{"observed_at":"2026-08-07T11:09:06.756849Z","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-07T11:09:18.675007Z","title":"Towards scalable complete verification of relu neural networks via dependency-based branching","venue":null,"work_id":"dff64c69-49d2-4e4a-990c-1c5304c5a143","year":2021},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:06.800673Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:f0728ff00875a1f981728141474dcb1ccd57bdeaf512b9c819ca71ccec471d2f","observation_id":"93f0922e-6f35-4d51-8d1b-39065d0ad2f8","resolution":{"observed_at":"2026-08-07T11:09:18.752882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:18.551444Z","title":null,"venue":null,"work_id":"87fb5f0a-0500-467f-ba08-eb5ced5eadd3","year":2021},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:06.916861Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:053ecf4ae55b23f78c06eac5319f2a9e7b76acce270bc407f97afaa9a814a7b5","observation_id":"426a9ce5-6913-4310-b8b8-c1746c808f79","resolution":{"observed_at":"2026-08-07T11:09:18.610630Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:18.433724Z","title":"Ead: elastic-net attacks to deep neural networks via adversarial examples","venue":null,"work_id":"c07b951f-9018-4ae6-841b-43b92646f210","year":2018},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:06.983942Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:38abf4b9347c0987a86fdd34f98d970a366c1e76d6a608527491fe5c7285a49d","observation_id":"fd59b71a-3d82-4197-92b1-11f8832db3cd","resolution":{"observed_at":"2026-08-07T11:09:18.486083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:07.099054Z","title":"Minimally distorted adversarial examples with a fast adaptive boundary attack","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:07.099054Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:908f5f0d3e025b932a36ebe12d1aaeca2e2b86159d9743cc7407bd795e8c20b7","observation_id":"78e8a8b6-6e7c-4a22-a70f-ba31cd9ce0ef","resolution":{"observed_at":"2026-08-07T11:09:07.099054Z","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-07T11:09:18.309418Z","title":"Partition-based formu- lations for mixed-integer optimization of trained relu neural networks.Advances in neural information processing systems, 34:3068–3080, 2021","venue":null,"work_id":"c15973f3-384b-4076-881a-219e768389ef","year":2021},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:07.213580Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:8d975f02f94194089dc231fc54f649a40bed53dbc102bb611691c9d169244920","observation_id":"6b29d7cc-127a-40a6-8aee-4d310da25b63","resolution":{"observed_at":"2026-08-07T11:09:18.363835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:18.181897Z","title":"Nonlinear hybrid planning with deep net ltearned transition models and mixed-integer linear programming","venue":null,"work_id":"afe45ebe-76d9-44e2-9679-fc7419906fc9","year":2017},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:07.369835Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:4ca39ff07dd86675543d579e1148dd2183736452d742e72b972c82bc48fdd318","observation_id":"5e73c744-c82f-4432-815b-7fa9828afb56","resolution":{"observed_at":"2026-08-07T11:09:18.238209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.12397","last_updated":"2020-02-28T19:29:14Z","snapshot_observed_at":"2026-08-04T07:25:20.847892Z","submitted_at":"2019-09-26T21:16:17Z","title":"CAQL: Continuous Action Q-Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.12397","snapshot_observed_at":"2026-08-07T11:09:07.484329Z","title":"Caql: Continuous action q-learning.arXiv preprint arXiv:1909.12397, 2019","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:07.484329Z"},"links":{"cited_paper":"/paper/1909.12397","citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:57c1c86781e2a44c8bfdd99ee7507a30e0538a9e3ebfdaa1bb6479c6100e6f95","observation_id":"e12c8d02-dabc-4310-9df2-4bc1035fa95b","resolution":{"observed_at":"2026-08-07T11:09:07.484329Z","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-07T11:09:18.048493Z","title":"Reinforcement learning with combinatorial actions: An application to vehicle routing.Advances in Neural Information Processing Systems, 33:609–620, 2020","venue":null,"work_id":"3306ccdb-e738-42ca-9ce6-8aef2637b10a","year":2020},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:07.644225Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:70e952277db4efe57b0f9d66dde8349170459393ec18790406f96e22e153ca2c","observation_id":"357d7c3d-eff9-426c-928e-2d0264bc1752","resolution":{"observed_at":"2026-08-07T11:09:18.126121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:17.891867Z","title":"Data-driven power system operation: Exploring the balance between cost and risk.IEEE Transactions on Power Systems, 34(1):791–801, 2018","venue":null,"work_id":"236f14d0-7bf2-42c7-b3b0-e6a1a6584714","year":2018},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:07.756231Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:299583969c2af32e394abf4edf361b4764802d23fcec222987f4dc51c2990df3","observation_id":"c918a59c-1c52-48c7-979d-89e8bad3a7af","resolution":{"observed_at":"2026-08-07T11:09:17.959090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:17.740599Z","title":"From decision trees and neural networks to milp: power system optimization considering dynamic stability constraints","venue":null,"work_id":"ca67f64e-96e8-459c-bdc6-17ed131309d2","year":2020},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:07.861847Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:1224ecc9af7f4b8b708f26f8e8ce68d51f2d2950f42e92d6d04587bfdd1b7aff","observation_id":"c67179bc-ebcf-4701-9e66-ad1ebf6d2851","resolution":{"observed_at":"2026-08-07T11:09:17.821468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:17.641928Z","title":"An analytics approach to designing combination chemotherapy regimens for cancer.Management Science, 62(5):1511–1531, 2016","venue":null,"work_id":"4313c29c-d9c1-4e94-836c-b7e84ff1cffd","year":2016},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:07.989021Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:c29e758e72fa2d7511446bc34ce50509cc48780784be8d3431b3db30c31074ff","observation_id":"33f4946c-7cc9-4c06-8ae1-ed1ce47e5ba7","resolution":{"observed_at":"2026-08-07T11:09:17.689847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:17.492697Z","title":"Integrating tactical planning, operational planning and scheduling using data-driven feasibility analysis.Computers & Chemical Engineering, 161:107759, 2022","venue":null,"work_id":"b3bf07e2-370a-497b-bc50-0ec7ff55cef5","year":2022},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:08.135117Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:fc77bf36cfb2133c11271daf2f3d8216be2232aa37071b0a6e1935c83ede7d10","observation_id":"725a0a97-c95e-4850-8006-2f5f39b55203","resolution":{"observed_at":"2026-08-07T11:09:17.557878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:17.343894Z","title":"Integration of plant scheduling feasibility with supply chain network under disruptions using machine learning surrogates","venue":null,"work_id":"ddae5eac-01cd-4282-a56e-156219ba1b9d","year":2024},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:08.268871Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:b8360ed94476923c8c9ea62b3d002f4cabe16feba3163fee7a3b49aad922d527","observation_id":"62c4be10-9b8e-4d8d-839e-e2b271b9e38a","resolution":{"observed_at":"2026-08-07T11:09:17.420646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:17.233185Z","title":"Mixed-integer linear programming formulation with embedded machine learning surrogates for the design of chemical process families.Industrial & Engineering Chemistry Research, 2025","venue":null,"work_id":"9740ce75-baee-4652-82dc-829838ad3ea1","year":2025},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:08.339291Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:c7bb413c9b4c46d56353f3d0aab31bd6d97200c5b5f0cbc6bfea615e9c16f335","observation_id":"9661a74c-2890-438d-9ba7-ce55b5f0d455","resolution":{"observed_at":"2026-08-07T11:09:17.281428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:17.098685Z","title":"Formulating data-driven surrogate models for process optimization.Computers & Chemical Engineering, 179:108411, 2023","venue":null,"work_id":"0ea547be-488e-4632-b066-c9fe4dae7bd6","year":2023},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:08.441085Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:9aa4ea05fe0499e4449bb0d57b6a8c5bc7678b3ee374caea54dd21960ce9f101","observation_id":"8e62ebc5-e920-421f-bd54-6c85cb02a7b6","resolution":{"observed_at":"2026-08-07T11:09:17.169893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:16.965660Z","title":"Reduced model trust region methods for embedding complex simulations in optimization problems","venue":null,"work_id":"d0e6d767-4446-4f03-946b-5b011e744a18","year":2015},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:08.504068Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:836abea6d841920ff130488f0fbc68b99e2436effe6854a3139973f3ebbb2eae","observation_id":"8bdbb81a-9990-4a74-ab65-f4f5605bf3ee","resolution":{"observed_at":"2026-08-07T11:09:17.039188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:14.994306Z","title":"Advanced trust region optimization strategies for glass box/black box models.AIChE Journal, 64(11):3934–3943, 2018","venue":null,"work_id":"17a8469a-ada3-45fb-bb37-d03e055b01f4","year":2018},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:08.568391Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:6c47a92a8e8cd8999d4d9a029f14dfe1ae427417e9dab438e3f285128298f01e","observation_id":"774b41db-a367-4eae-b47d-15e3dfa11e37","resolution":{"observed_at":"2026-08-07T11:09:16.113249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:08.628706Z","title":"Nested conformal prediction and quantile out-of-bag ensemble methods.Pattern Recognition, 127:108496, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:08.628706Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:a87779bfb4535251f63198b1d6e509d7d3b17e4f70700d92b42056462461b0bb","observation_id":"42302236-43a7-4310-95d6-d8701a2b9fdb","resolution":{"observed_at":"2026-08-07T11:09:08.628706Z","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-07T11:09:14.723948Z","title":"Candès, Aaditya Ramdas, and Ryan J","venue":null,"work_id":"894979c3-7e91-441f-ba13-2e14335f4ae1","year":2023},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:08.714145Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:3351f4287064caa5a0e00e1b82d01f6290bc127d1461280218b9611d41540004","observation_id":"c5109241-e357-4d7b-b0ce-472b1876a358","resolution":{"observed_at":"2026-08-07T11:09:14.778662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:14.626175Z","title":"Boosted conformal prediction intervals","venue":null,"work_id":"ea1f9416-6b0d-46fe-aa89-d699e179dddc","year":2024},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:08.837521Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:9513cd4816963ba5241a13b2961b4bb8bc070b24983b725096ef169b69cf3287","observation_id":"e4d95052-215f-4799-b95e-fc8ef4438011","resolution":{"observed_at":"2026-08-07T11:09:14.668755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:14.426014Z","title":"Conformal inverse optimization.Advances in Neural Information Processing Systems, 37:63534–63564, 2024","venue":null,"work_id":"9e831203-a0fb-41cf-9725-45ff1ff895a3","year":2024},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:08.952828Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:4df44ba8b0aa8a8a77dd7e8b504a25c21a160b45f79a8984190fc0e9409cc99c","observation_id":"3ef226d0-778e-4fd6-8874-7bfc7ec7d496","resolution":{"observed_at":"2026-08-07T11:09:14.534511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.07407","last_updated":"2026-07-09T00:09:40Z","snapshot_observed_at":"2026-07-12T23:16:58.768627Z","submitted_at":"2024-02-12T04:59:34Z","title":"Conformal Predictive Programming for Chance Constrained Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.07407","snapshot_observed_at":"2026-08-07T11:09:09.044093Z","title":"Conformal predictive programming for chance constrained optimization.arXiv preprint arXiv:2402.07407, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:09.044093Z"},"links":{"cited_paper":"/paper/2402.07407","citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:21af078b0f84b934f7eefd45e53c9b0c74453861dd0e94badce9c2cb8ec66c4e","observation_id":"37be7222-7076-4d51-9839-437b2b8e1926","resolution":{"observed_at":"2026-08-07T11:09:09.044093Z","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-07T11:09:14.289349Z","title":"Mixed integer linear programming formulation techniques.Siam Review, 57(1):3–57, 2015","venue":null,"work_id":"62bc917e-4927-4dbb-b9f0-76fde2c8e067","year":2015},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:09.141484Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:d0a1e9f83deb914cfaee2390eb196784d47f003495db516264663997fc991cda","observation_id":"24775e60-dd38-4dca-9b0e-d60598dd0c6c","resolution":{"observed_at":"2026-08-07T11:09:14.334726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:14.143844Z","title":"Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with baron.Optimization Methods and Software, 33(3):540–562, 2018","venue":null,"work_id":"6685aeb1-b64d-4bc1-a4f9-bcecf59859b6","year":2018},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:09.256079Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:589a32630232985dcc236066c79f55710ce4106251749049823b466e2bf90bb7","observation_id":"7b0506af-0849-4ed3-9d00-06a41e6a2a49","resolution":{"observed_at":"2026-08-07T11:09:14.232397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:13.987455Z","title":"Conformal prediction: Clas- sification and general case","venue":null,"work_id":"cefb216e-feb9-4e75-97f9-fb4de4528621","year":2022},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:09.321569Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:5397a3ed20f7d21417c60a679995629dd5613965fc88662c3d62dbde9617b0eb","observation_id":"3616881a-e760-4e65-893a-a9273160e9bf","resolution":{"observed_at":"2026-08-07T11:09:14.054589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:09.433664Z","title":"Conformal prediction under covariate shift.Advances in neural information processing systems, 32, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:09.433664Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:77a3f80f839f303d79344866727f229f58662e88f5b9ee7bf6d1647bf2deac7d","observation_id":"a18e7b65-ef4c-4bb0-b221-74d699d367b8","resolution":{"observed_at":"2026-08-07T11:09:09.433664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.11824","last_updated":"2026-03-06T03:35:34Z","snapshot_observed_at":"2026-07-06T19:52:07.342252Z","submitted_at":"2024-11-18T18:44:00Z","title":"Theoretical Foundations of Conformal Prediction","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.11824","snapshot_observed_at":"2026-08-07T11:09:09.767571Z","title":"Theoretical foundations of conformal prediction.arXiv preprint arXiv:2411.11824, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:09.767571Z"},"links":{"cited_paper":"/paper/2411.11824","citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:05ade3bef9ebb3d14f93927f78546d0103a956131d2ad4cd99a936c1cf934f17","observation_id":"784f734e-38c0-4d02-9cf0-6a2ebcc753ad","resolution":{"observed_at":"2026-08-07T11:09:09.767571Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:09:09.879411Z","title":"Classification with valid and adaptive coverage.Advances in neural information processing systems, 33:3581–3591, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:09.879411Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:281d09bf88dd32c54809d13b28104f1ecc829c82f40943c54ffd328e327f1368","observation_id":"cb468e85-92f8-4eae-84c5-ba82b069ed9a","resolution":{"observed_at":"2026-08-07T11:09:09.879411Z","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-07T11:09:13.848613Z","title":"Conformal prediction using conditional histograms","venue":null,"work_id":"3ef6c874-9da2-4f13-9837-992ad1785883","year":2021},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:10.052206Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:2858c36bb77fe390452ed842913369158ee6ac1a9eb0a6fd2da9f411e2ded44c","observation_id":"a0bdc482-47b8-478a-aa7e-a4796d233816","resolution":{"observed_at":"2026-08-07T11:09:13.907977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:13.705104Z","title":"Mondrianconfidence machine.Technical Report, 2003","venue":null,"work_id":"4cd6f227-086f-4685-b8a7-92bde5bdc2d6","year":2003},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:10.168675Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:92c9f6f69b13a00d925d1d5376c152cf00e8cde4610289ddecbfc7c634eea13b","observation_id":"6d14d6eb-771a-42e4-8dfb-bf9d8be53ac8","resolution":{"observed_at":"2026-08-07T11:09:13.786622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:13.545477Z","title":"Inductive confidence machines for regression","venue":null,"work_id":"1a589e4b-288c-4386-855e-ec75c1d6635e","year":2002},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:10.272000Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:a79a2a7bc796e3f17a232b274eca79ce469635afa78f972d39e66d4856e72c91","observation_id":"25cdccee-6ef6-40d2-844b-b9bd4a92bb74","resolution":{"observed_at":"2026-08-07T11:09:13.601918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:13.405972Z","title":"Gurobi Optimizer Reference Manual, 2024","venue":null,"work_id":"7bd6ace8-1464-41e3-acef-bf5d7a7c9fa9","year":2024},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:10.384027Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:13a3d60b7b813ff9a1d788a5f2510f809627f2587f1a04153d53d1ecb4e76075","observation_id":"8ea88108-af31-46e0-ac64-6c0681976fb4","resolution":{"observed_at":"2026-08-07T11:09:13.470775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:13.224588Z","title":"Springer, 2021","venue":null,"work_id":"50a10cc9-b2d1-42df-9539-64a31774c4d4","year":2021},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:10.490715Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:f747351e30331e9217543415e7c13d2771305d1ffa2fbfe509b7f0b5495529fa","observation_id":"a03865c4-3da9-4873-902b-a14cba74317e","resolution":{"observed_at":"2026-08-07T11:09:13.311232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:12.957610Z","title":"Omlt: Optimization & machine learning toolkit.Journal of Machine Learning Research, 23(349):1–8, 2022","venue":null,"work_id":"0151a8c1-90fa-48c1-b3f3-ceee65f30dad","year":2022},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:10.668478Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:317eae7ac09c9aec52399cea8fcc26c167b6c23e7fd4112143005e7be9b0860e","observation_id":"9a959bc8-fcf6-4f2e-8283-96165f84cce0","resolution":{"observed_at":"2026-08-07T11:09:13.028212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:12.834691Z","title":"Nonlinear operability of a membrane reactor for direct methane aromatization.IFAC-PapersOnLine, 48(8):728–733, 2015","venue":null,"work_id":"1b49cab2-5d5a-4d1d-845a-b8cfbadf5099","year":2015},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:10.768140Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:2fb4037b38226bb6c7cb4882a922c7fc5385310d6f2766f1a9ad854a05b07b6f","observation_id":"9328fc2d-0d7f-42d4-a3b4-184f34c99574","resolution":{"observed_at":"2026-08-07T11:09:12.908244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:12.684149Z","title":"Novel operability-based approach for process design and intensification: Application to a membrane reactor for direct methane aromatization","venue":null,"work_id":"6d58dfd7-797c-4c31-886c-f3869d69d94f","year":2017},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:10.894734Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:e5b82631862e4b4ee9779628bf3a1c1dacab6ff6aae9eb5b02b0fe9aab4c992a","observation_id":"9747acf5-0a2e-44f8-916a-9f21e5cbde08","resolution":{"observed_at":"2026-08-07T11:09:12.735598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:12.450250Z","title":"The nutritious supply chain: optimizing humanitarian food assistance.INFORMS Journal on Optimization, 3(2):200–226, 2021","venue":null,"work_id":"9acf1458-3f16-4c55-837e-3f9b375d10c3","year":2021},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:11.016823Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:e8d3dc4da862d7dafb861ee36f75dbdf2dc2b30b6c1fd8b5b400b49e3a50eb7d","observation_id":"7f777ed4-f99d-4a7b-ad7f-efd8fd151c40","resolution":{"observed_at":"2026-08-07T11:09:12.570037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.00241","last_updated":"2025-09-14T02:19:44Z","snapshot_observed_at":"2026-07-06T15:21:31.380819Z","submitted_at":"2023-04-29T11:46:53Z","title":"When Deep Learning Meets Polyhedral Theory: A Survey","version":4},"cited_work":{"arxiv_id":"2305.00241","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.00241","snapshot_observed_at":"2026-08-07T11:09:11.653819Z","title":"When Deep Learning Meets Polyhedral Theory: A Survey","venue":"math.OC","work_id":"bdfc36a8-2c1b-4d28-9bae-6082af1d5663","year":2023},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:11.124282Z"},"links":{"cited_paper":"/paper/2305.00241","citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:f629c943cc90146efef096357b593b0519a0002f7d109a8d078837686485ba24","observation_id":"69613b3c-2b20-4433-a9f6-f571771d4363","resolution":{"observed_at":"2026-08-07T11:09:11.767778Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:12.253317Z","title":"Improved big-m reformulation for general- ized disjunctive programs.Computers & Chemical Engineering, 76:98–103, 2015","venue":null,"work_id":"8406463a-78c2-4bda-a2fb-39fc090e0c0a","year":2015},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:11.249387Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:a38bb78be8c137c9c7e211ba60105fce2e0671a6df3b778c25c0d8459fd2c36e","observation_id":"6ef664d9-c779-4fb3-83df-3d011b50377b","resolution":{"observed_at":"2026-08-07T11:09:12.342752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:12.103399Z","title":"Opyrability: A python package for process operability analysis.Journal of Open Source Software, 9(94):5966, 2024","venue":null,"work_id":"bd70722f-2d5d-49ae-a688-5b9c3c0bee11","year":2024},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:11.366502Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:146e4e852f153cb5a4dfc3f1629eb7fdeb0ffc7ec73813d8e0e9c409a68fbb31","observation_id":"155107fa-e168-406c-8cb7-d3fbbfd565d1","resolution":{"observed_at":"2026-08-07T11:09:12.158799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:09:11.981408Z","title":"Good\" and","venue":null,"work_id":"0ac7d718-799a-4dcd-8cfd-9afe7095cc1a","year":null},"citing_paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:11.471675Z"},"links":{"citing_paper":"/paper/2506.03531"},"observation_digest":"sha256:4982c436230c1fb21bc184ffcb30fd72e7371433d50c0429fa0da12e082ea68e","observation_id":"fd310179-9827-45c3-ad0b-31d900896284","resolution":{"observed_at":"2026-08-07T11:09:12.026491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.03531","last_updated":"2025-06-04T03:26:31Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T10:58:16.440017Z","submitted_at":"2025-06-04T03:26:31Z","title":"Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees"},"reference_resolution":{"displayed":66,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":1,"verified_fuzzy":52},"total_outbound_references":66},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 66 of 66 outbound references and 2 inbound Pith citation observations for arXiv:2506.03531."}