{"as_of":"2026-08-20T16:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f8dd25823184ab4c27adc36d619a2757fbdcc139dddb768e21e1b96314bccd3c","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T04:52:22.214376Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T19:50:48.956327Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T19:50:49.100766Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"cited_work":{"arxiv_id":"2412.01051","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.01051","snapshot_observed_at":"2026-08-05T19:50:49.100766Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","venue":"math.OC","work_id":"daf62c28-d068-4373-92e7-0d6b76bfc6e1","year":2024},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-19T18:19:48.645805Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":1959,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.956327Z"},"links":{"cited_paper":"/paper/2412.01051","citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:841c64c75844cbc8afc3a8acfb6258d351fc58c51d6f168c2a9ee042e9e9af42","observation_id":"353af111-18e1-487c-bd8c-b2af740c7444","resolution":{"observed_at":"2026-08-05T19:50:49.106817Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.01051","snapshot_observed_at":"2026-07-13T16:24:28.182375Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.28345","last_updated":"2026-07-06T13:50:25Z","snapshot_observed_at":"2026-08-15T08:46:51.836299Z","submitted_at":"2026-03-30T12:14:24Z","title":"Reachability Across the NL/PL Boundary: A Taxonomy-Driven Dataflow Model for LLM-Integrated Applications","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-13T16:24:28.182375Z"},"links":{"cited_paper":"/paper/2412.01051","citing_paper":"/paper/2603.28345"},"observation_digest":"sha256:6a826340c4460e2c37a1aaac72f3262caf4ca63eed99a1c3a9ccf79940b744f9","observation_id":"ca8a5235-f0d6-4387-8d17-56772ae3b2d6","resolution":{"observed_at":"2026-07-13T16:24:28.182375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.01051/citation-record","integrity":"/paper/2412.01051/integrity","json":"/paper/2412.01051/citation-record.json","paper":"/paper/2412.01051"},"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-12T04:52:22.732730Z","title":"On implementing a primal-dual interior-point method for conic quadratic optimization","venue":null,"work_id":"dfee32ca-ce34-449f-b837-a887c86491e3","year":2003},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.066960Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:c054162e1f35af42c92209881bb0b1d03fd9fcd0d922221a4fc1f759ff912cdf","observation_id":"82aa8e3a-dffd-4bc7-83ee-cf53cf8a9f3f","resolution":{"observed_at":"2026-08-12T04:52:22.737784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T04:52:22.072541Z","title":"Machine learning for combinatorial optimization: a methodological tour d’horizon","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.072541Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:4baa772db2f43d6993d5380fde2f414aa5ada54a4f2b2b9319c6e0057ae5cb48","observation_id":"c92d7e49-ecf5-4320-9dd0-4a8533578ce9","resolution":{"observed_at":"2026-08-12T04:52:22.072541Z","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-12T04:52:22.707424Z","title":"Multi-period trading via convex optimization","venue":null,"work_id":"461369f2-05c3-4bf1-ae21-f481a2bcd004","year":2017},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.077564Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:e21a90fd904cdfdc9e99732993b524c5bb3939f48a188d3d4a2cdef2296c04ac","observation_id":"4f618af7-e122-44b2-bb6e-4c83a2fbd4d1","resolution":{"observed_at":"2026-08-12T04:52:22.712554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T04:52:22.691231Z","title":"Enhancing sparsity by reweighted l_1 minimization","venue":null,"work_id":"59af12ef-fd41-437c-ba04-fcf2387de9dd","year":2008},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.083833Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:e1d64c37311abc614785b7a6b8f0d70ac84decd5f8b4ea7cc6b67b961b561faa","observation_id":"e78f0525-46c0-42cf-b2dc-96511bb75674","resolution":{"observed_at":"2026-08-12T04:52:22.696427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T04:52:22.675462Z","title":"Learning to optimize: A tutorial for continuous and mixed-integer optimization","venue":null,"work_id":"65ba0963-d8e5-4822-9928-651e36c87931","year":2024},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.089433Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:bf98f3ecf60b0337b0c0b74514ae8595543b8d9d32c4e3b48492c5c5f7da4aa7","observation_id":"b1bf32c5-8491-4eb9-a2ea-0c1d4db31a2f","resolution":{"observed_at":"2026-08-12T04:52:22.680614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.12288","last_updated":"2023-05-25T20:00:12Z","snapshot_observed_at":"2026-08-19T18:19:49.229217Z","submitted_at":"2022-09-25T18:27:33Z","title":"On Representing Linear Programs by Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.12288","snapshot_observed_at":"2026-08-12T04:52:22.094467Z","title":"On representing linear programs by graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.094467Z"},"links":{"cited_paper":"/paper/2209.12288","citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:0d3ec28f50723946e14db6a75c4111cc9d7ff31fc5222a00f8de7c2173d8f8c7","observation_id":"479d97be-f505-442e-b098-bfe9ca77d1d3","resolution":{"observed_at":"2026-08-12T04:52:22.094467Z","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-12T04:52:22.100011Z","title":"Expressive power of graph neural networks for (mixed-integer) quadratic programs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.100011Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:e3f63b69a8275b2abe299ea387f714187e052bb0e95214c414274f611daf052c","observation_id":"63d12a44-0b1b-4dfc-ac04-379474e30ff3","resolution":{"observed_at":"2026-08-12T04:52:22.100011Z","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-12T04:52:22.105073Z","title":"Support-vector networks","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.105073Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:1f187af090e6d05931a11dfb7b0a05a4fa1a7dd4a1818b1a201c3a54ffeb3480","observation_id":"52c00163-b373-4cdc-94f3-1dad0f1dfdba","resolution":{"observed_at":"2026-08-12T04:52:22.105073Z","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-12T04:52:22.650409Z","title":"Linear programming and extensions","venue":null,"work_id":"5a1ab34a-6f56-466b-9c29-ad49dfa95364","year":2016},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.109793Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:66639dbe92b78218bc55fe6cc27ae4db29ae19f8157cb6759fe7bc24f8119043","observation_id":"2884d99c-5c5d-4b37-89a7-889d895b7173","resolution":{"observed_at":"2026-08-12T04:52:22.655136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T04:52:22.114755Z","title":"QPLIB : A library of quadratic programming instances","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.114755Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:9c8160383d1c515b13de4f1d4141f5b2b4e7b1af3715dff46c9d642d12bf68ed","observation_id":"f5b9e9ff-c3be-4322-b326-f85185d9daf7","resolution":{"observed_at":"2026-08-12T04:52:22.114755Z","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-12T04:52:22.119626Z","title":"Model predictive control: Theory and practice—a survey","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.119626Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:740e4c4ab3d657623a670f603a9a080c30cc9c2d283ff9e12f13ea9785054541","observation_id":"be6a2742-f4b9-444a-9517-7557a91c0b03","resolution":{"observed_at":"2026-08-12T04:52:22.119626Z","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-12T04:52:22.124003Z","title":"The machine learning for combinatorial optimization competition (ml4co): Results and insights","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.124003Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:efd70527b400381bf88fea7e628c9b5cba2eed9c7abe26e8c7f18cb7a39da948","observation_id":"f59f5692-2841-4a55-ac66-485a8e640ceb","resolution":{"observed_at":"2026-08-12T04:52:22.124003Z","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-12T04:52:22.613340Z","title":"Pdhg-unrolled learning-to-optimize method for large-scale linear programming","venue":null,"work_id":"103c82eb-ce55-45a3-b9b6-867f05a00088","year":2024},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.130213Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:ef7aeb1d64e7c6a0ea1630ae6cc28adbe7a026e4d834db92c06c7482250bff72","observation_id":"e9fae49c-c746-4e11-8518-905a01210bdf","resolution":{"observed_at":"2026-08-12T04:52:22.618256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T04:52:22.597478Z","title":"Efficient and interpretable deep blind image deblurring via algorithm unrolling","venue":null,"work_id":"08cf3532-1dbc-4b98-aa45-e9da6e4d6931","year":2020},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.135124Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:c354a53d0dbdb506b5ca0e15bc64b01b7347179d06eb66f4f85dc7e9a3027269","observation_id":"fffee2b8-0512-4310-8bb4-f1a99ed5fb6a","resolution":{"observed_at":"2026-08-12T04:52:22.602589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T04:52:22.581378Z","title":"Knowledge-driven deep unrolling for robust image layer separation","venue":null,"work_id":"106b5ba3-1824-446e-9f78-82f5c11a9822","year":2019},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.139359Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:86b94b1f88f1e5f290f60f22727a49d9bea37c2fe4e59632883dfbff60b00f7b","observation_id":"38188c4b-e1d4-4aeb-8f6f-08d6a5ad5038","resolution":{"observed_at":"2026-08-12T04:52:22.586610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T04:52:22.148703Z","title":"A practical and optimal first-order method for large-scale convex quadratic programming, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.148703Z"},"links":{"cited_paper":"/paper/2311.07710","citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:eb7b354c01eebf478b10385df921192d10a3f6ad4649c3bad643f08a5cb3a90b","observation_id":"370ed34d-1faa-4318-bccb-99f6d243a784","resolution":{"observed_at":"2026-08-12T04:52:22.148703Z","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-12T04:52:22.153342Z","title":"Portfolio selection","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.153342Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:8be5d9b6a1fc06e6203554537664b4855c16e660fe7adea36b8d6a7c83b7bb54","observation_id":"4e190e6c-5232-40da-bf43-07ea40b27f47","resolution":{"observed_at":"2026-08-12T04:52:22.153342Z","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-12T04:52:22.566063Z","title":"A repository of convex quadratic programming problems","venue":null,"work_id":"aa27767d-5635-4753-abd4-46972a7e2147","year":1999},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.158077Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:255b52b35f65ebcb89d209830ffcd0be49efb9a65bb08a97c81cfbaebf848fd2","observation_id":"12e5b75c-5660-41fd-a389-bf789677a171","resolution":{"observed_at":"2026-08-12T04:52:22.570796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-12T04:52:22.163127Z","title":"Solving mixed integer programs using neural networks","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.163127Z"},"links":{"cited_paper":"/paper/2012.13349","citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:c0584dccbd1c2db46e5fd7376eb6ae22f2272e32764cd63e1ef19aee0f947345","observation_id":"c630a47b-0688-4b2b-9ae1-f183065f8f0f","resolution":{"observed_at":"2026-08-12T04:52:22.163127Z","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-12T04:52:22.550028Z","title":"Operator splitting for a homogeneous embedding of the linear complementarity problem","venue":null,"work_id":"5d97a9a9-f2c9-4b09-a19b-77abe6569d34","year":1999},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.169254Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:85db4ac375c9a07c7966fc78f6d1128d142ebd1e26aecace74a7475cef7f0b64","observation_id":"ff1f4032-09c2-4df0-90e2-9e455db8ddc5","resolution":{"observed_at":"2026-08-12T04:52:22.555578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T04:52:22.174780Z","title":"Pytorch: An imperative style, high-performance deep learning library","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.174780Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:8a499047028f9c96d2522a22a0f22b6824012cc3a41d394610d678da7e25a245","observation_id":"295ccb89-6866-4009-8021-07718abeb5fb","resolution":{"observed_at":"2026-08-12T04:52:22.174780Z","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-12T04:52:22.179631Z","title":"Osqp: An operator splitting solver for quadratic programs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.179631Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:8189deb5a551f5da67f4260e833a68aac6b6cb4e778c9b82b9b03420628a3a09","observation_id":"465ce3b6-28f9-40d6-9fe5-46a4bc238ae7","resolution":{"observed_at":"2026-08-12T04:52:22.179631Z","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-12T04:52:22.184271Z","title":"Primal-dual interior-point methods","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.184271Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:4e9fd87d050e85d475038445d82bb9f2bc8f3cf39c37ca3fa2bdb4d819b268c9","observation_id":"8c49178b-97d5-4a9f-a318-bb2be8f30e88","resolution":{"observed_at":"2026-08-12T04:52:22.184271Z","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-12T04:52:22.503492Z","title":"Fista-net: Learning a fast iterative shrinkage thresholding network for inverse problems in imaging","venue":null,"work_id":"6734c1a8-4ac5-48d8-8d87-90ae82c6ff49","year":2021},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.189090Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:dd95cfc5ff2e7d275593fe6c5d939705b2170ff91519a56806f37a7bf8449a6a","observation_id":"92fe6a51-800f-47f4-b823-e3386ce37553","resolution":{"observed_at":"2026-08-12T04:52:22.508605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T04:52:22.487037Z","title":"Ista-net: Interpretable optimization-inspired deep network for image compressive sensing","venue":null,"work_id":"9a9e25c0-99e8-4a98-80be-c94e63378195","year":2018},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.193878Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:bd1aafe306be9cd66bc4c581a8da2b355e8872ddc5a1e862311613863af3e616","observation_id":"e838b9c5-7e51-4381-9d0d-46d28b63931f","resolution":{"observed_at":"2026-08-12T04:52:22.492870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T04:52:22.198706Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.198706Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:c5c7fd39d427aeeb2bafbfebb0807ba059759ac8e28eaf1231110fe3f8909f0a","observation_id":"0a2d0f38-7dc6-4884-a138-1c2e0ba0c126","resolution":{"observed_at":"2026-08-12T04:52:22.198706Z","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-12T04:52:22.204522Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.204522Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:bb67e8d892ff2c7a17e4102e6141b4ae96e9c4621c62a7466bf8c9a90ad40d8a","observation_id":"503c57f1-47eb-485b-b79b-11837564d854","resolution":{"observed_at":"2026-08-12T04:52:22.204522Z","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-12T04:52:22.209654Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.209654Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:1e4c1f1b33b882eed94759500f739c4afcda51b61db13522f83936107fd1397c","observation_id":"82d4461f-baf6-4084-8ab3-7fc651e1438d","resolution":{"observed_at":"2026-08-12T04:52:22.209654Z","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-12T04:52:22.441424Z","title":null,"venue":null,"work_id":"dd476442-47f1-4f9c-91a6-ced0f4fe135a","year":null},"citing_paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T04:52:22.214376Z"},"links":{"citing_paper":"/paper/2412.01051"},"observation_digest":"sha256:7e1f6331eb5ca5ca55b1ae64bd3e34e726e21d0e8afa8e49f8c92aa67f29db35","observation_id":"a875d2b3-ec30-401a-8483-d18ada49be63","resolution":{"observed_at":"2026-08-12T04:52:22.447081Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.01051","last_updated":"2024-12-02T02:22:44Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-19T18:19:33.197703Z","submitted_at":"2024-12-02T02:22:44Z","title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":29},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 2 inbound Pith citation observations for arXiv:2412.01051."}