{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:6KEJACC2YLWD7QKJSWXAPTMIMW","short_pith_number":"pith:6KEJACC2","canonical_record":{"source":{"id":"1009.4791","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-24T09:53:32Z","cross_cats_sorted":[],"title_canon_sha256":"0c0f832157adc15811af7213b3c9cd5846d0a4cfe8912139616455bf9b49338a","abstract_canon_sha256":"5fbf39341c55c2e0347d94a015bda041a643ad66adca11e68fe5e3dcafc1c5c6"},"schema_version":"1.0"},"canonical_sha256":"f28890085ac2ec3fc14995ae07cd8865ae3ecb21220935d86981403d6eb22738","source":{"kind":"arxiv","id":"1009.4791","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4791","created_at":"2026-05-18T04:37:32Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4791v2","created_at":"2026-05-18T04:37:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4791","created_at":"2026-05-18T04:37:32Z"},{"alias_kind":"pith_short_12","alias_value":"6KEJACC2YLWD","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6KEJACC2YLWD7QKJ","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6KEJACC2","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:6KEJACC2YLWD7QKJSWXAPTMIMW","target":"record","payload":{"canonical_record":{"source":{"id":"1009.4791","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-24T09:53:32Z","cross_cats_sorted":[],"title_canon_sha256":"0c0f832157adc15811af7213b3c9cd5846d0a4cfe8912139616455bf9b49338a","abstract_canon_sha256":"5fbf39341c55c2e0347d94a015bda041a643ad66adca11e68fe5e3dcafc1c5c6"},"schema_version":"1.0"},"canonical_sha256":"f28890085ac2ec3fc14995ae07cd8865ae3ecb21220935d86981403d6eb22738","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:32.838973Z","signature_b64":"V7tUBn1rmFr1oUeCUe8uarYH27zRBN+m8VXbs7JwJ9nnMcQA++79osDraZ1ZCrbyoSmdryuHroszMVGrWt4uBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f28890085ac2ec3fc14995ae07cd8865ae3ecb21220935d86981403d6eb22738","last_reissued_at":"2026-05-18T04:37:32.838451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:32.838451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.4791","source_version":2,"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:37:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lMw6gw6Fa3+t0OaYLTLaxdMMm599rPWIid3LD5A+OSlqEnihfxAuThnJNh3OvOFRQAl91AQ7o/PNJEjQjsMFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:04:51.719363Z"},"content_sha256":"9aed3bad17e0e77308aae30bca01132d4e7cb87744dd73e4a07ac1b640e05d9b","schema_version":"1.0","event_id":"sha256:9aed3bad17e0e77308aae30bca01132d4e7cb87744dd73e4a07ac1b640e05d9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:6KEJACC2YLWD7QKJSWXAPTMIMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-parametric Solution-path Algorithm for Instance-weighted Support Vector Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ichiro Takeuchi, Masashi Sugiyama, Masayuki Karasuyama, Naoyuki Harada","submitted_at":"2010-09-24T09:53:32Z","abstract_excerpt":"An instance-weighted variant of the support vector machine (SVM) has attracted considerable attention recently since they are useful in various machine learning tasks such as non-stationary data analysis, heteroscedastic data modeling, transfer learning, learning to rank, and transduction. An important challenge in these scenarios is to overcome the computational bottleneck---instance weights often change dynamically or adaptively, and thus the weighted SVM solutions must be repeatedly computed. In this paper, we develop an algorithm that can efficiently and exactly update the weighted SVM sol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4791","kind":"arxiv","version":2},"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:37:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6SSuGT0oQewKuKCNSalZUTjVNVrDUHnQYTG03eP6Y52Agwy1yn84f1lQdM6YRHREYdcJTJioj2RmOrorCN8wAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:04:51.719716Z"},"content_sha256":"6a238e3b5a469e46f4b90b4334328c7a45aa1b9a8269f72d260f9ffaaf4433ac","schema_version":"1.0","event_id":"sha256:6a238e3b5a469e46f4b90b4334328c7a45aa1b9a8269f72d260f9ffaaf4433ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KEJACC2YLWD7QKJSWXAPTMIMW/bundle.json","state_url":"https://pith.science/pith/6KEJACC2YLWD7QKJSWXAPTMIMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KEJACC2YLWD7QKJSWXAPTMIMW/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-31T21:04:51Z","links":{"resolver":"https://pith.science/pith/6KEJACC2YLWD7QKJSWXAPTMIMW","bundle":"https://pith.science/pith/6KEJACC2YLWD7QKJSWXAPTMIMW/bundle.json","state":"https://pith.science/pith/6KEJACC2YLWD7QKJSWXAPTMIMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KEJACC2YLWD7QKJSWXAPTMIMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:6KEJACC2YLWD7QKJSWXAPTMIMW","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":"5fbf39341c55c2e0347d94a015bda041a643ad66adca11e68fe5e3dcafc1c5c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-24T09:53:32Z","title_canon_sha256":"0c0f832157adc15811af7213b3c9cd5846d0a4cfe8912139616455bf9b49338a"},"schema_version":"1.0","source":{"id":"1009.4791","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4791","created_at":"2026-05-18T04:37:32Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4791v2","created_at":"2026-05-18T04:37:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4791","created_at":"2026-05-18T04:37:32Z"},{"alias_kind":"pith_short_12","alias_value":"6KEJACC2YLWD","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6KEJACC2YLWD7QKJ","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6KEJACC2","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:6a238e3b5a469e46f4b90b4334328c7a45aa1b9a8269f72d260f9ffaaf4433ac","target":"graph","created_at":"2026-05-18T04:37:32Z","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":"An instance-weighted variant of the support vector machine (SVM) has attracted considerable attention recently since they are useful in various machine learning tasks such as non-stationary data analysis, heteroscedastic data modeling, transfer learning, learning to rank, and transduction. An important challenge in these scenarios is to overcome the computational bottleneck---instance weights often change dynamically or adaptively, and thus the weighted SVM solutions must be repeatedly computed. In this paper, we develop an algorithm that can efficiently and exactly update the weighted SVM sol","authors_text":"Ichiro Takeuchi, Masashi Sugiyama, Masayuki Karasuyama, Naoyuki Harada","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-24T09:53:32Z","title":"Multi-parametric Solution-path Algorithm for Instance-weighted Support Vector Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4791","kind":"arxiv","version":2},"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:9aed3bad17e0e77308aae30bca01132d4e7cb87744dd73e4a07ac1b640e05d9b","target":"record","created_at":"2026-05-18T04:37:32Z","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":"5fbf39341c55c2e0347d94a015bda041a643ad66adca11e68fe5e3dcafc1c5c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-24T09:53:32Z","title_canon_sha256":"0c0f832157adc15811af7213b3c9cd5846d0a4cfe8912139616455bf9b49338a"},"schema_version":"1.0","source":{"id":"1009.4791","kind":"arxiv","version":2}},"canonical_sha256":"f28890085ac2ec3fc14995ae07cd8865ae3ecb21220935d86981403d6eb22738","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f28890085ac2ec3fc14995ae07cd8865ae3ecb21220935d86981403d6eb22738","first_computed_at":"2026-05-18T04:37:32.838451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:37:32.838451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V7tUBn1rmFr1oUeCUe8uarYH27zRBN+m8VXbs7JwJ9nnMcQA++79osDraZ1ZCrbyoSmdryuHroszMVGrWt4uBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:37:32.838973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4791","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9aed3bad17e0e77308aae30bca01132d4e7cb87744dd73e4a07ac1b640e05d9b","sha256:6a238e3b5a469e46f4b90b4334328c7a45aa1b9a8269f72d260f9ffaaf4433ac"],"state_sha256":"46e1ae00bfedd1fdac3da067468b6ba1eeb71239ada6658775f3804bdb4776d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cIYGLP5E074D3DqMQXgUUlHitsypVmrUhzUVzOD/XLqq7ftKWZfS5aZcYQ6xXdb3U36cSZo3+v/Gckq+UbJQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:04:51.722229Z","bundle_sha256":"de492b14d2c8af3012f6040be9896e82ec257b55824301755efa3bcca6fb6c17"}}