{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6UUDLCCFQVT7SYOQGLJ6LRXC3T","short_pith_number":"pith:6UUDLCCF","schema_version":"1.0","canonical_sha256":"f5283588458567f961d032d3e5c6e2dce1f34b0a0249d5ea2b9986278e9241b2","source":{"kind":"arxiv","id":"2412.12180","version":2},"attestation_state":"computed","paper":{"title":"Fully stochastic trust-region methods with Barzilai-Borwein steplengths","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Benedetta Morini, Mahsa Yousefi, Stefania Bellavia","submitted_at":"2024-12-13T08:22:07Z","abstract_excerpt":"We investigate stochastic gradient methods and stochastic counterparts of the Barzilai-Borwein steplengths and their application to finite-sum minimization problems. Our proposal is based on the Trust-Region-ish (TRish) framework introduced in [F. E. Curtis, K. Scheinberg, R. Shi, {\\it A stochastic trust region algorithm based on careful step normalization}, Informs Journal on Optimization, 1, 2019]. The new framework, named TRishBB, aims to enhance the performance of TRish and at reducing the computational cost of the second-order TRish variant. We propose three different methods belonging to"},"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":"2412.12180","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-13T08:22:07Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"dc6f77d724dc4ded2d2adef00ac5e2ea2849a52e2e8ec8f8cbe8c3171f8dd00c","abstract_canon_sha256":"03db9a2c84e0f377c0d229060d0c5a8733e22cb5ea69e442d130ee19ecccf282"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:54.824612Z","signature_b64":"HmUqZWYPVNKxSR+h0GMfSWOSPRz1/Yv4w+8qAtYWw/AhJ+Svb8rVOL13HiMr+jl5Is827BPVo7AM88UuXjZRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5283588458567f961d032d3e5c6e2dce1f34b0a0249d5ea2b9986278e9241b2","last_reissued_at":"2026-07-05T11:45:54.824047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:54.824047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully stochastic trust-region methods with Barzilai-Borwein steplengths","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Benedetta Morini, Mahsa Yousefi, Stefania Bellavia","submitted_at":"2024-12-13T08:22:07Z","abstract_excerpt":"We investigate stochastic gradient methods and stochastic counterparts of the Barzilai-Borwein steplengths and their application to finite-sum minimization problems. Our proposal is based on the Trust-Region-ish (TRish) framework introduced in [F. E. Curtis, K. Scheinberg, R. Shi, {\\it A stochastic trust region algorithm based on careful step normalization}, Informs Journal on Optimization, 1, 2019]. The new framework, named TRishBB, aims to enhance the performance of TRish and at reducing the computational cost of the second-order TRish variant. We propose three different methods belonging to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12180","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.12180/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.12180","created_at":"2026-07-05T11:45:54.824107+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.12180v2","created_at":"2026-07-05T11:45:54.824107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12180","created_at":"2026-07-05T11:45:54.824107+00:00"},{"alias_kind":"pith_short_12","alias_value":"6UUDLCCFQVT7","created_at":"2026-07-05T11:45:54.824107+00:00"},{"alias_kind":"pith_short_16","alias_value":"6UUDLCCFQVT7SYOQ","created_at":"2026-07-05T11:45:54.824107+00:00"},{"alias_kind":"pith_short_8","alias_value":"6UUDLCCF","created_at":"2026-07-05T11:45:54.824107+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.06374","citing_title":"Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6UUDLCCFQVT7SYOQGLJ6LRXC3T","json":"https://pith.science/pith/6UUDLCCFQVT7SYOQGLJ6LRXC3T.json","graph_json":"https://pith.science/api/pith-number/6UUDLCCFQVT7SYOQGLJ6LRXC3T/graph.json","events_json":"https://pith.science/api/pith-number/6UUDLCCFQVT7SYOQGLJ6LRXC3T/events.json","paper":"https://pith.science/paper/6UUDLCCF"},"agent_actions":{"view_html":"https://pith.science/pith/6UUDLCCFQVT7SYOQGLJ6LRXC3T","download_json":"https://pith.science/pith/6UUDLCCFQVT7SYOQGLJ6LRXC3T.json","view_paper":"https://pith.science/paper/6UUDLCCF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.12180&json=true","fetch_graph":"https://pith.science/api/pith-number/6UUDLCCFQVT7SYOQGLJ6LRXC3T/graph.json","fetch_events":"https://pith.science/api/pith-number/6UUDLCCFQVT7SYOQGLJ6LRXC3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6UUDLCCFQVT7SYOQGLJ6LRXC3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6UUDLCCFQVT7SYOQGLJ6LRXC3T/action/storage_attestation","attest_author":"https://pith.science/pith/6UUDLCCFQVT7SYOQGLJ6LRXC3T/action/author_attestation","sign_citation":"https://pith.science/pith/6UUDLCCFQVT7SYOQGLJ6LRXC3T/action/citation_signature","submit_replication":"https://pith.science/pith/6UUDLCCFQVT7SYOQGLJ6LRXC3T/action/replication_record"}},"created_at":"2026-07-05T11:45:54.824107+00:00","updated_at":"2026-07-05T11:45:54.824107+00:00"}