{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OTFSDUD466226R7YE5ZQPJ6LWY","short_pith_number":"pith:OTFSDUD4","canonical_record":{"source":{"id":"1606.00136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T06:56:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a6b9da8ca83e00b476347bd3480029ea85c3d64086803c3e82ad6c92ee36a8e9","abstract_canon_sha256":"646fbd6b8f453674877c1b00a916a7d2ebf925e3522410956b0099f0779ec575"},"schema_version":"1.0"},"canonical_sha256":"74cb21d07cf7b5af47f8277307a7cbb61b2a97cb3f2d37a2cd6cf1f918563aa9","source":{"kind":"arxiv","id":"1606.00136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00136","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00136v1","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00136","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"OTFSDUD46622","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OTFSDUD466226R7Y","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OTFSDUD4","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OTFSDUD466226R7YE5ZQPJ6LWY","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T06:56:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a6b9da8ca83e00b476347bd3480029ea85c3d64086803c3e82ad6c92ee36a8e9","abstract_canon_sha256":"646fbd6b8f453674877c1b00a916a7d2ebf925e3522410956b0099f0779ec575"},"schema_version":"1.0"},"canonical_sha256":"74cb21d07cf7b5af47f8277307a7cbb61b2a97cb3f2d37a2cd6cf1f918563aa9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:05.842278Z","signature_b64":"tsgeSMUDWqg+F7NAH2kYo52lRva/WU+STgYgLN0doaza2cSvh0dwRszj6iXVk6OwQj+dathGeKKErvBZsph7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74cb21d07cf7b5af47f8277307a7cbb61b2a97cb3f2d37a2cd6cf1f918563aa9","last_reissued_at":"2026-05-18T01:13:05.841938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:05.841938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00136","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:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FG/0P6/u0HCqD1iHjx1g/go8JpJolwWmQ4ZzDTN3X1aoLfw9djvGVAbD+T+saGHbqZ0H5n0YnORBoa7sRG23DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:50:40.558622Z"},"content_sha256":"c92e90851baf65b9b97b127b580d4b7d44d82f0fc34747ccff2a160142685486","schema_version":"1.0","event_id":"sha256:c92e90851baf65b9b97b127b580d4b7d44d82f0fc34747ccff2a160142685486"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OTFSDUD466226R7YE5ZQPJ6LWY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiently Bounding Optimal Solutions after Small Data Modification in Large-Scale Empirical Risk Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Atsushi Shibagaki, Hiroyuki Hanada, Ichiro Takeuchi, Jun Sakuma","submitted_at":"2016-06-01T06:56:17Z","abstract_excerpt":"We study large-scale classification problems in changing environments where a small part of the dataset is modified, and the effect of the data modification must be quickly incorporated into the classifier. When the entire dataset is large, even if the amount of the data modification is fairly small, the computational cost of re-training the classifier would be prohibitively large. In this paper, we propose a novel method for efficiently incorporating such a data modification effect into the classifier without actually re-training it. The proposed method provides bounds on the unknown optimal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00136","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:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZkiXSVhMXE25xbps8J0RXHXg8I4o1Zwq8KGD7PKmY0ey+kq6u/LVVSCgLI945i0qcQlr0dviAYBzgD0N9h0fBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:50:40.558973Z"},"content_sha256":"2f5e49bdd80cb5a201d03982d3fb68e4d1fa8f9cd799df36c3cf49d4e3faebdf","schema_version":"1.0","event_id":"sha256:2f5e49bdd80cb5a201d03982d3fb68e4d1fa8f9cd799df36c3cf49d4e3faebdf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTFSDUD466226R7YE5ZQPJ6LWY/bundle.json","state_url":"https://pith.science/pith/OTFSDUD466226R7YE5ZQPJ6LWY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTFSDUD466226R7YE5ZQPJ6LWY/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-01T12:50:40Z","links":{"resolver":"https://pith.science/pith/OTFSDUD466226R7YE5ZQPJ6LWY","bundle":"https://pith.science/pith/OTFSDUD466226R7YE5ZQPJ6LWY/bundle.json","state":"https://pith.science/pith/OTFSDUD466226R7YE5ZQPJ6LWY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTFSDUD466226R7YE5ZQPJ6LWY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OTFSDUD466226R7YE5ZQPJ6LWY","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":"646fbd6b8f453674877c1b00a916a7d2ebf925e3522410956b0099f0779ec575","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T06:56:17Z","title_canon_sha256":"a6b9da8ca83e00b476347bd3480029ea85c3d64086803c3e82ad6c92ee36a8e9"},"schema_version":"1.0","source":{"id":"1606.00136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00136","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00136v1","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00136","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"OTFSDUD46622","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OTFSDUD466226R7Y","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OTFSDUD4","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:2f5e49bdd80cb5a201d03982d3fb68e4d1fa8f9cd799df36c3cf49d4e3faebdf","target":"graph","created_at":"2026-05-18T01:13:05Z","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 study large-scale classification problems in changing environments where a small part of the dataset is modified, and the effect of the data modification must be quickly incorporated into the classifier. When the entire dataset is large, even if the amount of the data modification is fairly small, the computational cost of re-training the classifier would be prohibitively large. In this paper, we propose a novel method for efficiently incorporating such a data modification effect into the classifier without actually re-training it. The proposed method provides bounds on the unknown optimal ","authors_text":"Atsushi Shibagaki, Hiroyuki Hanada, Ichiro Takeuchi, Jun Sakuma","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T06:56:17Z","title":"Efficiently Bounding Optimal Solutions after Small Data Modification in Large-Scale Empirical Risk Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00136","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:c92e90851baf65b9b97b127b580d4b7d44d82f0fc34747ccff2a160142685486","target":"record","created_at":"2026-05-18T01:13:05Z","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":"646fbd6b8f453674877c1b00a916a7d2ebf925e3522410956b0099f0779ec575","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T06:56:17Z","title_canon_sha256":"a6b9da8ca83e00b476347bd3480029ea85c3d64086803c3e82ad6c92ee36a8e9"},"schema_version":"1.0","source":{"id":"1606.00136","kind":"arxiv","version":1}},"canonical_sha256":"74cb21d07cf7b5af47f8277307a7cbb61b2a97cb3f2d37a2cd6cf1f918563aa9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74cb21d07cf7b5af47f8277307a7cbb61b2a97cb3f2d37a2cd6cf1f918563aa9","first_computed_at":"2026-05-18T01:13:05.841938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:05.841938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tsgeSMUDWqg+F7NAH2kYo52lRva/WU+STgYgLN0doaza2cSvh0dwRszj6iXVk6OwQj+dathGeKKErvBZsph7Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:05.842278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c92e90851baf65b9b97b127b580d4b7d44d82f0fc34747ccff2a160142685486","sha256:2f5e49bdd80cb5a201d03982d3fb68e4d1fa8f9cd799df36c3cf49d4e3faebdf"],"state_sha256":"1223e9573f46a0cd2441fc010531283e2e8b06cacbc7b8f9713779372e337011"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjnod9k6CsaujNteod2gcMG/qckH+ILjBDv0Khd4tU0q8/3sQFMI+E2qnrrR36TPU3r1N52+Si4eZhBoNcL2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:50:40.560946Z","bundle_sha256":"4e0d0d103531728e95c6ac6a5c66934b303cccd241039f483981ee0e3b4d65cc"}}