{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UO46PKZC23B3GI3D7YXJTGJ7LE","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":"88c701a0a91b709b87aa958909d1fe04a05e85eb7bc28674b93df76f93587d89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-25T11:00:22Z","title_canon_sha256":"0a31ed00cb67210d13bed90a13d104d8bb87b64e6a8df18d0dc3a131d1053dfe"},"schema_version":"1.0","source":{"id":"2511.20178","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.20178","created_at":"2026-07-24T01:23:02Z"},{"alias_kind":"arxiv_version","alias_value":"2511.20178v3","created_at":"2026-07-24T01:23:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.20178","created_at":"2026-07-24T01:23:02Z"},{"alias_kind":"pith_short_12","alias_value":"UO46PKZC23B3","created_at":"2026-07-24T01:23:02Z"},{"alias_kind":"pith_short_16","alias_value":"UO46PKZC23B3GI3D","created_at":"2026-07-24T01:23:02Z"},{"alias_kind":"pith_short_8","alias_value":"UO46PKZC","created_at":"2026-07-24T01:23:02Z"}],"graph_snapshots":[{"event_id":"sha256:8a30ae640ca29bd60af2a0ad7fad640045b14c18c20d252d13864cda9a10fec2","target":"graph","created_at":"2026-07-24T01:23:02Z","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/2511.20178/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stochastic convex optimization problems with nonlinear functional constraints are ubiquitous in signal processing applications including constrained least-squares, set-membership adaptive filtering, and trajectory optimization under uncertain fields. The presence of non-linear functional constraints renders the traditional projected stochastic gradient descent and related projection-based methods inefficient, and motivates the use of first-order methods. However, existing first-order methods, including primal and primal--dual algorithms, typically rely on a bounded (sub-)gradient assumption, w","authors_text":"Ketan Rajawat, Panchajanya Sanyal, Srujan Teja Thomdapu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-25T11:00:22Z","title":"Stochastic Sequential Quadratic Programming for Optimization with Functional Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.20178","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:c00fac47f84e3f6e12cee3d0c474615fdb454a9020a8fd51eade2517d3b8faa9","target":"record","created_at":"2026-07-24T01:23:02Z","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":"88c701a0a91b709b87aa958909d1fe04a05e85eb7bc28674b93df76f93587d89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-25T11:00:22Z","title_canon_sha256":"0a31ed00cb67210d13bed90a13d104d8bb87b64e6a8df18d0dc3a131d1053dfe"},"schema_version":"1.0","source":{"id":"2511.20178","kind":"arxiv","version":3}},"canonical_sha256":"a3b9e7ab22d6c3b32363fe2e99993f59119a6ae642ab0d9119c281a1d704ff13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3b9e7ab22d6c3b32363fe2e99993f59119a6ae642ab0d9119c281a1d704ff13","first_computed_at":"2026-07-24T01:23:02.103779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-24T01:23:02.103779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"unOVIxFqSaTVRWXV+mCbQ+pRDYiJ29yTxzaHu2wCd0eItt/jFBO+k53AqIIrR9EdfaQVEZ4wSim4KsAn2OnaAw==","signature_status":"signed_v1","signed_at":"2026-07-24T01:23:02.104803Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.20178","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c00fac47f84e3f6e12cee3d0c474615fdb454a9020a8fd51eade2517d3b8faa9","sha256:8a30ae640ca29bd60af2a0ad7fad640045b14c18c20d252d13864cda9a10fec2"],"state_sha256":"2f03076b38f552fbb353c749ea0395eaf665676ea7d95bc56f89676ff395d054"}