{"as_of":"2026-08-11T14:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db230867548c2c21d22a8902466b9ef0c5a8ac9c0428d8ea4f799ac54c903432","coverage":[{"denominator":92,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":92,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T23:30:25.048319Z","state":"measured"},{"denominator":92,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":92,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.24007/citation-record","integrity":"/paper/2607.24007/integrity","json":"/paper/2607.24007/citation-record.json","paper":"/paper/2607.24007"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T23:30:16.093389Z","title":"predict, then optimize","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.093389Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:e55e37a63773263f6cf9080c6b624e334af8eb8999b2855a35b776c4769cd83c","observation_id":"4ea29477-ef99-494c-bb12-4017a7896cd4","resolution":{"observed_at":"2026-07-31T23:30:16.093389Z","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-07-31T23:30:16.157227Z","title":"Management Science , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.157227Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:c467f4151cfa3a0f4d56acdb4c82c07da7cfe5b86e2858ccff48b01ad176109a","observation_id":"38d2be33-13e9-4046-ad42-76c3e0f36dcc","resolution":{"observed_at":"2026-07-31T23:30:16.157227Z","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-07-31T23:30:16.212001Z","title":"2013 , publisher=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.212001Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:5406c9d145cea1dd1fdeb523894875d94066195dc820a9181a82491cab717968","observation_id":"21d43b77-06b0-4bd5-9dda-318064fb86ff","resolution":{"observed_at":"2026-07-31T23:30:16.212001Z","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-07-31T23:30:16.252364Z","title":"Neural networks , volume=","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.252364Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:01497e7cfe6c559dc31f184c88ae9aaa088be424835e28c979c32b278481f285","observation_id":"36199906-e343-4955-9908-49d03096465b","resolution":{"observed_at":"2026-07-31T23:30:16.252364Z","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-07-31T23:30:16.300793Z","title":"Neural networks , volume=","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.300793Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:43fb45dc288c040457848fb22727aa29d2b294b937a08f6425c88c4df829c632","observation_id":"d671b7f1-10d8-45df-a52b-9d21ba40a8f6","resolution":{"observed_at":"2026-07-31T23:30:16.300793Z","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-07-31T23:30:16.348377Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.348377Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:5597b7ef5a40880e14f490482a9117c1ee3b60ff86ba359860edb005d127909d","observation_id":"20777408-08e6-4fdf-8339-4ee01c0e25d9","resolution":{"observed_at":"2026-07-31T23:30:16.348377Z","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-07-31T23:30:16.427401Z","title":"Mathematical Programming Computation , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.427401Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:66eb04adda416ccca2a43969ee006d31675cc23fe4f26f9a672cb83b4a01b58b","observation_id":"23de318d-d5da-47e8-aac0-30551f1f6580","resolution":{"observed_at":"2026-07-31T23:30:16.427401Z","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-07-31T23:30:16.481974Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.481974Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:872f67e2fdfcef5a4862ddb0f1ecc38ccf488c9dfc55ca6e6554df60267fea80","observation_id":"3718fb7a-02be-4fbb-a0b3-016116d13a0d","resolution":{"observed_at":"2026-07-31T23:30:16.481974Z","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-07-31T23:30:16.540193Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.540193Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:8fa9ab1f303301c6130ed66f41fcbc5ba0e474db97ac5c16828db28883e1598d","observation_id":"c655fd8e-2683-4a1a-bb51-61d578703277","resolution":{"observed_at":"2026-07-31T23:30:16.540193Z","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-07-31T23:30:16.595205Z","title":"Mathematical programming , volume=","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.595205Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:fac4016a0f46ae07bfeb21d1ff40079d2298c6877fef415be1d39288b8441a05","observation_id":"d48f4d9e-fb0f-42e0-98e9-06412d39fa1e","resolution":{"observed_at":"2026-07-31T23:30:16.595205Z","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-07-31T23:30:16.625424Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.625424Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:fd134be57b5e0408712995d586fba341a9c13991c4a41555711f2908440b6093","observation_id":"bd0186d2-afd0-4a00-880b-cccbcbb4c708","resolution":{"observed_at":"2026-07-31T23:30:16.625424Z","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-07-31T23:30:16.682619Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.682619Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:50185f2f3b2afd540d3585e1ccb6060038ed7b8f95a1f0a97928e99c7a0158ef","observation_id":"925c58f4-ac1c-4b0e-be20-37e2f313fd7e","resolution":{"observed_at":"2026-07-31T23:30:16.682619Z","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-07-31T23:30:16.738172Z","title":"1970 , publisher=","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.738172Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:21b5af9f045175030ba91c16510722e3bec7fd869f506c8bc5a365f42dcaec52","observation_id":"5db7c17e-44ed-41bc-b1e4-eb0a9354d898","resolution":{"observed_at":"2026-07-31T23:30:16.738172Z","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-07-31T23:30:16.781891Z","title":"European Journal of Operational Research , volume=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.781891Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:6892597ae8d6d90f345b6ad7bb398594add745a7ee084d71331d78f8934c5da3","observation_id":"111e98f5-927b-4d37-bfbf-72c01fc0729e","resolution":{"observed_at":"2026-07-31T23:30:16.781891Z","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-07-31T23:30:16.860730Z","title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.860730Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:83f0cb7b154c0395fcc830fa76c3c0dd40e80b1a3e9b8e35d35149abb194ed5c","observation_id":"de999c3e-cf4e-431e-b2e1-f57ba166fadd","resolution":{"observed_at":"2026-07-31T23:30:16.860730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.09170","last_updated":"2021-11-17T15:01:53Z","snapshot_observed_at":"2026-08-11T02:48:04.925739Z","submitted_at":"2021-11-17T15:01:53Z","title":"A Universal End-to-End Approach to Portfolio Optimization via Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.09170","snapshot_observed_at":"2026-07-31T23:30:16.920235Z","title":"arXiv preprint arXiv:2111.09170 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.920235Z"},"links":{"cited_paper":"/paper/2111.09170","citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:33c6c2536cc2efd82b9eeb1547a7a16b8d400becd1253b07296d7b36a97e6f0e","observation_id":"0bd4fa11-b041-4dd7-a816-5d13e77fb8ed","resolution":{"observed_at":"2026-07-31T23:30:16.920235Z","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-07-31T23:30:16.995030Z","title":"IEEE Transactions on Power Systems , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:16.995030Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:a05bdc357be80f1d03e3dbf3a218b0c4f707a2a78cb5e32d57bbadcad18558c5","observation_id":"48333572-7f68-43d2-b9ae-3eb8655bcd30","resolution":{"observed_at":"2026-07-31T23:30:16.995030Z","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-07-31T23:30:17.023471Z","title":"Operations Research , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:17.023471Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:6fccbe931d746648b84e2bc29b89163ad9407dd20724248c12ebc35dc98becd6","observation_id":"4afdb2f8-97eb-4365-8936-6fa5a822579a","resolution":{"observed_at":"2026-07-31T23:30:17.023471Z","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-07-31T23:30:17.112925Z","title":"Management Science , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:17.112925Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:abd2adceced5568856076f6f12957e7770c312d65c0a46d97981cb299cb4d250","observation_id":"af039af7-4f15-45d4-80cf-c158d8e71de1","resolution":{"observed_at":"2026-07-31T23:30:17.112925Z","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-07-31T23:30:17.244250Z","title":"On Data-Driven Prescriptive Analytics with Side Information: A Regularized","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:17.244250Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:c0c2e0d8f11e0562acc79269fcaaefb19b6081a73759c12f5dcf335e54acc521","observation_id":"989b2ec2-1613-4c51-a3e0-bc34bfdb0c65","resolution":{"observed_at":"2026-07-31T23:30:17.244250Z","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-07-31T23:30:17.345010Z","title":"Operations Research , volume=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:17.345010Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:15a882895fdffc5fd83604f4fe79d08d585662f1f41eabb2e0cf2415dbdf1566","observation_id":"bf147adc-e8d8-45bf-9d73-49399cf384f8","resolution":{"observed_at":"2026-07-31T23:30:17.345010Z","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-07-31T23:30:17.440789Z","title":"Mathematical Programming , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:17.440789Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:1ceedf3c14723ae606419c508298039a2a77f68895a44b0516fbdbaec3454420","observation_id":"14dae24b-26f3-42c8-ad04-27c325de80aa","resolution":{"observed_at":"2026-07-31T23:30:17.440789Z","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-07-31T23:30:17.572579Z","title":"2022 , eprint=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:17.572579Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:b42d054c1d4861fcc35b08d1bf50a01d6f462d020ca27abdc8e136e42201be88","observation_id":"20bc8e37-cec6-4eff-84a2-adf5a260d7ff","resolution":{"observed_at":"2026-07-31T23:30:17.572579Z","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-07-31T23:30:17.650509Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:17.650509Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:f32ac5d165257078baf7aa69b4cdce65b56c42c695adb7d04b534df86ac0c321","observation_id":"f4e806da-5e50-4cd3-ab3f-ac95d1c50d2d","resolution":{"observed_at":"2026-07-31T23:30:17.650509Z","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-07-31T23:30:17.735149Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:17.735149Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:b381d01763689fc4759a4657ceef7c4e0485ee21c0e057896206097414474e54","observation_id":"fb98c202-f1a5-4795-b627-899781fbe12e","resolution":{"observed_at":"2026-07-31T23:30:17.735149Z","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-07-31T23:30:17.835734Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:17.835734Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:3814621ce63fe12107f3a2b12e4cf8b95132da15820b60d61ceb805b9a1033c4","observation_id":"f4301313-a5df-4d36-89e2-f7e27885504e","resolution":{"observed_at":"2026-07-31T23:30:17.835734Z","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-07-31T23:30:17.931595Z","title":"Operations Research , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:17.931595Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:50b25ed3b7072cc323d8e82b410cdc34bef13879d8fabc510c2513d8df47b13d","observation_id":"1162bdc8-994f-4756-8fa5-f3e8e322b2ce","resolution":{"observed_at":"2026-07-31T23:30:17.931595Z","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-07-31T23:30:18.009778Z","title":"Operations Research , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:18.009778Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:db723036c861786a14b230e366ae673116e957fa217b1395340fe057ba1d5679","observation_id":"84dc5aeb-d62f-424a-bf8e-41de546a74d4","resolution":{"observed_at":"2026-07-31T23:30:18.009778Z","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-07-31T23:30:18.099405Z","title":"Management Science , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:18.099405Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:472de907f87d9c6dad7a86b77b9b1a54f9a7151cd949c4c2e4fbfb07f92c0003","observation_id":"5109a45b-a5c8-46b6-bfaa-402eea71fb38","resolution":{"observed_at":"2026-07-31T23:30:18.099405Z","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-07-31T23:30:18.319254Z","title":"Iise Transactions , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:18.319254Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:fa42619c28e62a23d6a53e75028220025d04d69633a9473e5f86cf49a31ab9be","observation_id":"01b0f512-899d-4d2f-befd-b58abcb20756","resolution":{"observed_at":"2026-07-31T23:30:18.319254Z","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-07-31T23:30:18.411704Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:18.411704Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:2cd4fd8867e2c39204c97653257fd5a7b547d32ba9c1ae10aaf1f3fab29113ae","observation_id":"60954564-fdb4-4d0d-b458-5d0b6f92f8c8","resolution":{"observed_at":"2026-07-31T23:30:18.411704Z","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-07-31T23:30:18.498487Z","title":"European Journal of Operational Research , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:18.498487Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:96c96a9cbd606e87370ae17a75ba6edc6f46744c911997922ac4cc201e92163d","observation_id":"c40903c1-b7a5-49e3-9b75-f4d38c33210f","resolution":{"observed_at":"2026-07-31T23:30:18.498487Z","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-07-31T23:30:18.592476Z","title":"The Review of Financial Studies , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:18.592476Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:e144118e63196a8019b5725c08981a2c41cc6b3300b65cbfe05b88d56e003c08","observation_id":"af1e5b26-e28f-4afc-b1c2-3e73970996db","resolution":{"observed_at":"2026-07-31T23:30:18.592476Z","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-07-31T23:30:18.682989Z","title":"INFOR: Information Systems and Operational Research , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:18.682989Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:68213d9f77f64fa450d1d9bba5a081b3e3322c884b337ff66cebafcd69ba15c1","observation_id":"dd973528-4855-43a9-8ce6-b1bb033fb7b0","resolution":{"observed_at":"2026-07-31T23:30:18.682989Z","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-07-31T23:30:18.752708Z","title":"arXiv preprint arXiv:2509.14557 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:18.752708Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:2c2666ca3e0fa213ba5a5926d47bc315abceaa9d42e768bef06b67618ac91a61","observation_id":"188c1032-ce89-4686-9bdf-cc347c03d80e","resolution":{"observed_at":"2026-07-31T23:30:18.752708Z","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-07-31T23:30:18.895472Z","title":"Operations Research , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:18.895472Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:d781babba6254e071bd868a587e1ded7375323c1899072b7815c69d0d4d1cd1b","observation_id":"7a11ddb4-1255-4cb1-a448-9878bb77a275","resolution":{"observed_at":"2026-07-31T23:30:18.895472Z","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-07-31T23:30:18.992037Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:18.992037Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:6d71ae9287577b0c3cbbe5f29a340129db63bead87856893bb1fd0993330a50e","observation_id":"d8a2c79c-d889-457e-82a2-63d979c5f8d1","resolution":{"observed_at":"2026-07-31T23:30:18.992037Z","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-07-31T23:30:19.087691Z","title":"Available at SSRN 3623006 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:19.087691Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:50bab24013d6e7e4486ffaa87f809ad47de5979eb2db36442ada6529cd0f04a3","observation_id":"e5495216-3345-42ec-a327-45569e33b376","resolution":{"observed_at":"2026-07-31T23:30:19.087691Z","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-07-31T23:30:19.169337Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:19.169337Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:3441c8639c1fe5ea2512297046011b7dc1c4ed800b51300cc159651bf02dcf07","observation_id":"2792a815-cdc9-427f-8ac0-b8aeab85d154","resolution":{"observed_at":"2026-07-31T23:30:19.169337Z","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-07-31T23:30:19.263447Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:19.263447Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:91d08e8f90452dd3c3b8b347d9671068ea6ad793a2aa1e421da393dd4a7ef9b9","observation_id":"a1625fe3-45ae-4baa-8440-19b4f6ca442f","resolution":{"observed_at":"2026-07-31T23:30:19.263447Z","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-07-31T23:30:19.364995Z","title":"Management Science , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:19.364995Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:92c41ead7557a28ac84853e35a17fc52c46a7c09248fd76cf75345c6516c18ff","observation_id":"9a899bb9-29d8-455b-96fb-01a6d6ce406c","resolution":{"observed_at":"2026-07-31T23:30:19.364995Z","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-07-31T23:30:19.474078Z","title":"Unpublished Manuscript, http://ttic","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:19.474078Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:7648a33a010046d26e68a21a2a03f1b9eedc282068f5ae5f3ca2abf06df5ef6f","observation_id":"c8a10e37-3534-4e9d-944a-4e82f097b6cc","resolution":{"observed_at":"2026-07-31T23:30:19.474078Z","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-07-31T23:30:19.570464Z","title":"2009 , publisher=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:19.570464Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:f84e3a48841813be594aca66aeb25b628999278025ca80d67cb90ced8c4c8f8e","observation_id":"3cbfdf23-52df-4799-9d55-597006dfb0ee","resolution":{"observed_at":"2026-07-31T23:30:19.570464Z","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-07-31T23:30:19.740915Z","title":"Practical","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:19.740915Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:7046253ab0b07f8fe60efba849aa2a0ce1f5ae844ab45e0f079e4277fc1087e3","observation_id":"3b62e66c-b885-41eb-bf1a-0a2f24a7f642","resolution":{"observed_at":"2026-07-31T23:30:19.740915Z","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-07-31T23:30:19.839332Z","title":"Journal of Global optimization , volume=","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:19.839332Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:737764a2b1659c297398f2217d92c8663af0c4f2e9bd4e1e690aaa4cc571bbf6","observation_id":"2f48b5f8-6a2e-4f5f-bd28-479ea111152b","resolution":{"observed_at":"2026-07-31T23:30:19.839332Z","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-07-31T23:30:19.923770Z","title":"International Conference on Artificial Intelligence and Statistics , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:19.923770Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:369b08b394a3a6533b836694dfe551e6cc81e002790fa83cf1bc8e1ba6dfefe2","observation_id":"97906c18-3801-4300-b9d7-ae6f33d38054","resolution":{"observed_at":"2026-07-31T23:30:19.923770Z","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-07-31T23:30:20.050543Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:20.050543Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:8ed948503d7b5ad6e4d582a3121cdf6ae84aa04f2208bde19fb5af865ea6ebd1","observation_id":"b895fd24-0f01-4c50-8307-636b43618a1e","resolution":{"observed_at":"2026-07-31T23:30:20.050543Z","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-07-31T23:30:20.143133Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:20.143133Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:a8137696df22ec1c0c427acd28a83d247e3b14f84aa9d3214a92f4b6eee836be","observation_id":"5e43eb30-4ed7-4ff4-83b2-fa670cc8a945","resolution":{"observed_at":"2026-07-31T23:30:20.143133Z","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-07-31T23:30:20.236943Z","title":", title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:20.236943Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:947f11d4a8ce289660cd13ce91d4bb6fcd46fb80cbfc07b29ff3c946f85ae934","observation_id":"2e851c92-0173-4ac2-95a0-7ab64ff24241","resolution":{"observed_at":"2026-07-31T23:30:20.236943Z","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-07-31T23:30:20.365460Z","title":", author=","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:20.365460Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:4cd2694a36f42ca77eef70dd6d167f13e276386b9e449bd7c594dc00141978b4","observation_id":"f3b6e5f6-6c02-431c-a6fe-8fd339bb64a7","resolution":{"observed_at":"2026-07-31T23:30:20.365460Z","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-07-31T23:30:20.504113Z","title":"Learning with","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:20.504113Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:2eb03702c0381ae0dc2b8963f3b45de5f6f50491132abf863b3cf64c7b937efd","observation_id":"b8a9dab2-4865-4690-951c-d9b0c99e47aa","resolution":{"observed_at":"2026-07-31T23:30:20.504113Z","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-07-31T23:30:20.639694Z","title":"Machine learning meets","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:20.639694Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:17c79e026515874778c06210b08e32cdf7e35bc59dfc1008949fd02a318e1756","observation_id":"2f93dbea-a5a1-4af7-bd1d-e33570f3c704","resolution":{"observed_at":"2026-07-31T23:30:20.639694Z","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-07-31T23:30:20.784865Z","title":"Online linear optimization via smoothing","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:20.784865Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:6e18966f8c129da2c61f7c2409a27abd4ca2f0a615cc590d8d2bd4f266458c4c","observation_id":"98d8ec9b-9a8c-4810-a464-6445c53fc2c1","resolution":{"observed_at":"2026-07-31T23:30:20.784865Z","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-07-31T23:30:21.011903Z","title":"Differentiable convex optimization layers","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:21.011903Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:f2f18ab3a730acedadab6b9f599b2a27d3251ca32f6bf9291405067d3f3c972d","observation_id":"f3ea18ee-e50c-417c-b2c9-0c838f9fcec9","resolution":{"observed_at":"2026-07-31T23:30:21.011903Z","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-07-31T23:30:21.132330Z","title":"Optnet: Differentiable optimization as a layer in neural networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:21.132330Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:4cd184e3ca27f30172f255ab7fd2a6a80bc0ff12ad4896744a0bf73e4ae972eb","observation_id":"f413e99a-b380-497a-a3fc-ac236a061125","resolution":{"observed_at":"2026-07-31T23:30:21.132330Z","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-07-31T23:30:21.280225Z","title":"The big data newsvendor: Practical insights from machine learning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:21.280225Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:f00f7a0681681a01e2fabd80dfa125e3ca91f4fd99ca5077af2f0c84113788ec","observation_id":"5fe6e686-f7e4-4a59-bc96-e334f019f644","resolution":{"observed_at":"2026-07-31T23:30:21.280225Z","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-07-31T23:30:21.411392Z","title":"Generalization bounds for regularized portfolio selection with market side information","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:21.411392Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:a925efbeb6a87203b99385765c55ecfb3923e34ccf55af1e8e108424d148a5b4","observation_id":"dc3e8767-8a77-471b-a488-c8ca8a6e6666","resolution":{"observed_at":"2026-07-31T23:30:21.411392Z","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-07-31T23:30:21.556899Z","title":"Learning with differentiable perturbed optimizers","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:21.556899Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:492171e26f3a92fcde6e6d4dfe69952827b10d1b362136d695170ecd8bb5384b","observation_id":"8c733647-88ea-4a04-808e-5bfe9fd1d6fe","resolution":{"observed_at":"2026-07-31T23:30:21.556899Z","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-07-31T23:30:21.705989Z","title":"Control of uncertain systems with a set-membership description of the uncertainty","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:21.705989Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:068ae10fa3ee98402a17cbe522a0d7d652604a6f49628bf98957a82340755517","observation_id":"d0ad8589-1ed9-4ea4-9f00-23c3b11cefb1","resolution":{"observed_at":"2026-07-31T23:30:21.705989Z","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-07-31T23:30:21.845325Z","title":"From predictive to prescriptive analytics","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:21.845325Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:392be05e717bbe035f766fd06c558211092ac0262fb1a37d8a1b0f823244ed1f","observation_id":"e5cd3826-b640-4d30-8b08-48351dcd501c","resolution":{"observed_at":"2026-07-31T23:30:21.845325Z","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-07-31T23:30:21.978490Z","title":"Data-driven optimization: A reproducing kernel hilbert space approach","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:21.978490Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:b76f031eceebd7169bb61564fbe2d7019099a3bf05eacf0357fb2744354c64c1","observation_id":"9c05d3a3-7c06-4b6e-80a9-0d98ece95fd4","resolution":{"observed_at":"2026-07-31T23:30:21.978490Z","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-07-31T23:30:22.046902Z","title":"Dynamic optimization with side information","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:22.046902Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:97afe1e3ecd0ed5a86fb1f5f9b8e0eacdf9d7ea24078a682f40774d853ef1501","observation_id":"43956e2c-08ce-4287-9832-a9d8d6f6582e","resolution":{"observed_at":"2026-07-31T23:30:22.046902Z","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-07-31T23:30:22.150295Z","title":"Learning with F enchel- Y oung losses","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:22.150295Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:d745385c247f232fc29d478c54a534d15032cd8069dd622a09127d64c21082b7","observation_id":"ce130e5f-abed-4820-a2e7-71129a506d48","resolution":{"observed_at":"2026-07-31T23:30:22.150295Z","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-07-31T23:30:22.329594Z","title":"Nonsmooth implicit differentiation for machine-learning and optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:22.329594Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:37eb76428eb66f39e0a01fec927049745e81b8af8d29b0cdb4935adafc36b5bf","observation_id":"95a7c030-d533-47e5-aaaa-efbd8fe4631a","resolution":{"observed_at":"2026-07-31T23:30:22.329594Z","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-07-31T23:30:22.512235Z","title":"Parametric portfolio policies: Exploiting characteristics in the cross-section of equity returns","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:22.512235Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:3b8f12ffa1f54f6d2ad4b282b06c59bc27d48e64b1a331b804e7efe2931c5f0f","observation_id":"a6bc360c-e729-4ef3-b990-39b0a9970601","resolution":{"observed_at":"2026-07-31T23:30:22.512235Z","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-07-31T23:30:22.691936Z","title":"End-to-end feasible optimization proxies for large-scale economic dispatch","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:22.691936Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:201683a197c7ac4fac9aa71a4d6dcc0f13a7b2503d4cf13aa7b19c312f3ff261","observation_id":"101f3e32-5c92-4aa7-98bd-bae8475cbc8e","resolution":{"observed_at":"2026-07-31T23:30:22.691936Z","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-07-31T23:30:22.874202Z","title":"Task-based end-to-end model learning in stochastic optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:22.874202Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:41102080f6428e55a62594626ffb4e01517546895da66a5fa626e089ef70e168","observation_id":"163abd58-401e-4b64-8936-fc4666d2634f","resolution":{"observed_at":"2026-07-31T23:30:22.874202Z","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-07-31T23:30:23.025887Z","title":"predict, then optimize","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:23.025887Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:9fb789d42de6a9a7f968d991c9cb488b49775b28e8de133edf13423d40f8bad1","observation_id":"d636bce0-c13a-4b0f-82ee-7c7893810967","resolution":{"observed_at":"2026-07-31T23:30:23.025887Z","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-07-31T23:30:23.176110Z","title":"Decision trees for decision-making under the predict-then-optimize framework","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:23.176110Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:29319cacf20d11bca11b48936ff8cbb88fdb4945310e6eb42d45b18d43fe146a","observation_id":"2500e1c8-5643-4ebc-a598-8be5f1aec0f3","resolution":{"observed_at":"2026-07-31T23:30:23.176110Z","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-07-31T23:30:23.332397Z","title":"Mind the (optimality) gap: a gap-aware learning rate scheduler for adversarial nets","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:23.332397Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:6104ed87e4bfaef2c90a4f504dd27d7a1a58fc861329b157224f0a9854ff0001","observation_id":"40f48950-ba4e-4c74-9f60-4f77a6886533","resolution":{"observed_at":"2026-07-31T23:30:23.332397Z","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-07-31T23:30:23.464070Z","title":"Efficient global optimization of expensive black-box functions","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:23.464070Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:35cc5627d0c11bf0a5f615e158712162285f8ba6a2cbfcd43cafa05826097de2","observation_id":"f0f31f71-4bf1-4383-8758-947ac31f57fa","resolution":{"observed_at":"2026-07-31T23:30:23.464070Z","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-07-31T23:30:23.581141Z","title":"Stochastic optimization forests","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:23.581141Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:73de79dcd5f1f62df25475657e93a4bd32593c2988cdfe5215827ba4a57748b7","observation_id":"dc7db5af-0a45-41f7-8bb2-abd835f3f5a0","resolution":{"observed_at":"2026-07-31T23:30:23.581141Z","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-07-31T23:30:23.677410Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:23.677410Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:2a7c982382cf19e3595eff084e901c4c8096ba1dc24ba5ce97e0ef65166102a0","observation_id":"a6f6953c-0a7a-4e9b-9cd8-78291d7cfb0b","resolution":{"observed_at":"2026-07-31T23:30:23.677410Z","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":"10.1007/s10107-023-02016-z","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T23:31:37.213962Z","title":null,"venue":null,"work_id":"e736628a-0a7f-4fda-aeca-8bbc5935074b","year":2024},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:23.754701Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:9dccbf181deb99bb49af78a4f054a447ef53f6b7e6df542c6438287d4ceb1132","observation_id":"3122cd8f-05cf-4a80-b81e-ab80392f89ca","resolution":{"observed_at":"2026-07-31T23:31:37.281382Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07-31T23:30:23.806883Z","title":"Data-driven sample average approximation with covariate information","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:23.806883Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:4bb593ca86118bcd35625b88e706f7a861f085f73e4365e3da361f16f9ce711f","observation_id":"7db0f9b6-68fd-4354-b8c4-747306fe9655","resolution":{"observed_at":"2026-07-31T23:30:23.806883Z","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-07-31T23:30:23.869667Z","title":"Risk bounds and calibration for a smart predict-then-optimize method","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:23.869667Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:34afe8ad6ba61629b24f0d7e9efdb9a13fa392eceada8ee999b7cf87f945b1f6","observation_id":"66505624-61fa-46c7-917a-aeeda4b20d67","resolution":{"observed_at":"2026-07-31T23:30:23.869667Z","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-07-31T23:30:23.949147Z","title":"Decision-driven regularization: A blended model for predict-then-optimize","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:23.949147Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:c5bc3c882c8989eeee043c1d9eee44cf67620f2a8f320566dbe210ff43921c22","observation_id":"14478240-3144-42f4-8e4e-5233beee5b92","resolution":{"observed_at":"2026-07-31T23:30:23.949147Z","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-07-31T23:30:24.026970Z","title":"Smart predict-and-optimize for hard combinatorial optimization problems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:24.026970Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:d090b189749f6c45f9336ad996fd778fdf7d18b4f723f03a4cceaed2ce9fb128","observation_id":"0a6f248d-e809-430f-839f-ce0c8c06ba19","resolution":{"observed_at":"2026-07-31T23:30:24.026970Z","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-07-31T23:30:24.105321Z","title":"Calibration by distribution matching: Trainable kernel calibration metrics","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:24.105321Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:4df2156db5b2c559e70f2ad43eb46d72d1b0ad8cf8dbe01e2cccb98dd1684cff","observation_id":"cb43cdfa-804e-4853-85a5-8e2445bea76d","resolution":{"observed_at":"2026-07-31T23:30:24.105321Z","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-07-31T23:30:24.181111Z","title":"Smooth minimization of non-smooth functions","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:24.181111Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:4274ae078cd1c08af1018073f6ae5adc7b28e32f6fe92a8722ca5a15c35d420c","observation_id":"31f1a0bb-7283-4ce4-ad7d-77a85d07658e","resolution":{"observed_at":"2026-07-31T23:30:24.181111Z","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-07-31T23:30:24.250315Z","title":"Sparse MAP : Differentiable sparse structured inference","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:24.250315Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:81f460e4bc7c747f89033f4b30e9e7ac147dd8711d464f35c498aac12ab8ea80","observation_id":"c0596e75-79aa-47e2-9d6f-89a8a3fe85a6","resolution":{"observed_at":"2026-07-31T23:30:24.250315Z","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-07-31T23:30:24.297504Z","title":"Applying deep learning to the newsvendor problem","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:24.297504Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:afe0d0063bbb719a3340fba45c666e33f73494ddbac1c95b4e0eea5f62710f79","observation_id":"a3b3ec16-8b8f-4c0e-a56a-8c5b05cbdb6b","resolution":{"observed_at":"2026-07-31T23:30:24.297504Z","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-07-31T23:30:24.375612Z","title":"A practical end-to-end inventory management model with deep learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:24.375612Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:56579c607c6d65c101e4207fab7480f811c00eedc27c27ca35663ee7ee5a5d87","observation_id":"7c778268-319b-4b6a-aa05-4f287dca9813","resolution":{"observed_at":"2026-07-31T23:30:24.375612Z","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-07-31T23:30:24.455699Z","title":"Tyrrell Rockafellar","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:24.455699Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:232a05264507966da70be4202c974229ce7aacee7c1188d1ccd09f396f75010e","observation_id":"855735d2-63de-4080-bfb5-5b6ea7e1b649","resolution":{"observed_at":"2026-07-31T23:30:24.455699Z","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-07-31T23:30:24.538815Z","title":"Tyrrell Rockafellar and Roger J.-B","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:24.538815Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:822d45c43f0a3bffcf0b8c501a592c476d597abe59aa30d448c01cdfc79159ac","observation_id":"bb0bc36d-0830-453c-a3e4-acf6074cc959","resolution":{"observed_at":"2026-07-31T23:30:24.538815Z","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-07-31T23:30:24.623984Z","title":"Schneider and Daniel Kuhn","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:24.623984Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:57297af90d484cfd03acda7ef75569f71b6450525d4328757d7079ac6833ee6b","observation_id":"fc489cd9-4f8f-46c8-9fad-40bb1cedf27f","resolution":{"observed_at":"2026-07-31T23:30:24.623984Z","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-07-31T23:30:24.693806Z","title":"Practical B ayesian optimization of machine learning algorithms","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:24.693806Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:c590e59bdc64fba63ab05aa1a6aa284a02a2bb4f59107e8d659c6536fa69244a","observation_id":"3da58654-7af3-4948-a63e-8b1e711593e2","resolution":{"observed_at":"2026-07-31T23:30:24.693806Z","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-07-31T23:30:24.746277Z","title":"Machine learning meets M arkowitz","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:24.746277Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:ecf5c55e87fdc667f5ea6b1fa03a6603f9f263c2d6b5a977d7a24164716a8f82","observation_id":"b6483ff3-4a14-4468-ab0b-a37807524caa","resolution":{"observed_at":"2026-07-31T23:30:24.746277Z","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-07-31T23:30:24.827967Z","title":"On data-driven prescriptive analytics with side information: A regularized N adaraya-- W atson approach","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:24.827967Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:c35175f724661a2cc66e7dc056f666519b449bcb6efa8df14b77d8ea38377b07","observation_id":"8cc360ff-239a-482c-8aba-6b19d95fff0c","resolution":{"observed_at":"2026-07-31T23:30:24.827967Z","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-07-31T23:30:24.905147Z","title":"Melding the data-decisions pipeline: Decision-focused learning for combinatorial optimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:24.905147Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:5c350831f4985bf1fee229648d8b9a740cd5d9fbb6328d1110812158dab6ed75","observation_id":"73339bb1-28a7-4f28-84dd-93ce1fcdaf63","resolution":{"observed_at":"2026-07-31T23:30:24.905147Z","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-07-31T23:30:24.981357Z","title":"Data-driven piecewise affine decision rules for stochastic programming with covariate information","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:24.981357Z"},"links":{"citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:882dcaedb84b04df08f66cca7d03a9547cc1298d07964bf5de279344883ddea7","observation_id":"2aef28d5-eed9-4f38-81ca-dfd8c92796c8","resolution":{"observed_at":"2026-07-31T23:30:24.981357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.13665","last_updated":"2021-01-23T18:19:33Z","snapshot_observed_at":"2026-07-06T09:23:55.119397Z","submitted_at":"2020-05-27T21:28:43Z","title":"Deep Learning for Portfolio Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.13665","snapshot_observed_at":"2026-07-31T23:30:25.048319Z","title":"Deep learning for portfolio optimization","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-07-31T23:30:25.048319Z"},"links":{"cited_paper":"/paper/2005.13665","citing_paper":"/paper/2607.24007"},"observation_digest":"sha256:3541a971f2fdb7ec65981d8d09afd5405f4193b7f0bc8204a98792273ee3f0fc","observation_id":"69b83209-aa86-4c63-97fc-db3b74b0060c","resolution":{"observed_at":"2026-07-31T23:30:25.048319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.24007","last_updated":"2026-07-27T05:09:41Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-08T17:46:49.912578Z","submitted_at":"2026-07-27T05:09:41Z","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies"},"reference_resolution":{"displayed":92,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":91,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":92},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 92 of 92 outbound references and 0 inbound Pith citation observations for arXiv:2607.24007."}