{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HNNLPH66UOGG7IZMMQG7FUYISD","short_pith_number":"pith:HNNLPH66","canonical_record":{"source":{"id":"1504.05708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-22T09:42:02Z","cross_cats_sorted":[],"title_canon_sha256":"a1dde7d46ac36ace8a3d99e3498774c69da95ed6cbe73d49772f5c268d6df462","abstract_canon_sha256":"af0184662ca810ed33d1d740e9259bf6d611a26e2921098f7d3e77dcd5a787e2"},"schema_version":"1.0"},"canonical_sha256":"3b5ab79fdea38c6fa32c640df2d30890d054bf6e4939af2afb1a8dc0a7eac6eb","source":{"kind":"arxiv","id":"1504.05708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05708","created_at":"2026-05-18T02:18:12Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05708v1","created_at":"2026-05-18T02:18:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05708","created_at":"2026-05-18T02:18:12Z"},{"alias_kind":"pith_short_12","alias_value":"HNNLPH66UOGG","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HNNLPH66UOGG7IZM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HNNLPH66","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HNNLPH66UOGG7IZMMQG7FUYISD","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-22T09:42:02Z","cross_cats_sorted":[],"title_canon_sha256":"a1dde7d46ac36ace8a3d99e3498774c69da95ed6cbe73d49772f5c268d6df462","abstract_canon_sha256":"af0184662ca810ed33d1d740e9259bf6d611a26e2921098f7d3e77dcd5a787e2"},"schema_version":"1.0"},"canonical_sha256":"3b5ab79fdea38c6fa32c640df2d30890d054bf6e4939af2afb1a8dc0a7eac6eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:12.899843Z","signature_b64":"bsgoP+bYrTsHUV33Jx5YjUQm3r6ejT3i8L7hRhX+juRJ/tunjobH+5NoUnJxm3AjYESFtn1mFMtV1rx449w5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b5ab79fdea38c6fa32c640df2d30890d054bf6e4939af2afb1a8dc0a7eac6eb","last_reissued_at":"2026-05-18T02:18:12.899220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:12.899220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05708","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:18:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3a1ePIRdvo1SEJkE9lN69KAP59+keSVf0VHgk4Bv4fo33midDHXsgVTtFHORxmoHIgX0wTNRBhb1Rrn5F9BmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:49:17.863884Z"},"content_sha256":"64e014205ea5e1ef3059353e7af2bcbb57ba4d6126944c251a295012cff43276","schema_version":"1.0","event_id":"sha256:64e014205ea5e1ef3059353e7af2bcbb57ba4d6126944c251a295012cff43276"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HNNLPH66UOGG7IZMMQG7FUYISD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DuQuad: an inexact (augmented) dual first order algorithm for quadratic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrei Patrascu, Ion Necoara","submitted_at":"2015-04-22T09:42:02Z","abstract_excerpt":"In this paper we present the solver DuQuad specialized for solving general convex quadratic problems arising in many engineering applications. When it is difficult to project on the primal feasible set, we use the (augmented) Lagrangian relaxation to handle the complicated constraints and then, we apply dual first order algorithms based on inexact dual gradient information for solving the corresponding dual problem. The iteration complexity analysis is based on two types of approximate primal solutions: the primal last iterate and an average of primal iterates. We provide computational complex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05708","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:18:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yzW7m9JYD33VMZsWPcuF/1pL89DztpLMUxtLX1s868R5OcWQc06hFe585dAQuQ7PqNP5XGUnWWSD+reEw3q2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:49:17.864516Z"},"content_sha256":"0af671518b9b20a38bd3365f8e2e1dbc08f12d1842c5d79068b8cf631a97454a","schema_version":"1.0","event_id":"sha256:0af671518b9b20a38bd3365f8e2e1dbc08f12d1842c5d79068b8cf631a97454a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNNLPH66UOGG7IZMMQG7FUYISD/bundle.json","state_url":"https://pith.science/pith/HNNLPH66UOGG7IZMMQG7FUYISD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNNLPH66UOGG7IZMMQG7FUYISD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T08:49:17Z","links":{"resolver":"https://pith.science/pith/HNNLPH66UOGG7IZMMQG7FUYISD","bundle":"https://pith.science/pith/HNNLPH66UOGG7IZMMQG7FUYISD/bundle.json","state":"https://pith.science/pith/HNNLPH66UOGG7IZMMQG7FUYISD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNNLPH66UOGG7IZMMQG7FUYISD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HNNLPH66UOGG7IZMMQG7FUYISD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"af0184662ca810ed33d1d740e9259bf6d611a26e2921098f7d3e77dcd5a787e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-22T09:42:02Z","title_canon_sha256":"a1dde7d46ac36ace8a3d99e3498774c69da95ed6cbe73d49772f5c268d6df462"},"schema_version":"1.0","source":{"id":"1504.05708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05708","created_at":"2026-05-18T02:18:12Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05708v1","created_at":"2026-05-18T02:18:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05708","created_at":"2026-05-18T02:18:12Z"},{"alias_kind":"pith_short_12","alias_value":"HNNLPH66UOGG","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HNNLPH66UOGG7IZM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HNNLPH66","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:0af671518b9b20a38bd3365f8e2e1dbc08f12d1842c5d79068b8cf631a97454a","target":"graph","created_at":"2026-05-18T02:18:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we present the solver DuQuad specialized for solving general convex quadratic problems arising in many engineering applications. When it is difficult to project on the primal feasible set, we use the (augmented) Lagrangian relaxation to handle the complicated constraints and then, we apply dual first order algorithms based on inexact dual gradient information for solving the corresponding dual problem. The iteration complexity analysis is based on two types of approximate primal solutions: the primal last iterate and an average of primal iterates. We provide computational complex","authors_text":"Andrei Patrascu, Ion Necoara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-22T09:42:02Z","title":"DuQuad: an inexact (augmented) dual first order algorithm for quadratic programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05708","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:64e014205ea5e1ef3059353e7af2bcbb57ba4d6126944c251a295012cff43276","target":"record","created_at":"2026-05-18T02:18:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"af0184662ca810ed33d1d740e9259bf6d611a26e2921098f7d3e77dcd5a787e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-22T09:42:02Z","title_canon_sha256":"a1dde7d46ac36ace8a3d99e3498774c69da95ed6cbe73d49772f5c268d6df462"},"schema_version":"1.0","source":{"id":"1504.05708","kind":"arxiv","version":1}},"canonical_sha256":"3b5ab79fdea38c6fa32c640df2d30890d054bf6e4939af2afb1a8dc0a7eac6eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b5ab79fdea38c6fa32c640df2d30890d054bf6e4939af2afb1a8dc0a7eac6eb","first_computed_at":"2026-05-18T02:18:12.899220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:12.899220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bsgoP+bYrTsHUV33Jx5YjUQm3r6ejT3i8L7hRhX+juRJ/tunjobH+5NoUnJxm3AjYESFtn1mFMtV1rx449w5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:12.899843Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64e014205ea5e1ef3059353e7af2bcbb57ba4d6126944c251a295012cff43276","sha256:0af671518b9b20a38bd3365f8e2e1dbc08f12d1842c5d79068b8cf631a97454a"],"state_sha256":"fb3a00688cb2beb863f524dc3b1842371564dd319bfab20abb088e6af6acec4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aSlMlgLZbckz41RlRHs9E4ZhvfBHF5tkLXe7dnXylgkOEoHKnuU7AotkHkJ9EaOG6NRSnTQRWp7Y4wbxCFDuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:49:17.868024Z","bundle_sha256":"d86be5b2a2532f67075a8afcb78faeddfca5cb3bbf99a4055b8038b2aa1c3122"}}