{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5PNNIVSNUV43GB2VLWEPS7UPZK","short_pith_number":"pith:5PNNIVSN","canonical_record":{"source":{"id":"1507.03229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-12T13:07:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4b975f629e452287eabec0fa79076df8ce69d9f13e3176e3027f50ac2616c90b","abstract_canon_sha256":"585129e593e68dc841e67038555828995cc45cc02867d3306f2b273cf0b2ba53"},"schema_version":"1.0"},"canonical_sha256":"ebdad4564da579b307555d88f97e8fcaae8b6f2b434088ca9bf36aad5e87b012","source":{"kind":"arxiv","id":"1507.03229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03229","created_at":"2026-05-18T01:36:59Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03229v1","created_at":"2026-05-18T01:36:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03229","created_at":"2026-05-18T01:36:59Z"},{"alias_kind":"pith_short_12","alias_value":"5PNNIVSNUV43","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5PNNIVSNUV43GB2V","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5PNNIVSN","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5PNNIVSNUV43GB2VLWEPS7UPZK","target":"record","payload":{"canonical_record":{"source":{"id":"1507.03229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-12T13:07:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4b975f629e452287eabec0fa79076df8ce69d9f13e3176e3027f50ac2616c90b","abstract_canon_sha256":"585129e593e68dc841e67038555828995cc45cc02867d3306f2b273cf0b2ba53"},"schema_version":"1.0"},"canonical_sha256":"ebdad4564da579b307555d88f97e8fcaae8b6f2b434088ca9bf36aad5e87b012","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:59.323473Z","signature_b64":"jv9UpzYG51qpxAXwjpvALiyGW5Ey5v54vs69kK5A0533WDAnfd/dPJkd7DUMs7r+/C4kc677GPCMNEb9OHjJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebdad4564da579b307555d88f97e8fcaae8b6f2b434088ca9bf36aad5e87b012","last_reissued_at":"2026-05-18T01:36:59.322866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:59.322866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.03229","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:36:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mVBFFqR9LY9ZRgLfAa4oUlTOwx60mdeTnTZp1gd4adnqwGIuCyB3sxdG7PXM/xF5lUrsqIhd2LQrWYzvW6CBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:51:04.045154Z"},"content_sha256":"f4167c4f329572ba615f2965a1df48a41e40d0fcd15845a45b09752901dcde9d","schema_version":"1.0","event_id":"sha256:f4167c4f329572ba615f2965a1df48a41e40d0fcd15845a45b09752901dcde9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5PNNIVSNUV43GB2VLWEPS7UPZK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Homotopy Continuation Approaches for Robust SV Classification and Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ichiro Takeuchi, Kohei Ogawa, Masashi Sugiyama, Masayuki Karasuyama, Shinya Suzumura","submitted_at":"2015-07-12T13:07:26Z","abstract_excerpt":"In support vector machine (SVM) applications with unreliable data that contains a portion of outliers, non-robustness of SVMs often causes considerable performance deterioration. Although many approaches for improving the robustness of SVMs have been studied, two major challenges remain in robust SVM learning. First, robust learning algorithms are essentially formulated as non-convex optimization problems. It is thus important to develop a non-convex optimization method for robust SVM that can find a good local optimal solution. The second practical issue is how one can tune the hyperparameter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03229","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:36:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HoFwZCPqXNsQwsoF2BmE9Ry+v8UW0TW7MOqngdbvfh9iXBLqKGCOagxAgKH6iSnWXKC81u45x5RdJy5Q34JFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:51:04.045754Z"},"content_sha256":"3c6ed0c0567475beb9a4cbb1615a4fe7fca4fd80c53d2ec388bda1b78c981c05","schema_version":"1.0","event_id":"sha256:3c6ed0c0567475beb9a4cbb1615a4fe7fca4fd80c53d2ec388bda1b78c981c05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5PNNIVSNUV43GB2VLWEPS7UPZK/bundle.json","state_url":"https://pith.science/pith/5PNNIVSNUV43GB2VLWEPS7UPZK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5PNNIVSNUV43GB2VLWEPS7UPZK/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-31T19:51:04Z","links":{"resolver":"https://pith.science/pith/5PNNIVSNUV43GB2VLWEPS7UPZK","bundle":"https://pith.science/pith/5PNNIVSNUV43GB2VLWEPS7UPZK/bundle.json","state":"https://pith.science/pith/5PNNIVSNUV43GB2VLWEPS7UPZK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5PNNIVSNUV43GB2VLWEPS7UPZK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5PNNIVSNUV43GB2VLWEPS7UPZK","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":"585129e593e68dc841e67038555828995cc45cc02867d3306f2b273cf0b2ba53","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-12T13:07:26Z","title_canon_sha256":"4b975f629e452287eabec0fa79076df8ce69d9f13e3176e3027f50ac2616c90b"},"schema_version":"1.0","source":{"id":"1507.03229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03229","created_at":"2026-05-18T01:36:59Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03229v1","created_at":"2026-05-18T01:36:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03229","created_at":"2026-05-18T01:36:59Z"},{"alias_kind":"pith_short_12","alias_value":"5PNNIVSNUV43","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5PNNIVSNUV43GB2V","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5PNNIVSN","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:3c6ed0c0567475beb9a4cbb1615a4fe7fca4fd80c53d2ec388bda1b78c981c05","target":"graph","created_at":"2026-05-18T01:36: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":"In support vector machine (SVM) applications with unreliable data that contains a portion of outliers, non-robustness of SVMs often causes considerable performance deterioration. Although many approaches for improving the robustness of SVMs have been studied, two major challenges remain in robust SVM learning. First, robust learning algorithms are essentially formulated as non-convex optimization problems. It is thus important to develop a non-convex optimization method for robust SVM that can find a good local optimal solution. The second practical issue is how one can tune the hyperparameter","authors_text":"Ichiro Takeuchi, Kohei Ogawa, Masashi Sugiyama, Masayuki Karasuyama, Shinya Suzumura","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-12T13:07:26Z","title":"Homotopy Continuation Approaches for Robust SV Classification and Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03229","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:f4167c4f329572ba615f2965a1df48a41e40d0fcd15845a45b09752901dcde9d","target":"record","created_at":"2026-05-18T01:36: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":"585129e593e68dc841e67038555828995cc45cc02867d3306f2b273cf0b2ba53","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-12T13:07:26Z","title_canon_sha256":"4b975f629e452287eabec0fa79076df8ce69d9f13e3176e3027f50ac2616c90b"},"schema_version":"1.0","source":{"id":"1507.03229","kind":"arxiv","version":1}},"canonical_sha256":"ebdad4564da579b307555d88f97e8fcaae8b6f2b434088ca9bf36aad5e87b012","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebdad4564da579b307555d88f97e8fcaae8b6f2b434088ca9bf36aad5e87b012","first_computed_at":"2026-05-18T01:36:59.322866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:59.322866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jv9UpzYG51qpxAXwjpvALiyGW5Ey5v54vs69kK5A0533WDAnfd/dPJkd7DUMs7r+/C4kc677GPCMNEb9OHjJCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:59.323473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4167c4f329572ba615f2965a1df48a41e40d0fcd15845a45b09752901dcde9d","sha256:3c6ed0c0567475beb9a4cbb1615a4fe7fca4fd80c53d2ec388bda1b78c981c05"],"state_sha256":"ffb92909f4c17fbbfb40d8881ff2bc86973cff7d38638e86ac7b3565a4781636"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdgAN2GOVyHph0t7tP5H1jK/kcnHg++otGOr5MFvfyvuQAjnvBr2SnOa72HDf5r0F989v9s9uC4c/0Ofe4JdCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:51:04.049783Z","bundle_sha256":"4804deb7aa47027fd99ef403c0b5a0008ebac8c350cd4b9d437e5d85d0ad8822"}}