{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OIN5OF2KIQAUZBN6ZNUNHBGLUW","short_pith_number":"pith:OIN5OF2K","schema_version":"1.0","canonical_sha256":"721bd7174a44014c85becb68d384cba59c2093c73afced1194f90c1febabb264","source":{"kind":"arxiv","id":"2508.11869","version":1},"attestation_state":"computed","paper":{"title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akang Wang, Jiang Xue, Jinxin Xiong, Linxin Yang, Xiaodong Luo, Xi Gao","submitted_at":"2025-08-16T01:53:15Z","abstract_excerpt":"Convex quadratic programs (QPs) are fundamental to numerous applications, including finance, engineering, and energy systems. Among the various methods for solving them, the Douglas-Rachford (DR) splitting algorithm is notable for its robust convergence properties. Concurrently, the emerging field of Learning-to-Optimize offers promising avenues for enhancing algorithmic performance, with algorithm unrolling receiving considerable attention due to its computational efficiency and interpretability. In this work, we propose an approach that unrolls a modified DR splitting algorithm to efficientl"},"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":"2508.11869","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-16T01:53:15Z","cross_cats_sorted":[],"title_canon_sha256":"790d0b51ae79bcca19a637d08f70914dc3e5fa9842986c53c265dd4f8a7a72c1","abstract_canon_sha256":"ae56de6f3c3d929d1ee86767a41fd4b1bf0df0d55b0c9312e8161909289779f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:55.950206Z","signature_b64":"ZMfVz4ddWP/L5xWOlzIwAbwKlkkROVAlQqcDkD5m65fr8CBq0GTebRBpgAaO93mkAZrmokgQRIieVqCNDG94Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"721bd7174a44014c85becb68d384cba59c2093c73afced1194f90c1febabb264","last_reissued_at":"2026-07-05T11:54:55.949751Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:55.949751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akang Wang, Jiang Xue, Jinxin Xiong, Linxin Yang, Xiaodong Luo, Xi Gao","submitted_at":"2025-08-16T01:53:15Z","abstract_excerpt":"Convex quadratic programs (QPs) are fundamental to numerous applications, including finance, engineering, and energy systems. Among the various methods for solving them, the Douglas-Rachford (DR) splitting algorithm is notable for its robust convergence properties. Concurrently, the emerging field of Learning-to-Optimize offers promising avenues for enhancing algorithmic performance, with algorithm unrolling receiving considerable attention due to its computational efficiency and interpretability. In this work, we propose an approach that unrolls a modified DR splitting algorithm to efficientl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.11869","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/2508.11869/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":"2508.11869","created_at":"2026-07-05T11:54:55.949813+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.11869v1","created_at":"2026-07-05T11:54:55.949813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.11869","created_at":"2026-07-05T11:54:55.949813+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIN5OF2KIQAU","created_at":"2026-07-05T11:54:55.949813+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIN5OF2KIQAUZBN6","created_at":"2026-07-05T11:54:55.949813+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIN5OF2K","created_at":"2026-07-05T11:54:55.949813+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OIN5OF2KIQAUZBN6ZNUNHBGLUW","json":"https://pith.science/pith/OIN5OF2KIQAUZBN6ZNUNHBGLUW.json","graph_json":"https://pith.science/api/pith-number/OIN5OF2KIQAUZBN6ZNUNHBGLUW/graph.json","events_json":"https://pith.science/api/pith-number/OIN5OF2KIQAUZBN6ZNUNHBGLUW/events.json","paper":"https://pith.science/paper/OIN5OF2K"},"agent_actions":{"view_html":"https://pith.science/pith/OIN5OF2KIQAUZBN6ZNUNHBGLUW","download_json":"https://pith.science/pith/OIN5OF2KIQAUZBN6ZNUNHBGLUW.json","view_paper":"https://pith.science/paper/OIN5OF2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.11869&json=true","fetch_graph":"https://pith.science/api/pith-number/OIN5OF2KIQAUZBN6ZNUNHBGLUW/graph.json","fetch_events":"https://pith.science/api/pith-number/OIN5OF2KIQAUZBN6ZNUNHBGLUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIN5OF2KIQAUZBN6ZNUNHBGLUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIN5OF2KIQAUZBN6ZNUNHBGLUW/action/storage_attestation","attest_author":"https://pith.science/pith/OIN5OF2KIQAUZBN6ZNUNHBGLUW/action/author_attestation","sign_citation":"https://pith.science/pith/OIN5OF2KIQAUZBN6ZNUNHBGLUW/action/citation_signature","submit_replication":"https://pith.science/pith/OIN5OF2KIQAUZBN6ZNUNHBGLUW/action/replication_record"}},"created_at":"2026-07-05T11:54:55.949813+00:00","updated_at":"2026-07-05T11:54:55.949813+00:00"}