{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QHX7CODMKLQXSTCK2OL6AKRCRF","short_pith_number":"pith:QHX7CODM","canonical_record":{"source":{"id":"1901.09506","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-28T03:59:26Z","cross_cats_sorted":[],"title_canon_sha256":"150921cdb1b11a49670ef3f495d71bc40ce6b0a6fc42c23c07bda53dccd55430","abstract_canon_sha256":"7650148d8c5384ba16ce330603f041d69dfa20479add01924b7c15ae0384f552"},"schema_version":"1.0"},"canonical_sha256":"81eff1386c52e1794c4ad397e02a2289483d9ceb11cf2bf140e17ce99e40b2ff","source":{"kind":"arxiv","id":"1901.09506","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09506","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09506v2","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09506","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"pith_short_12","alias_value":"QHX7CODMKLQX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QHX7CODMKLQXSTCK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QHX7CODM","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QHX7CODMKLQXSTCK2OL6AKRCRF","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09506","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-28T03:59:26Z","cross_cats_sorted":[],"title_canon_sha256":"150921cdb1b11a49670ef3f495d71bc40ce6b0a6fc42c23c07bda53dccd55430","abstract_canon_sha256":"7650148d8c5384ba16ce330603f041d69dfa20479add01924b7c15ae0384f552"},"schema_version":"1.0"},"canonical_sha256":"81eff1386c52e1794c4ad397e02a2289483d9ceb11cf2bf140e17ce99e40b2ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:23.717815Z","signature_b64":"JTL6CJ1Nyi5T+Q3VayC5h1nRIS2SCSN90rar/Z3tO845cUxTCldq+kvWwzz7oeP9xsBXZ1DPnP9NICqURODKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81eff1386c52e1794c4ad397e02a2289483d9ceb11cf2bf140e17ce99e40b2ff","last_reissued_at":"2026-05-17T23:40:23.717081Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:23.717081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09506","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-17T23:40:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FpKWN3AnMOJow2RRU4mtYXYEbFjx56itKcnM1iGpQwmlthgYXACQGNkURgPi88DZ0mVa6FcOeAc60X6OudW9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:37:25.413238Z"},"content_sha256":"8b1a1e25580536b1ea3fae36aca641519cfa0b772489f0184d1f5ac3ac6a84bb","schema_version":"1.0","event_id":"sha256:8b1a1e25580536b1ea3fae36aca641519cfa0b772489f0184d1f5ac3ac6a84bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QHX7CODMKLQXSTCK2OL6AKRCRF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An iterative regularized mirror descent method for ill-posed nondifferentiable stochastic optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Farzad Yousefian, Mostafa Amini","submitted_at":"2019-01-28T03:59:26Z","abstract_excerpt":"A wide range of applications arising in machine learning and signal processing can be cast as convex optimization problems. These problems are often ill-posed, i.e., the optimal solution lacks a desired property such as uniqueness or sparsity. In the literature, to address ill-posedness, a bilevel optimization problem is considered where the goal is to find among optimal solutions of the inner level optimization problem, a solution that minimizes a secondary metric, i.e., the outer level objective function. In addressing the resulting bilevel model, the convergence analysis of most existing me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09506","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":""},"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-05-17T23:40:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/1LdcXjxeVOcTY7bDOpRWnASYyzNX1qsiqfVK/oCM6oZPoCaMPgCoSxDXAKFc7ese0VCo/vaGfkKcbc4WuMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:37:25.413607Z"},"content_sha256":"3229907fc47a1f75a5c0a8527c9b5c08b4f2b630db1af406e422115efdb937ba","schema_version":"1.0","event_id":"sha256:3229907fc47a1f75a5c0a8527c9b5c08b4f2b630db1af406e422115efdb937ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHX7CODMKLQXSTCK2OL6AKRCRF/bundle.json","state_url":"https://pith.science/pith/QHX7CODMKLQXSTCK2OL6AKRCRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHX7CODMKLQXSTCK2OL6AKRCRF/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-22T10:37:25Z","links":{"resolver":"https://pith.science/pith/QHX7CODMKLQXSTCK2OL6AKRCRF","bundle":"https://pith.science/pith/QHX7CODMKLQXSTCK2OL6AKRCRF/bundle.json","state":"https://pith.science/pith/QHX7CODMKLQXSTCK2OL6AKRCRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHX7CODMKLQXSTCK2OL6AKRCRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QHX7CODMKLQXSTCK2OL6AKRCRF","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":"7650148d8c5384ba16ce330603f041d69dfa20479add01924b7c15ae0384f552","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-28T03:59:26Z","title_canon_sha256":"150921cdb1b11a49670ef3f495d71bc40ce6b0a6fc42c23c07bda53dccd55430"},"schema_version":"1.0","source":{"id":"1901.09506","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09506","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09506v2","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09506","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"pith_short_12","alias_value":"QHX7CODMKLQX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QHX7CODMKLQXSTCK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QHX7CODM","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:3229907fc47a1f75a5c0a8527c9b5c08b4f2b630db1af406e422115efdb937ba","target":"graph","created_at":"2026-05-17T23:40:23Z","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"},"paper":{"abstract_excerpt":"A wide range of applications arising in machine learning and signal processing can be cast as convex optimization problems. These problems are often ill-posed, i.e., the optimal solution lacks a desired property such as uniqueness or sparsity. In the literature, to address ill-posedness, a bilevel optimization problem is considered where the goal is to find among optimal solutions of the inner level optimization problem, a solution that minimizes a secondary metric, i.e., the outer level objective function. In addressing the resulting bilevel model, the convergence analysis of most existing me","authors_text":"Farzad Yousefian, Mostafa Amini","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-28T03:59:26Z","title":"An iterative regularized mirror descent method for ill-posed nondifferentiable stochastic optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09506","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:8b1a1e25580536b1ea3fae36aca641519cfa0b772489f0184d1f5ac3ac6a84bb","target":"record","created_at":"2026-05-17T23:40:23Z","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":"7650148d8c5384ba16ce330603f041d69dfa20479add01924b7c15ae0384f552","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-28T03:59:26Z","title_canon_sha256":"150921cdb1b11a49670ef3f495d71bc40ce6b0a6fc42c23c07bda53dccd55430"},"schema_version":"1.0","source":{"id":"1901.09506","kind":"arxiv","version":2}},"canonical_sha256":"81eff1386c52e1794c4ad397e02a2289483d9ceb11cf2bf140e17ce99e40b2ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81eff1386c52e1794c4ad397e02a2289483d9ceb11cf2bf140e17ce99e40b2ff","first_computed_at":"2026-05-17T23:40:23.717081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:23.717081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JTL6CJ1Nyi5T+Q3VayC5h1nRIS2SCSN90rar/Z3tO845cUxTCldq+kvWwzz7oeP9xsBXZ1DPnP9NICqURODKBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:23.717815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09506","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b1a1e25580536b1ea3fae36aca641519cfa0b772489f0184d1f5ac3ac6a84bb","sha256:3229907fc47a1f75a5c0a8527c9b5c08b4f2b630db1af406e422115efdb937ba"],"state_sha256":"3f3a6c8fb3e1bb0b0766e32af8d286be9a00efa517288667a9e8b5b3c0863295"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kC0ZFRYsF1OoT0IEBt6M0ACpp81btlv34HNSbeQeYIbOh9sghg1LwPS8eRHFwlvcESIWHwzUN/Pv+3YQ5RkwDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T10:37:25.415658Z","bundle_sha256":"539cf698f5e020a6075fd36b252748a82f82eaca94dc571525aa9be900676c77"}}