{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W5X5S5SQVX255QNAYFLFUY5JH6","short_pith_number":"pith:W5X5S5SQ","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"},"canonical_sha256":"b76fd97650adf5dec1a0c1565a63a93f87c99bd7baf47ef5dc9ddd73d777aabb","source":{"kind":"arxiv","id":"1703.09180","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09180","created_at":"2026-05-18T00:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09180v1","created_at":"2026-05-18T00:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09180","created_at":"2026-05-18T00:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"W5X5S5SQVX25","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W5X5S5SQVX255QNA","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W5X5S5SQ","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W5X5S5SQVX255QNAYFLFUY5JH6","target":"record","payload":{"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"},"canonical_sha256":"b76fd97650adf5dec1a0c1565a63a93f87c99bd7baf47ef5dc9ddd73d777aabb","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"},"source_kind":"arxiv","source_id":"1703.09180","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"laUSJtjotfP2OFmQ44tFvQV4CbPq56jskSF+9FPqzjaVQwYb2Wbg3zbN76p63lPA0tnCOpD591mUluQEAMxJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:36:29.863904Z"},"content_sha256":"c691773e0606049bd902da26118cb3e2bb103af33f01782cfb91af1a49f04330","schema_version":"1.0","event_id":"sha256:c691773e0606049bd902da26118cb3e2bb103af33f01782cfb91af1a49f04330"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W5X5S5SQVX255QNAYFLFUY5JH6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4fPBNZ8lPZpbwVj8AJ6hlyriQyCsdxJLetp6LmK2Acg576ZY39QMGAsmC7eyx0GxxWLLKWSwzvG3g9m3EH0MAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:36:29.864243Z"},"content_sha256":"7a54bc70db32bd500426e0c3080dc46de0c5a4510b2aee914943365eb80c79c8","schema_version":"1.0","event_id":"sha256:7a54bc70db32bd500426e0c3080dc46de0c5a4510b2aee914943365eb80c79c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5X5S5SQVX255QNAYFLFUY5JH6/bundle.json","state_url":"https://pith.science/pith/W5X5S5SQVX255QNAYFLFUY5JH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5X5S5SQVX255QNAYFLFUY5JH6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T14:36:29Z","links":{"resolver":"https://pith.science/pith/W5X5S5SQVX255QNAYFLFUY5JH6","bundle":"https://pith.science/pith/W5X5S5SQVX255QNAYFLFUY5JH6/bundle.json","state":"https://pith.science/pith/W5X5S5SQVX255QNAYFLFUY5JH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5X5S5SQVX255QNAYFLFUY5JH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W5X5S5SQVX255QNAYFLFUY5JH6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1bda0954c4319c488f5c70b5e352b5f8b78bc31ed1279ad211db071454c2329f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-27T16:49:50Z","title_canon_sha256":"335c55ab7b9355286bb7b124d908ced590ab9a710768ba7d9275374b15d7babb"},"schema_version":"1.0","source":{"id":"1703.09180","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09180","created_at":"2026-05-18T00:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09180v1","created_at":"2026-05-18T00:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09180","created_at":"2026-05-18T00:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"W5X5S5SQVX25","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W5X5S5SQVX255QNA","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W5X5S5SQ","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:7a54bc70db32bd500426e0c3080dc46de0c5a4510b2aee914943365eb80c79c8","target":"graph","created_at":"2026-05-18T00:47:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Pavel Dvurechensky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-27T16:49:50Z","title":"Gradient Method With Inexact Oracle for Composite Non-Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09180","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c691773e0606049bd902da26118cb3e2bb103af33f01782cfb91af1a49f04330","target":"record","created_at":"2026-05-18T00:47:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1bda0954c4319c488f5c70b5e352b5f8b78bc31ed1279ad211db071454c2329f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-27T16:49:50Z","title_canon_sha256":"335c55ab7b9355286bb7b124d908ced590ab9a710768ba7d9275374b15d7babb"},"schema_version":"1.0","source":{"id":"1703.09180","kind":"arxiv","version":1}},"canonical_sha256":"b76fd97650adf5dec1a0c1565a63a93f87c99bd7baf47ef5dc9ddd73d777aabb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b76fd97650adf5dec1a0c1565a63a93f87c99bd7baf47ef5dc9ddd73d777aabb","first_computed_at":"2026-05-18T00:47:54.048205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:54.048205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yS7f2jWWbsQpFYDnIivcbbiRID5YvZ+dsyOBfdFt+dxoF6TX/9RS5w/Bim/4eRAlXsaYEX0zboDle3lFQKgMBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:54.048954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09180","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c691773e0606049bd902da26118cb3e2bb103af33f01782cfb91af1a49f04330","sha256:7a54bc70db32bd500426e0c3080dc46de0c5a4510b2aee914943365eb80c79c8"],"state_sha256":"5ba62adab8f179b21c9b42113a5ab2c19ebb2b2cb223c395903e54c44d894270"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZmmaVq8HBZoL0jrrofz6xniR0NmR8pzBuYrQmDfXNbspWCUyR26vXP9kqEnds4p3ZNZt0wlcGrxSgk0rQjmEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T14:36:29.866138Z","bundle_sha256":"b3e194068e74ef0e99eb8ab85fca80379936315d744ec2d11d3372152d7788b9"}}