{"as_of":"2026-08-19T05:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a7ba5788a93e480615bb8bbbbe5ab8a48f5618e4d20be99742627dc1e5d91185","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T19:50:48.981156Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2508.11869/citation-record","integrity":"/paper/2508.11869/integrity","json":"/paper/2508.11869/citation-record.json","paper":"/paper/2508.11869"},"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-05T19:50:49.317742Z","title":"fk is Lipschitz continuous with constantL =σmax(I +M), as∥∇fk(x)−∇fk(y)∥≤ L∥x−y∥","venue":null,"work_id":"3ac3dd0a-3b54-4249-bd50-494c9ed04f77","year":2025},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.971550Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:0b0ae88269e044df4294b45f876a5a73b88527baac47110a8aa0d61583621b57","observation_id":"cbe688c8-0657-4b36-9200-58541ab254c5","resolution":{"observed_at":"2026-08-05T19:50:49.321354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T19:50:49.327827Z","title":null,"venue":null,"work_id":"127bb932-35c3-4bc9-b6db-4fdaf1aeefc6","year":2004},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.968346Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:6d49b5e7a72249fc0aa34041fa4ad4c8b156162b4126b6e7a271011a6418a91e","observation_id":"0dd9e94b-7770-48e7-81f1-e81c020771f1","resolution":{"observed_at":"2026-08-05T19:50:49.331333Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T19:50:49.338671Z","title":null,"venue":null,"work_id":"f211bd0b-fabb-404f-9c35-85a8cd5497a2","year":2025},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.965579Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:6e0282c4e4ce35cf3fe8bd4e5fa0e7c79d9843e3265ed2c244498a4494223882","observation_id":"5c03ccef-850d-4974-b164-f3a47b217cf3","resolution":{"observed_at":"2026-08-05T19:50:49.342079Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T19:50:49.297206Z","title":"Inf. Time(s)","venue":null,"work_id":"6bed3611-7030-4cae-8848-fa54994f11e0","year":2025},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.978149Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:3790021b9306bd7414218f7e0b2d07d8a1bf610dea3dc20707cead7be3321a03","observation_id":"aa3aa50d-e54e-44be-9669-af44b8bb8c31","resolution":{"observed_at":"2026-08-05T19:50:49.300443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-05T19:50:48.947457Z","title":"Adam: A method for stochastic optimization.arXiv preprint arXiv:1412.6980,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.947457Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:cc27ccbc5ba96df11a3a1c0e104465a137365a0aa3af68cfaadb87147a96bb23","observation_id":"2736fe33-1ee0-4e13-89c0-cff9b75dd35d","resolution":{"observed_at":"2026-08-05T19:50:48.947457Z","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-05T19:50:48.962645Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.962645Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:083be959b5ab93c9fccf709af08e7b7f33cef1253f71b63b727851e531b15612","observation_id":"c1b1e006-3fb0-4e75-bab7-d874470adf92","resolution":{"observed_at":"2026-08-05T19:50:48.962645Z","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-05T19:50:49.285073Z","title":"Obj.”), feasibility satisfaction (“Max Viol","venue":null,"work_id":"aaec89ee-a2cd-4baf-9587-99eca8ce63f3","year":2025},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.981156Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:197031eaaf60a7520a900a00171d6a64dd43c58dbf00d103e8ccbb0c261fbb1c","observation_id":"9220cf42-12df-4b7e-8c29-d9354e53b75a","resolution":{"observed_at":"2026-08-05T19:50:49.289702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T19:50:49.307479Z","title":"Therefore, ∀k > K,∃0 < c <1, such that∥wk+1−wk∥≤ c∥wk−wk−1∥ and thus∑ k=K∥wk+1−wk∥ < +∞","venue":null,"work_id":"1244566e-1b84-4b06-bffc-31e093162679","year":2025},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.974918Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:2a4a055c258e0faea565bad10c54a3036a0513c4c5bb2a9c6ef540db9074efb5","observation_id":"88b40bd7-87b5-43ec-a3df-8ced6b3359f5","resolution":{"observed_at":"2026-08-05T19:50:49.310731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T19:50:49.379124Z","title":"On the douglas—rachford splitting method and the proximal point algorithm for maximal monotone operators.Mathematical Programming, 55:293–318,","venue":null,"work_id":"11544472-5974-499c-b8a2-a2839cfe51f7","year":2025},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":1956,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.937630Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:8c0d7f6e1487fea74fe4dbae23c948b3300a4b275c37688008cf79bd689db58f","observation_id":"2503669f-59ca-422a-a25a-f8a43725cb32","resolution":{"observed_at":"2026-08-05T19:50:49.382203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-17T03:09:44.346907Z","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-15T08:46:52.420876Z","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:fcc57abbd880da8e3801c5b95256f8c8de1e5de0a572d36c60f4b6998e5768b7","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T19:50:49.369100Z","title":"The machine learning for combinatorial optimization competition (ml4co): Results and insights","venue":null,"work_id":"c4c95113-ee62-40d0-8451-75860c1f4bfe","year":2021},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.941088Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:ee0549a1ec1c1bb799b9228386cbcbc9386aa3d666db04580e16242551b70c73","observation_id":"dacdbeba-d6b8-49c0-be67-7381cc72480a","resolution":{"observed_at":"2026-08-05T19:50:49.372527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T19:50:49.358839Z","title":"Operator splitting for a homogeneous embedding of the linear complementarity problem","venue":null,"work_id":"66ef971c-f21a-4c15-8ca2-ec2bb9c222fe","year":2025},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.953189Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:c178b27597b1c59f8edeaff32f864998e99becc6eec1d25597c90e37f20af322","observation_id":"7c3cdaca-986c-4727-8aef-a72a0d2e4988","resolution":{"observed_at":"2026-08-05T19:50:49.362683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T19:50:49.388483Z","title":"Warm-starting ac optimal power flow with graph neural networks","venue":null,"work_id":"786c48e7-ef5a-4e3b-b2b8-c58987cea503","year":2019},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.934573Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:c2f75033518898817080e8257c8220c171ff5ba195f65fcccc8f8ad008ede76b","observation_id":"604695da-3339-4d09-a299-0b11c37c0e0e","resolution":{"observed_at":"2026-08-05T19:50:49.391544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T19:50:49.398107Z","title":"Learning warm-start points for ac optimal power flow","venue":null,"work_id":"e7c13065-f97b-4851-9614-018c01169090","year":2019},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.927826Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:b142e84d65fda5a42fdf815dd6a5da36fe065d94b03e714e0facef4cd8f6e767","observation_id":"980018a0-b245-44c4-b6fa-b19188697a03","resolution":{"observed_at":"2026-08-05T19:50:49.401140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12443","last_updated":"2022-11-22T17:52:36Z","snapshot_observed_at":"2026-08-16T16:14:06.577509Z","submitted_at":"2022-11-22T17:52:36Z","title":"Learning context-aware adaptive solvers to accelerate quadratic programming","version":1},"cited_work":{"arxiv_id":"2211.12443","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.12443","snapshot_observed_at":"2026-08-05T19:50:49.213024Z","title":"Learning context-aware adaptive solvers to accelerate quadratic programming","venue":"math.OC","work_id":"8ebec03b-a346-43e7-8273-04bb206b54ba","year":2022},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.944194Z"},"links":{"cited_paper":"/paper/2211.12443","citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:3f65187d6a04d08dbe1b31842cfad2cd42f1b02defc3c9f05da0aa033d6075ae","observation_id":"0da91e6f-753c-4900-8a4a-2a6a7a2a6531","resolution":{"observed_at":"2026-08-05T19:50:49.216779Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T19:50:48.931439Z","title":"Expressive power of graph neural networks for (mixed-integer) quadratic programs.arXiv preprint arXiv:2406.05938,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.931439Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:21abe39f105b239620099ccc7869356776f704980ac929451a9ae264a44768ef","observation_id":"1895e0f9-6b8f-456d-9501-9146f9803ea4","resolution":{"observed_at":"2026-08-05T19:50:48.931439Z","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-05T19:50:49.349283Z","title":"Learning to solve the ac optimal power flow via a lagrangian approach","venue":null,"work_id":"775d9da6-48ab-44d8-9c17-cd64f853c801","year":2022},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.959601Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:516724ab0c0640951d3581ec2522e0338540399f9096f6299b6b29f4cb09fc59","observation_id":"e45f70cd-be71-436c-8405-a359f327ff49","resolution":{"observed_at":"2026-08-05T19:50:49.352513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T19:50:48.950293Z","title":"Mpax: Mathematical programming in jax","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-05T19:50:48.950293Z"},"links":{"citing_paper":"/paper/2508.11869"},"observation_digest":"sha256:98efb16669dee76f0aec6ed7e883e385615c6641823eba3fd60383e440b14f4c","observation_id":"bb6b6ed2-1056-4b6c-be53-123a8c8439ef","resolution":{"observed_at":"2026-08-05T19:50:48.950293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.11869","last_updated":"2025-08-16T01:53:15Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T08:46:52.420876Z","submitted_at":"2025-08-16T01:53:15Z","title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":2,"verified_fuzzy":10},"total_outbound_references":18},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2508.11869."}