{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UP5NKZWFOMKTGTQYK6FYW5MKA2","short_pith_number":"pith:UP5NKZWF","canonical_record":{"source":{"id":"1503.02753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-10T02:17:57Z","cross_cats_sorted":[],"title_canon_sha256":"1e2c8d5098256a673cac80a074347636320de8dfeff64efb4ec408aa9f47eea2","abstract_canon_sha256":"49eb807645a3110edf3cdcc0e11d8e7209d814072008f1abbe158da152f5e2c1"},"schema_version":"1.0"},"canonical_sha256":"a3fad566c57315334e18578b8b758a06b824ec370b242f4aaec2f4d0463bd3e6","source":{"kind":"arxiv","id":"1503.02753","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02753","created_at":"2026-05-18T02:25:13Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02753v1","created_at":"2026-05-18T02:25:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02753","created_at":"2026-05-18T02:25:13Z"},{"alias_kind":"pith_short_12","alias_value":"UP5NKZWFOMKT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UP5NKZWFOMKTGTQY","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UP5NKZWF","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UP5NKZWFOMKTGTQYK6FYW5MKA2","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-10T02:17:57Z","cross_cats_sorted":[],"title_canon_sha256":"1e2c8d5098256a673cac80a074347636320de8dfeff64efb4ec408aa9f47eea2","abstract_canon_sha256":"49eb807645a3110edf3cdcc0e11d8e7209d814072008f1abbe158da152f5e2c1"},"schema_version":"1.0"},"canonical_sha256":"a3fad566c57315334e18578b8b758a06b824ec370b242f4aaec2f4d0463bd3e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:13.198425Z","signature_b64":"mlfHHkh41uloJ7s3B6682EX0pk60cu0Ywg3VN3kBIT4angvtjygPkBhATxQnFceeaTnrURZq/Kqjtz82mnThAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3fad566c57315334e18578b8b758a06b824ec370b242f4aaec2f4d0463bd3e6","last_reissued_at":"2026-05-18T02:25:13.197971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:13.197971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02753","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:25:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+kDyFG5REAhSRcrTZqvpXz+bru/BNUSKzpKPZ3cGIPJBficyRM+T4ztQmMnjD2d8/WohB648LiBLmfn8f0aDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:16:05.035427Z"},"content_sha256":"d8ba875b6d931e3f571ac9b83488b36ef56c478bbb1b7b39ded0e1a4f6a89305","schema_version":"1.0","event_id":"sha256:d8ba875b6d931e3f571ac9b83488b36ef56c478bbb1b7b39ded0e1a4f6a89305"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UP5NKZWFOMKTGTQYK6FYW5MKA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A semi-smooth Newton method for solving convex quadratic programming problem under simplicial cone constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"J. G. Barrios, O. P. Ferreira, S. Z. N\\'emeth","submitted_at":"2015-03-10T02:17:57Z","abstract_excerpt":"In this paper the simplicial cone constrained convex quadratic programming problem is studied. The optimality conditions of this problem consist in a linear complementarity problem. This fact, under a suitable condition, leads to an equivalence between the simplicial cone constrained convex quadratic programming problem and the one of finding the unique solution of a nonsmooth system of equations. It is shown that a semi-smooth Newton method applied to this nonsmooth system of equations is always well defined and under a mild assumption on the simplicial cone the method generates a sequence th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02753","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:25:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AeGRnguSVtG318uy5iCfhHb7YAk9XiUWY/agcfGjKwWV5A3nEd/vXcmlKEjl3gb1zC/hQ6rRuJD9OzLwlGEjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:16:05.035799Z"},"content_sha256":"53cd5bbf54e4b70e6748cf0e4df353fa09ee8cf4e80b1cdb3cc8bf8a307b820e","schema_version":"1.0","event_id":"sha256:53cd5bbf54e4b70e6748cf0e4df353fa09ee8cf4e80b1cdb3cc8bf8a307b820e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2/bundle.json","state_url":"https://pith.science/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2/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-31T02:16:05Z","links":{"resolver":"https://pith.science/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2","bundle":"https://pith.science/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2/bundle.json","state":"https://pith.science/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UP5NKZWFOMKTGTQYK6FYW5MKA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UP5NKZWFOMKTGTQYK6FYW5MKA2","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":"49eb807645a3110edf3cdcc0e11d8e7209d814072008f1abbe158da152f5e2c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-10T02:17:57Z","title_canon_sha256":"1e2c8d5098256a673cac80a074347636320de8dfeff64efb4ec408aa9f47eea2"},"schema_version":"1.0","source":{"id":"1503.02753","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02753","created_at":"2026-05-18T02:25:13Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02753v1","created_at":"2026-05-18T02:25:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02753","created_at":"2026-05-18T02:25:13Z"},{"alias_kind":"pith_short_12","alias_value":"UP5NKZWFOMKT","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UP5NKZWFOMKTGTQY","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UP5NKZWF","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:53cd5bbf54e4b70e6748cf0e4df353fa09ee8cf4e80b1cdb3cc8bf8a307b820e","target":"graph","created_at":"2026-05-18T02:25:13Z","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 the simplicial cone constrained convex quadratic programming problem is studied. The optimality conditions of this problem consist in a linear complementarity problem. This fact, under a suitable condition, leads to an equivalence between the simplicial cone constrained convex quadratic programming problem and the one of finding the unique solution of a nonsmooth system of equations. It is shown that a semi-smooth Newton method applied to this nonsmooth system of equations is always well defined and under a mild assumption on the simplicial cone the method generates a sequence th","authors_text":"J. G. Barrios, O. P. Ferreira, S. Z. N\\'emeth","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-10T02:17:57Z","title":"A semi-smooth Newton method for solving convex quadratic programming problem under simplicial cone constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02753","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:d8ba875b6d931e3f571ac9b83488b36ef56c478bbb1b7b39ded0e1a4f6a89305","target":"record","created_at":"2026-05-18T02:25:13Z","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":"49eb807645a3110edf3cdcc0e11d8e7209d814072008f1abbe158da152f5e2c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-10T02:17:57Z","title_canon_sha256":"1e2c8d5098256a673cac80a074347636320de8dfeff64efb4ec408aa9f47eea2"},"schema_version":"1.0","source":{"id":"1503.02753","kind":"arxiv","version":1}},"canonical_sha256":"a3fad566c57315334e18578b8b758a06b824ec370b242f4aaec2f4d0463bd3e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3fad566c57315334e18578b8b758a06b824ec370b242f4aaec2f4d0463bd3e6","first_computed_at":"2026-05-18T02:25:13.197971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:13.197971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mlfHHkh41uloJ7s3B6682EX0pk60cu0Ywg3VN3kBIT4angvtjygPkBhATxQnFceeaTnrURZq/Kqjtz82mnThAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:13.198425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02753","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8ba875b6d931e3f571ac9b83488b36ef56c478bbb1b7b39ded0e1a4f6a89305","sha256:53cd5bbf54e4b70e6748cf0e4df353fa09ee8cf4e80b1cdb3cc8bf8a307b820e"],"state_sha256":"12b6723bacaaaf909db1e10f97dc7eb2ca37ccc58b01bf14902a04e2a7341cbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+R/QoXot0/7AS46gzB5RyZRMZFfVTnR1e1yQbzELKnwIgzbCir18k57sBa0pfjWZ4nHjIoeC5rbT3rTOOFqvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:16:05.037921Z","bundle_sha256":"7c731d0ce7cf4a9291fec17ac0f55669a28ed7c12d380f95c91ca09cff231ade"}}