{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZGIUHFASFL5PNWBEB25L36NUU7","short_pith_number":"pith:ZGIUHFAS","canonical_record":{"source":{"id":"2607.22551","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T11:05:09Z","cross_cats_sorted":[],"title_canon_sha256":"5bb09cb7dc57109f636cc5badf3cb19c5edb72c4ec262764be3058152a433bf5","abstract_canon_sha256":"03ef9c8012ea0a5488ae524deab055964aa9ef36bd70a949197aacd6071b88e5"},"schema_version":"1.0"},"canonical_sha256":"c9914394122afaf6d8240ebabdf9b4a7e934a5962ef3e0c8166d1deaa1283851","source":{"kind":"arxiv","id":"2607.22551","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.22551","created_at":"2026-07-28T00:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"2607.22551v1","created_at":"2026-07-28T00:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.22551","created_at":"2026-07-28T00:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZGIUHFASFL5P","created_at":"2026-07-28T00:21:41Z"},{"alias_kind":"pith_short_16","alias_value":"ZGIUHFASFL5PNWBE","created_at":"2026-07-28T00:21:41Z"},{"alias_kind":"pith_short_8","alias_value":"ZGIUHFAS","created_at":"2026-07-28T00:21:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZGIUHFASFL5PNWBEB25L36NUU7","target":"record","payload":{"canonical_record":{"source":{"id":"2607.22551","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T11:05:09Z","cross_cats_sorted":[],"title_canon_sha256":"5bb09cb7dc57109f636cc5badf3cb19c5edb72c4ec262764be3058152a433bf5","abstract_canon_sha256":"03ef9c8012ea0a5488ae524deab055964aa9ef36bd70a949197aacd6071b88e5"},"schema_version":"1.0"},"canonical_sha256":"c9914394122afaf6d8240ebabdf9b4a7e934a5962ef3e0c8166d1deaa1283851","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T00:21:41.762451Z","signature_b64":"mqBQAr0GxraUca/oCj3z9CABngBhodgYWT/GDkIKEdsP0RGxN7g+3DerQHM0K7CmPLTtikNYwE7IbLm2w6PZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9914394122afaf6d8240ebabdf9b4a7e934a5962ef3e0c8166d1deaa1283851","last_reissued_at":"2026-07-28T00:21:41.761409Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T00:21:41.761409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.22551","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-07-28T00:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YqQirGtatyuAMiarHRahwpOaf7rs86i1gECps/SXuY6axbq20iiL38jpT2kVED+PhB4wIzyaB7l8+zSQlYeAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:05:55.030544Z"},"content_sha256":"1588f3ebb38e95dc8ec0642a50af6a74e5d2be26cdb3c296242e23662b5d3566","schema_version":"1.0","event_id":"sha256:1588f3ebb38e95dc8ec0642a50af6a74e5d2be26cdb3c296242e23662b5d3566"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZGIUHFASFL5PNWBEB25L36NUU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mohammad Alkousa","submitted_at":"2026-05-14T11:05:09Z","abstract_excerpt":"In this paper, we consider constraint optimization problems subject to non-smooth convex functional (inequality-type) constraints, wherein the objective function is non-smooth and quasar convex. We propose and analyze two groups of algorithms, each consisting of a standard version and a modified variant, that operate by switching between two types of iteration points: productive and non-productive. Within each group, we develop distinct mirror descent-type algorithms for both deterministic and stochastic settings, and we establish their convergence rates."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.22551","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.22551/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-07-28T00:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nCcWNefpTWuOlBwPNL2j4nL9RaDKVKEH3bJflAunDGG2NHzGc/tJe+e9MyE42gd/TPcwAgasy+2xN0MbpJPYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:05:55.031392Z"},"content_sha256":"a971eb17059327dab4992387ded5a6b398fe5c94f036cfc81b7fd8463dc02beb","schema_version":"1.0","event_id":"sha256:a971eb17059327dab4992387ded5a6b398fe5c94f036cfc81b7fd8463dc02beb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGIUHFASFL5PNWBEB25L36NUU7/bundle.json","state_url":"https://pith.science/pith/ZGIUHFASFL5PNWBEB25L36NUU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGIUHFASFL5PNWBEB25L36NUU7/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-08-04T17:05:55Z","links":{"resolver":"https://pith.science/pith/ZGIUHFASFL5PNWBEB25L36NUU7","bundle":"https://pith.science/pith/ZGIUHFASFL5PNWBEB25L36NUU7/bundle.json","state":"https://pith.science/pith/ZGIUHFASFL5PNWBEB25L36NUU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGIUHFASFL5PNWBEB25L36NUU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZGIUHFASFL5PNWBEB25L36NUU7","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":"03ef9c8012ea0a5488ae524deab055964aa9ef36bd70a949197aacd6071b88e5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T11:05:09Z","title_canon_sha256":"5bb09cb7dc57109f636cc5badf3cb19c5edb72c4ec262764be3058152a433bf5"},"schema_version":"1.0","source":{"id":"2607.22551","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.22551","created_at":"2026-07-28T00:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"2607.22551v1","created_at":"2026-07-28T00:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.22551","created_at":"2026-07-28T00:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZGIUHFASFL5P","created_at":"2026-07-28T00:21:41Z"},{"alias_kind":"pith_short_16","alias_value":"ZGIUHFASFL5PNWBE","created_at":"2026-07-28T00:21:41Z"},{"alias_kind":"pith_short_8","alias_value":"ZGIUHFAS","created_at":"2026-07-28T00:21:41Z"}],"graph_snapshots":[{"event_id":"sha256:a971eb17059327dab4992387ded5a6b398fe5c94f036cfc81b7fd8463dc02beb","target":"graph","created_at":"2026-07-28T00:21:41Z","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/2607.22551/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider constraint optimization problems subject to non-smooth convex functional (inequality-type) constraints, wherein the objective function is non-smooth and quasar convex. We propose and analyze two groups of algorithms, each consisting of a standard version and a modified variant, that operate by switching between two types of iteration points: productive and non-productive. Within each group, we develop distinct mirror descent-type algorithms for both deterministic and stochastic settings, and we establish their convergence rates.","authors_text":"Mohammad Alkousa","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T11:05:09Z","title":"Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.22551","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:1588f3ebb38e95dc8ec0642a50af6a74e5d2be26cdb3c296242e23662b5d3566","target":"record","created_at":"2026-07-28T00:21:41Z","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":"03ef9c8012ea0a5488ae524deab055964aa9ef36bd70a949197aacd6071b88e5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T11:05:09Z","title_canon_sha256":"5bb09cb7dc57109f636cc5badf3cb19c5edb72c4ec262764be3058152a433bf5"},"schema_version":"1.0","source":{"id":"2607.22551","kind":"arxiv","version":1}},"canonical_sha256":"c9914394122afaf6d8240ebabdf9b4a7e934a5962ef3e0c8166d1deaa1283851","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9914394122afaf6d8240ebabdf9b4a7e934a5962ef3e0c8166d1deaa1283851","first_computed_at":"2026-07-28T00:21:41.761409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-28T00:21:41.761409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mqBQAr0GxraUca/oCj3z9CABngBhodgYWT/GDkIKEdsP0RGxN7g+3DerQHM0K7CmPLTtikNYwE7IbLm2w6PZCQ==","signature_status":"signed_v1","signed_at":"2026-07-28T00:21:41.762451Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.22551","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1588f3ebb38e95dc8ec0642a50af6a74e5d2be26cdb3c296242e23662b5d3566","sha256:a971eb17059327dab4992387ded5a6b398fe5c94f036cfc81b7fd8463dc02beb"],"state_sha256":"b055b562344a6bbf61c61ebcac9dbccc8ebe90d8f02e4dd31e0dd006ff3ce735"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tlS2msP2SwvBY1SqTVl2kqhg+Wnc0jBBTL+SoVzauZ8JULeRvuxsCXmlrVIqTuLtl0E+625IU+xkMYIUkSq1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T17:05:55.036804Z","bundle_sha256":"4d4660e3dd28f49b6a3fa95af6da4399b2e18f13c65af8d818bbab360ef0c3b7"}}