{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:W5X5S5SQVX255QNAYFLFUY5JH6","short_pith_number":"pith:W5X5S5SQ","schema_version":"1.0","canonical_sha256":"b76fd97650adf5dec1a0c1565a63a93f87c99bd7baf47ef5dc9ddd73d777aabb","source":{"kind":"arxiv","id":"1703.09180","version":1},"attestation_state":"computed","paper":{"title":"Gradient Method With Inexact Oracle for Composite Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Pavel Dvurechensky","submitted_at":"2017-03-27T16:49:50Z","abstract_excerpt":"In this paper, we develop new first-order method for composite non-convex minimization problems with simple constraints and inexact oracle. The objective function is given as a sum of \"`hard\"', possibly non-convex part, and \"`simple\"' convex part. Informally speaking, oracle inexactness means that, for the \"`hard\"' part, at any point we can approximately calculate the value of the function and construct a quadratic function, which approximately bounds this function from above. We give several examples of such inexactness: smooth non-convex functions with inexact H\\\"older-continuous gradient, f"},"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":"1703.09180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-27T16:49:50Z","cross_cats_sorted":[],"title_canon_sha256":"335c55ab7b9355286bb7b124d908ced590ab9a710768ba7d9275374b15d7babb","abstract_canon_sha256":"1bda0954c4319c488f5c70b5e352b5f8b78bc31ed1279ad211db071454c2329f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:54.048954Z","signature_b64":"yS7f2jWWbsQpFYDnIivcbbiRID5YvZ+dsyOBfdFt+dxoF6TX/9RS5w/Bim/4eRAlXsaYEX0zboDle3lFQKgMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b76fd97650adf5dec1a0c1565a63a93f87c99bd7baf47ef5dc9ddd73d777aabb","last_reissued_at":"2026-05-18T00:47:54.048205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:54.048205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient Method With Inexact Oracle for Composite Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Pavel Dvurechensky","submitted_at":"2017-03-27T16:49:50Z","abstract_excerpt":"In this paper, we develop new first-order method for composite non-convex minimization problems with simple constraints and inexact oracle. The objective function is given as a sum of \"`hard\"', possibly non-convex part, and \"`simple\"' convex part. Informally speaking, oracle inexactness means that, for the \"`hard\"' part, at any point we can approximately calculate the value of the function and construct a quadratic function, which approximately bounds this function from above. We give several examples of such inexactness: smooth non-convex functions with inexact H\\\"older-continuous gradient, f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09180","kind":"arxiv","version":1},"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":"1703.09180","created_at":"2026-05-18T00:47:54.048331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.09180v1","created_at":"2026-05-18T00:47:54.048331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09180","created_at":"2026-05-18T00:47:54.048331+00:00"},{"alias_kind":"pith_short_12","alias_value":"W5X5S5SQVX25","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"W5X5S5SQVX255QNA","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"W5X5S5SQ","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08969","citing_title":"Distributed Inexact Successive Convex Approximation ADMM: Analysis-Part I","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W5X5S5SQVX255QNAYFLFUY5JH6","json":"https://pith.science/pith/W5X5S5SQVX255QNAYFLFUY5JH6.json","graph_json":"https://pith.science/api/pith-number/W5X5S5SQVX255QNAYFLFUY5JH6/graph.json","events_json":"https://pith.science/api/pith-number/W5X5S5SQVX255QNAYFLFUY5JH6/events.json","paper":"https://pith.science/paper/W5X5S5SQ"},"agent_actions":{"view_html":"https://pith.science/pith/W5X5S5SQVX255QNAYFLFUY5JH6","download_json":"https://pith.science/pith/W5X5S5SQVX255QNAYFLFUY5JH6.json","view_paper":"https://pith.science/paper/W5X5S5SQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.09180&json=true","fetch_graph":"https://pith.science/api/pith-number/W5X5S5SQVX255QNAYFLFUY5JH6/graph.json","fetch_events":"https://pith.science/api/pith-number/W5X5S5SQVX255QNAYFLFUY5JH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W5X5S5SQVX255QNAYFLFUY5JH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W5X5S5SQVX255QNAYFLFUY5JH6/action/storage_attestation","attest_author":"https://pith.science/pith/W5X5S5SQVX255QNAYFLFUY5JH6/action/author_attestation","sign_citation":"https://pith.science/pith/W5X5S5SQVX255QNAYFLFUY5JH6/action/citation_signature","submit_replication":"https://pith.science/pith/W5X5S5SQVX255QNAYFLFUY5JH6/action/replication_record"}},"created_at":"2026-05-18T00:47:54.048331+00:00","updated_at":"2026-05-18T00:47:54.048331+00:00"}