{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QHX7CODMKLQXSTCK2OL6AKRCRF","short_pith_number":"pith:QHX7CODM","schema_version":"1.0","canonical_sha256":"81eff1386c52e1794c4ad397e02a2289483d9ceb11cf2bf140e17ce99e40b2ff","source":{"kind":"arxiv","id":"1901.09506","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.09506","created_at":"2026-05-17T23:40:23.717200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.09506v2","created_at":"2026-05-17T23:40:23.717200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09506","created_at":"2026-05-17T23:40:23.717200+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHX7CODMKLQX","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHX7CODMKLQXSTCK","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHX7CODM","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QHX7CODMKLQXSTCK2OL6AKRCRF","json":"https://pith.science/pith/QHX7CODMKLQXSTCK2OL6AKRCRF.json","graph_json":"https://pith.science/api/pith-number/QHX7CODMKLQXSTCK2OL6AKRCRF/graph.json","events_json":"https://pith.science/api/pith-number/QHX7CODMKLQXSTCK2OL6AKRCRF/events.json","paper":"https://pith.science/paper/QHX7CODM"},"agent_actions":{"view_html":"https://pith.science/pith/QHX7CODMKLQXSTCK2OL6AKRCRF","download_json":"https://pith.science/pith/QHX7CODMKLQXSTCK2OL6AKRCRF.json","view_paper":"https://pith.science/paper/QHX7CODM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.09506&json=true","fetch_graph":"https://pith.science/api/pith-number/QHX7CODMKLQXSTCK2OL6AKRCRF/graph.json","fetch_events":"https://pith.science/api/pith-number/QHX7CODMKLQXSTCK2OL6AKRCRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHX7CODMKLQXSTCK2OL6AKRCRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHX7CODMKLQXSTCK2OL6AKRCRF/action/storage_attestation","attest_author":"https://pith.science/pith/QHX7CODMKLQXSTCK2OL6AKRCRF/action/author_attestation","sign_citation":"https://pith.science/pith/QHX7CODMKLQXSTCK2OL6AKRCRF/action/citation_signature","submit_replication":"https://pith.science/pith/QHX7CODMKLQXSTCK2OL6AKRCRF/action/replication_record"}},"created_at":"2026-05-17T23:40:23.717200+00:00","updated_at":"2026-05-17T23:40:23.717200+00:00"}