{"as_of":"2026-08-11T05:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5656a84367c77fd8d2e0971e0cc25c72b56e1425a145e2a9e1b093403aae7a49","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:58:10.618646Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T09:56:30.448334Z","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-04T19:30:07.014273Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"cited_work":{"arxiv_id":"2501.03443","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.03443","snapshot_observed_at":"2026-07-04T19:30:07.014273Z","title":"Optimization learning","venue":null,"work_id":"678857a0-6154-4a73-ba39-c8347f66e4b5","year":2025},"citing_paper":{"arxiv_id":"2602.09317","last_updated":"2026-05-08T20:13:16Z","snapshot_observed_at":"2026-08-11T04:44:00.669083Z","submitted_at":"2026-02-10T01:24:32Z","title":"SnareNet: Flexible Repair Layers for Neural Networks with Hard Constraints","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-16T03:36:12.749864Z"},"links":{"cited_paper":"/paper/2501.03443","citing_paper":"/paper/2602.09317"},"observation_digest":"sha256:0314c7b4b5ccc69921aa646493572b6c9d308b365e2b7c721bd38d39de4f6c1c","observation_id":"2eafa899-4877-496f-84df-9c095a029944","resolution":{"observed_at":"2026-05-16T03:37:13.739729Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"cited_work":{"arxiv_id":"2501.03443","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.03443","snapshot_observed_at":"2026-07-04T19:30:07.014273Z","title":"Optimization learning","venue":null,"work_id":"678857a0-6154-4a73-ba39-c8347f66e4b5","year":2025},"citing_paper":{"arxiv_id":"2604.03489","last_updated":"2026-04-03T22:33:17Z","snapshot_observed_at":"2026-08-07T21:38:13.708025Z","submitted_at":"2026-04-03T22:33:17Z","title":"Improving Feasibility via Fast Autoencoder-Based Projections","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-13T19:29:59.328674Z"},"links":{"cited_paper":"/paper/2501.03443","citing_paper":"/paper/2604.03489"},"observation_digest":"sha256:5c02cabf84d4049276e18581e86b85381367c1000268e66a33cf0663b22832af","observation_id":"6b252443-76a9-462f-a1e9-e4d4e14ebfe2","resolution":{"observed_at":"2026-05-13T19:33:10.272191Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"cited_work":{"arxiv_id":"2501.03443","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.03443","snapshot_observed_at":"2026-07-04T19:30:07.014273Z","title":"Optimization learning","venue":null,"work_id":"678857a0-6154-4a73-ba39-c8347f66e4b5","year":2025},"citing_paper":{"arxiv_id":"2605.28340","last_updated":"2026-05-27T11:43:27Z","snapshot_observed_at":"2026-08-08T18:49:05.235801Z","submitted_at":"2026-05-27T11:43:27Z","title":"Decision-focused learning for optimal PV-Battery scheduling","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T09:56:30.448334Z"},"links":{"cited_paper":"/paper/2501.03443","citing_paper":"/paper/2605.28340"},"observation_digest":"sha256:3c35bfd7b653b06d52e6790a06332fb656cdb231a08f65d8118138fce586d327","observation_id":"6350a1fb-1c97-4a52-a3ac-2dadd440618f","resolution":{"observed_at":"2026-06-29T10:03:17.202884Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"cited_work":{"arxiv_id":"2501.03443","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.03443","snapshot_observed_at":"2026-07-04T19:30:07.014273Z","title":"Optimization learning","venue":null,"work_id":"678857a0-6154-4a73-ba39-c8347f66e4b5","year":2025},"citing_paper":{"arxiv_id":"2606.25362","last_updated":"2026-06-24T03:45:52Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T03:45:52Z","title":"Learning Optimization Proxies for Sequential Contextual Stochastic Programs: An Order Fulfillment Application","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-25T21:20:42.768437Z"},"links":{"cited_paper":"/paper/2501.03443","citing_paper":"/paper/2606.25362"},"observation_digest":"sha256:64ad1d552a357d2bb9ccdd4adadfafcb6486f1d839efb3fb01576b13e3337ad8","observation_id":"787c4451-0c12-4ecb-9074-9087c25f30f7","resolution":{"observed_at":"2026-07-04T19:30:07.016155Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.03443/citation-record","integrity":"/paper/2501.03443/integrity","json":"/paper/2501.03443/citation-record.json","paper":"/paper/2501.03443"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.387865Z","title":"Agrawal, Amos B., S","venue":null,"work_id":"7eb6cc8c-0803-404e-b19b-821385ce58b2","year":2019},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.427834Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:8f9ae030277d99b06dd33f4ae00fa7139663e6008c3418ced63b41d0b6c84ce5","observation_id":"6343479d-082a-4b0a-9894-bdf7caf6ba21","resolution":{"observed_at":"2026-08-10T21:58:11.392646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.373671Z","title":"Optnet: Differentiable optimization as a layer in neural networks","venue":null,"work_id":"8be0997d-7cc1-4208-9363-0b54c416963f","year":2017},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.432777Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:aa319ff91603bca26e18b6daf912f7b5ba4ea9c7b9a8fdbb4f0158710cb714df","observation_id":"bb152c21-e981-45e3-aa8c-d1b203aae3c2","resolution":{"observed_at":"2026-08-10T21:58:11.378721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07843","last_updated":"2022-06-15T23:03:56Z","snapshot_observed_at":"2026-07-06T13:21:24.182761Z","submitted_at":"2022-06-15T23:03:56Z","title":"Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.07843","snapshot_observed_at":"2026-08-10T21:58:10.438028Z","title":"Recent develop- ments in security-constrained AC optimal power flow: Overview of challenge 1 in the ARPA-E Grid Optimization Competition","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.438028Z"},"links":{"cited_paper":"/paper/2206.07843","citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:b08ac7e6158db29e51fee4fd9fb8c0b3f583ab3095cd8a0177b809803a6d6c99","observation_id":"2821c03d-499c-4ae9-99a8-6336e2088cd2","resolution":{"observed_at":"2026-08-10T21:58:10.438028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1607.06450","last_updated":"2016-07-21T19:57:52Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2016-07-21T19:57:52Z","title":"Layer Normalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.06450","snapshot_observed_at":"2026-08-10T21:58:10.442476Z","title":"Layer normalization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.442476Z"},"links":{"cited_paper":"/paper/1607.06450","citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:5ed67f3d3a0f013d2b61343f853b9b3d089958954fa07db1c32592aad34dd975","observation_id":"7a558172-1f30-4a9a-8778-d1d8fd84a51f","resolution":{"observed_at":"2026-08-10T21:58:10.442476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.02788","last_updated":"2021-01-04T18:52:39Z","snapshot_observed_at":"2026-08-10T16:03:44.453782Z","submitted_at":"2019-08-07T18:22:18Z","title":"The Power Grid Library for Benchmarking AC Optimal Power Flow Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.02788","snapshot_observed_at":"2026-08-10T21:58:10.446654Z","title":"The power grid library for benchmarking AC optimal power flow algorithms","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.446654Z"},"links":{"cited_paper":"/paper/1908.02788","citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:456337fe9d8404de2ba47951e06a60ad77a35a68e6539df9002d5250027bb9f3","observation_id":"257fd8c0-2d99-4b60-94fd-1b4eba8d3f8d","resolution":{"observed_at":"2026-08-10T21:58:10.446654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.352958Z","title":null,"venue":null,"work_id":"0fea01de-aad0-4698-84b1-b487e4eeaab6","year":2019},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.451277Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:513bdf3c06d5ec048ad56c5a36b50cb1bd5f9ac117b0ebbb7ad068a676363ee7","observation_id":"a2a7ec43-e772-4614-bf77-21576483859b","resolution":{"observed_at":"2026-08-10T21:58:11.363715Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.338291Z","title":"Machine learning for combinatorial optimiza- tion: A methodological tour d’horizon","venue":null,"work_id":"e88089b4-d2f1-47d4-b9ec-98b2bd9ce29e","year":2021},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.455498Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:48f9233caeaf9dad12a213a364a7e765a9dc01c9ee1644f38655d633f67fe3ac","observation_id":"9a95de33-26f0-4585-aae7-2b39a85ee726","resolution":{"observed_at":"2026-08-10T21:58:11.343308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.09703","last_updated":"2023-01-23T20:23:35Z","snapshot_observed_at":"2026-08-11T00:31:17.402420Z","submitted_at":"2023-01-23T20:23:35Z","title":"Two-Stage Learning For the Flexible Job Shop Scheduling Problem","version":1},"cited_work":{"arxiv_id":"2301.09703","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.09703","snapshot_observed_at":"2026-08-10T21:58:10.653353Z","title":"Two-Stage Learning For the Flexible Job Shop Scheduling Problem","venue":"cs.AI","work_id":"9f59c497-c8f5-471d-8fc3-d0d06bd93418","year":2023},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.459190Z"},"links":{"cited_paper":"/paper/2301.09703","citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:7a83391f25e92556bf182ebde5d62b2e58b640f0ac614e932c48388a4035305f","observation_id":"9e907dce-a80e-4911-a481-3fe81f3d1d9b","resolution":{"observed_at":"2026-08-10T21:58:10.660213Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.324329Z","title":"End-to-end feasible optimization proxies for large-scale economic dispatch","venue":null,"work_id":"0bbdcc61-478c-4d6a-a1ab-8c33e92d8c43","year":2023},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.463348Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:3c5299e9613bfa0e0c9a02dc656dad56aa0f749f92c2a14b125cbc082314045a","observation_id":"528b9d90-1ff1-4efb-9a39-8de76c6564ca","resolution":{"observed_at":"2026-08-10T21:58:11.329342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.310061Z","title":"End-to-End Feasible Optimization Proxies for Large-Scale Economic Dispatch","venue":null,"work_id":"78888552-f053-4bf3-b9e4-8e59527f06c4","year":2023},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.467287Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:118fc05c745ed3a85d1b1824df4713bc44672e54ba98c9a4970e63ceb5568397","observation_id":"0d843c1a-e418-407a-8432-48fad11e1144","resolution":{"observed_at":"2026-08-10T21:58:11.314992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.292037Z","title":"Real-time risk analysis with opti- mization proxies","venue":null,"work_id":"44814ddc-9eb0-49ac-b740-5afe1dec6494","year":2024},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.470909Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:a93669aeb0e471e9c5ee71a09b98d4aed90fff53e8450b250b9851fbdcdfc325","observation_id":"158bc24d-0d16-4a18-abc1-97896e1a73ed","resolution":{"observed_at":"2026-08-10T21:58:11.299395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.277349Z","title":"Donti, David Rolnick, and J Zico Kolter","venue":null,"work_id":"b8f85f52-7b1b-4dbd-8d3b-0b1bf54f52fc","year":2021},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.474779Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:ba1b3c706367a33731f2b4f0d1808768cc3e0abb0d108e34b8df73b3a28fc49d","observation_id":"49e28767-206f-489d-bbe1-ab8a0afad6a8","resolution":{"observed_at":"2026-08-10T21:58:11.281701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.263085Z","title":"Optimizing primary response in preventive security-constrained optimal power flow.IEEE Systems Journal, 12(1):414– 423, 2016","venue":null,"work_id":"03fbab9d-f42b-4af8-aadf-7203ebaab81a","year":2016},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.478664Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:048b9b0120d434a5ec3c5cd1c9d64544f4f6c9c34154ccabcefe0ed5cba13fc5","observation_id":"0f13b330-0bd3-4ef2-899f-1220114ba9b6","resolution":{"observed_at":"2026-08-10T21:58:11.268012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.247241Z","title":null,"venue":null,"work_id":"c9153bbf-ffad-4297-be13-0ad5d9bdc98d","year":2020},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.482798Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:03f730db469492ea84622973618996e493c736d694b68f149229aa55e52372fd","observation_id":"eba62ef8-6ff7-4fe8-990d-11cb2f90704d","resolution":{"observed_at":"2026-08-10T21:58:11.252740Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.230474Z","title":null,"venue":null,"work_id":"90a5ba66-253a-406e-b1a2-77f2c7d24e33","year":2021},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.486624Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:4b43023d64b59a3c2b1b54944b1270e13aa8cff0502774fec6c8e69066194351","observation_id":"113b1a99-a469-4d00-94a4-bb5c9353ff0e","resolution":{"observed_at":"2026-08-10T21:58:11.235681Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.212613Z","title":"Gould, R","venue":null,"work_id":"7cfd0e75-1616-4817-9bd1-8e1b8c80165f","year":2022},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.490394Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:b1935168fe36515aabb0b90b0da6b28a12061feca097909750b5980df373c4d1","observation_id":"0659c7c4-3521-4be7-934a-62b47f6f527a","resolution":{"observed_at":"2026-08-10T21:58:11.218875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.197413Z","title":"“Grid optimization competition datasets, 2018","venue":null,"work_id":"7c3032f8-185d-4987-9b22-c90ee1638f53","year":2018},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.494051Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:e8a85ec74feb611d24145aeebd448f592198cbc60f573e5b4feba5b32a0e937e","observation_id":"70a5a715-e7ad-4924-b7ca-7ed1d1a584ac","resolution":{"observed_at":"2026-08-10T21:58:11.202731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.177330Z","title":"Direct calculation of line outage distribution factors","venue":null,"work_id":"cafa192d-8de8-4662-80be-40ea8cf90ab0","year":2009},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.498083Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:61a3327beee67e10a1c2fba1c96c1e106a915b92140fc161261b017e3aa81838","observation_id":"71ff05b7-a1c9-4b9d-8763-c5ca9d73ec4e","resolution":{"observed_at":"2026-08-10T21:58:11.183042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.158837Z","title":"Fast Simultaneous Feasibility Test for Security Constrained Unit Commitment, 2022","venue":null,"work_id":"0a6e8a13-d126-4ddb-8e1a-10ba9d77c30b","year":2022},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.501534Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:9afa4180451fa78272abb506db77d1524dd4b5c28eba42b452f3c954a3acb15f","observation_id":"c6749e94-a66d-4cbd-8d48-a0b9354c123d","resolution":{"observed_at":"2026-08-10T21:58:11.164749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.505314Z","title":"Multilayer feedforward networks are universal approximators","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.505314Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:ef8a6677ebe58bfe86f30d79612f005c9e3365ee7f37651985628faa94233049","observation_id":"e5a9c947-ad9d-496c-a69c-f85d9aac0ed7","resolution":{"observed_at":"2026-08-10T21:58:10.505314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.133472Z","title":"DeepOPF-NGT: Fast No Ground Truth Deep Learning- Based Approach for AC-OPF Problems","venue":null,"work_id":"aabb981b-f856-428e-9767-0203524df8d6","year":2021},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.508833Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:7d732f99e23240eb6b4fb62894253b1b17cfeb48f89bfd5298dbf82da4b093f3","observation_id":"a5a15082-3853-49db-b8a7-27dc3853c38d","resolution":{"observed_at":"2026-08-10T21:58:11.138158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.119856Z","title":"AC Power Flow Data in MATPOWER and QCQP Format: iTesla, RTE Snapshots, and PEGASE, 2016","venue":null,"work_id":"2e362acd-dfe8-4870-a5d9-c805eca7e577","year":2016},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.512750Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:06783da3a1d4cc5b57a85781e528fc7881c0575cc44314245b608dc2d2117f28","observation_id":"0f1dffb4-b8ca-4f64-892a-1299ff927b26","resolution":{"observed_at":"2026-08-10T21:58:11.124892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.107096Z","title":"Dual interior-point optimiza- tion learning, 2024","venue":null,"work_id":"483b08cd-8377-45f1-9504-fda50cf3e44f","year":2024},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.517424Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:bb51b91fdf486e9eecda03c8c040cc8195559fe5816876beb60d96ec5cfdd7fd","observation_id":"fd3af7c7-3af7-4eed-b729-54eee43363b4","resolution":{"observed_at":"2026-08-10T21:58:11.111636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.087837Z","title":"A new computationally simple approach for implement- ing neural networks with output hard constraints","venue":null,"work_id":"f41c6a3f-c4d3-48b0-b70f-4487a2cc91bc","year":2024},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.521402Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:876f9bb34d114363fb4a9dec3109750a930b25ae0ef08e3b45c7f5f4c3babf45","observation_id":"f228f8a6-1087-4e63-9644-c92e36d6dc7f","resolution":{"observed_at":"2026-08-10T21:58:11.093469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.071444Z","title":"Fast approximations for job shop scheduling: A lagrangian dual deep learning method","venue":null,"work_id":"d82a5d1e-a2be-43f6-a104-d72feba3a18a","year":2022},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.525171Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:a7d92125274b6803af6fceb1d6961a92258af0af94d06ab22bfc1b686f614b3b","observation_id":"52e240b2-6c5c-40ff-b143-cf973a2ea99d","resolution":{"observed_at":"2026-08-10T21:58:11.076823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.055831Z","title":"End-to-end con- strained optimization learning: A survey","venue":null,"work_id":"a3c22f63-2200-4ce6-9515-018ce154a0a0","year":2021},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.529537Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:6f4e6a39b5cc1ce7319a533e76119b38ffc895489507779e858e55f403a322df","observation_id":"71b2666b-55d6-485b-beda-d9ba8c56a568","resolution":{"observed_at":"2026-08-10T21:58:11.060249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.040949Z","title":"The Implicit Function Theorem","venue":null,"work_id":"f93e062e-f97e-4e22-848e-82e430a69391","year":2003},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.534457Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:ffb90087de895cb45e589207cccc3fdbd937085e7d957525b2325245332fff57","observation_id":"58a4b10b-1fd2-48ad-b98b-16e20cb8c7bf","resolution":{"observed_at":"2026-08-10T21:58:11.045398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.025610Z","title":"Learning to Solve Optimization Problems With Hard Linear Constraints","venue":null,"work_id":"549af242-e350-4e88-a352-6cbe3e36215b","year":2023},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.538887Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:c6b2cdb1cd87bac829e5881c948d7d03bc7bd68190738f6de82ec201441a852b","observation_id":"69fc4a50-1353-4333-a6e2-4d808d3933fa","resolution":{"observed_at":"2026-08-10T21:58:11.030586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:11.009511Z","title":"The security-constrained commitment and dispatch for midwest iso day-ahead co-optimized energy and ancillary service market","venue":null,"work_id":"22e17d1e-27a4-4224-b255-8af703660182","year":2009},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.543571Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:5a00192efafe17a29d00a6f0ab1d7c614609e60aebeadc120108421570a8834f","observation_id":"b98d835f-2b48-441e-8a77-b21bc9721eeb","resolution":{"observed_at":"2026-08-10T21:58:11.014786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.991868Z","title":"Schedule 28A – Demand Curves for Transmission Constraints, 2019","venue":null,"work_id":"32045e9f-850c-4dcb-a8dc-928dee3d4929","year":2019},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.547514Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:2f1a8491a2b430fc8f49b0895f27cf3cbbc423541413a15f85120d6f3de4a0bd","observation_id":"645707fa-8053-4322-9bbc-6c8daf35de58","resolution":{"observed_at":"2026-08-10T21:58:10.996646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.978502Z","title":"Real-time energy and operating reserve market software formulations and business logic,","venue":null,"work_id":"bda5778c-6e27-40b5-aad7-3fb49a02e51c","year":null},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.551145Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:3d0497c25b763c2694aa745307a9892a412c4811db0fd7780981ade465145cdf","observation_id":"c1f89028-fc2f-4fed-9e1e-161a1adaf73c","resolution":{"observed_at":"2026-08-10T21:58:10.983068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.948452Z","title":"Schedule 28 – Demand Curves for TOperating Reserves, 2023","venue":null,"work_id":"92b2aa0a-dacc-458d-9897-e687a540c826","year":2023},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.558930Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:f349ba8710a2ecf48f9f7066487cd2a71d30fd09ee30d59b5e74f90e6a8ea1a5","observation_id":"8a183c1a-4e5d-44e1-ae0a-8e329d2d54c9","resolution":{"observed_at":"2026-08-10T21:58:10.952880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.935697Z","title":"MOSEK Optimizer API for Julia 10.1.24 , 2022","venue":null,"work_id":"ef3e45a7-105a-4ed5-afe2-026b102f56eb","year":2022},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.562448Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:af2173ef0b91aa6f2368c8dc6ac4edf80938ab1504b506409142906a0a6f9193","observation_id":"9f5baa79-d708-4f78-9e2b-a63ab339074c","resolution":{"observed_at":"2026-08-10T21:58:10.939716Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.923303Z","title":"Optimization-based learning for dynamic load planning in trucking service networks, 2024","venue":null,"work_id":"02102a30-bb8d-4356-b2ce-aa8b75dcc5fe","year":2024},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.565941Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:653028af2e9620b3d2ab6e6d0138cca6a25c3a99c29602d074b67fc657ee690d","observation_id":"856b87ca-724b-4233-bcad-2427bfb20d09","resolution":{"observed_at":"2026-08-10T21:58:10.927664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.910540Z","title":"DeepOPF: A Deep Neural Network Approach for Security-Constrained DC OPF","venue":null,"work_id":"a3fed01e-33ad-4964-8ea9-11e5a0c4a3ab","year":2020},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.569635Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:2265dd97c89c181c1a79d48a6d1ab5fe0152c9904fd16184f4cb3af82340fd22","observation_id":"54088d95-321f-4c0d-a2f4-df9c51fc5f3f","resolution":{"observed_at":"2026-08-10T21:58:10.914763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.573155Z","title":"Self-supervised primal-dual learning for constrained optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.573155Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:6935ed78455f4cb95cb77d12691e9aafeea465a59142a210d8edb091884d2224","observation_id":"0a57959a-3308-4734-95cd-76071e652c99","resolution":{"observed_at":"2026-08-10T21:58:10.573155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.887741Z","title":"Self-supervised learning for large-scale preventive security constrained dc optimal power flow","venue":null,"work_id":"49e66e7a-9c23-4d30-979a-4f27f04c8d5d","year":2024},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.576997Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:26c91b3b493bc04a5f3f1e85d6f5db6671fea49c638c5a5e96140a004a1e3e9b","observation_id":"51952381-a42d-4448-aa8c-2030e5de9ff0","resolution":{"observed_at":"2026-08-10T21:58:10.893334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.873810Z","title":"Dual Conic Proxies for AC Optimal Power Flow","venue":null,"work_id":"3853aa74-05a0-46a0-af7b-e2947938b19f","year":2024},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.580483Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:a435d316389cdacb7588b505714eb1833c4218517b7e95699d4d4edff5d12cfe","observation_id":"94193905-e9f7-44af-a2e3-cfe547a2c1b6","resolution":{"observed_at":"2026-08-10T21:58:10.878092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.860152Z","title":"Dual lagrangian learning for conic optimization, 2024","venue":null,"work_id":"a96df97d-b7cc-4cc1-a346-58bc4f8de9c0","year":2024},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.584119Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:b5f157d8ee81ac0c6340eb8cea00571ade7ab3c3a81dafca7f11e24b5568687c","observation_id":"86cb164f-c9ad-4a72-a799-c7f4b9e2242c","resolution":{"observed_at":"2026-08-10T21:58:10.864934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.847161Z","title":"Security constrained unit commitment using line outage distribution factors","venue":null,"work_id":"99a96663-b1e6-49e5-bab0-e0c157d5146a","year":2017},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.587852Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:c875378ae0098ffdce34da80d5ea3b1b22642cf0bd67c4571275c9524a73ec6b","observation_id":"e77ee8ac-2359-4a01-9c42-fbbf953ddf5c","resolution":{"observed_at":"2026-08-10T21:58:10.851441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.832368Z","title":"Rayen: Imposition of hard convex con- straints on neural networks","venue":null,"work_id":"32da57d0-25c0-4424-ae9a-ea2f66806494","year":2023},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.591544Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:8cd07c1b18908a4c7d775044ad2eeee10a5c08eb24105f0b5fc4da0d535d9ce4","observation_id":"8656e5dc-f1ad-48c6-a6b0-186b970b8917","resolution":{"observed_at":"2026-08-10T21:58:10.836964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.816393Z","title":"of Electrical Engineering","venue":null,"work_id":"578612de-23d7-4e80-bba2-85fbab7d12c7","year":1999},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.595186Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:128d53e06e2fb01a766357ac1d87842a47b04888439473865576824e89c05b67","observation_id":"fa81bb8e-997c-4605-9639-f192232c6b0b","resolution":{"observed_at":"2026-08-10T21:58:10.822464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.796517Z","title":"Machine Learning for Optimal Power Flows","venue":null,"work_id":"744abea2-5eb7-4405-bbfd-206214bae6b0","year":2021},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.599011Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:a03bfccc575b8e833a1266ae4f0ca3118b102b1efbae59a156ee336c1c9c728a","observation_id":"39a7c57b-a1cb-4ce5-8aec-67d734224851","resolution":{"observed_at":"2026-08-10T21:58:10.806020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.781733Z","title":"Combining deep learning and optimization for preventive security-constrained DC optimal power flow","venue":null,"work_id":"63636bf5-a2e4-470d-bf93-939640afcd3b","year":2021},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.602982Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:d8be9765451392723b3da3eb96cba5a118166e103b9816f7a2e109d25cdf3690","observation_id":"3a710414-41e8-4ba8-87bd-6aba02259e6d","resolution":{"observed_at":"2026-08-10T21:58:10.786652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.765525Z","title":"An exact and scalable problem decomposition for security-constrained optimal power flow","venue":null,"work_id":"86760ee1-d1f8-4dd9-8468-81f36e757f80","year":2021},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.607113Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:d7b43f3f76c809cf10897e05e7e0d75a2fbbc85847afb461d7b76b72ace73133","observation_id":"770fe2fc-df27-48e2-a1a3-2bbcc1f539ae","resolution":{"observed_at":"2026-08-10T21:58:10.771579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.750366Z","title":"Fast optimal power flow with guarantees via an unsu- pervised generative model","venue":null,"work_id":"1ca269da-bb90-4f05-a442-0ec7083a3c14","year":2022},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.611116Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:4de78e0c7eaa28c383ff31912e63aaeb9c7a04e9f3a576c2da55ca6b31e3dab7","observation_id":"37f1bb3c-2d71-4c28-af08-c37830c05422","resolution":{"observed_at":"2026-08-10T21:58:10.755152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.733960Z","title":"Melding the data-decisions pipeline: Decision- focused learning for combinatorial optimization","venue":null,"work_id":"04b40b60-0d86-41ae-a7c4-f66c0e362305","year":2019},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.614943Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:41ff4c9ade84bf3624762d88df6c9dce58716904b81748f7d21d01b8aee9fa48","observation_id":"41f08120-0282-4db7-9a17-371e117f8da3","resolution":{"observed_at":"2026-08-10T21:58:10.739849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.714779Z","title":"Reinforcement learning from optimiza- tion proxy for ride-hailing vehicle relocation","venue":null,"work_id":"4e2e9c50-6e8b-4e79-ac47-ea016e7ea8f3","year":2022},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.618646Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:734ec64f98f74aa834f1d671e1d2542730ed37f26dfdffb3eca977c325109576","observation_id":"c1d41ee4-5035-4bc6-969d-c024160a7573","resolution":{"observed_at":"2026-08-10T21:58:10.722316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:58:10.962748Z","title":null,"venue":null,"work_id":"87fbf939-05ea-4109-b017-69276e3b3a11","year":null},"citing_paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-10T21:58:10.555122Z"},"links":{"citing_paper":"/paper/2501.03443"},"observation_digest":"sha256:f9fd30d762dfc2cb872eff32eee6678389804ed47c948d60fa15480f9265670f","observation_id":"99ae6262-e142-4f15-9fac-e261e78b969e","resolution":{"observed_at":"2026-08-10T21:58:10.968190Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.03443","last_updated":"2025-01-07T00:09:52Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-10T21:50:22.326938Z","submitted_at":"2025-01-07T00:09:52Z","title":"Optimization Learning"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":38},"total_outbound_references":49},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 4 inbound Pith citation observations for arXiv:2501.03443."}