{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EQ4EYDFEWV3PMGLPGB7IJHVKGA","short_pith_number":"pith:EQ4EYDFE","canonical_record":{"source":{"id":"1906.11580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-27T12:09:58Z","cross_cats_sorted":[],"title_canon_sha256":"7094e2b52a8c4aa9b6b121d311e72164903bb07e846f835c037fccfcf78ca90f","abstract_canon_sha256":"9a8d87306a62b0c872f30e6b6bc22a38591267c6e44ef1423a07347d4988d119"},"schema_version":"1.0"},"canonical_sha256":"24384c0ca4b576f6196f307e849eaa3007210ce6b7cc7170d7ca586dd6424c7d","source":{"kind":"arxiv","id":"1906.11580","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11580","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11580v1","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11580","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"pith_short_12","alias_value":"EQ4EYDFEWV3P","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EQ4EYDFEWV3PMGLP","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EQ4EYDFE","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EQ4EYDFEWV3PMGLPGB7IJHVKGA","target":"record","payload":{"canonical_record":{"source":{"id":"1906.11580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-27T12:09:58Z","cross_cats_sorted":[],"title_canon_sha256":"7094e2b52a8c4aa9b6b121d311e72164903bb07e846f835c037fccfcf78ca90f","abstract_canon_sha256":"9a8d87306a62b0c872f30e6b6bc22a38591267c6e44ef1423a07347d4988d119"},"schema_version":"1.0"},"canonical_sha256":"24384c0ca4b576f6196f307e849eaa3007210ce6b7cc7170d7ca586dd6424c7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:04.401506Z","signature_b64":"+qqe6ycKKXu1X5d7tEQ0LGmJNXBivcqyyquksUllLAEtAaC+wb/FRqhu1eM7vm1QKPOZcBlk7vjzw9WVRJhWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24384c0ca4b576f6196f307e849eaa3007210ce6b7cc7170d7ca586dd6424c7d","last_reissued_at":"2026-05-17T23:42:04.400921Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:04.400921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.11580","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-17T23:42:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V+KDUUUxPvDoDnhxmYh9ZJ56NCbXb/GD8/5Z9nazQZl1SmiVlgPLM6hWw1jntJDx/8NpHVk+K7FFMLdO6XKJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:44:45.943769Z"},"content_sha256":"d7b60f8d6d79128245e3e63d6717fb8e81c6fc092ce9a889e9222964b7156f78","schema_version":"1.0","event_id":"sha256:d7b60f8d6d79128245e3e63d6717fb8e81c6fc092ce9a889e9222964b7156f78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EQ4EYDFEWV3PMGLPGB7IJHVKGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient projection and conditional gradient methods for constrained nonconvex minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrey Tremba, Boris Polyak, Maxim Balashov","submitted_at":"2019-06-27T12:09:58Z","abstract_excerpt":"Minimization of a smooth function on a sphere or, more generally, on a smooth manifold, is the simplest non-convex optimization problem. It has a lot of applications. Our goal is to propose a version of the gradient projection algorithm for its solution and to obtain results that guarantee convergence of the algorithm under some minimal natural assumptions. We use the Lezanski-Polyak-Lojasiewicz condition on a manifold to prove the global linear convergence of the algorithm. Another method well fitted for the problem is the conditional gradient (Frank-Wolfe) algorithm. We examine some conditio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11580","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-17T23:42:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vSk4s4pblIiuIf46UL5Ux82R9/OCb3db9Lj1W4UUOl9msu3WknVW4Abq12nd68efwG57VJp9RRrerwGQiPUhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:44:45.944454Z"},"content_sha256":"a323b00c8178f8176660e156b9da7738e197000559665aa3130f6d00f89df1ba","schema_version":"1.0","event_id":"sha256:a323b00c8178f8176660e156b9da7738e197000559665aa3130f6d00f89df1ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA/bundle.json","state_url":"https://pith.science/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA/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-11T01:44:45Z","links":{"resolver":"https://pith.science/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA","bundle":"https://pith.science/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA/bundle.json","state":"https://pith.science/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQ4EYDFEWV3PMGLPGB7IJHVKGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EQ4EYDFEWV3PMGLPGB7IJHVKGA","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":"9a8d87306a62b0c872f30e6b6bc22a38591267c6e44ef1423a07347d4988d119","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-27T12:09:58Z","title_canon_sha256":"7094e2b52a8c4aa9b6b121d311e72164903bb07e846f835c037fccfcf78ca90f"},"schema_version":"1.0","source":{"id":"1906.11580","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11580","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11580v1","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11580","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"pith_short_12","alias_value":"EQ4EYDFEWV3P","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EQ4EYDFEWV3PMGLP","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EQ4EYDFE","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:a323b00c8178f8176660e156b9da7738e197000559665aa3130f6d00f89df1ba","target":"graph","created_at":"2026-05-17T23:42:04Z","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":"Minimization of a smooth function on a sphere or, more generally, on a smooth manifold, is the simplest non-convex optimization problem. It has a lot of applications. Our goal is to propose a version of the gradient projection algorithm for its solution and to obtain results that guarantee convergence of the algorithm under some minimal natural assumptions. We use the Lezanski-Polyak-Lojasiewicz condition on a manifold to prove the global linear convergence of the algorithm. Another method well fitted for the problem is the conditional gradient (Frank-Wolfe) algorithm. We examine some conditio","authors_text":"Andrey Tremba, Boris Polyak, Maxim Balashov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-27T12:09:58Z","title":"Gradient projection and conditional gradient methods for constrained nonconvex minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11580","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:d7b60f8d6d79128245e3e63d6717fb8e81c6fc092ce9a889e9222964b7156f78","target":"record","created_at":"2026-05-17T23:42:04Z","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":"9a8d87306a62b0c872f30e6b6bc22a38591267c6e44ef1423a07347d4988d119","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-27T12:09:58Z","title_canon_sha256":"7094e2b52a8c4aa9b6b121d311e72164903bb07e846f835c037fccfcf78ca90f"},"schema_version":"1.0","source":{"id":"1906.11580","kind":"arxiv","version":1}},"canonical_sha256":"24384c0ca4b576f6196f307e849eaa3007210ce6b7cc7170d7ca586dd6424c7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24384c0ca4b576f6196f307e849eaa3007210ce6b7cc7170d7ca586dd6424c7d","first_computed_at":"2026-05-17T23:42:04.400921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:04.400921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+qqe6ycKKXu1X5d7tEQ0LGmJNXBivcqyyquksUllLAEtAaC+wb/FRqhu1eM7vm1QKPOZcBlk7vjzw9WVRJhWDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:04.401506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.11580","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7b60f8d6d79128245e3e63d6717fb8e81c6fc092ce9a889e9222964b7156f78","sha256:a323b00c8178f8176660e156b9da7738e197000559665aa3130f6d00f89df1ba"],"state_sha256":"60f1b4f60c6f1e5879916b11c7612d6532e841b4a6a91da652013dfa7c154b8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZU2x7vtCtF+olT7TMqy6eP5YbsAas0nkw1zSDTEjwRj0hrsdLxt/xDpcJ0LGK/ftF+LJNLuU1j9t2XBGT5fBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:44:45.948049Z","bundle_sha256":"1bec01d2309c347fc9a63d365cc32e92382c91d95068127261b45cbfae5a9a63"}}