{"as_of":"2026-08-21T07:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd05bbd2d8206f9631e5fe6f3cf8b5f6741342e78d94f254c1964e0fdb11b699","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:41:03.986335Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2505.09391/citation-record","integrity":"/paper/2505.09391/integrity","json":"/paper/2505.09391/citation-record.json","paper":"/paper/2505.09391"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:41:03.837831Z","title":"Learning to learn by gradient descent by gradient descent","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.837831Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:d0cda989861e1a15de8eeb3683b135c6ba53d03d3162c7e6b4eea77103a87316","observation_id":"da4aded9-5d4b-415d-a138-c93240aef511","resolution":{"observed_at":"2026-08-15T21:41:03.837831Z","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-15T21:41:03.842060Z","title":"Practical large-scale linear programming using primal-dual hybrid gradient","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.842060Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:9b15c393dc3e7de4539c63c228f0f03a8f8918e1755f9472757eeab48ceebf2c","observation_id":"f319ea03-371c-46c6-bb85-de3a6d9d7c77","resolution":{"observed_at":"2026-08-15T21:41:03.842060Z","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-15T21:41:04.400587Z","title":"Mosek optimization toolbox for matlab","venue":null,"work_id":"0b78480b-f275-4c9c-8d01-b6f0a9cb0fb1","year":2019},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.845853Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:aeed8196c5e9b7a4795f2d8f9fc55c73517d5df4a2edb51bfeaba6b203b4b8ff","observation_id":"9e8f6054-06b9-48a0-8df8-b491d8e131cc","resolution":{"observed_at":"2026-08-15T21:41:04.404163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.389152Z","title":"An inexact admm for separable nonconvex and nonsmooth optimization","venue":null,"work_id":"07c8ad2a-a416-48a3-943d-38735e20e40b","year":2025},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.849868Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:92e155ac65c322305f35d436e70f89909ae471debe3ffb5c81f9748e2a65022a","observation_id":"ca0eac80-8019-4959-b82d-144ff2d52515","resolution":{"observed_at":"2026-08-15T21:41:04.393511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.378493Z","title":"Infeasibility detection in the alternating direction method of multipliers for convex optimization","venue":null,"work_id":"a4600b10-3c02-441a-be4d-59addbc511e6","year":2019},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.853482Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:68e2bb30d951daadb51e4bbf277b89ae80836a4c76fc7ed1569db7a306ad1d29","observation_id":"9a5612cb-a339-4624-b363-587d8780a27e","resolution":{"observed_at":"2026-08-15T21:41:04.382001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.368654Z","title":"Inexact interior-point method","venue":null,"work_id":"70e4a776-8a57-4305-ba8f-0e37795b89d0","year":1998},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.857213Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:695c37fb868c96f4a4c58e16c2cab89e15ca2d21825bcdd8a943fd39ed28bef9","observation_id":"00df78c3-af50-4147-a0d8-e619ab9f4e04","resolution":{"observed_at":"2026-08-15T21:41:04.371943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.357982Z","title":"Predictive control for linear and hybrid systems","venue":null,"work_id":"7802a657-79a1-4514-a574-7c8ce9bf4957","year":2017},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.861112Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:ca2d2b9f6cb09964c6059a4d6aa73695df0d7cafbcf39311fba82def795b31a8","observation_id":"bb655e2c-6ac6-4116-bd85-96539c3fd3de","resolution":{"observed_at":"2026-08-15T21:41:04.361780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:03.864641Z","title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.864641Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:8e3fee4c13e2ab0d7b7e87493d2115d1bf42885df9def335cb4d817e30eb50b5","observation_id":"63e28ac9-2aea-4c99-a290-f6b00eba22e6","resolution":{"observed_at":"2026-08-15T21:41:03.864641Z","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-15T21:41:04.341448Z","title":"Performance bounds and suboptimal policies for multi--period investment","venue":null,"work_id":"950cc9b0-16a0-4739-a498-b1d366d22965","year":2013},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.868095Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:28c1ca6c70c33406c071677a8902de5505b0b2413b800cbd2739e9be3e24bbc5","observation_id":"001881e6-a5c9-459b-b892-3c6b0205e2b1","resolution":{"observed_at":"2026-08-15T21:41:04.345270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.330284Z","title":"On representing mixed-integer linear programs by graph neural networks","venue":null,"work_id":"896864b6-007d-4284-8847-3e3790116275","year":2022},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.871380Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:d0b9ea9f4ed9e17f539ac0b5ffc1e3822ce462222e087fd7804f46e8bf8d4d21","observation_id":"26d9100b-24e8-4d5c-927b-181260cf517f","resolution":{"observed_at":"2026-08-15T21:41:04.334005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:03.874838Z","title":"Support-vector networks","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.874838Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:3fed12f51db28903636249cbca1ea684e8a92a6317c0152d74e1dedf0f5bc8a8","observation_id":"726b8a59-5640-4951-8299-d39fd88eb690","resolution":{"observed_at":"2026-08-15T21:41:03.874838Z","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-15T21:41:04.313452Z","title":"Dc3: A learning method for optimization with hard constraints","venue":null,"work_id":"b089dd60-ebcf-4207-a5c4-2afb4247047b","year":2021},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.878713Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:07d321f8764e4a0bedd546a3a4c943011bec8dd2981596dba17667d97f9d7de1","observation_id":"d36afb61-4e7e-471d-bd7e-6e44d7d3573e","resolution":{"observed_at":"2026-08-15T21:41:04.317116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.303414Z","title":"Globally convergent inexact newton methods","venue":null,"work_id":"bfa9f1ec-006a-4763-836d-dc8f734fc94f","year":1994},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.882242Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:c02b187bb2daf36e4565b042dea6a36b7923945ac64a1b2e692d7de35896a10d","observation_id":"4b2262c2-e176-4f3b-be12-68115cff2d3c","resolution":{"observed_at":"2026-08-15T21:41:04.306827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.292733Z","title":"Ipm-lstm: A learning-based interior point method for solving nonlinear programs","venue":null,"work_id":"65bb0b0d-04db-431f-a0aa-fdc70ab75418","year":2024},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.885646Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:37be840d2de9e4b34ee85896477f2216c0c978d341777a237bceeaee6d815eeb","observation_id":"376b9c12-3e44-4dfe-a17b-e02311422fcb","resolution":{"observed_at":"2026-08-15T21:41:04.296435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:03.889107Z","title":"Model predictive control: Theory and practice—a survey","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.889107Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:f9cb4301c46c7e35fbb07ba6d89884a0e6b12ccba10288ae6ad046b4e6d57184","observation_id":"dc30acb5-b340-4ff5-86e6-1c57ee72b3c3","resolution":{"observed_at":"2026-08-15T21:41:03.889107Z","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-15T21:41:04.273727Z","title":"The machine learning for combinatorial optimization competition (ml4co): Results and insights","venue":null,"work_id":"ebf8394e-3931-4d04-9892-6724aa1eb074","year":2021},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.892737Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:643addc265b0218a752634cb49d656f2ade975e8067d4a825ec176e46c1adeb0","observation_id":"68ef573d-0105-4da9-8909-031f349b4bc9","resolution":{"observed_at":"2026-08-15T21:41:04.277747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:03.896122Z","title":"Learning fast approximations of sparse coding","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.896122Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:e678e04dd7ea41ab8fe9155ec0a91f4d8253b5d8290b06c79984e26a33e27dbe","observation_id":"8bd09048-c347-43dd-b210-94d8b3e12eb2","resolution":{"observed_at":"2026-08-15T21:41:03.896122Z","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-15T21:41:04.254407Z","title":"Bounds on eigenvalues of matrices arising from interior-point methods","venue":null,"work_id":"2660a2ee-b5b4-4333-875e-294ff3d6a8d6","year":2014},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.899486Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:3df103cb7319702479034d71bb5852cef6622140679e2162f70c9101b54e3f6e","observation_id":"8a8bf8a7-be2b-4f0a-bc5c-5dc3d74f8a3a","resolution":{"observed_at":"2026-08-15T21:41:04.258301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.242511Z","title":"Gurobi Optimizer Reference Manual, 2023","venue":null,"work_id":"2d951671-bb6a-4a97-9f84-beeb742c9c4c","year":2023},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.902676Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:1e0cad5a64752f286db00bab5fd3fa358aaf79d36f14949f7263aee7487d38d1","observation_id":"10b368fc-3a8e-4584-9046-7d0b634bae50","resolution":{"observed_at":"2026-08-15T21:41:04.246667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.232144Z","title":"Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities","venue":null,"work_id":"ac5d98e5-b823-4a87-8312-85d1f35bc4b9","year":2000},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.906030Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:93bc1acfae8b23948cae33cfc741f6bd4bf32a19489cb83b604f44616138308e","observation_id":"c83ca3ce-ee3b-410d-b13f-058aaa19a335","resolution":{"observed_at":"2026-08-15T21:41:04.235871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.221872Z","title":"On the convergence of primal-dual hybrid gradient algorithm","venue":null,"work_id":"32793c43-7e88-4e8e-b430-12e78262e57f","year":2014},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.909277Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:efa858ce943f6bad5905a6b331c7078195d7c54406f094c78c2bdc7ecdc12305","observation_id":"229bfae3-ea85-4bc3-96d5-6b24a5934c84","resolution":{"observed_at":"2026-08-15T21:41:04.225302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:03.912886Z","title":"Robust statistics","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.912886Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:19b76ce003617a6c6f5529b17e735bd6c9b09cac92e2ac1a0d699f714e30e3a6","observation_id":"df312810-1324-494d-8c83-ff41f2832624","resolution":{"observed_at":"2026-08-15T21:41:03.912886Z","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-15T21:41:04.204048Z","title":"Gonzalez, Ion Stoica, and Ken Goldberg","venue":null,"work_id":"55144642-b05c-4aac-98af-ba539742de5a","year":2021},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.916168Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:9f286dbef3dec9414564d2a5b1a994fe495e455449dc3ded2ba6cc15d86d763b","observation_id":"ac0dcf52-8f67-4f28-bbba-91e9b58be750","resolution":{"observed_at":"2026-08-15T21:41:04.208381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.192934Z","title":"Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension","venue":null,"work_id":"03e4ccdc-6851-4e40-9a28-faf6bbc4eee3","year":2008},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.919604Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:3ae2ea3f3acf41b4564fef58a60170827d876630267440b7fde9b27a5b6c65fc","observation_id":"ac2e022d-4360-4e70-a2d0-f7906ad91806","resolution":{"observed_at":"2026-08-15T21:41:04.196582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.06674","last_updated":"2024-09-23T11:28:24Z","snapshot_observed_at":"2026-08-19T12:42:03.326168Z","submitted_at":"2023-06-11T13:19:37Z","title":"Self-supervised Equality Embedded Deep Lagrange Dual for Approximate Constrained Optimization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.06674","snapshot_observed_at":"2026-08-15T21:41:03.923273Z","title":"Self-supervised equality embedded deep lagrange dual for approximate constrained optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.923273Z"},"links":{"cited_paper":"/paper/2306.06674","citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:6d31063e2742afac02e0224c7d47ebdaef906661adfe47527bb484a18522a251","observation_id":"8b96abf6-a4f6-476d-934a-ac6489bfc22b","resolution":{"observed_at":"2026-08-15T21:41:03.923273Z","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-15T21:41:04.182463Z","title":"Adam: a method for stochastic optimization","venue":null,"work_id":"86993cf5-3854-4654-80ba-186d2525d8d2","year":2014},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.926987Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:60ea84981027982250386d4303e149471c362612c954386e941fde44658f4caf","observation_id":"e29f4897-f102-47fa-be41-b454a38c2611","resolution":{"observed_at":"2026-08-15T21:41:04.186056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.171607Z","title":"Pdhg-unrolled learning-to-optimize method for large-scale linear programming","venue":null,"work_id":"43c0b124-b2b0-400b-838c-fafc42fe6ac4","year":2024},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.930341Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:3abaa779457ec41633956a0e0910540b8af1b2ae264c2f9ce0c4efcfce475523","observation_id":"4bb7cdb0-d7bf-48f4-9467-27e76f9de2be","resolution":{"observed_at":"2026-08-15T21:41:04.175328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.160784Z","title":"Learning to solve optimization problems with hard linear constraints","venue":null,"work_id":"f7bb183b-d6df-47e7-934c-e4df0d502e98","year":2023},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.933763Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:176b91bdf7d16f08468529689854700df79775ef34d1973d56be30252b01a93c","observation_id":"94627025-0fd5-4cf6-b6f0-6144506a54a5","resolution":{"observed_at":"2026-08-15T21:41:04.164454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.149725Z","title":"Low complexity homeomorphic projection to ensure neural-network solution feasibility for optimization over (non-) convex set","venue":null,"work_id":"a36a20c1-7ede-4cb9-8a11-8c0c596a6a56","year":2023},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.937062Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:b839cf8ca8174cbcea67f8238c844b369539fcc75ba61375cdcab102ad00a506","observation_id":"a49e20b4-621d-42d8-ab14-fb7a59c603a8","resolution":{"observed_at":"2026-08-15T21:41:04.153769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:03.940687Z","title":"Splitting algorithms for the sum of two nonlinear operators","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.940687Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:41588708c94cc1ce4c829afd846931a2b325f7603578fe4d3e6b3207e69710d7","observation_id":"43815b52-b41a-458d-8ec0-acb9bd78f3f7","resolution":{"observed_at":"2026-08-15T21:41:03.940687Z","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-15T21:41:04.132994Z","title":"Towards constituting mathematical structures for learning to optimize","venue":null,"work_id":"460ce096-c867-4036-87c5-95c3589eb7d9","year":2023},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.944090Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:4698d1a0774123fc93ffd4e7d711ad9ebac3c114887bf7e74f136a272a055b19","observation_id":"d6dd1cd2-db98-4bfd-b219-6c682e5a5423","resolution":{"observed_at":"2026-08-15T21:41:04.136702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.07710","last_updated":"2025-07-14T18:29:02Z","snapshot_observed_at":"2026-08-16T14:43:39.386854Z","submitted_at":"2023-11-13T19:50:03Z","title":"A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.07710","snapshot_observed_at":"2026-08-15T21:41:03.947398Z","title":"A practical and optimal first-order method for large-scale convex quadratic programming","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.947398Z"},"links":{"cited_paper":"/paper/2311.07710","citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:0ab31eb2c1221e54e14a80aecbfac67e788c73e69203ec043c22d7f0c486599b","observation_id":"ef589fc2-81b9-497f-be55-3940ff2e6f55","resolution":{"observed_at":"2026-08-15T21:41:03.947398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.13349","last_updated":"2021-07-29T13:41:25Z","snapshot_observed_at":"2026-08-16T18:56:28.610181Z","submitted_at":"2020-12-23T09:33:11Z","title":"Solving Mixed Integer Programs Using Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.13349","snapshot_observed_at":"2026-08-15T21:41:03.950898Z","title":"Solving mixed integer programs using neural networks","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.950898Z"},"links":{"cited_paper":"/paper/2012.13349","citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:ed82d48c7f10dd725d9fb4acc9bfd379579b5769f205bdf447c12834beaa2f8e","observation_id":"adc38ac2-e58f-42ab-b454-82247a814233","resolution":{"observed_at":"2026-08-15T21:41:03.950898Z","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-15T21:41:03.954822Z","title":"Operator splitting for a homogeneous embedding of the linear complementarity problem","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.954822Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:ace8bda2f76c346775f176a9c6893e6a19da84b9c23207431fd15f2c21231774","observation_id":"4f1cc237-077a-40b1-a082-548742adce60","resolution":{"observed_at":"2026-08-15T21:41:03.954822Z","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-15T21:41:03.958101Z","title":"Conic optimization via operator splitting and homogeneous self-dual embedding","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.958101Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:a93489c459bce25d54125a34f11d7316b0f08709d41d8dca16af0385f9e246f6","observation_id":"e5cd34c5-8723-4d8c-8797-e077c56683d9","resolution":{"observed_at":"2026-08-15T21:41:03.958101Z","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-15T21:41:04.109379Z","title":"Self-supervised primal-dual learning for constrained optimization","venue":null,"work_id":"c655e6a3-fa32-409d-8e85-6f676d9a9a28","year":2023},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.962562Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:e9b59738e881c17ac62bd93d654e883f15cf214443fc72a0b21039daa0b5a182","observation_id":"ea5b3741-2319-4ac2-8b86-76738d238fe4","resolution":{"observed_at":"2026-08-15T21:41:04.113264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.098390Z","title":"End-to-end learning to warm-start for real-time quadratic optimization","venue":null,"work_id":"ad618c0f-a5e6-4217-bab4-ab33fec1bbb3","year":2023},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.966063Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:903c1198f3067bb96b09adbd8be1a41345c7af0bb7b615a4501f767434b3b71e","observation_id":"aaf18555-e614-42c8-9918-0a6a576a6792","resolution":{"observed_at":"2026-08-15T21:41:04.102074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:03.969474Z","title":"Osqp: An operator splitting solver for quadratic programs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.969474Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:34c9c848da23ece89c7885d51ed94ae9e8154c0827ef91edf45affcc620404eb","observation_id":"09a04f8c-c72d-45c8-a73f-5a290b8b9d11","resolution":{"observed_at":"2026-08-15T21:41:03.969474Z","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-15T21:41:04.081129Z","title":"Deep admm-net for compressive sensing mri","venue":null,"work_id":"976a459f-1891-43e1-a155-f8b908c7c9ed","year":2016},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.972838Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:3a80bfe8e987d726ea5b6f29f27fec612e58e3342898971cb8357ff0f97c6fb6","observation_id":"6a74c8b7-08a1-4cec-9d33-2c28a76197cb","resolution":{"observed_at":"2026-08-15T21:41:04.084781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:03.976285Z","title":"Regression shrinkage and selection via the lasso","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.976285Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:71410a5d0a8e907b699dcb6b7e9881f509b9268291608537c36b2f2cf48eb510","observation_id":"0c82a3c6-5871-48bf-8418-6cc731e13488","resolution":{"observed_at":"2026-08-15T21:41:03.976285Z","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-15T21:41:03.979622Z","title":"On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.979622Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:df18a11b08d40087df8c033cdefe868ce35bd73d597a8663229d999fe9ff4592","observation_id":"f8e647c8-75ad-4005-9b25-fdfdaec6187c","resolution":{"observed_at":"2026-08-15T21:41:03.979622Z","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-15T21:41:04.057221Z","title":"On inexact admms with relative error criteria","venue":null,"work_id":"2d489f50-5758-4f0a-a9d3-6b4f2e9dd3d7","year":2018},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.982993Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:e3c0d288fa709dab940aec2b5d284ce12ea951947f61fe56a1400af206f4d0f2","observation_id":"546a74d3-bceb-48ef-9d3a-3bebe0b44785","resolution":{"observed_at":"2026-08-15T21:41:04.061081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T21:41:04.043892Z","title":"A fast successive qp algorithm for general mean-variance portfolio optimization","venue":null,"work_id":"4024af7f-ef03-4ce7-9cb5-0e696f810d1e","year":2023},"citing_paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:03.986335Z"},"links":{"citing_paper":"/paper/2505.09391"},"observation_digest":"sha256:32f7a8a3c4405bf11a6b537ff2a4d1f052b9fa098a19c133c543a9b2772c9d5b","observation_id":"66720ce7-9180-437e-9811-7d9d19f3fece","resolution":{"observed_at":"2026-08-15T21:41:04.049355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.09391","last_updated":"2025-05-14T13:44:05Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-21T07:27:56.257222Z","submitted_at":"2025-05-14T13:44:05Z","title":"A Learning-Based Inexact ADMM for Solving Quadratic Programs"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":27},"total_outbound_references":43},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2505.09391."}