{"as_of":"2026-08-14T02:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c58630d71120e1f8e097d96eaf8dccc74bf49d5b91b0f1f705d89ff0a7270cb5","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T10:28:09.808244Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.19285/citation-record","integrity":"/paper/2411.19285/integrity","json":"/paper/2411.19285/citation-record.json","paper":"/paper/2411.19285"},"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-12T10:28:10.181391Z","title":"Differentiable convex optimization layers","venue":null,"work_id":"90ca5c56-88fa-44ab-9d62-4097cc4631b9","year":2019},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.678209Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:c918ec34da81b4245b541188bd7588da18a4b25363390d822817895895de0178","observation_id":"50ed1ea5-b59b-403b-9910-eb5f1cf9c18f","resolution":{"observed_at":"2026-08-12T10:28:10.184435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:10.172781Z","title":"Deep declarative networks","venue":null,"work_id":"c87b4857-7f12-46cc-8372-705442b368ad","year":2021},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.685712Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:b5537dd6b9a79322be4907fd4d23f81b3d10a187c44667a14360caf5fc4cd410","observation_id":"b2c3b5e7-0ba5-4f06-a293-9fea29037cbd","resolution":{"observed_at":"2026-08-12T10:28:10.175957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.688846Z","title":"A tutorial on energy- based learning","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.688846Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:c5ad7395bf9232eed6626ff60368bee7896dd722522a287c18027c1a3ff8b566","observation_id":"eb5ed0ac-d350-4782-a68f-2125bc3b797f","resolution":{"observed_at":"2026-08-12T10:28:09.688846Z","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-12T10:28:10.159511Z","title":"Generic methods for optimization-based modeling","venue":null,"work_id":"527ceeb9-d70b-4721-a1a0-d4644f96525e","year":2012},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.692038Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:165250ca1d83016d4a5103d7fa1ed097f484bd8f11c7f2c8f0f90353a0e33eff","observation_id":"a4c59564-d72a-4a0f-814c-2829c973ff3f","resolution":{"observed_at":"2026-08-12T10:28:10.162665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:10.150602Z","title":"Smart predict-and-optimize for hard combina- torial optimization problems","venue":null,"work_id":"6e789ec6-ece0-4401-bcf9-767ce20ea9bb","year":2020},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.695301Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:e424716dd52538810e56522e93988928357859cda4d6aaf98d80b4986050a751","observation_id":"828504b7-dd93-4f1a-bbb5-4664a8505e97","resolution":{"observed_at":"2026-08-12T10:28:10.153848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.698404Z","title":"predict, then optimize","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.698404Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:148c3d4bc54fce4d78ca31c270c38e121e839f0f729676756ba5007763f5c6b9","observation_id":"ce008269-e05d-4462-bb4b-3be278a19fa2","resolution":{"observed_at":"2026-08-12T10:28:09.698404Z","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-12T10:28:10.136722Z","title":"Melding the data-decisions pipeline: Decision- focused learning for combinatorial optimization","venue":null,"work_id":"a9717497-a489-4fdc-ab35-0c4ac6e625be","year":2019},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.701471Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:95bbeec55cab87859485543121877b45bf8bbb03840cba043ecb488a85452453","observation_id":"a4252219-0f16-409e-87c8-ccafa3c219f8","resolution":{"observed_at":"2026-08-12T10:28:10.140232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:10.127293Z","title":"Stochastic distribution control system design: a convex optimization approach","venue":null,"work_id":"dba713fe-b081-4d05-af9c-a51cb6dd3e8d","year":2010},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.704244Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:b1d5b899c5c4c8ee04144fecd2af682c5cac111dd9796c65b058168229aa40fd","observation_id":"6f00b34b-0188-406b-8564-6ea5ab108b42","resolution":{"observed_at":"2026-08-12T10:28:10.130693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:10.118607Z","title":"Real-time convex optimization in signal processing","venue":null,"work_id":"6d4d716a-f6a7-4281-b396-87b89a8734a1","year":2010},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.707032Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:f22dd083a43918148406019c710e2542f2b252df42cd8da69240cafe5f67aeae","observation_id":"66234480-3de4-4790-9fb9-3c536b729428","resolution":{"observed_at":"2026-08-12T10:28:10.121757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.15183","last_updated":"2022-10-12T09:51:43Z","snapshot_observed_at":"2026-08-13T19:13:02.734749Z","submitted_at":"2021-05-31T17:45:58Z","title":"Efficient and Modular Implicit Differentiation","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.15183","snapshot_observed_at":"2026-08-12T10:28:09.709798Z","title":"Efficient and modular implicit differentiation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.709798Z"},"links":{"cited_paper":"/paper/2105.15183","citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:b0bc46d3bf824a9a4e2997429f2df96df2845437c6c1a97c3a4b7dd7c0eb7e90","observation_id":"bb93583c-870e-44ff-af0c-02726c468b5e","resolution":{"observed_at":"2026-08-12T10:28:09.709798Z","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-12T10:28:10.109860Z","title":"Efficient multiple hyperparameter learning for log-linear models","venue":null,"work_id":"4292631c-ea9b-443a-a0db-20a88f8a7aec","year":2007},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.712988Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:fdccb16ec7e6a40f3c79516e03f7f1c3159a9b80ce1220d7319905756035d748","observation_id":"408c34ed-0c6a-49f1-b447-9424964f1731","resolution":{"observed_at":"2026-08-12T10:28:10.113169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:10.101237Z","title":"Alternating differentiation for optimization layers","venue":null,"work_id":"1c74cd71-f5dd-4a77-9807-99f888f2a33e","year":2022},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.716049Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:8690a397d57b7a40015ff3c97e47831c6f21d567620a2b4b383dd22d3bd0eb62","observation_id":"69fac1d9-fa44-453c-9879-54a469bbe55c","resolution":{"observed_at":"2026-08-12T10:28:10.104310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:10.092790Z","title":"An implicit function theorem","venue":null,"work_id":"f2b4f91f-2bb2-44b4-8ce1-31af9e25d294","year":1978},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.718828Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:b829871a7acbeca869cf3e4427938dc4309e088f67f353b2d4cdbfc3852b6a04","observation_id":"e4af22a0-94a4-4b0d-8654-0b18e83fa3f0","resolution":{"observed_at":"2026-08-12T10:28:10.095857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.721549Z","title":"Optnet: Differentiable optimization as a layer in neural networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.721549Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:a7540e945222d1d8d6b1ab03217c638afd557f20b642f897f8ae8226b2c4ca0d","observation_id":"22560b55-7b23-4b7d-9605-52ac2f7078d5","resolution":{"observed_at":"2026-08-12T10:28:09.721549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.09043","last_updated":"2020-05-20T00:59:53Z","snapshot_observed_at":"2026-08-08T07:57:02.175720Z","submitted_at":"2019-04-19T00:33:25Z","title":"Differentiating Through a Cone Program","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.09043","snapshot_observed_at":"2026-08-12T10:28:09.724403Z","title":"Differenti- ating through a cone program","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.724403Z"},"links":{"cited_paper":"/paper/1904.09043","citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:ebda6ea6476146a12c9618e3d23cf5c9ff113a9dbd219cb0229562f4183cb6f3","observation_id":"ffdbd41f-8d72-43d0-8442-e25e270c268c","resolution":{"observed_at":"2026-08-12T10:28:09.724403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:28:09.728148Z","title":"Osqp: An operator splitting solver for quadratic programs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.728148Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:898a60741638646fdd65041ae031d1491622c4f728a6cb403039e750aeeba37b","observation_id":"51ed9700-9b12-4449-950f-12826076b98d","resolution":{"observed_at":"2026-08-12T10:28:09.728148Z","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-12T10:28:10.074267Z","title":"The simplex method for quadratic programming","venue":null,"work_id":"44090fcf-878a-453e-9974-c4fd72e8b5d8","year":1959},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.731094Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:d1dcf725e5e1aa1490a25894abbe5ece1b12dad0c88827766ba300f5de8e0e43","observation_id":"5ea14657-3046-416c-811e-63761090aae6","resolution":{"observed_at":"2026-08-12T10:28:10.077546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:10.064874Z","title":"Efficient differentiable quadratic programming layers: an admm approach","venue":null,"work_id":"b50638e8-809f-4766-a14f-0d6edf65d9e5","year":2023},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.734852Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:69b9937ab5ea1a0061674911ad17fb58eca52f68898840b67029823d2184aa67","observation_id":"e9cc218c-1780-47df-802e-d806c326e693","resolution":{"observed_at":"2026-08-12T10:28:10.067981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:10.055944Z","title":"Cvxpy: A python-embedded modeling language for convex optimization","venue":null,"work_id":"638587de-6baf-4892-bae0-3f5cf76b289c","year":2016},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.737546Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:372576862bc44df36d3aa9e4f875666dcd7c5b867debafc7a3cd6f2ef3892547","observation_id":"dd98e02b-ee3a-4067-b4fa-ba320d0aa2fb","resolution":{"observed_at":"2026-08-12T10:28:10.059231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:10.046748Z","title":"Conic optimization via operator splitting and homogeneous self-dual embedding","venue":null,"work_id":"7048d144-86e8-4bdc-b859-1ea10bb9a26a","year":2016},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.740254Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:495b8e76e53198b3c1e08005956ce3af05ed429b78a5ddd76d770f6dd41573a1","observation_id":"da301481-067d-47d3-ad13-45382fec22a1","resolution":{"observed_at":"2026-08-12T10:28:10.050287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:10.038153Z","title":"Mipaal: Mixed integer program as a layer","venue":null,"work_id":"139eb1ad-1306-4a21-a85d-3dfa1d1b9667","year":2020},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.742921Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:b3f6d88bdd549ea6b22451d06a322eea135f0b1f55e0364b345c12c8b16395ca","observation_id":"c33bc2df-c993-4a7e-8906-1b2b6736dc6e","resolution":{"observed_at":"2026-08-12T10:28:10.041299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:10.029346Z","title":"Implicit mle: backpropagating through discrete exponential family distributions","venue":null,"work_id":"1393a587-8573-402d-9a3b-4351ac71a85e","year":2021},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.745609Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:13e158e6833d1bc378d2043950dc7fb627bbb4551116007e097ed951c7be869a","observation_id":"981aed01-08fa-4730-bec8-58902d5e9a58","resolution":{"observed_at":"2026-08-12T10:28:10.032566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.748311Z","title":"Satnet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.748311Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:1842a770e1aa77ade918277a5cbd02b3367b48a5e49aabdc3f55384f9c9b599d","observation_id":"80462051-89a7-407b-9970-34ccb2fbdb73","resolution":{"observed_at":"2026-08-12T10:28:09.748311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11189","last_updated":"2020-09-22T12:57:10Z","snapshot_observed_at":"2026-08-13T21:32:39.378490Z","submitted_at":"2020-09-22T12:57:10Z","title":"Qlib: An AI-oriented Quantitative Investment Platform","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11189","snapshot_observed_at":"2026-08-12T10:28:09.750815Z","title":"Qlib: An ai-oriented quantitative investment platform","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.750815Z"},"links":{"cited_paper":"/paper/2009.11189","citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:7f281962ba42cab5498804b569d56dbfc20c28a9aee6069fceb504c017faf4b3","observation_id":"110192dc-3630-4991-8896-6c25126cf0de","resolution":{"observed_at":"2026-08-12T10:28:09.750815Z","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-12T10:28:10.016047Z","title":"Robust linear programming discrimination of two linearly inseparable sets","venue":null,"work_id":"3e632af8-b760-4049-9c1d-0cdd5280400f","year":1992},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.754347Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:7275bd62ffe3446aa32bc927ec2f4b59d19846bfab5a5acae7d318a60738f8ad","observation_id":"84bf68e6-f765-456b-81c0-6cfad4de791c","resolution":{"observed_at":"2026-08-12T10:28:10.019035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:10.007508Z","title":"End-to-end risk budgeting portfolio optimiza- tion with neural networks","venue":null,"work_id":"5322fdf1-f30d-4261-8095-caf9e8f5a58d","year":2023},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.757391Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:e0fbcc861efe35923550c48d41361cb3319689f5143bde9e71902bdc12eafac4","observation_id":"d45b4f59-a245-46de-bf67-ec43600ff18c","resolution":{"observed_at":"2026-08-12T10:28:10.010576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.998658Z","title":null,"venue":null,"work_id":"fc4a7ca5-c1ce-4beb-aef8-956b38dbdf7c","year":1952},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.760244Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:b950a26e7abdb7dc28fb8af4dffea66f913b38b50baab9858982ef32b253c929","observation_id":"34746748-10f7-4729-9858-02c5bf38e89e","resolution":{"observed_at":"2026-08-12T10:28:10.001786Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.989474Z","title":"V olatility clustering in financial markets: a microsimulation of interacting agents","venue":null,"work_id":"6619ac28-088a-4eb6-bad8-2cfe34b7f728","year":2000},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.763291Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:943ec6e2ab30c3e18e8d1c44d79ebe11294fa93ede4b6cece3b7db017178452e","observation_id":"5a935b40-1154-450f-8849-082677753e4e","resolution":{"observed_at":"2026-08-12T10:28:09.992569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.980708Z","title":"Improved svrg for non-strongly-convex or sum-of-non- convex objectives","venue":null,"work_id":"459f0c77-3492-48a7-80c8-0207f936256c","year":2016},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.766041Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:2e4ce2b7c11dbeb296651eec71f2297b68a2cdf0fd0b12507d952c7953c37004","observation_id":"8ac0f6b5-d4ee-4622-b152-38ded76e27c0","resolution":{"observed_at":"2026-08-12T10:28:09.983936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-13T19:34:03.954748Z","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-12T10:28:09.768745Z","title":"Dc3: A learning method for optimization with hard constraints","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.768745Z"},"links":{"cited_paper":"/paper/2104.12225","citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:0856b27d41ae84805276c5d59621d5f036f41437d244adc16f503fee83657ebe","observation_id":"bab0d5cd-f0b3-4f9e-9044-69e012e25d9a","resolution":{"observed_at":"2026-08-12T10:28:09.768745Z","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-12T10:28:09.972132Z","title":"End-to-end learning for optimization via constraint-enforcing approximators","venue":null,"work_id":"2321ef4c-4d42-43c2-b6f3-50cbc948259d","year":2023},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.771650Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:8ac3039aaf3f1dcdcaaae616f09805752f52d7bd640ed1e5f824bf0176650401","observation_id":"33e84044-ec79-456a-91c0-255d1dbb6e2d","resolution":{"observed_at":"2026-08-12T10:28:09.975229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.963555Z","title":"End-to-end stochastic optimization with energy-based model","venue":null,"work_id":"0e940b9c-5de3-4790-bc42-c772ab672f7c","year":2022},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.774293Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:574f1037bded299693de9d7284b0b832eca391c9bba58b71be3d1b4a9779b19a","observation_id":"30ac6d32-b376-4d2e-a8f0-fa8ae06d4152","resolution":{"observed_at":"2026-08-12T10:28:09.966729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.954786Z","title":"Learning the travelling salesperson problem requires rethinking generalization","venue":null,"work_id":"1c2dbd89-36ce-42df-ad0e-731c85278693","year":2022},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.776960Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:414b12373301341441a3b2c50db69fae2ab497758957c89c0175fcffa854254f","observation_id":"bb5ee0ab-b4f4-4fb3-b84f-737f21c8ceec","resolution":{"observed_at":"2026-08-12T10:28:09.957988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.779666Z","title":"Learning combinatorial optimization algorithms over graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.779666Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:5c619342441619e39c18fc4305d3c0153473d39e22d02b53061cc9de59f48333","observation_id":"0bab6cc3-5aec-43bf-a57e-bf7935ae5fb9","resolution":{"observed_at":"2026-08-12T10:28:09.779666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.04936","last_updated":"2019-11-12T15:39:21Z","snapshot_observed_at":"2026-07-06T08:36:24.990567Z","submitted_at":"2019-11-12T15:39:21Z","title":"Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.04936","snapshot_observed_at":"2026-08-12T10:28:09.782242Z","title":"Combinatorial opti- mization by graph pointer networks and hierarchical reinforcement learning","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.782242Z"},"links":{"cited_paper":"/paper/1911.04936","citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:a81f7ff6cdce6635b0181db0424ced58c62b8cf40fb562bf35f19230d2a22898","observation_id":"2a4a682e-e25f-412b-b90a-1b4abe196fdd","resolution":{"observed_at":"2026-08-12T10:28:09.782242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.08475","last_updated":"2019-02-07T09:10:08Z","snapshot_observed_at":"2026-07-06T06:29:42.428021Z","submitted_at":"2018-03-22T17:22:24Z","title":"Attention, Learn to Solve Routing Problems!","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.08475","snapshot_observed_at":"2026-08-12T10:28:09.785733Z","title":"Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.785733Z"},"links":{"cited_paper":"/paper/1803.08475","citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:cb093605d2097134c4aa5b7698dc19167d048b1c9331ac083c0be7a61f8c20ed","observation_id":"a27d4acb-eb4a-4c57-9284-0341f290bc1a","resolution":{"observed_at":"2026-08-12T10:28:09.785733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.04636","last_updated":"2021-07-09T19:13:07Z","snapshot_observed_at":"2026-08-13T18:48:34.401303Z","submitted_at":"2021-07-09T19:13:07Z","title":"End-to-End Risk Budgeting Portfolio Optimization with Neural Networks","version":1},"cited_work":{"arxiv_id":"2107.04636","doi":null,"metadata_source":"pith","pith_arxiv_id":"2107.04636","snapshot_observed_at":"2026-08-12T10:28:09.845274Z","title":"End-to-End Risk Budgeting Portfolio Optimization with Neural Networks","venue":"q-fin.PM","work_id":"8faae55c-4535-4987-9ccc-bb93ce500f21","year":2021},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.788818Z"},"links":{"cited_paper":"/paper/2107.04636","citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:b7793be1826322c39a31af3dc73aa4c4cba0d9bd3e5b78a1b876549c940b4e00","observation_id":"41348664-65aa-4b6c-9a88-a4a736221a89","resolution":{"observed_at":"2026-08-12T10:28:09.848673Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.16067","last_updated":"2022-11-09T00:34:52Z","snapshot_observed_at":"2026-08-13T16:12:47.545662Z","submitted_at":"2022-03-30T05:46:54Z","title":"Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Losses","version":4},"cited_work":{"arxiv_id":"2203.16067","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.16067","snapshot_observed_at":"2026-08-12T10:28:09.831402Z","title":"Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Losses","venue":"cs.LG","work_id":"bb274a31-724c-4d9c-acb2-c37bf5b9f0e3","year":2022},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.791743Z"},"links":{"cited_paper":"/paper/2203.16067","citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:29e7024fdfa6d1679dbb09ae1f4643db3571cbe888a2f872a593b758a5ada15e","observation_id":"0ed05b92-fd6e-4dd1-b77d-af02ad2567de","resolution":{"observed_at":"2026-08-12T10:28:09.836455Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.941441Z","title":"Automatically learning compact quality-aware surrogates for optimization problems","venue":null,"work_id":"9ea50712-c103-4728-abc8-879639a100b7","year":2020},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.794582Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:7ca3ffa592bf61eed1f19a1b22283e16b0b1c79b7c2bbe0b8521b14266b27242","observation_id":"b8a473e8-3b00-4f7e-881f-bedbdc546b9c","resolution":{"observed_at":"2026-08-12T10:28:09.944680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.932140Z","title":"Surco: Learning linear surrogates for combinatorial nonlinear optimization problems","venue":null,"work_id":"30ac3e6a-3035-4daf-9b37-d560e31d567d","year":2023},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.797292Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:376bc2bb2eb195fd703f0f0e1f04b176cc0c92b3d93cdf634e367bcdbb36d11d","observation_id":"651149af-6964-4b3a-916a-5946ee735d59","resolution":{"observed_at":"2026-08-12T10:28:09.935407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.923270Z","title":"Landscape surrogate: Learning decision losses for mathematical optimization under partial information","venue":null,"work_id":"a198900e-99ce-4291-a8c8-caccc1680a9e","year":2024},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.799956Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:3a3b5f7b34e0ed201373653576071f8da76942d034cffdd6273d7ecd303f5230","observation_id":"5f742917-6aa3-4652-a63d-55bb65d3d1e8","resolution":{"observed_at":"2026-08-12T10:28:09.926348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.914631Z","title":"Conic optimization via operator splitting and homogeneous self-dual embedding","venue":null,"work_id":"98f4dc0b-6809-457f-9142-9adb1740ab08","year":2016},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.802728Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:e9083e467cbcda132bf9406537208dff1c44f01b22e60ae28ec93fb4cb1e3982","observation_id":"baf1c3b5-9fbc-402c-8967-f4cb61f5e59d","resolution":{"observed_at":"2026-08-12T10:28:09.917755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.906067Z","title":"Operator splitting for a homogeneous embedding of the linear comple- mentarity problem","venue":null,"work_id":"884dddbd-ad6b-4b26-8988-2eeac5a2cb1d","year":1999},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.805456Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:90c51c38593241a8efa1a295ba28617c4dc741fcc551cc08f481828362fe992b","observation_id":"6b6f60eb-b377-414b-86a9-54f1f09ed754","resolution":{"observed_at":"2026-08-12T10:28:09.909097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:28:09.897187Z","title":"Comparing technical and fun- damental indicators in stock price forecasting","venue":null,"work_id":"6d8ac7be-0591-437c-91ce-fb91fd20ad52","year":2018},"citing_paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T10:28:09.808244Z"},"links":{"citing_paper":"/paper/2411.19285"},"observation_digest":"sha256:022575fb9e51a1a9f68b81aa3b9b01bd5f8a05c75201721054e78cb187034820","observation_id":"518d21ac-a4a2-4352-81ff-3dfaed8d7f75","resolution":{"observed_at":"2026-08-12T10:28:09.900404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.19285","last_updated":"2024-12-30T03:25:23Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T11:57:06.766013Z","submitted_at":"2024-11-28T17:31:15Z","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":2,"verified_fuzzy":29},"total_outbound_references":44},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2411.19285."}