{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:73WSCFV27OJUXVZJ4D2S6APQLD","short_pith_number":"pith:73WSCFV2","schema_version":"1.0","canonical_sha256":"feed2116bafb934bd729e0f52f01f058e0429113735135fcde8d7f16558d4420","source":{"kind":"arxiv","id":"2304.14907","version":3},"attestation_state":"computed","paper":{"title":"A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Daniel P. Robinson, Frank E. Curtis, Qi Wang, Vyacheslav Kungurtsev","submitted_at":"2023-04-28T15:30:43Z","abstract_excerpt":"A stochastic-gradient-based interior-point algorithm for minimizing a continuously differentiable objective function (that may be nonconvex) subject to bound constraints is presented, analyzed, and demonstrated through experimental results. The algorithm is unique from other interior-point methods for solving smooth nonconvex optimization problems since the search directions are computed using stochastic gradient estimates. It is also unique in its use of inner neighborhoods of the feasible region -- defined by a positive and vanishing neighborhood-parameter sequence -- in which the iterates a"},"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":"2304.14907","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-04-28T15:30:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"dce65ab2d9aaa60969566edded32b723204d4ccb64f69c74ae7a508e26c35c40","abstract_canon_sha256":"127119c6ab7851d557a34bae4a8b3b03c1f9c2bd6065fe827b50429ce0e0a6b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:44.493889Z","signature_b64":"2ZN9MaJeMECZWX0o65TbshozAYxCLD8LuVuSZnmT/s9kwD09/V0qi4S0E+0/FfaRKfH1EA7KkNBXKhTp7htWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"feed2116bafb934bd729e0f52f01f058e0429113735135fcde8d7f16558d4420","last_reissued_at":"2026-07-05T07:55:44.493432Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:44.493432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Daniel P. Robinson, Frank E. Curtis, Qi Wang, Vyacheslav Kungurtsev","submitted_at":"2023-04-28T15:30:43Z","abstract_excerpt":"A stochastic-gradient-based interior-point algorithm for minimizing a continuously differentiable objective function (that may be nonconvex) subject to bound constraints is presented, analyzed, and demonstrated through experimental results. The algorithm is unique from other interior-point methods for solving smooth nonconvex optimization problems since the search directions are computed using stochastic gradient estimates. It is also unique in its use of inner neighborhoods of the feasible region -- defined by a positive and vanishing neighborhood-parameter sequence -- in which the iterates a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.14907","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.14907/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":"2304.14907","created_at":"2026-07-05T07:55:44.493491+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.14907v3","created_at":"2026-07-05T07:55:44.493491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.14907","created_at":"2026-07-05T07:55:44.493491+00:00"},{"alias_kind":"pith_short_12","alias_value":"73WSCFV27OJU","created_at":"2026-07-05T07:55:44.493491+00:00"},{"alias_kind":"pith_short_16","alias_value":"73WSCFV27OJUXVZJ","created_at":"2026-07-05T07:55:44.493491+00:00"},{"alias_kind":"pith_short_8","alias_value":"73WSCFV2","created_at":"2026-07-05T07:55:44.493491+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.19382","citing_title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/73WSCFV27OJUXVZJ4D2S6APQLD","json":"https://pith.science/pith/73WSCFV27OJUXVZJ4D2S6APQLD.json","graph_json":"https://pith.science/api/pith-number/73WSCFV27OJUXVZJ4D2S6APQLD/graph.json","events_json":"https://pith.science/api/pith-number/73WSCFV27OJUXVZJ4D2S6APQLD/events.json","paper":"https://pith.science/paper/73WSCFV2"},"agent_actions":{"view_html":"https://pith.science/pith/73WSCFV27OJUXVZJ4D2S6APQLD","download_json":"https://pith.science/pith/73WSCFV27OJUXVZJ4D2S6APQLD.json","view_paper":"https://pith.science/paper/73WSCFV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.14907&json=true","fetch_graph":"https://pith.science/api/pith-number/73WSCFV27OJUXVZJ4D2S6APQLD/graph.json","fetch_events":"https://pith.science/api/pith-number/73WSCFV27OJUXVZJ4D2S6APQLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73WSCFV27OJUXVZJ4D2S6APQLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73WSCFV27OJUXVZJ4D2S6APQLD/action/storage_attestation","attest_author":"https://pith.science/pith/73WSCFV27OJUXVZJ4D2S6APQLD/action/author_attestation","sign_citation":"https://pith.science/pith/73WSCFV27OJUXVZJ4D2S6APQLD/action/citation_signature","submit_replication":"https://pith.science/pith/73WSCFV27OJUXVZJ4D2S6APQLD/action/replication_record"}},"created_at":"2026-07-05T07:55:44.493491+00:00","updated_at":"2026-07-05T07:55:44.493491+00:00"}