{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LSLIA7HCFWYEJQXLONTLYZJ6QY","short_pith_number":"pith:LSLIA7HC","canonical_record":{"source":{"id":"1510.07169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-24T17:56:27Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"b64fdc18e1213716e3541bede8417de3715cab45fe1ec4c07e530cab4fc8e91f","abstract_canon_sha256":"217b6dbc4824d84dbd7f1778a16cd72249de7fec63b62ae82f56a2e385ce7942"},"schema_version":"1.0"},"canonical_sha256":"5c96807ce22db044c2eb7366bc653e862a7ab681ca53e4afb25e24c639abdb81","source":{"kind":"arxiv","id":"1510.07169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07169","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07169v1","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07169","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"pith_short_12","alias_value":"LSLIA7HCFWYE","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LSLIA7HCFWYEJQXL","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LSLIA7HC","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LSLIA7HCFWYEJQXLONTLYZJ6QY","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-24T17:56:27Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"b64fdc18e1213716e3541bede8417de3715cab45fe1ec4c07e530cab4fc8e91f","abstract_canon_sha256":"217b6dbc4824d84dbd7f1778a16cd72249de7fec63b62ae82f56a2e385ce7942"},"schema_version":"1.0"},"canonical_sha256":"5c96807ce22db044c2eb7366bc653e862a7ab681ca53e4afb25e24c639abdb81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:19.826688Z","signature_b64":"/oDlwipdsNq1FELnu662N8mNRV/pe8AMu4oq10rEiEo/pVFqkHlga38oyIzBRjYyMdodfsgWyoF1ZpAwW14mDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c96807ce22db044c2eb7366bc653e862a7ab681ca53e4afb25e24c639abdb81","last_reissued_at":"2026-05-18T01:29:19.825962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:19.825962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07169","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:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cmzdTUTby/ml4o5kIgYKlbQVtxwRcryutUTTO7g7V+r1DRpsW8kOx/6R/FcC+wFecOFzSup8sfqkRM7aIOvHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T03:03:28.198494Z"},"content_sha256":"e96e71074ac3c218fe3a2640ecefca78b924e4371d4fad871bd0f861dde1da31","schema_version":"1.0","event_id":"sha256:e96e71074ac3c218fe3a2640ecefca78b924e4371d4fad871bd0f861dde1da31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LSLIA7HCFWYEJQXLONTLYZJ6QY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Scalable Lasso via Stochastic Frank-Wolfe Methods with a Convergence Guarantee","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Claudio Sartori, Emanuele Frandi, Johan A. K. Suykens, Ricardo Nanculef, Stefano Lodi","submitted_at":"2015-10-24T17:56:27Z","abstract_excerpt":"Frank-Wolfe (FW) algorithms have been often proposed over the last few years as efficient solvers for a variety of optimization problems arising in the field of Machine Learning. The ability to work with cheap projection-free iterations and the incremental nature of the method make FW a very effective choice for many large-scale problems where computing a sparse model is desirable.\n  In this paper, we present a high-performance implementation of the FW method tailored to solve large-scale Lasso regression problems, based on a randomized iteration, and prove that the convergence guarantees of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07169","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:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L0d5OH+pLWkxahBtSYNwCI9ko9F4T06B0hM/sQe/76MrpAB5hAkqSciZMiJpsV63QcN/1TaDZw7P6F6AANhNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T03:03:28.198832Z"},"content_sha256":"2103560bf9ac8c1316387e6e332329ef7f40d76c343f2ae71ea9fc25ab90decf","schema_version":"1.0","event_id":"sha256:2103560bf9ac8c1316387e6e332329ef7f40d76c343f2ae71ea9fc25ab90decf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSLIA7HCFWYEJQXLONTLYZJ6QY/bundle.json","state_url":"https://pith.science/pith/LSLIA7HCFWYEJQXLONTLYZJ6QY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSLIA7HCFWYEJQXLONTLYZJ6QY/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-03T03:03:28Z","links":{"resolver":"https://pith.science/pith/LSLIA7HCFWYEJQXLONTLYZJ6QY","bundle":"https://pith.science/pith/LSLIA7HCFWYEJQXLONTLYZJ6QY/bundle.json","state":"https://pith.science/pith/LSLIA7HCFWYEJQXLONTLYZJ6QY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSLIA7HCFWYEJQXLONTLYZJ6QY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LSLIA7HCFWYEJQXLONTLYZJ6QY","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":"217b6dbc4824d84dbd7f1778a16cd72249de7fec63b62ae82f56a2e385ce7942","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-24T17:56:27Z","title_canon_sha256":"b64fdc18e1213716e3541bede8417de3715cab45fe1ec4c07e530cab4fc8e91f"},"schema_version":"1.0","source":{"id":"1510.07169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07169","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07169v1","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07169","created_at":"2026-05-18T01:29:19Z"},{"alias_kind":"pith_short_12","alias_value":"LSLIA7HCFWYE","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LSLIA7HCFWYEJQXL","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LSLIA7HC","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:2103560bf9ac8c1316387e6e332329ef7f40d76c343f2ae71ea9fc25ab90decf","target":"graph","created_at":"2026-05-18T01:29:19Z","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 (FW) algorithms have been often proposed over the last few years as efficient solvers for a variety of optimization problems arising in the field of Machine Learning. The ability to work with cheap projection-free iterations and the incremental nature of the method make FW a very effective choice for many large-scale problems where computing a sparse model is desirable.\n  In this paper, we present a high-performance implementation of the FW method tailored to solve large-scale Lasso regression problems, based on a randomized iteration, and prove that the convergence guarantees of t","authors_text":"Claudio Sartori, Emanuele Frandi, Johan A. K. Suykens, Ricardo Nanculef, Stefano Lodi","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-24T17:56:27Z","title":"Fast and Scalable Lasso via Stochastic Frank-Wolfe Methods with a Convergence Guarantee"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07169","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:e96e71074ac3c218fe3a2640ecefca78b924e4371d4fad871bd0f861dde1da31","target":"record","created_at":"2026-05-18T01:29:19Z","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":"217b6dbc4824d84dbd7f1778a16cd72249de7fec63b62ae82f56a2e385ce7942","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-24T17:56:27Z","title_canon_sha256":"b64fdc18e1213716e3541bede8417de3715cab45fe1ec4c07e530cab4fc8e91f"},"schema_version":"1.0","source":{"id":"1510.07169","kind":"arxiv","version":1}},"canonical_sha256":"5c96807ce22db044c2eb7366bc653e862a7ab681ca53e4afb25e24c639abdb81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c96807ce22db044c2eb7366bc653e862a7ab681ca53e4afb25e24c639abdb81","first_computed_at":"2026-05-18T01:29:19.825962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:19.825962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/oDlwipdsNq1FELnu662N8mNRV/pe8AMu4oq10rEiEo/pVFqkHlga38oyIzBRjYyMdodfsgWyoF1ZpAwW14mDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:19.826688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e96e71074ac3c218fe3a2640ecefca78b924e4371d4fad871bd0f861dde1da31","sha256:2103560bf9ac8c1316387e6e332329ef7f40d76c343f2ae71ea9fc25ab90decf"],"state_sha256":"b0eee2663293ffd05b54030e84bcc33cd41f52705303b0040382e9f585ae3885"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xDvy7LcPxIg1BuZU/369T4CWviHZax9Q0zui7Ljf7K2LCeadLCMyGgA4i/dQ0gNqH/3xXbMc7IRxirYis2sNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T03:03:28.200647Z","bundle_sha256":"4ef74e65bc52387f305bf290d8f549bba66273098a5242bcba8acda13a2a52be"}}