{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NZUQCC5Y2LSGHISWH26RCG47SI","short_pith_number":"pith:NZUQCC5Y","canonical_record":{"source":{"id":"1610.06834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T16:01:56Z","cross_cats_sorted":[],"title_canon_sha256":"c82cee81c989dd8ec720988e0f2a547e783f2fd2fcc74abab0ff768f35e83855","abstract_canon_sha256":"8187a44443b9ec80129d546d3354e9891bab97082648a96df2fc82ab43d18f63"},"schema_version":"1.0"},"canonical_sha256":"6e69010bb8d2e463a2563ebd111b9f9233907083775e3c364e5bad40aed0e753","source":{"kind":"arxiv","id":"1610.06834","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06834","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06834v1","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06834","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"NZUQCC5Y2LSG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NZUQCC5Y2LSGHISW","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NZUQCC5Y","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NZUQCC5Y2LSGHISWH26RCG47SI","target":"record","payload":{"canonical_record":{"source":{"id":"1610.06834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T16:01:56Z","cross_cats_sorted":[],"title_canon_sha256":"c82cee81c989dd8ec720988e0f2a547e783f2fd2fcc74abab0ff768f35e83855","abstract_canon_sha256":"8187a44443b9ec80129d546d3354e9891bab97082648a96df2fc82ab43d18f63"},"schema_version":"1.0"},"canonical_sha256":"6e69010bb8d2e463a2563ebd111b9f9233907083775e3c364e5bad40aed0e753","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:36.600736Z","signature_b64":"JNF00WJJwnZEod8xUNZxW3c0kx3mImDbezPxBwQ5M0Ws5PvRmoeCECDw9/aWQwtBvNVAaHwatIRzP72UKBZmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e69010bb8d2e463a2563ebd111b9f9233907083775e3c364e5bad40aed0e753","last_reissued_at":"2026-05-18T01:01:36.600094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:36.600094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.06834","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-18T01:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EYtPoDhDU5saVy02yyVhi9Ek8fcaEQN+qa0m+Ydi9hjLXanVl5cRqT/OCcagIe/KqAIi4t3UEc3KgAc1j9A0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:07:44.305560Z"},"content_sha256":"63f7eaae33ffd10483b5c41ae963fc2c88da036e0ba0f0b5415e60216cbd954d","schema_version":"1.0","event_id":"sha256:63f7eaae33ffd10483b5c41ae963fc2c88da036e0ba0f0b5415e60216cbd954d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NZUQCC5Y2LSGHISWH26RCG47SI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Projected Gradient and Constraint Linearization Method for Nonlinear Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Giampaolo Torrisi, Manfred Morari, Roy S. Smith, Sergio Grammatico","submitted_at":"2016-10-21T16:01:56Z","abstract_excerpt":"Projected Gradient Descent denotes a class of iterative methods for solving optimization programs. Its applicability to convex optimization programs has gained significant popularity for its intuitive implementation that involves only simple algebraic operations. In fact, if the projection onto the feasible set is easy to compute, then the method has low complexity. On the other hand, when the problem is nonconvex, e.g. because of nonlinear equality constraints, the projection becomes hard and thus impractical. In this paper, we propose a projected gradient method for Nonlinear Programs (NLPs)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06834","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-18T01:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cOqibOHM3m8QoudlmQ8531uMYnZGwTfGGN3yeMBJIeyvmGbRELom9/U1HTwWb0XIFCM3X6hd++urs2ZAbul3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:07:44.306296Z"},"content_sha256":"de662fc433bf38b37b8603e39c7fb84a9d9c3142802c172514307a5273e8647c","schema_version":"1.0","event_id":"sha256:de662fc433bf38b37b8603e39c7fb84a9d9c3142802c172514307a5273e8647c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZUQCC5Y2LSGHISWH26RCG47SI/bundle.json","state_url":"https://pith.science/pith/NZUQCC5Y2LSGHISWH26RCG47SI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZUQCC5Y2LSGHISWH26RCG47SI/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-06-09T21:07:44Z","links":{"resolver":"https://pith.science/pith/NZUQCC5Y2LSGHISWH26RCG47SI","bundle":"https://pith.science/pith/NZUQCC5Y2LSGHISWH26RCG47SI/bundle.json","state":"https://pith.science/pith/NZUQCC5Y2LSGHISWH26RCG47SI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZUQCC5Y2LSGHISWH26RCG47SI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NZUQCC5Y2LSGHISWH26RCG47SI","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":"8187a44443b9ec80129d546d3354e9891bab97082648a96df2fc82ab43d18f63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T16:01:56Z","title_canon_sha256":"c82cee81c989dd8ec720988e0f2a547e783f2fd2fcc74abab0ff768f35e83855"},"schema_version":"1.0","source":{"id":"1610.06834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06834","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06834v1","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06834","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"NZUQCC5Y2LSG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NZUQCC5Y2LSGHISW","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NZUQCC5Y","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:de662fc433bf38b37b8603e39c7fb84a9d9c3142802c172514307a5273e8647c","target":"graph","created_at":"2026-05-18T01:01:36Z","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":"Projected Gradient Descent denotes a class of iterative methods for solving optimization programs. Its applicability to convex optimization programs has gained significant popularity for its intuitive implementation that involves only simple algebraic operations. In fact, if the projection onto the feasible set is easy to compute, then the method has low complexity. On the other hand, when the problem is nonconvex, e.g. because of nonlinear equality constraints, the projection becomes hard and thus impractical. In this paper, we propose a projected gradient method for Nonlinear Programs (NLPs)","authors_text":"Giampaolo Torrisi, Manfred Morari, Roy S. Smith, Sergio Grammatico","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T16:01:56Z","title":"A Projected Gradient and Constraint Linearization Method for Nonlinear Model Predictive Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06834","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:63f7eaae33ffd10483b5c41ae963fc2c88da036e0ba0f0b5415e60216cbd954d","target":"record","created_at":"2026-05-18T01:01:36Z","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":"8187a44443b9ec80129d546d3354e9891bab97082648a96df2fc82ab43d18f63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-21T16:01:56Z","title_canon_sha256":"c82cee81c989dd8ec720988e0f2a547e783f2fd2fcc74abab0ff768f35e83855"},"schema_version":"1.0","source":{"id":"1610.06834","kind":"arxiv","version":1}},"canonical_sha256":"6e69010bb8d2e463a2563ebd111b9f9233907083775e3c364e5bad40aed0e753","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e69010bb8d2e463a2563ebd111b9f9233907083775e3c364e5bad40aed0e753","first_computed_at":"2026-05-18T01:01:36.600094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:36.600094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JNF00WJJwnZEod8xUNZxW3c0kx3mImDbezPxBwQ5M0Ws5PvRmoeCECDw9/aWQwtBvNVAaHwatIRzP72UKBZmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:36.600736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63f7eaae33ffd10483b5c41ae963fc2c88da036e0ba0f0b5415e60216cbd954d","sha256:de662fc433bf38b37b8603e39c7fb84a9d9c3142802c172514307a5273e8647c"],"state_sha256":"91a1c65dbaed02113381b1e595ff6d1033013b1ed2a71b95e62b1f4f64b3eb49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pBzhy4NHFbDpoQo/KWf30zvR+clD8jm6yZ1E30DawcT16Dm9MYsrq2ru2QfD+2vsPvcGMqG5NxO+Hjd23cLzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T21:07:44.310359Z","bundle_sha256":"f68eff5bc45830f2e035d8334b17aca3c5fad614e9def6cf8344acfc557b70a1"}}