{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:6L5ZFZGNUTX2KC56WWQZYCZ6BY","short_pith_number":"pith:6L5ZFZGN","canonical_record":{"source":{"id":"0903.4817","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-03-27T17:23:31Z","cross_cats_sorted":["cs.CG","cs.CV","math.OC","stat.ML"],"title_canon_sha256":"3519d1b6a3196ca8ffe3bec79715ded21040b50135f8b2ebf58d48da9814f880","abstract_canon_sha256":"d0d41619a8d72c0da9759d8466c903d575af5275069cf0343a23c428f20ba742"},"schema_version":"1.0"},"canonical_sha256":"f2fb92e4cda4efa50bbeb5a19c0b3e0e17fda645713c5057b5eb3f80356781b7","source":{"kind":"arxiv","id":"0903.4817","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.4817","created_at":"2026-05-18T03:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"0903.4817v3","created_at":"2026-05-18T03:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4817","created_at":"2026-05-18T03:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"6L5ZFZGNUTX2","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"6L5ZFZGNUTX2KC56","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"6L5ZFZGN","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:6L5ZFZGNUTX2KC56WWQZYCZ6BY","target":"record","payload":{"canonical_record":{"source":{"id":"0903.4817","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-03-27T17:23:31Z","cross_cats_sorted":["cs.CG","cs.CV","math.OC","stat.ML"],"title_canon_sha256":"3519d1b6a3196ca8ffe3bec79715ded21040b50135f8b2ebf58d48da9814f880","abstract_canon_sha256":"d0d41619a8d72c0da9759d8466c903d575af5275069cf0343a23c428f20ba742"},"schema_version":"1.0"},"canonical_sha256":"f2fb92e4cda4efa50bbeb5a19c0b3e0e17fda645713c5057b5eb3f80356781b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:59.113873Z","signature_b64":"zfigyoIwHHyBR05BXXVA99y237ZcFHiSS+8ztWo49otY+4glpiasI9sCjYtUjlhB4OjzpILEdQXIbYPBaBGFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2fb92e4cda4efa50bbeb5a19c0b3e0e17fda645713c5057b5eb3f80356781b7","last_reissued_at":"2026-05-18T03:41:59.113187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:59.113187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0903.4817","source_version":3,"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-18T03:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"puqopif6F/YqCjg5DYbHDZ16SgPsg33Ksf3FFD8XkQm+idSFh4lF3772lHaz+IiRY4oez0EypOn7O/29kAhyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:23:55.170011Z"},"content_sha256":"3c54348aeb52c01ddc07c41dbf07871d98c70e73466a66afe58849a45d853829","schema_version":"1.0","event_id":"sha256:3c54348aeb52c01ddc07c41dbf07871d98c70e73466a66afe58849a45d853829"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:6L5ZFZGNUTX2KC56WWQZYCZ6BY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Exponential Lower Bound on the Complexity of Regularization Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bernd G\\\"artner, Cl\\'ement Maria, Martin Jaggi","submitted_at":"2009-03-27T17:23:31Z","abstract_excerpt":"For a variety of regularized optimization problems in machine learning, algorithms computing the entire solution path have been developed recently. Most of these methods are quadratic programs that are parameterized by a single parameter, as for example the Support Vector Machine (SVM). Solution path algorithms do not only compute the solution for one particular value of the regularization parameter but the entire path of solutions, making the selection of an optimal parameter much easier.\n  It has been assumed that these piecewise linear solution paths have only linear complexity, i.e. linear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4817","kind":"arxiv","version":3},"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-18T03:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2We3D4YVre5ItQ5iYBEVJbyRxCmHV99GnU5QweoBw8SuZ1AjxroougFdtLpkpJjqOdhtcIpT9pnGUwvx04YbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:23:55.170382Z"},"content_sha256":"54a6c7e72d75954364a87eac13df3c36402f2c18839e8869a0d82faa975baae7","schema_version":"1.0","event_id":"sha256:54a6c7e72d75954364a87eac13df3c36402f2c18839e8869a0d82faa975baae7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6L5ZFZGNUTX2KC56WWQZYCZ6BY/bundle.json","state_url":"https://pith.science/pith/6L5ZFZGNUTX2KC56WWQZYCZ6BY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6L5ZFZGNUTX2KC56WWQZYCZ6BY/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-04T15:23:55Z","links":{"resolver":"https://pith.science/pith/6L5ZFZGNUTX2KC56WWQZYCZ6BY","bundle":"https://pith.science/pith/6L5ZFZGNUTX2KC56WWQZYCZ6BY/bundle.json","state":"https://pith.science/pith/6L5ZFZGNUTX2KC56WWQZYCZ6BY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6L5ZFZGNUTX2KC56WWQZYCZ6BY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:6L5ZFZGNUTX2KC56WWQZYCZ6BY","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":"d0d41619a8d72c0da9759d8466c903d575af5275069cf0343a23c428f20ba742","cross_cats_sorted":["cs.CG","cs.CV","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-03-27T17:23:31Z","title_canon_sha256":"3519d1b6a3196ca8ffe3bec79715ded21040b50135f8b2ebf58d48da9814f880"},"schema_version":"1.0","source":{"id":"0903.4817","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.4817","created_at":"2026-05-18T03:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"0903.4817v3","created_at":"2026-05-18T03:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4817","created_at":"2026-05-18T03:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"6L5ZFZGNUTX2","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"6L5ZFZGNUTX2KC56","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"6L5ZFZGN","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:54a6c7e72d75954364a87eac13df3c36402f2c18839e8869a0d82faa975baae7","target":"graph","created_at":"2026-05-18T03:41:59Z","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":"For a variety of regularized optimization problems in machine learning, algorithms computing the entire solution path have been developed recently. Most of these methods are quadratic programs that are parameterized by a single parameter, as for example the Support Vector Machine (SVM). Solution path algorithms do not only compute the solution for one particular value of the regularization parameter but the entire path of solutions, making the selection of an optimal parameter much easier.\n  It has been assumed that these piecewise linear solution paths have only linear complexity, i.e. linear","authors_text":"Bernd G\\\"artner, Cl\\'ement Maria, Martin Jaggi","cross_cats":["cs.CG","cs.CV","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-03-27T17:23:31Z","title":"An Exponential Lower Bound on the Complexity of Regularization Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4817","kind":"arxiv","version":3},"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:3c54348aeb52c01ddc07c41dbf07871d98c70e73466a66afe58849a45d853829","target":"record","created_at":"2026-05-18T03:41:59Z","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":"d0d41619a8d72c0da9759d8466c903d575af5275069cf0343a23c428f20ba742","cross_cats_sorted":["cs.CG","cs.CV","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-03-27T17:23:31Z","title_canon_sha256":"3519d1b6a3196ca8ffe3bec79715ded21040b50135f8b2ebf58d48da9814f880"},"schema_version":"1.0","source":{"id":"0903.4817","kind":"arxiv","version":3}},"canonical_sha256":"f2fb92e4cda4efa50bbeb5a19c0b3e0e17fda645713c5057b5eb3f80356781b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2fb92e4cda4efa50bbeb5a19c0b3e0e17fda645713c5057b5eb3f80356781b7","first_computed_at":"2026-05-18T03:41:59.113187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:59.113187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zfigyoIwHHyBR05BXXVA99y237ZcFHiSS+8ztWo49otY+4glpiasI9sCjYtUjlhB4OjzpILEdQXIbYPBaBGFBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:59.113873Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.4817","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c54348aeb52c01ddc07c41dbf07871d98c70e73466a66afe58849a45d853829","sha256:54a6c7e72d75954364a87eac13df3c36402f2c18839e8869a0d82faa975baae7"],"state_sha256":"c11d9431d76aad01de6397633e632cbe4561109e1be09e35dbf30ff7ecee6ce0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QOuwoeinwJF/ojglMq4RHEmFiuR+wWdEN1zNvzk1ff1wonOCKjfMbCOZQH4oG4//We1Hks2jnn2LYk+DvEb3Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:23:55.173169Z","bundle_sha256":"16719f632e234c6e59abc8f9c3520bbdf54389e8d6749d4bbbec7fd272def15d"}}