{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DBVJGOR7XX2CNLXEYZH35MLNTQ","short_pith_number":"pith:DBVJGOR7","canonical_record":{"source":{"id":"1406.3816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-15T13:34:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6e08fa7281cd12840302663f1b06d600ce6cd5633f1f8fd19176bd0ff55b8063","abstract_canon_sha256":"ff86c825dca8ccfd3789cd7a93a385719e2466a4b1596c0d0d77078d93764e3d"},"schema_version":"1.0"},"canonical_sha256":"186a933a3fbdf426aee4c64fbeb16d9c05b5f16c6dcd4b4fd73eb83f5282c95d","source":{"kind":"arxiv","id":"1406.3816","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3816","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3816v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3816","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"DBVJGOR7XX2C","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DBVJGOR7XX2CNLXE","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DBVJGOR7","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DBVJGOR7XX2CNLXEYZH35MLNTQ","target":"record","payload":{"canonical_record":{"source":{"id":"1406.3816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-15T13:34:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6e08fa7281cd12840302663f1b06d600ce6cd5633f1f8fd19176bd0ff55b8063","abstract_canon_sha256":"ff86c825dca8ccfd3789cd7a93a385719e2466a4b1596c0d0d77078d93764e3d"},"schema_version":"1.0"},"canonical_sha256":"186a933a3fbdf426aee4c64fbeb16d9c05b5f16c6dcd4b4fd73eb83f5282c95d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.676270Z","signature_b64":"j9S8qy5kue6Q7eQTlTaXhXMcFVVruDdMp5qtApzO/PWFkcksI9CELUFdOnorFU8sYfmKuJGdYpth8jVbmDRmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"186a933a3fbdf426aee4c64fbeb16d9c05b5f16c6dcd4b4fd73eb83f5282c95d","last_reissued_at":"2026-05-18T02:49:39.675941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.675941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.3816","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-18T02:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+qLsqAWvRd5XLd4obBBjU76sjzkjtb/TvCR1ft/3VcG39pmj7OG4TwYLSQgtZdO9/qCXmogkECyfzNVvysoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:05:23.322695Z"},"content_sha256":"19fa1f1f13dbac733c082d8566d57755363a698a7f48300f2ce8a4afbf52b1b9","schema_version":"1.0","event_id":"sha256:19fa1f1f13dbac733c082d8566d57755363a698a7f48300f2ce8a4afbf52b1b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DBVJGOR7XX2CNLXEYZH35MLNTQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous Model Selection and Optimization through Parameter-free Stochastic Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francesco Orabona","submitted_at":"2014-06-15T13:34:27Z","abstract_excerpt":"Stochastic gradient descent algorithms for training linear and kernel predictors are gaining more and more importance, thanks to their scalability. While various methods have been proposed to speed up their convergence, the model selection phase is often ignored. In fact, in theoretical works most of the time assumptions are made, for example, on the prior knowledge of the norm of the optimal solution, while in the practical world validation methods remain the only viable approach. In this paper, we propose a new kernel-based stochastic gradient descent algorithm that performs model selection "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3816","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-18T02:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FtCe/wkTizyTzF0BbW/LWuYtxe7iDC9b/Nn4SjfKksZw12PjiQ7MF/6dupfHJiy8uwkeRenON+lvn2bxKurADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:05:23.323097Z"},"content_sha256":"0735e7d8aaf202e2de173f3c4c921119613ff4b094349d0246b19fd69af7dc6c","schema_version":"1.0","event_id":"sha256:0735e7d8aaf202e2de173f3c4c921119613ff4b094349d0246b19fd69af7dc6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBVJGOR7XX2CNLXEYZH35MLNTQ/bundle.json","state_url":"https://pith.science/pith/DBVJGOR7XX2CNLXEYZH35MLNTQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBVJGOR7XX2CNLXEYZH35MLNTQ/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-05-26T17:05:23Z","links":{"resolver":"https://pith.science/pith/DBVJGOR7XX2CNLXEYZH35MLNTQ","bundle":"https://pith.science/pith/DBVJGOR7XX2CNLXEYZH35MLNTQ/bundle.json","state":"https://pith.science/pith/DBVJGOR7XX2CNLXEYZH35MLNTQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBVJGOR7XX2CNLXEYZH35MLNTQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DBVJGOR7XX2CNLXEYZH35MLNTQ","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":"ff86c825dca8ccfd3789cd7a93a385719e2466a4b1596c0d0d77078d93764e3d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-15T13:34:27Z","title_canon_sha256":"6e08fa7281cd12840302663f1b06d600ce6cd5633f1f8fd19176bd0ff55b8063"},"schema_version":"1.0","source":{"id":"1406.3816","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3816","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3816v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3816","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"DBVJGOR7XX2C","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DBVJGOR7XX2CNLXE","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DBVJGOR7","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:0735e7d8aaf202e2de173f3c4c921119613ff4b094349d0246b19fd69af7dc6c","target":"graph","created_at":"2026-05-18T02:49:39Z","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":"Stochastic gradient descent algorithms for training linear and kernel predictors are gaining more and more importance, thanks to their scalability. While various methods have been proposed to speed up their convergence, the model selection phase is often ignored. In fact, in theoretical works most of the time assumptions are made, for example, on the prior knowledge of the norm of the optimal solution, while in the practical world validation methods remain the only viable approach. In this paper, we propose a new kernel-based stochastic gradient descent algorithm that performs model selection ","authors_text":"Francesco Orabona","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-15T13:34:27Z","title":"Simultaneous Model Selection and Optimization through Parameter-free Stochastic Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3816","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:19fa1f1f13dbac733c082d8566d57755363a698a7f48300f2ce8a4afbf52b1b9","target":"record","created_at":"2026-05-18T02:49:39Z","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":"ff86c825dca8ccfd3789cd7a93a385719e2466a4b1596c0d0d77078d93764e3d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-15T13:34:27Z","title_canon_sha256":"6e08fa7281cd12840302663f1b06d600ce6cd5633f1f8fd19176bd0ff55b8063"},"schema_version":"1.0","source":{"id":"1406.3816","kind":"arxiv","version":1}},"canonical_sha256":"186a933a3fbdf426aee4c64fbeb16d9c05b5f16c6dcd4b4fd73eb83f5282c95d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"186a933a3fbdf426aee4c64fbeb16d9c05b5f16c6dcd4b4fd73eb83f5282c95d","first_computed_at":"2026-05-18T02:49:39.675941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:39.675941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j9S8qy5kue6Q7eQTlTaXhXMcFVVruDdMp5qtApzO/PWFkcksI9CELUFdOnorFU8sYfmKuJGdYpth8jVbmDRmBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:39.676270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3816","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19fa1f1f13dbac733c082d8566d57755363a698a7f48300f2ce8a4afbf52b1b9","sha256:0735e7d8aaf202e2de173f3c4c921119613ff4b094349d0246b19fd69af7dc6c"],"state_sha256":"40f3cd341d8e572863997df1541cfb23d89a64fe55fadcdfe2be77ff2829d855"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xLZP36xI0ZuRQh1G55Z+0t0S470LaIERCrdBZTpJn+GJUNS5SU602Wr6m4aDoXYQ3BIZMfGLRQMvDERB3uJUDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:05:23.326698Z","bundle_sha256":"3f6b4a3d7f83df32d66b9ff73da21ee2c20bc5860aa89dbf3d972515e601ef4b"}}