{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RQVVL23TUIBWPVRCDIOTA5MBLZ","short_pith_number":"pith:RQVVL23T","canonical_record":{"source":{"id":"2503.13965","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-18T06:57:36Z","cross_cats_sorted":[],"title_canon_sha256":"15008c13c6bb1a7f5a1df4a23a67c510fda56bfad19a21685d3d5d79003f2386","abstract_canon_sha256":"2f22bfeb911f1aff512bb3a419ee77d359bd51e5e1328f4ca4d1c0251edc3e80"},"schema_version":"1.0"},"canonical_sha256":"8c2b55eb73a20367d6221a1d3075815e7606430f8f380e3f8fbff08c1833b361","source":{"kind":"arxiv","id":"2503.13965","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.13965","created_at":"2026-06-09T01:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"2503.13965v5","created_at":"2026-06-09T01:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.13965","created_at":"2026-06-09T01:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"RQVVL23TUIBW","created_at":"2026-06-09T01:05:05Z"},{"alias_kind":"pith_short_16","alias_value":"RQVVL23TUIBWPVRC","created_at":"2026-06-09T01:05:05Z"},{"alias_kind":"pith_short_8","alias_value":"RQVVL23T","created_at":"2026-06-09T01:05:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RQVVL23TUIBWPVRCDIOTA5MBLZ","target":"record","payload":{"canonical_record":{"source":{"id":"2503.13965","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-18T06:57:36Z","cross_cats_sorted":[],"title_canon_sha256":"15008c13c6bb1a7f5a1df4a23a67c510fda56bfad19a21685d3d5d79003f2386","abstract_canon_sha256":"2f22bfeb911f1aff512bb3a419ee77d359bd51e5e1328f4ca4d1c0251edc3e80"},"schema_version":"1.0"},"canonical_sha256":"8c2b55eb73a20367d6221a1d3075815e7606430f8f380e3f8fbff08c1833b361","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:05.844686Z","signature_b64":"s3H29PtZ6ulT67U9KbJHO2igz5qX7hqsJsB+ih9JMlLaKUW/RN9SfXVt6mm5gczk6T1vBxbXxL6O8s8NXJFiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c2b55eb73a20367d6221a1d3075815e7606430f8f380e3f8fbff08c1833b361","last_reissued_at":"2026-06-09T01:05:05.844179Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:05.844179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.13965","source_version":5,"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-06-09T01:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7UF9QEoLCVBpy03Dn/lRYT6YSMWpsHBiPLdjdrdcnnV9nyHSrioY14zkli1oxggqDObB9fKQ4VlsCm/fA5OAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:58:13.532598Z"},"content_sha256":"a186023589c0fa7d699296f815988e3acbcc724d542033690c59f089594ebca3","schema_version":"1.0","event_id":"sha256:a186023589c0fa7d699296f815988e3acbcc724d542033690c59f089594ebca3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RQVVL23TUIBWPVRCDIOTA5MBLZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ioannis Lestas, Masaaki Nagahara, Mengmou Li","submitted_at":"2025-03-18T06:57:36Z","abstract_excerpt":"In this paper, we propose a systematic approach for extending first-order optimization algorithms, originally designed for unconstrained strongly convex problems, to handle closed convex set constraints. We show that the resulting projected algorithms retain the same linear convergence rate bounds, provided that the underlying unconstrained optimization algorithms admit a quadratic Lyapunov function obtained from integral quadratic constraint (IQC) analysis. The projected algorithms are constructed by applying a projection in the norm induced by the Lyapunov matrix, ensuring both constraint sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.13965","kind":"arxiv","version":5},"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/2503.13965/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-06-09T01:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NM1ASUyg6sHeclXz1gMCiKykEizWbMdmi7ptBZCj609M3be7LpXOQGZWAL7VoW82TrM6c26DNoQfZ/D5dfbqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:58:13.533388Z"},"content_sha256":"30487f5b7710f3fdad0d28a9797793671bb0735c6b1b16eb77c89b12470272f4","schema_version":"1.0","event_id":"sha256:30487f5b7710f3fdad0d28a9797793671bb0735c6b1b16eb77c89b12470272f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ/bundle.json","state_url":"https://pith.science/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ/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-10T05:58:13Z","links":{"resolver":"https://pith.science/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ","bundle":"https://pith.science/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ/bundle.json","state":"https://pith.science/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQVVL23TUIBWPVRCDIOTA5MBLZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RQVVL23TUIBWPVRCDIOTA5MBLZ","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":"2f22bfeb911f1aff512bb3a419ee77d359bd51e5e1328f4ca4d1c0251edc3e80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-18T06:57:36Z","title_canon_sha256":"15008c13c6bb1a7f5a1df4a23a67c510fda56bfad19a21685d3d5d79003f2386"},"schema_version":"1.0","source":{"id":"2503.13965","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.13965","created_at":"2026-06-09T01:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"2503.13965v5","created_at":"2026-06-09T01:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.13965","created_at":"2026-06-09T01:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"RQVVL23TUIBW","created_at":"2026-06-09T01:05:05Z"},{"alias_kind":"pith_short_16","alias_value":"RQVVL23TUIBWPVRC","created_at":"2026-06-09T01:05:05Z"},{"alias_kind":"pith_short_8","alias_value":"RQVVL23T","created_at":"2026-06-09T01:05:05Z"}],"graph_snapshots":[{"event_id":"sha256:30487f5b7710f3fdad0d28a9797793671bb0735c6b1b16eb77c89b12470272f4","target":"graph","created_at":"2026-06-09T01:05:05Z","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/2503.13965/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a systematic approach for extending first-order optimization algorithms, originally designed for unconstrained strongly convex problems, to handle closed convex set constraints. We show that the resulting projected algorithms retain the same linear convergence rate bounds, provided that the underlying unconstrained optimization algorithms admit a quadratic Lyapunov function obtained from integral quadratic constraint (IQC) analysis. The projected algorithms are constructed by applying a projection in the norm induced by the Lyapunov matrix, ensuring both constraint sa","authors_text":"Ioannis Lestas, Masaaki Nagahara, Mengmou Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-18T06:57:36Z","title":"First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.13965","kind":"arxiv","version":5},"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:a186023589c0fa7d699296f815988e3acbcc724d542033690c59f089594ebca3","target":"record","created_at":"2026-06-09T01:05:05Z","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":"2f22bfeb911f1aff512bb3a419ee77d359bd51e5e1328f4ca4d1c0251edc3e80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-18T06:57:36Z","title_canon_sha256":"15008c13c6bb1a7f5a1df4a23a67c510fda56bfad19a21685d3d5d79003f2386"},"schema_version":"1.0","source":{"id":"2503.13965","kind":"arxiv","version":5}},"canonical_sha256":"8c2b55eb73a20367d6221a1d3075815e7606430f8f380e3f8fbff08c1833b361","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c2b55eb73a20367d6221a1d3075815e7606430f8f380e3f8fbff08c1833b361","first_computed_at":"2026-06-09T01:05:05.844179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:05.844179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s3H29PtZ6ulT67U9KbJHO2igz5qX7hqsJsB+ih9JMlLaKUW/RN9SfXVt6mm5gczk6T1vBxbXxL6O8s8NXJFiBw==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:05.844686Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.13965","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a186023589c0fa7d699296f815988e3acbcc724d542033690c59f089594ebca3","sha256:30487f5b7710f3fdad0d28a9797793671bb0735c6b1b16eb77c89b12470272f4"],"state_sha256":"f463f9fe2077187648957cd65f32a725a71a6ccb1cc9fa7f1c2a0d22dd16234a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yb0EW+bU5CbVHNZ5tSyuqnAWvjdI4djmEiRKLIeKDipol8SxpluQX1n02QxXDOWGXorrojsw3rD3EpQr5L8GBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T05:58:13.538303Z","bundle_sha256":"a2e44eaa603561cca3ec724afeba535694896ca38dd754a45130d02c6ced8db7"}}