{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OAAKEZV3WGWAC6YQHGTAUT7LFJ","short_pith_number":"pith:OAAKEZV3","canonical_record":{"source":{"id":"1901.08087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-23T19:14:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"69a5e28fc4c8c6e5fca8b126e71ca031e0ac3d13e116fcf5d41c37b8f034e581","abstract_canon_sha256":"a90630ccb2838438ae77c63957a54e1cce59f44c17201308b17496d325919003"},"schema_version":"1.0"},"canonical_sha256":"7000a266bbb1ac017b1039a60a4feb2a5645defc9d4c9691fc4795c3f3c602cd","source":{"kind":"arxiv","id":"1901.08087","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08087","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08087v1","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08087","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"OAAKEZV3WGWA","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OAAKEZV3WGWAC6YQ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OAAKEZV3","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OAAKEZV3WGWAC6YQHGTAUT7LFJ","target":"record","payload":{"canonical_record":{"source":{"id":"1901.08087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-23T19:14:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"69a5e28fc4c8c6e5fca8b126e71ca031e0ac3d13e116fcf5d41c37b8f034e581","abstract_canon_sha256":"a90630ccb2838438ae77c63957a54e1cce59f44c17201308b17496d325919003"},"schema_version":"1.0"},"canonical_sha256":"7000a266bbb1ac017b1039a60a4feb2a5645defc9d4c9691fc4795c3f3c602cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:37.927972Z","signature_b64":"SC10J9pBlWhOYkpCaA2yZNZyT2qPBgV9OLyvKDHOU0n7FzVfUJPZQKiyoFJdDWz1ayPBk1TJCbApU4Ubhfi+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7000a266bbb1ac017b1039a60a4feb2a5645defc9d4c9691fc4795c3f3c602cd","last_reissued_at":"2026-05-17T23:55:37.927491Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:37.927491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.08087","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:55:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ui6LuCsm4t80yrP4055fNJUbRmq9Y5aithjbSM/jxpRWBN6g+DXKRIMg9qnLsVD6LGoxgEifNZ29FB3eI90fDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:45:17.306991Z"},"content_sha256":"336802a5a456f275bb06a47497f5788726976ddf6c2aca6a4324459f12f8d01c","schema_version":"1.0","event_id":"sha256:336802a5a456f275bb06a47497f5788726976ddf6c2aca6a4324459f12f8d01c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OAAKEZV3WGWAC6YQHGTAUT7LFJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model Function Based Conditional Gradient Method with Armijo-like Line Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Peter Ochs, Yura Malitsky","submitted_at":"2019-01-23T19:14:03Z","abstract_excerpt":"The Conditional Gradient Method is generalized to a class of non-smooth non-convex optimization problems with many applications in machine learning. The proposed algorithm iterates by minimizing so-called model functions over the constraint set. Complemented with an Amijo line search procedure, we prove that subsequences converge to a stationary point. The abstract framework of model functions provides great flexibility for the design of concrete algorithms. As special cases, for example, we develop an algorithm for additive composite problems and an algorithm for non-linear composite problems"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08087","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:55:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ecd9YHZrFcXQff24SYoQU9QJeoojwZeqrqfGg1W3VxwNPdXaFf/lj4SWawwkOso33tl7KXU17t8cDvAzkdftAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:45:17.307729Z"},"content_sha256":"d19cf9847cb4ed9c70fbf4a066c9c698dc0ad2d23773048ffb2b4e38d12a45c4","schema_version":"1.0","event_id":"sha256:d19cf9847cb4ed9c70fbf4a066c9c698dc0ad2d23773048ffb2b4e38d12a45c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OAAKEZV3WGWAC6YQHGTAUT7LFJ/bundle.json","state_url":"https://pith.science/pith/OAAKEZV3WGWAC6YQHGTAUT7LFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OAAKEZV3WGWAC6YQHGTAUT7LFJ/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-11T00:45:17Z","links":{"resolver":"https://pith.science/pith/OAAKEZV3WGWAC6YQHGTAUT7LFJ","bundle":"https://pith.science/pith/OAAKEZV3WGWAC6YQHGTAUT7LFJ/bundle.json","state":"https://pith.science/pith/OAAKEZV3WGWAC6YQHGTAUT7LFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OAAKEZV3WGWAC6YQHGTAUT7LFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OAAKEZV3WGWAC6YQHGTAUT7LFJ","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":"a90630ccb2838438ae77c63957a54e1cce59f44c17201308b17496d325919003","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-23T19:14:03Z","title_canon_sha256":"69a5e28fc4c8c6e5fca8b126e71ca031e0ac3d13e116fcf5d41c37b8f034e581"},"schema_version":"1.0","source":{"id":"1901.08087","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08087","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08087v1","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08087","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"OAAKEZV3WGWA","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OAAKEZV3WGWAC6YQ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OAAKEZV3","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:d19cf9847cb4ed9c70fbf4a066c9c698dc0ad2d23773048ffb2b4e38d12a45c4","target":"graph","created_at":"2026-05-17T23:55:37Z","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":"The Conditional Gradient Method is generalized to a class of non-smooth non-convex optimization problems with many applications in machine learning. The proposed algorithm iterates by minimizing so-called model functions over the constraint set. Complemented with an Amijo line search procedure, we prove that subsequences converge to a stationary point. The abstract framework of model functions provides great flexibility for the design of concrete algorithms. As special cases, for example, we develop an algorithm for additive composite problems and an algorithm for non-linear composite problems","authors_text":"Peter Ochs, Yura Malitsky","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-23T19:14:03Z","title":"Model Function Based Conditional Gradient Method with Armijo-like Line Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08087","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:336802a5a456f275bb06a47497f5788726976ddf6c2aca6a4324459f12f8d01c","target":"record","created_at":"2026-05-17T23:55:37Z","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":"a90630ccb2838438ae77c63957a54e1cce59f44c17201308b17496d325919003","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-23T19:14:03Z","title_canon_sha256":"69a5e28fc4c8c6e5fca8b126e71ca031e0ac3d13e116fcf5d41c37b8f034e581"},"schema_version":"1.0","source":{"id":"1901.08087","kind":"arxiv","version":1}},"canonical_sha256":"7000a266bbb1ac017b1039a60a4feb2a5645defc9d4c9691fc4795c3f3c602cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7000a266bbb1ac017b1039a60a4feb2a5645defc9d4c9691fc4795c3f3c602cd","first_computed_at":"2026-05-17T23:55:37.927491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:37.927491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SC10J9pBlWhOYkpCaA2yZNZyT2qPBgV9OLyvKDHOU0n7FzVfUJPZQKiyoFJdDWz1ayPBk1TJCbApU4Ubhfi+DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:37.927972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08087","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:336802a5a456f275bb06a47497f5788726976ddf6c2aca6a4324459f12f8d01c","sha256:d19cf9847cb4ed9c70fbf4a066c9c698dc0ad2d23773048ffb2b4e38d12a45c4"],"state_sha256":"e7dfd58aee1bc8177f82b1595cc1d3d54e02ff050157ebe210ecdb7de4eaa13b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhftAVZu0Mmv/2kd5+BJiLTojDqjsWI7/lBrYhztc8PKqkZVwmZPjnY83VveQElIyQoyy/e8/wF1xtVuPweQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:45:17.311573Z","bundle_sha256":"04acf1564bad2bcdf0232b0b73248483ca882574ea3fde58e5456ca5cd4b5586"}}