{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:73CLGOPJTHQKOJVXKJ6MHIQEXS","short_pith_number":"pith:73CLGOPJ","canonical_record":{"source":{"id":"1410.4062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-15T13:50:34Z","cross_cats_sorted":["cs.LG","cs.NA","math.OC"],"title_canon_sha256":"6aa52a6b5a5bc61a9f99a86acbea99a874f0d5f57283051620a78ff6bfc98450","abstract_canon_sha256":"dccdd5177380e47b0536494b8f36b8909c28996b0febd17169a4f588f092c88b"},"schema_version":"1.0"},"canonical_sha256":"fec4b339e999e0a726b7527cc3a204bca36a5805e6beb7d3db66b70ade2378f1","source":{"kind":"arxiv","id":"1410.4062","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4062","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4062v1","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4062","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"73CLGOPJTHQK","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"73CLGOPJTHQKOJVX","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"73CLGOPJ","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:73CLGOPJTHQKOJVXKJ6MHIQEXS","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-15T13:50:34Z","cross_cats_sorted":["cs.LG","cs.NA","math.OC"],"title_canon_sha256":"6aa52a6b5a5bc61a9f99a86acbea99a874f0d5f57283051620a78ff6bfc98450","abstract_canon_sha256":"dccdd5177380e47b0536494b8f36b8909c28996b0febd17169a4f588f092c88b"},"schema_version":"1.0"},"canonical_sha256":"fec4b339e999e0a726b7527cc3a204bca36a5805e6beb7d3db66b70ade2378f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:21.594865Z","signature_b64":"ZsfLRPfarivThM7FOZqYLkXDlQlH0VoKY3RMPx4VcWg8VTgc5uDYdOrepdtwznp3fc+Ao59nRprr0IPWRRn6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fec4b339e999e0a726b7527cc3a204bca36a5805e6beb7d3db66b70ade2378f1","last_reissued_at":"2026-05-18T01:29:21.594155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:21.594155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4062","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-18T01:29:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FyCFAGRFL2/n8RMFNWS0tgxnxv2mIFLZ4c6DvOn/p1F3CSsyRPAvBCP0isvcuCTQyVxMOcB3WyFATkN/zk2iDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T06:21:39.787652Z"},"content_sha256":"a7c4139c18b0e1bdce01c54ec643af1387974576a85a2a3bd22715f100a6a278","schema_version":"1.0","event_id":"sha256:a7c4139c18b0e1bdce01c54ec643af1387974576a85a2a3bd22715f100a6a278"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:73CLGOPJTHQKOJVXKJ6MHIQEXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity Issues and Randomization Strategies in Frank-Wolfe Algorithms for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.OC"],"primary_cat":"stat.ML","authors_text":"Emanuele Frandi, Johan Suykens, Ricardo Nanculef","submitted_at":"2014-10-15T13:50:34Z","abstract_excerpt":"Frank-Wolfe algorithms for convex minimization have recently gained considerable attention from the Optimization and Machine Learning communities, as their properties make them a suitable choice in a variety of applications. However, as each iteration requires to optimize a linear model, a clever implementation is crucial to make such algorithms viable on large-scale datasets. For this purpose, approximation strategies based on a random sampling have been proposed by several researchers. In this work, we perform an experimental study on the effectiveness of these techniques, analyze possible a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4062","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-18T01:29:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHLguP5BoEkMu+jqqFESW/TVbzYCkvkN19g+FlDvymmpgVD8rl51HQuG9cbxtHzaffxZ/cxpMhl/pPBUa3RaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T06:21:39.787996Z"},"content_sha256":"a2bc22cd743079589f4618f43e973cfa655e8445b2f32907c2c2f3eaf1ce1597","schema_version":"1.0","event_id":"sha256:a2bc22cd743079589f4618f43e973cfa655e8445b2f32907c2c2f3eaf1ce1597"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73CLGOPJTHQKOJVXKJ6MHIQEXS/bundle.json","state_url":"https://pith.science/pith/73CLGOPJTHQKOJVXKJ6MHIQEXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73CLGOPJTHQKOJVXKJ6MHIQEXS/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-03T06:21:39Z","links":{"resolver":"https://pith.science/pith/73CLGOPJTHQKOJVXKJ6MHIQEXS","bundle":"https://pith.science/pith/73CLGOPJTHQKOJVXKJ6MHIQEXS/bundle.json","state":"https://pith.science/pith/73CLGOPJTHQKOJVXKJ6MHIQEXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73CLGOPJTHQKOJVXKJ6MHIQEXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:73CLGOPJTHQKOJVXKJ6MHIQEXS","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":"dccdd5177380e47b0536494b8f36b8909c28996b0febd17169a4f588f092c88b","cross_cats_sorted":["cs.LG","cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-15T13:50:34Z","title_canon_sha256":"6aa52a6b5a5bc61a9f99a86acbea99a874f0d5f57283051620a78ff6bfc98450"},"schema_version":"1.0","source":{"id":"1410.4062","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4062","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4062v1","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4062","created_at":"2026-05-18T01:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"73CLGOPJTHQK","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"73CLGOPJTHQKOJVX","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"73CLGOPJ","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:a2bc22cd743079589f4618f43e973cfa655e8445b2f32907c2c2f3eaf1ce1597","target":"graph","created_at":"2026-05-18T01:29: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"},"paper":{"abstract_excerpt":"Frank-Wolfe algorithms for convex minimization have recently gained considerable attention from the Optimization and Machine Learning communities, as their properties make them a suitable choice in a variety of applications. However, as each iteration requires to optimize a linear model, a clever implementation is crucial to make such algorithms viable on large-scale datasets. For this purpose, approximation strategies based on a random sampling have been proposed by several researchers. In this work, we perform an experimental study on the effectiveness of these techniques, analyze possible a","authors_text":"Emanuele Frandi, Johan Suykens, Ricardo Nanculef","cross_cats":["cs.LG","cs.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-15T13:50:34Z","title":"Complexity Issues and Randomization Strategies in Frank-Wolfe Algorithms for Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4062","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:a7c4139c18b0e1bdce01c54ec643af1387974576a85a2a3bd22715f100a6a278","target":"record","created_at":"2026-05-18T01:29: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":"dccdd5177380e47b0536494b8f36b8909c28996b0febd17169a4f588f092c88b","cross_cats_sorted":["cs.LG","cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-15T13:50:34Z","title_canon_sha256":"6aa52a6b5a5bc61a9f99a86acbea99a874f0d5f57283051620a78ff6bfc98450"},"schema_version":"1.0","source":{"id":"1410.4062","kind":"arxiv","version":1}},"canonical_sha256":"fec4b339e999e0a726b7527cc3a204bca36a5805e6beb7d3db66b70ade2378f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fec4b339e999e0a726b7527cc3a204bca36a5805e6beb7d3db66b70ade2378f1","first_computed_at":"2026-05-18T01:29:21.594155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:21.594155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZsfLRPfarivThM7FOZqYLkXDlQlH0VoKY3RMPx4VcWg8VTgc5uDYdOrepdtwznp3fc+Ao59nRprr0IPWRRn6Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:21.594865Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4062","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7c4139c18b0e1bdce01c54ec643af1387974576a85a2a3bd22715f100a6a278","sha256:a2bc22cd743079589f4618f43e973cfa655e8445b2f32907c2c2f3eaf1ce1597"],"state_sha256":"817a58b51a97c8b724595c51abee53a128e97656ffb586054d71455f236f53b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z4VF/R+f98gcFyHtgXYL1Coo9KKU+G2ymXm75MQDrKFRwVUjmJQykITOtbTMeR8Y+Be4dm80J1m1HKRdDDcWDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T06:21:39.789893Z","bundle_sha256":"db1e766c10cc7b709875834ec39b95722b368eefbf9d000da59432aa2df1ea40"}}