{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DQNWCLKBNCLTK6SNIR6OUFON6E","short_pith_number":"pith:DQNWCLKB","canonical_record":{"source":{"id":"1504.02870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-11T13:25:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"670d5875f919705fd313af5fc23bfc746b501992a36949b7c07b7222efceaf06","abstract_canon_sha256":"2c2ec86e54591ce2a19dc869aa26caaae7f19382aa395f03b676e1ba8c667f19"},"schema_version":"1.0"},"canonical_sha256":"1c1b612d416897357a4d447cea15cdf124df0addf9a384aa7adc5e26d8022d28","source":{"kind":"arxiv","id":"1504.02870","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02870","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02870v1","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02870","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"DQNWCLKBNCLT","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DQNWCLKBNCLTK6SN","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DQNWCLKB","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DQNWCLKBNCLTK6SNIR6OUFON6E","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-11T13:25:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"670d5875f919705fd313af5fc23bfc746b501992a36949b7c07b7222efceaf06","abstract_canon_sha256":"2c2ec86e54591ce2a19dc869aa26caaae7f19382aa395f03b676e1ba8c667f19"},"schema_version":"1.0"},"canonical_sha256":"1c1b612d416897357a4d447cea15cdf124df0addf9a384aa7adc5e26d8022d28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:59.804587Z","signature_b64":"cQt3RdsDrq2mMQfJq0VLq5bXJi8KnwaOaePvV2stWHt8SbDe7mJbMVm1JsPWpG6Z8ljAUhcwvB8dy23VgdnUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c1b612d416897357a4d447cea15cdf124df0addf9a384aa7adc5e26d8022d28","last_reissued_at":"2026-05-18T02:18:59.804099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:59.804099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02870","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:18:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVwZ/VhXwpIMmGt+9AcP1f15n96/Y6Dyq3+r7DJQl2s3jKEzA+cM2tIxC8SbBWdWEtwpqgSBN+F4Ns42hn84Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T19:07:36.417019Z"},"content_sha256":"190c39e52fd6950a4f32d10c2812582556d746c7c774aef36248a412646ba406","schema_version":"1.0","event_id":"sha256:190c39e52fd6950a4f32d10c2812582556d746c7c774aef36248a412646ba406"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DQNWCLKBNCLTK6SNIR6OUFON6E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quick sensitivity analysis for incremental data modification and its application to leave-one-out CV in linear classification problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ichiro Takeuchi, Shota Okumura, Yoshiki Suzuki","submitted_at":"2015-04-11T13:25:37Z","abstract_excerpt":"We introduce a novel sensitivity analysis framework for large scale classification problems that can be used when a small number of instances are incrementally added or removed. For quickly updating the classifier in such a situation, incremental learning algorithms have been intensively studied in the literature. Although they are much more efficient than solving the optimization problem from scratch, their computational complexity yet depends on the entire training set size. It means that, if the original training set is large, completely solving an incremental learning problem might be stil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02870","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:18:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NK219t50V55aEYQ5ZkvptOt+D9woCJT8Abkmc++x6PSPtrpt9CNBO+0G6D3ctjkn9Fa9uys8dM8cGTYWhH8xBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T19:07:36.417404Z"},"content_sha256":"1a313bc144859845af849d9d63202c23b13da1d6a45a76d1ab4347de29907d04","schema_version":"1.0","event_id":"sha256:1a313bc144859845af849d9d63202c23b13da1d6a45a76d1ab4347de29907d04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DQNWCLKBNCLTK6SNIR6OUFON6E/bundle.json","state_url":"https://pith.science/pith/DQNWCLKBNCLTK6SNIR6OUFON6E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DQNWCLKBNCLTK6SNIR6OUFON6E/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-26T19:07:36Z","links":{"resolver":"https://pith.science/pith/DQNWCLKBNCLTK6SNIR6OUFON6E","bundle":"https://pith.science/pith/DQNWCLKBNCLTK6SNIR6OUFON6E/bundle.json","state":"https://pith.science/pith/DQNWCLKBNCLTK6SNIR6OUFON6E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DQNWCLKBNCLTK6SNIR6OUFON6E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DQNWCLKBNCLTK6SNIR6OUFON6E","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":"2c2ec86e54591ce2a19dc869aa26caaae7f19382aa395f03b676e1ba8c667f19","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-11T13:25:37Z","title_canon_sha256":"670d5875f919705fd313af5fc23bfc746b501992a36949b7c07b7222efceaf06"},"schema_version":"1.0","source":{"id":"1504.02870","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02870","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02870v1","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02870","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"DQNWCLKBNCLT","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DQNWCLKBNCLTK6SN","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DQNWCLKB","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:1a313bc144859845af849d9d63202c23b13da1d6a45a76d1ab4347de29907d04","target":"graph","created_at":"2026-05-18T02:18: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":"We introduce a novel sensitivity analysis framework for large scale classification problems that can be used when a small number of instances are incrementally added or removed. For quickly updating the classifier in such a situation, incremental learning algorithms have been intensively studied in the literature. Although they are much more efficient than solving the optimization problem from scratch, their computational complexity yet depends on the entire training set size. It means that, if the original training set is large, completely solving an incremental learning problem might be stil","authors_text":"Ichiro Takeuchi, Shota Okumura, Yoshiki Suzuki","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-11T13:25:37Z","title":"Quick sensitivity analysis for incremental data modification and its application to leave-one-out CV in linear classification problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02870","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:190c39e52fd6950a4f32d10c2812582556d746c7c774aef36248a412646ba406","target":"record","created_at":"2026-05-18T02:18: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":"2c2ec86e54591ce2a19dc869aa26caaae7f19382aa395f03b676e1ba8c667f19","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-11T13:25:37Z","title_canon_sha256":"670d5875f919705fd313af5fc23bfc746b501992a36949b7c07b7222efceaf06"},"schema_version":"1.0","source":{"id":"1504.02870","kind":"arxiv","version":1}},"canonical_sha256":"1c1b612d416897357a4d447cea15cdf124df0addf9a384aa7adc5e26d8022d28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c1b612d416897357a4d447cea15cdf124df0addf9a384aa7adc5e26d8022d28","first_computed_at":"2026-05-18T02:18:59.804099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:59.804099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cQt3RdsDrq2mMQfJq0VLq5bXJi8KnwaOaePvV2stWHt8SbDe7mJbMVm1JsPWpG6Z8ljAUhcwvB8dy23VgdnUBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:59.804587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02870","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:190c39e52fd6950a4f32d10c2812582556d746c7c774aef36248a412646ba406","sha256:1a313bc144859845af849d9d63202c23b13da1d6a45a76d1ab4347de29907d04"],"state_sha256":"3862114806c81cf2e4e6fcb10f45c19de823306d25661b997138de35d465d126"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OQjr4hpqfajNZLdBIU7DxoqYgI5RKb9Byy6tTnf7oobxD49xJmigtdiFkM+8SVVScXO17F4HjmcoKLc32xrpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T19:07:36.419361Z","bundle_sha256":"65fdbd857ca52b0e7c0aa71d27ba65e5c28edb3a5cad3e185e15e4f4a1beac6e"}}