{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LWPMXJ3NAD5GNVLK5SMG4G6X6R","short_pith_number":"pith:LWPMXJ3N","canonical_record":{"source":{"id":"1105.0471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-05-03T03:14:14Z","cross_cats_sorted":[],"title_canon_sha256":"ac30e1369d21767959f92e307dc5ce3a37bbdcfe1e3ccbf7b4343b5cf1813203","abstract_canon_sha256":"14f843b990cd6f7c17ae5fb5e52f243aadceb65b8b7b3021faa7958e14806329"},"schema_version":"1.0"},"canonical_sha256":"5d9ecba76d00fa66d56aec986e1bd7f45d10c3fddb912ad8ad289f96a74c7973","source":{"kind":"arxiv","id":"1105.0471","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0471","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0471v1","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0471","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"LWPMXJ3NAD5G","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LWPMXJ3NAD5GNVLK","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LWPMXJ3N","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LWPMXJ3NAD5GNVLK5SMG4G6X6R","target":"record","payload":{"canonical_record":{"source":{"id":"1105.0471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-05-03T03:14:14Z","cross_cats_sorted":[],"title_canon_sha256":"ac30e1369d21767959f92e307dc5ce3a37bbdcfe1e3ccbf7b4343b5cf1813203","abstract_canon_sha256":"14f843b990cd6f7c17ae5fb5e52f243aadceb65b8b7b3021faa7958e14806329"},"schema_version":"1.0"},"canonical_sha256":"5d9ecba76d00fa66d56aec986e1bd7f45d10c3fddb912ad8ad289f96a74c7973","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:11.225675Z","signature_b64":"iy/q2BQcdATOaGwvbaA7iwwJzmvTuHK3lPrCL9/RmKP0DiAPitCqdxLVImTfJ5TxuIBaE72utkdzKwr1AgDpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d9ecba76d00fa66d56aec986e1bd7f45d10c3fddb912ad8ad289f96a74c7973","last_reissued_at":"2026-05-18T04:23:11.225272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:11.225272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.0471","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-18T04:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ePwb7QfFPLVNfJQFUU44dNaoeScFFFq0yohNKvCd94mgVRC6o8epHj+gpjAYYoalXYR1CZAkdnUP+7ArEO6dCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:37:28.670124Z"},"content_sha256":"73d094f793f5e2bfb00f72b4fea3e91b3fe32a43ae6cad12847217d9f81e99c2","schema_version":"1.0","event_id":"sha256:73d094f793f5e2bfb00f72b4fea3e91b3fe32a43ae6cad12847217d9f81e99c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LWPMXJ3NAD5GNVLK5SMG4G6X6R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Suboptimal Solution Path Algorithm for Support Vector Machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ichiro Takeuchi, Masayuki Karasuyama","submitted_at":"2011-05-03T03:14:14Z","abstract_excerpt":"We consider a suboptimal solution path algorithm for the Support Vector Machine. The solution path algorithm is an effective tool for solving a sequence of a parametrized optimization problems in machine learning. The path of the solutions provided by this algorithm are very accurate and they satisfy the optimality conditions more strictly than other SVM optimization algorithms. In many machine learning application, however, this strict optimality is often unnecessary, and it adversely affects the computational efficiency. Our algorithm can generate the path of suboptimal solutions within an a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0471","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-18T04:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tP+UP1H8S5HVPn/IzYeFAEJWgrJALuYOM6KC0ykv42C+6RYZ6+UIk+1kzH8jLWLIY07qumO3rLg1PAhUI/AjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:37:28.670753Z"},"content_sha256":"e7c63017b513bb8f608beffd3d9740cae85beb0e04b17870216a6c43a6627870","schema_version":"1.0","event_id":"sha256:e7c63017b513bb8f608beffd3d9740cae85beb0e04b17870216a6c43a6627870"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWPMXJ3NAD5GNVLK5SMG4G6X6R/bundle.json","state_url":"https://pith.science/pith/LWPMXJ3NAD5GNVLK5SMG4G6X6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWPMXJ3NAD5GNVLK5SMG4G6X6R/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-31T16:37:28Z","links":{"resolver":"https://pith.science/pith/LWPMXJ3NAD5GNVLK5SMG4G6X6R","bundle":"https://pith.science/pith/LWPMXJ3NAD5GNVLK5SMG4G6X6R/bundle.json","state":"https://pith.science/pith/LWPMXJ3NAD5GNVLK5SMG4G6X6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWPMXJ3NAD5GNVLK5SMG4G6X6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LWPMXJ3NAD5GNVLK5SMG4G6X6R","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":"14f843b990cd6f7c17ae5fb5e52f243aadceb65b8b7b3021faa7958e14806329","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-05-03T03:14:14Z","title_canon_sha256":"ac30e1369d21767959f92e307dc5ce3a37bbdcfe1e3ccbf7b4343b5cf1813203"},"schema_version":"1.0","source":{"id":"1105.0471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0471","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0471v1","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0471","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"LWPMXJ3NAD5G","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LWPMXJ3NAD5GNVLK","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LWPMXJ3N","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:e7c63017b513bb8f608beffd3d9740cae85beb0e04b17870216a6c43a6627870","target":"graph","created_at":"2026-05-18T04:23:11Z","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":"We consider a suboptimal solution path algorithm for the Support Vector Machine. The solution path algorithm is an effective tool for solving a sequence of a parametrized optimization problems in machine learning. The path of the solutions provided by this algorithm are very accurate and they satisfy the optimality conditions more strictly than other SVM optimization algorithms. In many machine learning application, however, this strict optimality is often unnecessary, and it adversely affects the computational efficiency. Our algorithm can generate the path of suboptimal solutions within an a","authors_text":"Ichiro Takeuchi, Masayuki Karasuyama","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-05-03T03:14:14Z","title":"Suboptimal Solution Path Algorithm for Support Vector Machine"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0471","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:73d094f793f5e2bfb00f72b4fea3e91b3fe32a43ae6cad12847217d9f81e99c2","target":"record","created_at":"2026-05-18T04:23:11Z","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":"14f843b990cd6f7c17ae5fb5e52f243aadceb65b8b7b3021faa7958e14806329","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-05-03T03:14:14Z","title_canon_sha256":"ac30e1369d21767959f92e307dc5ce3a37bbdcfe1e3ccbf7b4343b5cf1813203"},"schema_version":"1.0","source":{"id":"1105.0471","kind":"arxiv","version":1}},"canonical_sha256":"5d9ecba76d00fa66d56aec986e1bd7f45d10c3fddb912ad8ad289f96a74c7973","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d9ecba76d00fa66d56aec986e1bd7f45d10c3fddb912ad8ad289f96a74c7973","first_computed_at":"2026-05-18T04:23:11.225272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:11.225272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iy/q2BQcdATOaGwvbaA7iwwJzmvTuHK3lPrCL9/RmKP0DiAPitCqdxLVImTfJ5TxuIBaE72utkdzKwr1AgDpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:11.225675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73d094f793f5e2bfb00f72b4fea3e91b3fe32a43ae6cad12847217d9f81e99c2","sha256:e7c63017b513bb8f608beffd3d9740cae85beb0e04b17870216a6c43a6627870"],"state_sha256":"a1a3b140ebb98b4d4e42a3b7c8c6af95116f181cdd969444fd6966a201990862"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xtCKi0/KdB3FKe8asz8TWhFYi0X+O4+cBMdAkqT/sofik6LVzT36BiRGRkIpncY9xWSgN7YAFbkGiJOYt+ucCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:37:28.674239Z","bundle_sha256":"9559de72af3828aeb6d043240fceb7ee0d05867ed2af7e22915abdd2fcae0c3b"}}