{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HCWW72JHZ333WSZL3ZUM3DXLSO","short_pith_number":"pith:HCWW72JH","canonical_record":{"source":{"id":"2605.11421","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-12T02:15:33Z","cross_cats_sorted":[],"title_canon_sha256":"d25c8abb5414025428bfad464683c89ad2bbdcec9c4834152d518fff27d5e31b","abstract_canon_sha256":"a0de5901a44cec94acee269fee3f46d39edaf9993ed16f53e6ababcf1b3aaaab"},"schema_version":"1.0"},"canonical_sha256":"38ad6fe927cef7bb4b2bde68cd8eeb9393135667eb5224e677aedbc7dc2d86b5","source":{"kind":"arxiv","id":"2605.11421","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.11421","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.11421v2","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11421","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"HCWW72JHZ333","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"pith_short_16","alias_value":"HCWW72JHZ333WSZL","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"pith_short_8","alias_value":"HCWW72JH","created_at":"2026-05-27T01:05:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HCWW72JHZ333WSZL3ZUM3DXLSO","target":"record","payload":{"canonical_record":{"source":{"id":"2605.11421","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-12T02:15:33Z","cross_cats_sorted":[],"title_canon_sha256":"d25c8abb5414025428bfad464683c89ad2bbdcec9c4834152d518fff27d5e31b","abstract_canon_sha256":"a0de5901a44cec94acee269fee3f46d39edaf9993ed16f53e6ababcf1b3aaaab"},"schema_version":"1.0"},"canonical_sha256":"38ad6fe927cef7bb4b2bde68cd8eeb9393135667eb5224e677aedbc7dc2d86b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:56.843583Z","signature_b64":"0QC5Mq2BajOhdX6Z86jir3GwCs1s3dipkaiLFfyYPduclPRrzb8v4fbE//siG7uBb5ZyjMbrn6zxjibKI1l2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38ad6fe927cef7bb4b2bde68cd8eeb9393135667eb5224e677aedbc7dc2d86b5","last_reissued_at":"2026-05-27T01:05:56.842816Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:56.842816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.11421","source_version":2,"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-27T01:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P1EgUXFsrteIhdolD/DPt5Trk1hYNS8COzpLQRFNCIvrS6Nwj22HOT1kAr6DhCRrmvm4shLPG6NZFwSbPvxbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:22:00.670873Z"},"content_sha256":"d7627abe8483e24f3a196e4a3853b96647a5f955f4d171ff4b7521ff8973b410","schema_version":"1.0","event_id":"sha256:d7627abe8483e24f3a196e4a3853b96647a5f955f4d171ff4b7521ff8973b410"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HCWW72JHZ333WSZL3ZUM3DXLSO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Grimmer--Shu--Wang Certificate and the Drori--Teboulle Minimax Constant-Stepsize Bound for $N\\ge 3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"For every number of steps N at least 3, positive vectors exist that satisfy the equations of the strengthened low-rank certificate for the worst-case analysis of gradient descent with constant stepsize.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lixing Zhang","submitted_at":"2026-05-12T02:15:33Z","abstract_excerpt":"We prove, for every horizon \\(N\\ge 3\\), the existence of the strengthened low-rank performance-estimation certificate proposed by Grimmer, Shu, and Wang for the Drori--Teboulle constant-step gradient-descent bound. For each \\(N\\ge 3\\), let \\(\\rho_N\\in(0,1)\\) be determined by \\(\\rho_N^{2N}(2N\\rho_N+2N+1)=1\\). We show that the GSW certificate equations admit positive vectors \\(a,b,c,d\\) satisfying all residual equations. The proof proceeds through a reduced residual system in the variables \\(d\\), a simplex existence argument for a positive reduced zero, a terminal residual completion identity, a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove, for every horizon N >= 3, the existence of the strengthened low-rank performance-estimation certificate proposed by Grimmer, Shu, and Wang for the Drori-Teboulle minimax nonnegative constant-stepsize problem for gradient descent.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The GSW certificate equations admit positive vectors a, b, c, d satisfying all residual equations, shown via a reduced residual system, simplex existence argument, terminal residual completion identity, and tail-square convolution argument proving cumulative margins.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The Grimmer-Shu-Wang low-rank PEP certificate exists for every horizon N >= 3 and establishes the exact Drori-Teboulle minimax nonnegative constant-stepsize bound for gradient descent.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For every number of steps N at least 3, positive vectors exist that satisfy the equations of the strengthened low-rank certificate for the worst-case analysis of gradient descent with constant stepsize.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"fef0149551dfe6c4e7f82ba85fc61b0dda72e64013e4411b21ce5aae646f9ea3"},"source":{"id":"2605.11421","kind":"arxiv","version":2},"verdict":{"id":"6a642e79-12b1-445f-9d6c-44b421c37a7d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T02:37:04.909515Z","strongest_claim":"We prove, for every horizon N >= 3, the existence of the strengthened low-rank performance-estimation certificate proposed by Grimmer, Shu, and Wang for the Drori-Teboulle minimax nonnegative constant-stepsize problem for gradient descent.","one_line_summary":"The Grimmer-Shu-Wang low-rank PEP certificate exists for every horizon N >= 3 and establishes the exact Drori-Teboulle minimax nonnegative constant-stepsize bound for gradient descent.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The GSW certificate equations admit positive vectors a, b, c, d satisfying all residual equations, shown via a reduced residual system, simplex existence argument, terminal residual completion identity, and tail-square convolution argument proving cumulative margins.","pith_extraction_headline":"For every number of steps N at least 3, positive vectors exist that satisfy the equations of the strengthened low-rank certificate for the worst-case analysis of gradient descent with constant stepsize."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.11421/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T04:22:00.458781Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T12:36:22.419663Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T10:01:16.556914Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T08:28:42.511585Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"6316e6376e763f65d698e16e053cb43dcf3197c056b7afeb6140b2ad9c540444"},"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":"6a642e79-12b1-445f-9d6c-44b421c37a7d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JAIhiFfREB7wF0Uaw5Xz/OGpIXeinhP3ffkBPbqfsLzHE1lTmwt3adNwhPf/cazF0mvAUfyOGPfRHeVUFRmjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:22:00.671878Z"},"content_sha256":"a769d32519f349661e0dfa6b0bb1d689e9d846ddd97845744254e6d338572588","schema_version":"1.0","event_id":"sha256:a769d32519f349661e0dfa6b0bb1d689e9d846ddd97845744254e6d338572588"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCWW72JHZ333WSZL3ZUM3DXLSO/bundle.json","state_url":"https://pith.science/pith/HCWW72JHZ333WSZL3ZUM3DXLSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCWW72JHZ333WSZL3ZUM3DXLSO/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-31T10:22:00Z","links":{"resolver":"https://pith.science/pith/HCWW72JHZ333WSZL3ZUM3DXLSO","bundle":"https://pith.science/pith/HCWW72JHZ333WSZL3ZUM3DXLSO/bundle.json","state":"https://pith.science/pith/HCWW72JHZ333WSZL3ZUM3DXLSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCWW72JHZ333WSZL3ZUM3DXLSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HCWW72JHZ333WSZL3ZUM3DXLSO","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":"a0de5901a44cec94acee269fee3f46d39edaf9993ed16f53e6ababcf1b3aaaab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-12T02:15:33Z","title_canon_sha256":"d25c8abb5414025428bfad464683c89ad2bbdcec9c4834152d518fff27d5e31b"},"schema_version":"1.0","source":{"id":"2605.11421","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.11421","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.11421v2","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11421","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"HCWW72JHZ333","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"pith_short_16","alias_value":"HCWW72JHZ333WSZL","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"pith_short_8","alias_value":"HCWW72JH","created_at":"2026-05-27T01:05:56Z"}],"graph_snapshots":[{"event_id":"sha256:a769d32519f349661e0dfa6b0bb1d689e9d846ddd97845744254e6d338572588","target":"graph","created_at":"2026-05-27T01:05:56Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove, for every horizon N >= 3, the existence of the strengthened low-rank performance-estimation certificate proposed by Grimmer, Shu, and Wang for the Drori-Teboulle minimax nonnegative constant-stepsize problem for gradient descent."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The GSW certificate equations admit positive vectors a, b, c, d satisfying all residual equations, shown via a reduced residual system, simplex existence argument, terminal residual completion identity, and tail-square convolution argument proving cumulative margins."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The Grimmer-Shu-Wang low-rank PEP certificate exists for every horizon N >= 3 and establishes the exact Drori-Teboulle minimax nonnegative constant-stepsize bound for gradient descent."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For every number of steps N at least 3, positive vectors exist that satisfy the equations of the strengthened low-rank certificate for the worst-case analysis of gradient descent with constant stepsize."}],"snapshot_sha256":"fef0149551dfe6c4e7f82ba85fc61b0dda72e64013e4411b21ce5aae646f9ea3"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T04:22:00.458781Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T12:36:22.419663Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T10:01:16.556914Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T08:28:42.511585Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.11421/integrity.json","findings":[],"snapshot_sha256":"6316e6376e763f65d698e16e053cb43dcf3197c056b7afeb6140b2ad9c540444","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove, for every horizon \\(N\\ge 3\\), the existence of the strengthened low-rank performance-estimation certificate proposed by Grimmer, Shu, and Wang for the Drori--Teboulle constant-step gradient-descent bound. For each \\(N\\ge 3\\), let \\(\\rho_N\\in(0,1)\\) be determined by \\(\\rho_N^{2N}(2N\\rho_N+2N+1)=1\\). We show that the GSW certificate equations admit positive vectors \\(a,b,c,d\\) satisfying all residual equations. The proof proceeds through a reduced residual system in the variables \\(d\\), a simplex existence argument for a positive reduced zero, a terminal residual completion identity, a","authors_text":"Lixing Zhang","cross_cats":[],"headline":"For every number of steps N at least 3, positive vectors exist that satisfy the equations of the strengthened low-rank certificate for the worst-case analysis of gradient descent with constant stepsize.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-12T02:15:33Z","title":"The Grimmer--Shu--Wang Certificate and the Drori--Teboulle Minimax Constant-Stepsize Bound for $N\\ge 3$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.11421","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-13T02:37:04.909515Z","id":"6a642e79-12b1-445f-9d6c-44b421c37a7d","model_set":{"reader":"grok-4.3"},"one_line_summary":"The Grimmer-Shu-Wang low-rank PEP certificate exists for every horizon N >= 3 and establishes the exact Drori-Teboulle minimax nonnegative constant-stepsize bound for gradient descent.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For every number of steps N at least 3, positive vectors exist that satisfy the equations of the strengthened low-rank certificate for the worst-case analysis of gradient descent with constant stepsize.","strongest_claim":"We prove, for every horizon N >= 3, the existence of the strengthened low-rank performance-estimation certificate proposed by Grimmer, Shu, and Wang for the Drori-Teboulle minimax nonnegative constant-stepsize problem for gradient descent.","weakest_assumption":"The GSW certificate equations admit positive vectors a, b, c, d satisfying all residual equations, shown via a reduced residual system, simplex existence argument, terminal residual completion identity, and tail-square convolution argument proving cumulative margins."}},"verdict_id":"6a642e79-12b1-445f-9d6c-44b421c37a7d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d7627abe8483e24f3a196e4a3853b96647a5f955f4d171ff4b7521ff8973b410","target":"record","created_at":"2026-05-27T01:05:56Z","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":"a0de5901a44cec94acee269fee3f46d39edaf9993ed16f53e6ababcf1b3aaaab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-12T02:15:33Z","title_canon_sha256":"d25c8abb5414025428bfad464683c89ad2bbdcec9c4834152d518fff27d5e31b"},"schema_version":"1.0","source":{"id":"2605.11421","kind":"arxiv","version":2}},"canonical_sha256":"38ad6fe927cef7bb4b2bde68cd8eeb9393135667eb5224e677aedbc7dc2d86b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38ad6fe927cef7bb4b2bde68cd8eeb9393135667eb5224e677aedbc7dc2d86b5","first_computed_at":"2026-05-27T01:05:56.842816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:05:56.842816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0QC5Mq2BajOhdX6Z86jir3GwCs1s3dipkaiLFfyYPduclPRrzb8v4fbE//siG7uBb5ZyjMbrn6zxjibKI1l2Ag==","signature_status":"signed_v1","signed_at":"2026-05-27T01:05:56.843583Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.11421","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7627abe8483e24f3a196e4a3853b96647a5f955f4d171ff4b7521ff8973b410","sha256:a769d32519f349661e0dfa6b0bb1d689e9d846ddd97845744254e6d338572588"],"state_sha256":"d6942a7d79c8b5b51e1d9dbadbc33176d9d3a7d8fdd35739c3c672a56b694cdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E66mMmngk6KGLJTIU18VhgD/uhQMFxAYv2B0oA3kzKuMoxWHiq4jAXsYgzdpcFWgnFHdQoyP0juDbLZ8UC2UAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:22:00.676526Z","bundle_sha256":"ee0fefc5ec2ba25bd057dbc4d5c45e028fa0ab5e96b3293f6ed18356bfcb4594"}}