{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VKUARX3IF2TBHDMJKYIWKVIFF6","short_pith_number":"pith:VKUARX3I","schema_version":"1.0","canonical_sha256":"aaa808df682ea6138d8956116555052f9b2e249d6990f89d67d90ad51b2cb97a","source":{"kind":"arxiv","id":"2412.01051","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Akang Wang, Bingheng Li, Jianghua Wu, Jiliang Tang, Linxin Yang, Ruoyu Sun, Tian Ding, Xiaodong Luo, Yuyi Wang","submitted_at":"2024-12-02T02:22:44Z","abstract_excerpt":"Quadratic programs (QPs) arise in various domains such as machine learning, finance, and control. Recently, learning-enhanced primal-dual hybrid gradient (PDHG) methods have shown great potential in addressing large-scale linear programs; however, this approach has not been extended to QPs. In this work, we focus on unrolling \"PDQP\", a PDHG algorithm specialized for convex QPs. Specifically, we propose a neural network model called \"PDQP-net\" to learn optimal QP solutions. Theoretically, we demonstrate that a PDQP-net of polynomial size can align with the PDQP algorithm, returning optimal prim"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.01051","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-02T02:22:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"edc36745faa4a71170fdb135fe7bc22a451a9c17ce5b01a9ea85449c5b1ce9b2","abstract_canon_sha256":"a2e466fd6fb454350b3f15f246aecc117a24d5aa40962656306ec4011d841888"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:52.864916Z","signature_b64":"zct43I6mAdWNYp5tmXvJY0XZywUEJWhOOsQ1d7lulPGRFBsolgEk9ud/WtOtGLfHXOZ/0Ws57NDynfCejrD/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaa808df682ea6138d8956116555052f9b2e249d6990f89d67d90ad51b2cb97a","last_reissued_at":"2026-07-05T09:42:52.864417Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:52.864417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Akang Wang, Bingheng Li, Jianghua Wu, Jiliang Tang, Linxin Yang, Ruoyu Sun, Tian Ding, Xiaodong Luo, Yuyi Wang","submitted_at":"2024-12-02T02:22:44Z","abstract_excerpt":"Quadratic programs (QPs) arise in various domains such as machine learning, finance, and control. Recently, learning-enhanced primal-dual hybrid gradient (PDHG) methods have shown great potential in addressing large-scale linear programs; however, this approach has not been extended to QPs. In this work, we focus on unrolling \"PDQP\", a PDHG algorithm specialized for convex QPs. Specifically, we propose a neural network model called \"PDQP-net\" to learn optimal QP solutions. Theoretically, we demonstrate that a PDQP-net of polynomial size can align with the PDQP algorithm, returning optimal prim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.01051","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.01051/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.01051","created_at":"2026-07-05T09:42:52.864478+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.01051v1","created_at":"2026-07-05T09:42:52.864478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.01051","created_at":"2026-07-05T09:42:52.864478+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKUARX3IF2TB","created_at":"2026-07-05T09:42:52.864478+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKUARX3IF2TBHDMJ","created_at":"2026-07-05T09:42:52.864478+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKUARX3I","created_at":"2026-07-05T09:42:52.864478+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.11869","citing_title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","ref_index":1959,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VKUARX3IF2TBHDMJKYIWKVIFF6","json":"https://pith.science/pith/VKUARX3IF2TBHDMJKYIWKVIFF6.json","graph_json":"https://pith.science/api/pith-number/VKUARX3IF2TBHDMJKYIWKVIFF6/graph.json","events_json":"https://pith.science/api/pith-number/VKUARX3IF2TBHDMJKYIWKVIFF6/events.json","paper":"https://pith.science/paper/VKUARX3I"},"agent_actions":{"view_html":"https://pith.science/pith/VKUARX3IF2TBHDMJKYIWKVIFF6","download_json":"https://pith.science/pith/VKUARX3IF2TBHDMJKYIWKVIFF6.json","view_paper":"https://pith.science/paper/VKUARX3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.01051&json=true","fetch_graph":"https://pith.science/api/pith-number/VKUARX3IF2TBHDMJKYIWKVIFF6/graph.json","fetch_events":"https://pith.science/api/pith-number/VKUARX3IF2TBHDMJKYIWKVIFF6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKUARX3IF2TBHDMJKYIWKVIFF6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKUARX3IF2TBHDMJKYIWKVIFF6/action/storage_attestation","attest_author":"https://pith.science/pith/VKUARX3IF2TBHDMJKYIWKVIFF6/action/author_attestation","sign_citation":"https://pith.science/pith/VKUARX3IF2TBHDMJKYIWKVIFF6/action/citation_signature","submit_replication":"https://pith.science/pith/VKUARX3IF2TBHDMJKYIWKVIFF6/action/replication_record"}},"created_at":"2026-07-05T09:42:52.864478+00:00","updated_at":"2026-07-05T09:42:52.864478+00:00"}