{"as_of":"2026-08-09T20:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e9b090506f7e2de362aeab0779f0057be4823191dba5db8a9780b947095df375","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":16,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T19:36:57.881220Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T06:29:37.405587Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":"2104.12225","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-07-04T06:29:37.405587Z","title":"DC3: A learn- ing method for optimization with hard constraints","venue":null,"work_id":"7eba13d4-3903-47a2-bfb0-3f6963a31e51","year":2021},"citing_paper":{"arxiv_id":"2307.08336","last_updated":"2026-04-20T11:06:32Z","snapshot_observed_at":"2026-07-06T15:54:43.529621Z","submitted_at":"2023-07-17T09:12:05Z","title":"RAYEN: Imposition of Hard Convex Constraints on Neural Networks","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-24T07:24:31.376748Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2307.08336"},"observation_digest":"sha256:17372bab07965d18cd80887888915fc3772f8d0917648c736b2462da440e44cf","observation_id":"d09a33e6-d5b4-49ca-9c1f-edb15be51015","resolution":{"observed_at":"2026-05-24T07:26:03.664784Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-08-09T19:36:57.881220Z","title":"L., Rolnick, D., and Kolter, J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.00304","last_updated":"2025-02-01T03:59:15Z","snapshot_observed_at":"2026-08-09T19:26:40.474221Z","submitted_at":"2025-02-01T03:59:15Z","title":"HoP: Homeomorphic Polar Learning for Hard Constrained Optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T19:36:57.881220Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2502.00304"},"observation_digest":"sha256:2fb21803520f86cd7c10b2be023d196a71ca5f74691c57bacdb90154ed9d5ac2","observation_id":"b3e08838-599d-4022-aea2-42380ed5a02c","resolution":{"observed_at":"2026-08-09T19:36:57.881220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-08-08T14:17:30.551680Z","title":"DC3: A lea rning method for optimization with hard constraints","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06978","last_updated":"2025-05-07T19:05:16Z","snapshot_observed_at":"2026-08-08T14:09:44.437195Z","submitted_at":"2025-02-10T19:18:18Z","title":"Dual Conic Proxy for Semidefinite Relaxation of AC Optimal Power Flow","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T14:17:30.551680Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2502.06978"},"observation_digest":"sha256:08b1cd36d37bfaa9fae2c48ae0d79539c684bac8b2a0f31b9a06b04ffa35e711","observation_id":"0e485f68-b25e-47b7-9fbf-1921d7fb82ba","resolution":{"observed_at":"2026-08-08T14:17:30.551680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-08-07T18:37:52.081050Z","title":"Dc3: A learning method for optimization with hard constraints","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.10330","last_updated":"2026-05-28T13:16:50Z","snapshot_observed_at":"2026-08-08T00:55:07.990526Z","submitted_at":"2025-02-14T17:43:08Z","title":"Diffusion-based learning framework for Constrained Nonconvex Optimization with Weighted Bootstrapped Refinement","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T18:37:52.081050Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2502.10330"},"observation_digest":"sha256:82708ef4d3fc7e09d0dbca47f4d635fc5869ea8ed16dd73dbdabdece9ff2dbb0","observation_id":"a7463cd1-e87b-4e9f-8a7d-e5b6549f79e4","resolution":{"observed_at":"2026-08-07T18:37:52.081050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-08-06T18:35:11.752300Z","title":"Dc3: A learning method for optimization with hard constraints","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.08124","last_updated":"2025-08-20T19:55:50Z","snapshot_observed_at":"2026-08-07T19:54:23.409972Z","submitted_at":"2025-07-10T19:24:53Z","title":"Physics-Informed Neural Networks with Hard Nonlinear Equality and Inequality Constraints","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T18:35:11.752300Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2507.08124"},"observation_digest":"sha256:feeaeccebf8633a2bbeaed36281b7a0c7f66e83c30fd44fc21c8ad9239983334","observation_id":"831dde64-3b57-4dec-ab16-4b6656592d5b","resolution":{"observed_at":"2026-08-06T18:35:11.752300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-08-06T00:01:46.888919Z","title":"DC3: A learning method for optimization with hard constraints,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.04459","last_updated":"2025-08-06T13:59:14Z","snapshot_observed_at":"2026-08-09T07:21:14.453772Z","submitted_at":"2025-08-06T13:59:14Z","title":"Case Studies of Generative Machine Learning Models for Dynamical Systems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T00:01:46.888919Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2508.04459"},"observation_digest":"sha256:019f7a0016c8cae5fa0644b1cb56aa6a154f17126b593052b11ae6a4901ceaf3","observation_id":"2382fb66-77df-46c9-a4f0-c250c4f7e307","resolution":{"observed_at":"2026-08-06T00:01:46.888919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":"2104.12225","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-07-04T06:29:37.405587Z","title":"DC3: A learn- ing method for optimization with hard constraints","venue":null,"work_id":"7eba13d4-3903-47a2-bfb0-3f6963a31e51","year":2021},"citing_paper":{"arxiv_id":"2602.09317","last_updated":"2026-05-08T20:13:16Z","snapshot_observed_at":"2026-08-04T02:26:56.496271Z","submitted_at":"2026-02-10T01:24:32Z","title":"SnareNet: Flexible Repair Layers for Neural Networks with Hard Constraints","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-16T03:36:12.749864Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2602.09317"},"observation_digest":"sha256:b1c0f9ec6174c0a9ddebdd8fe778d227ad4ded0f5550341d9b451f8b69ebc7bd","observation_id":"0c38784a-2145-419f-b2e7-23f2f17541d5","resolution":{"observed_at":"2026-05-16T03:37:13.694761Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":"2104.12225","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-07-04T06:29:37.405587Z","title":"DC3: A learn- ing method for optimization with hard constraints","venue":null,"work_id":"7eba13d4-3903-47a2-bfb0-3f6963a31e51","year":2021},"citing_paper":{"arxiv_id":"2604.24911","last_updated":"2026-04-27T18:47:13Z","snapshot_observed_at":"2026-08-07T13:02:01.321714Z","submitted_at":"2026-04-27T18:47:13Z","title":"Learning with Embedded Linear Equality Constraints via Variational Bayesian Inference","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-08T04:12:05.834241Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2604.24911"},"observation_digest":"sha256:7826a7263221a1d966efbd1b1bcad5575062c612ebfe8b1b5d85e3b449829f1a","observation_id":"c67a8993-a013-47e1-bb55-4dde1e2ad85a","resolution":{"observed_at":"2026-05-11T21:51:12.715285Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":"2104.12225","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-07-04T06:29:37.405587Z","title":"DC3: A learn- ing method for optimization with hard constraints","venue":null,"work_id":"7eba13d4-3903-47a2-bfb0-3f6963a31e51","year":2021},"citing_paper":{"arxiv_id":"2605.14019","last_updated":"2026-05-13T18:32:44Z","snapshot_observed_at":"2026-07-06T23:25:29.856145Z","submitted_at":"2026-05-13T18:32:44Z","title":"Regret Equals Covariance: A Closed-Form Characterization for Stochastic Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-15T02:34:19.803167Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2605.14019"},"observation_digest":"sha256:aa1866b16c8ea67f1be0115a78ef88f473bdb20c6946360883f1093c7b1230c6","observation_id":"a8087a4e-2ad3-40a4-a77a-b8cd27a76a21","resolution":{"observed_at":"2026-05-15T02:39:41.709980Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":"2104.12225","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-07-04T06:29:37.405587Z","title":"DC3: A learn- ing method for optimization with hard constraints","venue":null,"work_id":"7eba13d4-3903-47a2-bfb0-3f6963a31e51","year":2021},"citing_paper":{"arxiv_id":"2606.05772","last_updated":"2026-06-04T06:57:17Z","snapshot_observed_at":"2026-08-07T14:19:00.805175Z","submitted_at":"2026-06-04T06:57:17Z","title":"Physics-Informed Graph Learning Acceleration for Large-Scale AC-OPF with Topology Changes","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-28T00:19:07.001137Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2606.05772"},"observation_digest":"sha256:2a3557f89cba024685640e206a94786bc90b8a835fc83efdf96ce8bc36e8d255","observation_id":"1daa0ef1-49e0-4599-8620-0f6a310c71dc","resolution":{"observed_at":"2026-07-02T14:37:03.873623Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":"2104.12225","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-07-04T06:29:37.405587Z","title":"DC3: A learn- ing method for optimization with hard constraints","venue":null,"work_id":"7eba13d4-3903-47a2-bfb0-3f6963a31e51","year":2021},"citing_paper":{"arxiv_id":"2606.21440","last_updated":"2026-06-19T14:02:01Z","snapshot_observed_at":"2026-08-07T08:57:52.454311Z","submitted_at":"2026-06-19T14:02:01Z","title":"Fusing Backdoors, Machine Learning, and Optimization for Large-Scale Parametric Mixed-Integer Programs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-26T14:41:53.912796Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2606.21440"},"observation_digest":"sha256:a8c61a457341e3dcd72a2d695d9a566e452f7b790361d90a3939b85d59ddeb73","observation_id":"3991fe8d-1038-49c5-bda9-4d12bb6c7e3a","resolution":{"observed_at":"2026-07-04T06:19:37.402202Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":"2104.12225","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-07-04T06:29:37.405587Z","title":"DC3: A learn- ing method for optimization with hard constraints","venue":null,"work_id":"7eba13d4-3903-47a2-bfb0-3f6963a31e51","year":2021},"citing_paper":{"arxiv_id":"2606.21728","last_updated":"2026-06-19T20:31:04Z","snapshot_observed_at":"2026-08-02T17:44:17.943628Z","submitted_at":"2026-06-19T20:31:04Z","title":"Embedding Linear Equality Constraints in Probabilistic Neural Networks for Dynamic Modelling","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-26T14:28:35.197163Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2606.21728"},"observation_digest":"sha256:eca28ddd91a29acc17da964aa9a7dcf665fc9fec859fb400923da54e5b2ae37c","observation_id":"7a00cc5f-b0bc-4fb0-8f2f-9dabb59d03a7","resolution":{"observed_at":"2026-07-04T06:29:37.408322Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":"2104.12225","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-07-04T06:29:37.405587Z","title":"DC3: A learn- ing method for optimization with hard constraints","venue":null,"work_id":"7eba13d4-3903-47a2-bfb0-3f6963a31e51","year":2021},"citing_paper":{"arxiv_id":"2606.28817","last_updated":"2026-06-27T09:03:21Z","snapshot_observed_at":"2026-08-02T14:29:21.094828Z","submitted_at":"2026-06-27T09:03:21Z","title":"Trust-Calibrated Certified Repair for Physics-Constrained Decisions under Localized Model Misspecification","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-30T09:10:09.947036Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2606.28817"},"observation_digest":"sha256:ccedbe2e84f26ee68fa77b2e7ff9f95a8e40cf60317936e56883d639c9bd7938","observation_id":"6f1bdebe-ac81-4f6f-9780-0f1b616909fb","resolution":{"observed_at":"2026-06-30T13:24:40.743054Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-08-01T09:44:50.425884Z","title":"arXiv preprint arXiv:2104.12225 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20674","last_updated":"2026-07-22T19:17:11Z","snapshot_observed_at":"2026-08-08T15:46:24.561086Z","submitted_at":"2026-07-22T19:17:11Z","title":"End-to-End Learning of Safe Optimal Feedback Control in High Dimensions with Control Barrier Function Layers","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T09:44:50.425884Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2607.20674"},"observation_digest":"sha256:0ee869f6d4df3e152598912dfbdf1e581694a1947c21e4418017127bb6f36af7","observation_id":"de1bce1e-72ef-4196-9f41-07ce549e76a8","resolution":{"observed_at":"2026-08-01T09:44:50.425884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-08-01T05:21:17.584647Z","title":"Dc3: A learning method for optimization with hard constraints,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22788","last_updated":"2026-07-24T12:49:09Z","snapshot_observed_at":"2026-08-06T07:21:25.448087Z","submitted_at":"2026-07-24T12:49:09Z","title":"FMOPF: Latent Flow Matching with Constraint-Aware Interaction Priors for AC Optimal Power Flow","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T05:21:17.584647Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2607.22788"},"observation_digest":"sha256:e1930fbf2441721322ecd178f71101dd2fa1b05abbad185ce2685ae3493eebb3","observation_id":"603eda5b-0fa6-4e52-b056-ca38574a16ad","resolution":{"observed_at":"2026-08-01T05:21:17.584647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.12225","snapshot_observed_at":"2026-07-30T21:18:19.651515Z","title":"DC3: A learning method for optimization with hard constraints,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23480","last_updated":"2026-07-26T06:11:06Z","snapshot_observed_at":"2026-08-08T21:24:30.471236Z","submitted_at":"2026-07-26T06:11:06Z","title":"A Multi-stage Constrained Optimization Framework for Data-driven Problems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-30T21:18:19.651515Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2607.23480"},"observation_digest":"sha256:f9ef585171011eb551407000eeea6636071de461d8ea0137042b5591c34f86ce","observation_id":"323a435a-5f57-4619-9f74-b9577dbf5da6","resolution":{"observed_at":"2026-07-30T21:18:19.651515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2104.12225/citation-record","integrity":"/paper/2104.12225/integrity","json":"/paper/2104.12225/citation-record.json","paper":"/paper/2104.12225"},"outbound":[],"paper":{"arxiv_id":"2104.12225","last_updated":"2021-04-25T18:21:59Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T17:21:05.516838Z","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 16 inbound Pith citation observations for arXiv:2104.12225."}