{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:2FPYWB57AMAMILCPFMMXYZ675W","short_pith_number":"pith:2FPYWB57","canonical_record":{"source":{"id":"2006.06934","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-06-12T03:55:01Z","cross_cats_sorted":[],"title_canon_sha256":"c545fbb4556d4bc3e19a99aae296a1250d3de519b729038c95551495042b5abb","abstract_canon_sha256":"bd72fbcf9023e588d49adc60b868b09f5d4fe95a9bb816355da7e1e92a0ff39f"},"schema_version":"1.0"},"canonical_sha256":"d15f8b07bf0300c42c4f2b197c67dfedbcf0f08f7132007586d8dcc17924e539","source":{"kind":"arxiv","id":"2006.06934","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.06934","created_at":"2026-07-05T01:19:53Z"},{"alias_kind":"arxiv_version","alias_value":"2006.06934v3","created_at":"2026-07-05T01:19:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.06934","created_at":"2026-07-05T01:19:53Z"},{"alias_kind":"pith_short_12","alias_value":"2FPYWB57AMAM","created_at":"2026-07-05T01:19:53Z"},{"alias_kind":"pith_short_16","alias_value":"2FPYWB57AMAMILCP","created_at":"2026-07-05T01:19:53Z"},{"alias_kind":"pith_short_8","alias_value":"2FPYWB57","created_at":"2026-07-05T01:19:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:2FPYWB57AMAMILCPFMMXYZ675W","target":"record","payload":{"canonical_record":{"source":{"id":"2006.06934","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-06-12T03:55:01Z","cross_cats_sorted":[],"title_canon_sha256":"c545fbb4556d4bc3e19a99aae296a1250d3de519b729038c95551495042b5abb","abstract_canon_sha256":"bd72fbcf9023e588d49adc60b868b09f5d4fe95a9bb816355da7e1e92a0ff39f"},"schema_version":"1.0"},"canonical_sha256":"d15f8b07bf0300c42c4f2b197c67dfedbcf0f08f7132007586d8dcc17924e539","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:19:53.180966Z","signature_b64":"XQK+1uo5K67WW0V25wvgO9tYjAQwhPEfq67g/HBjx0b/8KymNdcnE/QuZySG1pUKuVtuUmo4HJvft5QC7C7UBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d15f8b07bf0300c42c4f2b197c67dfedbcf0f08f7132007586d8dcc17924e539","last_reissued_at":"2026-07-05T01:19:53.180495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:19:53.180495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.06934","source_version":3,"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-07-05T01:19:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H+iGajvcTN8LUA8n8HryWfTF2qx+J59Z7uH/IpGP/HhQCmjBo6gmAs3i/VMSjU0/d/aN7mhBmTPeJ9yymuTKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:12:29.342711Z"},"content_sha256":"4ea7ed8c48e599f5628f2e8af6cfaa5eb09c9534d0e956acdf61886cc3bf196e","schema_version":"1.0","event_id":"sha256:4ea7ed8c48e599f5628f2e8af6cfaa5eb09c9534d0e956acdf61886cc3bf196e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:2FPYWB57AMAMILCPFMMXYZ675W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient Projection for Solving Quadratic Programs with Standard Simplex Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Youwei Liang","submitted_at":"2020-06-12T03:55:01Z","abstract_excerpt":"An important method to optimize a function on standard simplex is the active set algorithm, which requires the gradient of the function to be projected onto a hyperplane, with sign constraints on the variables that lie in the boundary of the simplex. We propose a new algorithm to efficiently project the gradient for this purpose. Furthermore, we apply the proposed gradient projection method to quadratic programs (QP) with standard simplex constraints, where gradient projection is used to explore the feasible region and, when we believe the optimal active set is identified, we switch to constra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.06934","kind":"arxiv","version":3},"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/2006.06934/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"},"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-07-05T01:19:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QmWx3BbyO9/3IVAXD5lc5CUI/CqYrgWYI4i2cTgJvFKxib7THxumRx3O3U8I3sci+hl7QC4q0kytYF3MBgAKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:12:29.343085Z"},"content_sha256":"111d0cdc9e5a24aaf56be580e8e778b453e56742041997813d5f9cd9b8d3868f","schema_version":"1.0","event_id":"sha256:111d0cdc9e5a24aaf56be580e8e778b453e56742041997813d5f9cd9b8d3868f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2FPYWB57AMAMILCPFMMXYZ675W/bundle.json","state_url":"https://pith.science/pith/2FPYWB57AMAMILCPFMMXYZ675W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2FPYWB57AMAMILCPFMMXYZ675W/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-07-07T02:12:29Z","links":{"resolver":"https://pith.science/pith/2FPYWB57AMAMILCPFMMXYZ675W","bundle":"https://pith.science/pith/2FPYWB57AMAMILCPFMMXYZ675W/bundle.json","state":"https://pith.science/pith/2FPYWB57AMAMILCPFMMXYZ675W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2FPYWB57AMAMILCPFMMXYZ675W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:2FPYWB57AMAMILCPFMMXYZ675W","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":"bd72fbcf9023e588d49adc60b868b09f5d4fe95a9bb816355da7e1e92a0ff39f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-06-12T03:55:01Z","title_canon_sha256":"c545fbb4556d4bc3e19a99aae296a1250d3de519b729038c95551495042b5abb"},"schema_version":"1.0","source":{"id":"2006.06934","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.06934","created_at":"2026-07-05T01:19:53Z"},{"alias_kind":"arxiv_version","alias_value":"2006.06934v3","created_at":"2026-07-05T01:19:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.06934","created_at":"2026-07-05T01:19:53Z"},{"alias_kind":"pith_short_12","alias_value":"2FPYWB57AMAM","created_at":"2026-07-05T01:19:53Z"},{"alias_kind":"pith_short_16","alias_value":"2FPYWB57AMAMILCP","created_at":"2026-07-05T01:19:53Z"},{"alias_kind":"pith_short_8","alias_value":"2FPYWB57","created_at":"2026-07-05T01:19:53Z"}],"graph_snapshots":[{"event_id":"sha256:111d0cdc9e5a24aaf56be580e8e778b453e56742041997813d5f9cd9b8d3868f","target":"graph","created_at":"2026-07-05T01:19:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.06934/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An important method to optimize a function on standard simplex is the active set algorithm, which requires the gradient of the function to be projected onto a hyperplane, with sign constraints on the variables that lie in the boundary of the simplex. We propose a new algorithm to efficiently project the gradient for this purpose. Furthermore, we apply the proposed gradient projection method to quadratic programs (QP) with standard simplex constraints, where gradient projection is used to explore the feasible region and, when we believe the optimal active set is identified, we switch to constra","authors_text":"Youwei Liang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-06-12T03:55:01Z","title":"Gradient Projection for Solving Quadratic Programs with Standard Simplex Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.06934","kind":"arxiv","version":3},"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:4ea7ed8c48e599f5628f2e8af6cfaa5eb09c9534d0e956acdf61886cc3bf196e","target":"record","created_at":"2026-07-05T01:19:53Z","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":"bd72fbcf9023e588d49adc60b868b09f5d4fe95a9bb816355da7e1e92a0ff39f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-06-12T03:55:01Z","title_canon_sha256":"c545fbb4556d4bc3e19a99aae296a1250d3de519b729038c95551495042b5abb"},"schema_version":"1.0","source":{"id":"2006.06934","kind":"arxiv","version":3}},"canonical_sha256":"d15f8b07bf0300c42c4f2b197c67dfedbcf0f08f7132007586d8dcc17924e539","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d15f8b07bf0300c42c4f2b197c67dfedbcf0f08f7132007586d8dcc17924e539","first_computed_at":"2026-07-05T01:19:53.180495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:19:53.180495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XQK+1uo5K67WW0V25wvgO9tYjAQwhPEfq67g/HBjx0b/8KymNdcnE/QuZySG1pUKuVtuUmo4HJvft5QC7C7UBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:19:53.180966Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.06934","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ea7ed8c48e599f5628f2e8af6cfaa5eb09c9534d0e956acdf61886cc3bf196e","sha256:111d0cdc9e5a24aaf56be580e8e778b453e56742041997813d5f9cd9b8d3868f"],"state_sha256":"d298eca436d3d066bcc3f7737f4ac80118a88d3475fc5aa588182fa70077b8b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n5DS/KaEgQmAHYma4mkvmJGZqBWgIbRd4tiFVkQtQrVqlkCL3Zr4K+VH2RFEbMxdKO/dDLRL5d4qsSZayiZMCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T02:12:29.345089Z","bundle_sha256":"ef6036fdf74b39961b6b5d27db5b7a6ce90ca0743395f30862a5815071ff7233"}}