{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ZJPVZ4ZQBR7ZGRHRVC55OLGRGF","short_pith_number":"pith:ZJPVZ4ZQ","canonical_record":{"source":{"id":"2311.05381","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-09T14:06:53Z","cross_cats_sorted":[],"title_canon_sha256":"2e583a1a717487c65aa30a8881c8700b9020f18c2c722131aa1f1c9f3cd9e852","abstract_canon_sha256":"1be684b31456e05a0f6b27b0b1106d4aca30c25d969e73fafcad4e940ce55f79"},"schema_version":"1.0"},"canonical_sha256":"ca5f5cf3300c7f9344f1a8bbd72cd1315e31290f596688950a3c68799117ebac","source":{"kind":"arxiv","id":"2311.05381","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.05381","created_at":"2026-07-05T09:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"2311.05381v4","created_at":"2026-07-05T09:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.05381","created_at":"2026-07-05T09:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZJPVZ4ZQBR7Z","created_at":"2026-07-05T09:18:21Z"},{"alias_kind":"pith_short_16","alias_value":"ZJPVZ4ZQBR7ZGRHR","created_at":"2026-07-05T09:18:21Z"},{"alias_kind":"pith_short_8","alias_value":"ZJPVZ4ZQ","created_at":"2026-07-05T09:18:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ZJPVZ4ZQBR7ZGRHRVC55OLGRGF","target":"record","payload":{"canonical_record":{"source":{"id":"2311.05381","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-09T14:06:53Z","cross_cats_sorted":[],"title_canon_sha256":"2e583a1a717487c65aa30a8881c8700b9020f18c2c722131aa1f1c9f3cd9e852","abstract_canon_sha256":"1be684b31456e05a0f6b27b0b1106d4aca30c25d969e73fafcad4e940ce55f79"},"schema_version":"1.0"},"canonical_sha256":"ca5f5cf3300c7f9344f1a8bbd72cd1315e31290f596688950a3c68799117ebac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:18:21.279415Z","signature_b64":"HJlu7mQEt5Y3GM1i6++f+QIpO8FiMx/o8joJg8czwLsvh5fan4ruCrN2Cnb7KVLR7w7Ha5s37wCE5j0YpDvjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca5f5cf3300c7f9344f1a8bbd72cd1315e31290f596688950a3c68799117ebac","last_reissued_at":"2026-07-05T09:18:21.279013Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:18:21.279013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.05381","source_version":4,"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-07-05T09:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wmoLPWTm+hoJucb5jxxmHemgdUs5NKtNf3Gva65K3ypWX36umTIDiLOycEE6339E0rzk6uRBI+Pq3dxTY1oDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:50:42.743745Z"},"content_sha256":"1aa2ac4e069a47c08e270b9ebcf2fdde480be2e6fb92b10d5a5b3f754bc738b3","schema_version":"1.0","event_id":"sha256:1aa2ac4e069a47c08e270b9ebcf2fdde480be2e6fb92b10d5a5b3f754bc738b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ZJPVZ4ZQBR7ZGRHRVC55OLGRGF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Splitting the Conditional Gradient Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Sebastian Pokutta, Zev Woodstock","submitted_at":"2023-11-09T14:06:53Z","abstract_excerpt":"We propose a novel generalization of the conditional gradient (CG / Frank-Wolfe) algorithm for minimizing a smooth function $f$ under an intersection of compact convex sets, using a first-order oracle for $\\nabla f$ and linear minimization oracles (LMOs) for the individual sets. Although this computational framework presents many advantages, there are only a small number of algorithms which require one LMO evaluation per set per iteration; furthermore, these algorithms require $f$ to be convex. Our algorithm appears to be the first in this class which is proven to also converge in the nonconve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.05381","kind":"arxiv","version":4},"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/2311.05381/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"},"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-07-05T09:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8c7e4jDtbeu4J/Bwndc/vKLYttNck5k1eaD+3JUZHxg8yWvxN9Oi5+aH5oXv1Xmh9O1PLYRxHa51D7h5C77HBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:50:42.744413Z"},"content_sha256":"ae1ec9c7c8395a6fcbeffb5f933340baa181b2ae1a047a0f681ab004b2888fc6","schema_version":"1.0","event_id":"sha256:ae1ec9c7c8395a6fcbeffb5f933340baa181b2ae1a047a0f681ab004b2888fc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJPVZ4ZQBR7ZGRHRVC55OLGRGF/bundle.json","state_url":"https://pith.science/pith/ZJPVZ4ZQBR7ZGRHRVC55OLGRGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJPVZ4ZQBR7ZGRHRVC55OLGRGF/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-07-09T06:50:42Z","links":{"resolver":"https://pith.science/pith/ZJPVZ4ZQBR7ZGRHRVC55OLGRGF","bundle":"https://pith.science/pith/ZJPVZ4ZQBR7ZGRHRVC55OLGRGF/bundle.json","state":"https://pith.science/pith/ZJPVZ4ZQBR7ZGRHRVC55OLGRGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJPVZ4ZQBR7ZGRHRVC55OLGRGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZJPVZ4ZQBR7ZGRHRVC55OLGRGF","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":"1be684b31456e05a0f6b27b0b1106d4aca30c25d969e73fafcad4e940ce55f79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-09T14:06:53Z","title_canon_sha256":"2e583a1a717487c65aa30a8881c8700b9020f18c2c722131aa1f1c9f3cd9e852"},"schema_version":"1.0","source":{"id":"2311.05381","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.05381","created_at":"2026-07-05T09:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"2311.05381v4","created_at":"2026-07-05T09:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.05381","created_at":"2026-07-05T09:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZJPVZ4ZQBR7Z","created_at":"2026-07-05T09:18:21Z"},{"alias_kind":"pith_short_16","alias_value":"ZJPVZ4ZQBR7ZGRHR","created_at":"2026-07-05T09:18:21Z"},{"alias_kind":"pith_short_8","alias_value":"ZJPVZ4ZQ","created_at":"2026-07-05T09:18:21Z"}],"graph_snapshots":[{"event_id":"sha256:ae1ec9c7c8395a6fcbeffb5f933340baa181b2ae1a047a0f681ab004b2888fc6","target":"graph","created_at":"2026-07-05T09:18:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.05381/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a novel generalization of the conditional gradient (CG / Frank-Wolfe) algorithm for minimizing a smooth function $f$ under an intersection of compact convex sets, using a first-order oracle for $\\nabla f$ and linear minimization oracles (LMOs) for the individual sets. Although this computational framework presents many advantages, there are only a small number of algorithms which require one LMO evaluation per set per iteration; furthermore, these algorithms require $f$ to be convex. Our algorithm appears to be the first in this class which is proven to also converge in the nonconve","authors_text":"Sebastian Pokutta, Zev Woodstock","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-09T14:06:53Z","title":"Splitting the Conditional Gradient Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.05381","kind":"arxiv","version":4},"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:1aa2ac4e069a47c08e270b9ebcf2fdde480be2e6fb92b10d5a5b3f754bc738b3","target":"record","created_at":"2026-07-05T09:18:21Z","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":"1be684b31456e05a0f6b27b0b1106d4aca30c25d969e73fafcad4e940ce55f79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-09T14:06:53Z","title_canon_sha256":"2e583a1a717487c65aa30a8881c8700b9020f18c2c722131aa1f1c9f3cd9e852"},"schema_version":"1.0","source":{"id":"2311.05381","kind":"arxiv","version":4}},"canonical_sha256":"ca5f5cf3300c7f9344f1a8bbd72cd1315e31290f596688950a3c68799117ebac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca5f5cf3300c7f9344f1a8bbd72cd1315e31290f596688950a3c68799117ebac","first_computed_at":"2026-07-05T09:18:21.279013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:18:21.279013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HJlu7mQEt5Y3GM1i6++f+QIpO8FiMx/o8joJg8czwLsvh5fan4ruCrN2Cnb7KVLR7w7Ha5s37wCE5j0YpDvjDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:18:21.279415Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.05381","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1aa2ac4e069a47c08e270b9ebcf2fdde480be2e6fb92b10d5a5b3f754bc738b3","sha256:ae1ec9c7c8395a6fcbeffb5f933340baa181b2ae1a047a0f681ab004b2888fc6"],"state_sha256":"ff7ecf588d856d563831ec8d7b5561d71c84e6897d23a5bdd3db32dbcd3e1cbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+HU7rK3D7LFWWP8OFoUZ2+mulNuGAPHG4r2WMRAwuWbrozJ1XaMIUTax2ZPI6MTnK+CyyXADatirwUndbMjDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T06:50:42.747503Z","bundle_sha256":"1036d7052b03465e8847acdc76dd6124e4a4a66477258bb21cba2f0d3f6f48e8"}}