{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KGWAENYDLGJQ73NZK665S65B5T","short_pith_number":"pith:KGWAENYD","canonical_record":{"source":{"id":"2408.16656","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-08-29T16:00:48Z","cross_cats_sorted":[],"title_canon_sha256":"404fe66c5f7f4974ab5d2b5068419828e9a6bbb1c25d8f6eccb1b3f50f20136e","abstract_canon_sha256":"605b712f96ef04397ecf76fa1038e4d8f2ca9da0f0e2aeade9fe3f942514ffef"},"schema_version":"1.0"},"canonical_sha256":"51ac02370359930fedb957bdd97ba1ece2026568a10d6097c45cf7f5921422a0","source":{"kind":"arxiv","id":"2408.16656","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.16656","created_at":"2026-06-02T01:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"2408.16656v2","created_at":"2026-06-02T01:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16656","created_at":"2026-06-02T01:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"KGWAENYDLGJQ","created_at":"2026-06-02T01:03:29Z"},{"alias_kind":"pith_short_16","alias_value":"KGWAENYDLGJQ73NZ","created_at":"2026-06-02T01:03:29Z"},{"alias_kind":"pith_short_8","alias_value":"KGWAENYD","created_at":"2026-06-02T01:03:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KGWAENYDLGJQ73NZK665S65B5T","target":"record","payload":{"canonical_record":{"source":{"id":"2408.16656","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-08-29T16:00:48Z","cross_cats_sorted":[],"title_canon_sha256":"404fe66c5f7f4974ab5d2b5068419828e9a6bbb1c25d8f6eccb1b3f50f20136e","abstract_canon_sha256":"605b712f96ef04397ecf76fa1038e4d8f2ca9da0f0e2aeade9fe3f942514ffef"},"schema_version":"1.0"},"canonical_sha256":"51ac02370359930fedb957bdd97ba1ece2026568a10d6097c45cf7f5921422a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:29.193085Z","signature_b64":"0PMwGMOauTTmqDdJEsbNPjV7d0Mwa4L2t/ZzKtCqxwDgyaUSucQUNEUuBIIeBwJ2ZL2gQGE8RAjbacv4a8vNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51ac02370359930fedb957bdd97ba1ece2026568a10d6097c45cf7f5921422a0","last_reissued_at":"2026-06-02T01:03:29.192671Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:29.192671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.16656","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-06-02T01:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIGYzje2Tj7Uyd06pYZ+FViGX1xUPV4Rwz+sVZD7iaj6CazWGzKIgqafogfGxcSwc8tudJ9Aaz+0pLScXHpvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:27:22.532821Z"},"content_sha256":"29998b00544b6fa4b3cbe5bd8ceec21a8f794c44edba3e45c9e4ead1b072d5d0","schema_version":"1.0","event_id":"sha256:29998b00544b6fa4b3cbe5bd8ceec21a8f794c44edba3e45c9e4ead1b072d5d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KGWAENYDLGJQ73NZK665S65B5T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Two Stepsize SQP Method for Nonlinear Equality Constrained Stochastic Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael J. O'Neill","submitted_at":"2024-08-29T16:00:48Z","abstract_excerpt":"We develop a Sequential Quadratic Optimization (SQP) algorithm for minimizing a stochastic objective function subject to deterministic equality constraints. The method utilizes two different stepsizes, one which exclusively scales the component of the step corrupted by the variance of the stochastic gradient estimates and a second which scales the entire step. We prove that this stepsize splitting scheme has a worst-case complexity result which improves over the best known result for this class of problems. In terms of approximately satisfying the constraint violation, this complexity result m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16656","kind":"arxiv","version":2},"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/2408.16656/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-02T01:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/uyV7pbo1kw96xgUSCLrbZgijbBQ9vUix4EGVxM0bLDZaqmSsLOfg2c3FELfUmP7Ff9jYsxn5hXxoMwEWyw6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:27:22.533188Z"},"content_sha256":"41b4bc5caa5fd98bd137774f0ffe6bda44b8e0987b0816b32ca9b680b11a5cdf","schema_version":"1.0","event_id":"sha256:41b4bc5caa5fd98bd137774f0ffe6bda44b8e0987b0816b32ca9b680b11a5cdf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGWAENYDLGJQ73NZK665S65B5T/bundle.json","state_url":"https://pith.science/pith/KGWAENYDLGJQ73NZK665S65B5T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGWAENYDLGJQ73NZK665S65B5T/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-29T18:27:22Z","links":{"resolver":"https://pith.science/pith/KGWAENYDLGJQ73NZK665S65B5T","bundle":"https://pith.science/pith/KGWAENYDLGJQ73NZK665S65B5T/bundle.json","state":"https://pith.science/pith/KGWAENYDLGJQ73NZK665S65B5T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGWAENYDLGJQ73NZK665S65B5T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KGWAENYDLGJQ73NZK665S65B5T","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":"605b712f96ef04397ecf76fa1038e4d8f2ca9da0f0e2aeade9fe3f942514ffef","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-08-29T16:00:48Z","title_canon_sha256":"404fe66c5f7f4974ab5d2b5068419828e9a6bbb1c25d8f6eccb1b3f50f20136e"},"schema_version":"1.0","source":{"id":"2408.16656","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.16656","created_at":"2026-06-02T01:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"2408.16656v2","created_at":"2026-06-02T01:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16656","created_at":"2026-06-02T01:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"KGWAENYDLGJQ","created_at":"2026-06-02T01:03:29Z"},{"alias_kind":"pith_short_16","alias_value":"KGWAENYDLGJQ73NZ","created_at":"2026-06-02T01:03:29Z"},{"alias_kind":"pith_short_8","alias_value":"KGWAENYD","created_at":"2026-06-02T01:03:29Z"}],"graph_snapshots":[{"event_id":"sha256:41b4bc5caa5fd98bd137774f0ffe6bda44b8e0987b0816b32ca9b680b11a5cdf","target":"graph","created_at":"2026-06-02T01:03:29Z","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/2408.16656/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop a Sequential Quadratic Optimization (SQP) algorithm for minimizing a stochastic objective function subject to deterministic equality constraints. The method utilizes two different stepsizes, one which exclusively scales the component of the step corrupted by the variance of the stochastic gradient estimates and a second which scales the entire step. We prove that this stepsize splitting scheme has a worst-case complexity result which improves over the best known result for this class of problems. In terms of approximately satisfying the constraint violation, this complexity result m","authors_text":"Michael J. O'Neill","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-08-29T16:00:48Z","title":"A Two Stepsize SQP Method for Nonlinear Equality Constrained Stochastic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16656","kind":"arxiv","version":2},"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:29998b00544b6fa4b3cbe5bd8ceec21a8f794c44edba3e45c9e4ead1b072d5d0","target":"record","created_at":"2026-06-02T01:03:29Z","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":"605b712f96ef04397ecf76fa1038e4d8f2ca9da0f0e2aeade9fe3f942514ffef","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-08-29T16:00:48Z","title_canon_sha256":"404fe66c5f7f4974ab5d2b5068419828e9a6bbb1c25d8f6eccb1b3f50f20136e"},"schema_version":"1.0","source":{"id":"2408.16656","kind":"arxiv","version":2}},"canonical_sha256":"51ac02370359930fedb957bdd97ba1ece2026568a10d6097c45cf7f5921422a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51ac02370359930fedb957bdd97ba1ece2026568a10d6097c45cf7f5921422a0","first_computed_at":"2026-06-02T01:03:29.192671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:29.192671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0PMwGMOauTTmqDdJEsbNPjV7d0Mwa4L2t/ZzKtCqxwDgyaUSucQUNEUuBIIeBwJ2ZL2gQGE8RAjbacv4a8vNAA==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:29.193085Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.16656","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29998b00544b6fa4b3cbe5bd8ceec21a8f794c44edba3e45c9e4ead1b072d5d0","sha256:41b4bc5caa5fd98bd137774f0ffe6bda44b8e0987b0816b32ca9b680b11a5cdf"],"state_sha256":"0830542bd8321e3328be4a6b9b6545c7be1b768930246302e183e1cd229c91a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Rf/9uS7PgT+4t0/pScsIXM6SM2lZ0Z4BbOXkKY7B60AOvGaIV8RrqDeVfa1HL5zKJPU3GJTbWSYsWRv19AaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T18:27:22.535155Z","bundle_sha256":"9356410694b56595267376056e36b99cf217412b68963a567dfd746e4bac98e3"}}