{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4QCUJHSNNXNNUCBKDFA6VGJJPG","short_pith_number":"pith:4QCUJHSN","schema_version":"1.0","canonical_sha256":"e405449e4d6ddada082a1941ea99297996db26d5231f3a1f9ce8581dd020e231","source":{"kind":"arxiv","id":"1808.03895","version":4},"attestation_state":"computed","paper":{"title":"The Stochastic Fej\\'er-Monotone Hybrid Steepest Descent Method and the Hierarchical RLS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Konstantinos Slavakis","submitted_at":"2018-08-12T05:48:55Z","abstract_excerpt":"This paper introduces the stochastic Fej\\'{e}r-monotone hybrid steepest descent method (S-FM-HSDM) to solve affinely constrained and composite convex minimization tasks. The minimization task is not known exactly; noise contaminates the information about the composite loss function and the affine constraints. S-FM-HSDM generates sequences of random variables that, under certain conditions and with respect to a probability space, converge point-wise to solutions of the noiseless minimization task. S-FM-HSDM enjoys desirable attributes of optimization techniques such as splitting of variables an"},"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":"1808.03895","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-12T05:48:55Z","cross_cats_sorted":[],"title_canon_sha256":"d4cf144ae41290ad8326a4567b60c5da08fab45561aef3871a3ca04c3860641d","abstract_canon_sha256":"d2682930917ebf57ed4b7d4058c665d888e78e0af8b2a42e901c7117b532b914"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:37.187024Z","signature_b64":"CrvBvAFphf5avUcILkY5kwwsmjmCXlsFhb5i3gxKtjLfN2DrIfpbppD0YuwOOJ6XsGz63Ztbq4N8WHFQbOUfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e405449e4d6ddada082a1941ea99297996db26d5231f3a1f9ce8581dd020e231","last_reissued_at":"2026-05-17T23:45:37.186406Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:37.186406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Stochastic Fej\\'er-Monotone Hybrid Steepest Descent Method and the Hierarchical RLS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Konstantinos Slavakis","submitted_at":"2018-08-12T05:48:55Z","abstract_excerpt":"This paper introduces the stochastic Fej\\'{e}r-monotone hybrid steepest descent method (S-FM-HSDM) to solve affinely constrained and composite convex minimization tasks. The minimization task is not known exactly; noise contaminates the information about the composite loss function and the affine constraints. S-FM-HSDM generates sequences of random variables that, under certain conditions and with respect to a probability space, converge point-wise to solutions of the noiseless minimization task. S-FM-HSDM enjoys desirable attributes of optimization techniques such as splitting of variables an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03895","kind":"arxiv","version":4},"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":"1808.03895","created_at":"2026-05-17T23:45:37.186513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03895v4","created_at":"2026-05-17T23:45:37.186513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03895","created_at":"2026-05-17T23:45:37.186513+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QCUJHSNNXNN","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QCUJHSNNXNNUCBK","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QCUJHSN","created_at":"2026-05-18T12:32:05.422762+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/4QCUJHSNNXNNUCBKDFA6VGJJPG","json":"https://pith.science/pith/4QCUJHSNNXNNUCBKDFA6VGJJPG.json","graph_json":"https://pith.science/api/pith-number/4QCUJHSNNXNNUCBKDFA6VGJJPG/graph.json","events_json":"https://pith.science/api/pith-number/4QCUJHSNNXNNUCBKDFA6VGJJPG/events.json","paper":"https://pith.science/paper/4QCUJHSN"},"agent_actions":{"view_html":"https://pith.science/pith/4QCUJHSNNXNNUCBKDFA6VGJJPG","download_json":"https://pith.science/pith/4QCUJHSNNXNNUCBKDFA6VGJJPG.json","view_paper":"https://pith.science/paper/4QCUJHSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03895&json=true","fetch_graph":"https://pith.science/api/pith-number/4QCUJHSNNXNNUCBKDFA6VGJJPG/graph.json","fetch_events":"https://pith.science/api/pith-number/4QCUJHSNNXNNUCBKDFA6VGJJPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QCUJHSNNXNNUCBKDFA6VGJJPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QCUJHSNNXNNUCBKDFA6VGJJPG/action/storage_attestation","attest_author":"https://pith.science/pith/4QCUJHSNNXNNUCBKDFA6VGJJPG/action/author_attestation","sign_citation":"https://pith.science/pith/4QCUJHSNNXNNUCBKDFA6VGJJPG/action/citation_signature","submit_replication":"https://pith.science/pith/4QCUJHSNNXNNUCBKDFA6VGJJPG/action/replication_record"}},"created_at":"2026-05-17T23:45:37.186513+00:00","updated_at":"2026-05-17T23:45:37.186513+00:00"}