{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WRGUSB5MWEDD2BN7QYZV7IPAWE","short_pith_number":"pith:WRGUSB5M","schema_version":"1.0","canonical_sha256":"b44d4907acb1063d05bf86335fa1e0b11de9beea63b2202c51ddea5786312854","source":{"kind":"arxiv","id":"1712.10277","version":3},"attestation_state":"computed","paper":{"title":"A Stochastic Trust Region Algorithm Based on Careful Step Normalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Frank E. Curtis, Katya Scheinberg, Rui Shi","submitted_at":"2017-12-29T16:59:25Z","abstract_excerpt":"An algorithm is proposed for solving stochastic and finite sum minimization problems. Based on a trust region methodology, the algorithm employs normalized steps, at least as long as the norms of the stochastic gradient estimates are within a specified interval. The complete algorithm---which dynamically chooses whether or not to employ normalized steps---is proved to have convergence guarantees that are similar to those possessed by a traditional stochastic gradient approach under various sets of conditions related to the accuracy of the stochastic gradient estimates and choice of stepsize se"},"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":"1712.10277","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-29T16:59:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9226ebacb71dff3995af91ce95a94883d4145aa1bb0f9d2f729fa79f661a04df","abstract_canon_sha256":"08da88572ad7352af1f308fce286862a3544792a0d1efb19635419672943c2ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:18.676719Z","signature_b64":"g8mdW8TRzAZ2l72bfFMeH/BFMr7NA/EV69EWT+CYUFhNxhhsPq5chHCySEPyjRs7+hJCCZbStblA5Cj/rqqmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b44d4907acb1063d05bf86335fa1e0b11de9beea63b2202c51ddea5786312854","last_reissued_at":"2026-05-18T00:12:18.675948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:18.675948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Stochastic Trust Region Algorithm Based on Careful Step Normalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Frank E. Curtis, Katya Scheinberg, Rui Shi","submitted_at":"2017-12-29T16:59:25Z","abstract_excerpt":"An algorithm is proposed for solving stochastic and finite sum minimization problems. Based on a trust region methodology, the algorithm employs normalized steps, at least as long as the norms of the stochastic gradient estimates are within a specified interval. The complete algorithm---which dynamically chooses whether or not to employ normalized steps---is proved to have convergence guarantees that are similar to those possessed by a traditional stochastic gradient approach under various sets of conditions related to the accuracy of the stochastic gradient estimates and choice of stepsize se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10277","kind":"arxiv","version":3},"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":"1712.10277","created_at":"2026-05-18T00:12:18.676071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.10277v3","created_at":"2026-05-18T00:12:18.676071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10277","created_at":"2026-05-18T00:12:18.676071+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRGUSB5MWEDD","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRGUSB5MWEDD2BN7","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRGUSB5M","created_at":"2026-05-18T12:31:53.515858+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/WRGUSB5MWEDD2BN7QYZV7IPAWE","json":"https://pith.science/pith/WRGUSB5MWEDD2BN7QYZV7IPAWE.json","graph_json":"https://pith.science/api/pith-number/WRGUSB5MWEDD2BN7QYZV7IPAWE/graph.json","events_json":"https://pith.science/api/pith-number/WRGUSB5MWEDD2BN7QYZV7IPAWE/events.json","paper":"https://pith.science/paper/WRGUSB5M"},"agent_actions":{"view_html":"https://pith.science/pith/WRGUSB5MWEDD2BN7QYZV7IPAWE","download_json":"https://pith.science/pith/WRGUSB5MWEDD2BN7QYZV7IPAWE.json","view_paper":"https://pith.science/paper/WRGUSB5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.10277&json=true","fetch_graph":"https://pith.science/api/pith-number/WRGUSB5MWEDD2BN7QYZV7IPAWE/graph.json","fetch_events":"https://pith.science/api/pith-number/WRGUSB5MWEDD2BN7QYZV7IPAWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRGUSB5MWEDD2BN7QYZV7IPAWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRGUSB5MWEDD2BN7QYZV7IPAWE/action/storage_attestation","attest_author":"https://pith.science/pith/WRGUSB5MWEDD2BN7QYZV7IPAWE/action/author_attestation","sign_citation":"https://pith.science/pith/WRGUSB5MWEDD2BN7QYZV7IPAWE/action/citation_signature","submit_replication":"https://pith.science/pith/WRGUSB5MWEDD2BN7QYZV7IPAWE/action/replication_record"}},"created_at":"2026-05-18T00:12:18.676071+00:00","updated_at":"2026-05-18T00:12:18.676071+00:00"}