{"as_of":"2026-08-09T16:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8e64f10b85e5f5b63e84e89cc6f7e021c3f92280855850a38daf51745451f315","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T01:44:05.674748Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.25719/citation-record","integrity":"/paper/2607.25719/integrity","json":"/paper/2607.25719/citation-record.json","paper":"/paper/2607.25719"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:02.936142Z","title":"Mathematical Programming Computation , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:02.936142Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:62030f1e3cdd2ba3db59abc54459332b03e1206b0d401a1cf951cc7142611e1b","observation_id":"3ceaff71-2780-452c-8543-410856b62ec3","resolution":{"observed_at":"2026-08-01T01:44:02.936142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:03.069034Z","title":"AIChE Journal , volume=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:03.069034Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:425aae6782b3adb61b541280790f34c59e753f111219714b7db9a52655dcfe65","observation_id":"5bf7d7ca-cc49-475c-b4c9-4f3210198d0a","resolution":{"observed_at":"2026-08-01T01:44:03.069034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:03.184747Z","title":"2008 , publisher=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:03.184747Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:fa8e6d5d952e51cda07210d6064af668a4aecb3feeaafc2a5636a9608568415d","observation_id":"e333c384-50a4-4a50-8763-c9ed656bc007","resolution":{"observed_at":"2026-08-01T01:44:03.184747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:03.334993Z","title":"2009 , publisher=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:03.334993Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:a9a2bc3ec542262c448568b2a90d9eae088043fca2592e5c9251aa7b488a5b08","observation_id":"2fd9df78-1b9c-447b-aa8f-c24910712f53","resolution":{"observed_at":"2026-08-01T01:44:03.334993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:03.474750Z","title":"2009 , publisher=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:03.474750Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:3063f03bf7a9be5aeaac90056204e71bacda5235bedd8daec52a806f55a4ca0e","observation_id":"4a4e54e1-e606-46c5-88fe-9853c22e80ca","resolution":{"observed_at":"2026-08-01T01:44:03.474750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:03.614749Z","title":"Operations Research , volume=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:03.614749Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:3a4fe09b7ff1d4bd2e8d6ec3633a7096bd9eb0cab39fa08410f49915bcb88dfa","observation_id":"0b6fc2a3-10c6-4c33-a378-9fba167accb3","resolution":{"observed_at":"2026-08-01T01:44:03.614749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:03.875009Z","title":"European Journal of Operational Research , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:03.875009Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:31b0686c3729aec6e5087b4bec7d7559d7158dfb86e46981835da40328323f5f","observation_id":"40d79851-f420-481b-978b-1f4e4ad75918","resolution":{"observed_at":"2026-08-01T01:44:03.875009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:04.096476Z","title":"The Journal of Machine Learning Research , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:04.096476Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:4b15c78bcec03131f9d27a91ed5e8d105e00170fde4ea9a5fa9726bc41796005","observation_id":"6d3a9983-c185-4def-831b-3dd725b71b4b","resolution":{"observed_at":"2026-08-01T01:44:04.096476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:04.234832Z","title":"INFORMS Journal on Computing , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:04.234832Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:aeea586f9d624490f3bdb1607b5d3ff78fbf87c717d3cf5d138ac8520249eeff","observation_id":"ef222cb1-288a-40fa-ad71-796c720e69d3","resolution":{"observed_at":"2026-08-01T01:44:04.234832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:04.475266Z","title":"Computational Optimization and Applications , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:04.475266Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:644e7179772c15ff5b1301554a14234139e8d3feaa6a3ddce794fab6c44f20e6","observation_id":"9ae9abcb-f4e3-44aa-8345-02ea9976ef70","resolution":{"observed_at":"2026-08-01T01:44:04.475266Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:04.657441Z","title":"SIAM Journal on Optimization , volume=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:04.657441Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:d755110e234be1934c9bb7b450dfe4229cd069777bb8772dc6a9111330f6f371","observation_id":"74954b4c-90ee-44c4-961e-4568def03058","resolution":{"observed_at":"2026-08-01T01:44:04.657441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:04.825625Z","title":"Applied mathematical modelling , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:04.825625Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:8848e5e622c8b7645ba75ec9048d8148bd28e8c19d87f1f933fa0ff044cce809","observation_id":"884eff75-f659-4cc0-91af-cc464c493dcc","resolution":{"observed_at":"2026-08-01T01:44:04.825625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:05.125723Z","title":"Mathematics of Operations Research , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:05.125723Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:c21473664b7111e7a9be85bfda381d2fc1368b12b0c6c8893b16aa113af21294","observation_id":"a008a714-04c4-4301-a5e1-ddad3eebbdc1","resolution":{"observed_at":"2026-08-01T01:44:05.125723Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.16378","last_updated":"2021-03-30T14:19:30Z","snapshot_observed_at":"2026-07-06T10:54:52.612871Z","submitted_at":"2021-03-30T14:19:30Z","title":"End-to-End Constrained Optimization Learning: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.16378","snapshot_observed_at":"2026-08-01T01:44:05.266290Z","title":"arXiv preprint arXiv:2103.16378 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:05.266290Z"},"links":{"cited_paper":"/paper/2103.16378","citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:6a87be343b30deb8a81914507c4c2c549ebb8474d45fbb3ceb8165b31acb7497","observation_id":"bac331cc-c440-4a0a-8b0f-7d7fbd0f7722","resolution":{"observed_at":"2026-08-01T01:44:05.266290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:05.405307Z","title":"INFORMS Journal on Computing , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:05.405307Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:5aa8ae9d246b4be1153beb58faf1be81b17e198fac9ae75f81059b257267fd9f","observation_id":"0bc9fb43-b5c4-483c-931e-1ad218dd3644","resolution":{"observed_at":"2026-08-01T01:44:05.405307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:05.504867Z","title":"İlker and Liao, Zhongxing and Bortfeld, Thomas and den Hertog, Dick and Ajdari, Ali , title =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:05.504867Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:2f27e068476b37f16b59980e4ed8339f5e8ca17d134ba8d558d59532e04d15ca","observation_id":"b5a9ec01-cc67-4ed3-bc23-465f801e368f","resolution":{"observed_at":"2026-08-01T01:44:05.504867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T01:44:05.674748Z","title":"arXiv preprint arXiv:2112.06251 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T01:44:05.674748Z"},"links":{"citing_paper":"/paper/2607.25719"},"observation_digest":"sha256:19415a0cf17808bf1d1d742169a0b6ccd5f6d7335d8132751124d561bc272fe1","observation_id":"cf33783b-7f90-471b-9c30-a96d71a86b6f","resolution":{"observed_at":"2026-08-01T01:44:05.674748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.25719","last_updated":"2026-07-28T13:45:13Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T05:19:08.354745Z","submitted_at":"2026-07-28T13:45:13Z","title":"Optimization with Dynamic Constraint Learning (DCL)"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":17},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2607.25719."}