{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:3I4DLZEHDBJQMR34OUHCME6FZT","short_pith_number":"pith:3I4DLZEH","canonical_record":{"source":{"id":"2102.03236","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-05T15:31:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"9ab7b20eb4b6f40216491e0847b786c205bf83327b67ae971fc0bd3afdccda74","abstract_canon_sha256":"6582a5c6cc46feb4225d72ed6a25285d5d1ed7eb2c991c506c498d72afa2ad73"},"schema_version":"1.0"},"canonical_sha256":"da3835e487185306477c750e2613c5cccec08b3cc2d698da2080ca7b45bb97d3","source":{"kind":"arxiv","id":"2102.03236","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.03236","created_at":"2026-07-05T03:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"2102.03236v2","created_at":"2026-07-05T03:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.03236","created_at":"2026-07-05T03:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"3I4DLZEHDBJQ","created_at":"2026-07-05T03:20:00Z"},{"alias_kind":"pith_short_16","alias_value":"3I4DLZEHDBJQMR34","created_at":"2026-07-05T03:20:00Z"},{"alias_kind":"pith_short_8","alias_value":"3I4DLZEH","created_at":"2026-07-05T03:20:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:3I4DLZEHDBJQMR34OUHCME6FZT","target":"record","payload":{"canonical_record":{"source":{"id":"2102.03236","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-05T15:31:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"9ab7b20eb4b6f40216491e0847b786c205bf83327b67ae971fc0bd3afdccda74","abstract_canon_sha256":"6582a5c6cc46feb4225d72ed6a25285d5d1ed7eb2c991c506c498d72afa2ad73"},"schema_version":"1.0"},"canonical_sha256":"da3835e487185306477c750e2613c5cccec08b3cc2d698da2080ca7b45bb97d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:00.091067Z","signature_b64":"sqtKOIDTwiXH/nfLrR71f4ybGLfPwA07Yc2lnZvRQGD0AQG8kHa677+8wfM7x35udbgAGiuv56YX2s2zc+mSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da3835e487185306477c750e2613c5cccec08b3cc2d698da2080ca7b45bb97d3","last_reissued_at":"2026-07-05T03:20:00.090582Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:00.090582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.03236","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-07-05T03:20:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Py72W8zpsfHoIH3pPVSiXeMmA6JktZer8g5hJ1SdoDJ08DeYNYWeMed5FL4IFECo0ci/ajwgYiohjkQTavL7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T07:39:47.500563Z"},"content_sha256":"8452a3e99dadaf3f6e780696d798783cb526f8561d76526768fc1058fd26e497","schema_version":"1.0","event_id":"sha256:8452a3e99dadaf3f6e780696d798783cb526f8561d76526768fc1058fd26e497"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:3I4DLZEHDBJQMR34OUHCME6FZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Optimization of Conformal Predictors via Incremental and Decremental Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Giovanni Cherubin, Konstantinos Chatzikokolakis, Martin Jaggi","submitted_at":"2021-02-05T15:31:37Z","abstract_excerpt":"Conformal Predictors (CP) are wrappers around ML models, providing error guarantees under weak assumptions on the data distribution. They are suitable for a wide range of problems, from classification and regression to anomaly detection. Unfortunately, their very high computational complexity limits their applicability to large datasets. In this work, we show that it is possible to speed up a CP classifier considerably, by studying it in conjunction with the underlying ML method, and by exploiting incremental&decremental learning. For methods such as k-NN, KDE, and kernel LS-SVM, our approach "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.03236","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.03236/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:20:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p9rcir8gLYGRAzZ4hcLA2uaI1KBLp4+j7jNYigfXEOUatZgDnoY3SPfeNnOEabBdSWMOkgkDJK7cAjpFNXd1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T07:39:47.500934Z"},"content_sha256":"d0c9a22c2c0ce92250c09fc85d90932ecaf109830f1beac8c0e9a694693d3630","schema_version":"1.0","event_id":"sha256:d0c9a22c2c0ce92250c09fc85d90932ecaf109830f1beac8c0e9a694693d3630"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3I4DLZEHDBJQMR34OUHCME6FZT/bundle.json","state_url":"https://pith.science/pith/3I4DLZEHDBJQMR34OUHCME6FZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3I4DLZEHDBJQMR34OUHCME6FZT/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-07-21T07:39:47Z","links":{"resolver":"https://pith.science/pith/3I4DLZEHDBJQMR34OUHCME6FZT","bundle":"https://pith.science/pith/3I4DLZEHDBJQMR34OUHCME6FZT/bundle.json","state":"https://pith.science/pith/3I4DLZEHDBJQMR34OUHCME6FZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3I4DLZEHDBJQMR34OUHCME6FZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:3I4DLZEHDBJQMR34OUHCME6FZT","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":"6582a5c6cc46feb4225d72ed6a25285d5d1ed7eb2c991c506c498d72afa2ad73","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-05T15:31:37Z","title_canon_sha256":"9ab7b20eb4b6f40216491e0847b786c205bf83327b67ae971fc0bd3afdccda74"},"schema_version":"1.0","source":{"id":"2102.03236","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.03236","created_at":"2026-07-05T03:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"2102.03236v2","created_at":"2026-07-05T03:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.03236","created_at":"2026-07-05T03:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"3I4DLZEHDBJQ","created_at":"2026-07-05T03:20:00Z"},{"alias_kind":"pith_short_16","alias_value":"3I4DLZEHDBJQMR34","created_at":"2026-07-05T03:20:00Z"},{"alias_kind":"pith_short_8","alias_value":"3I4DLZEH","created_at":"2026-07-05T03:20:00Z"}],"graph_snapshots":[{"event_id":"sha256:d0c9a22c2c0ce92250c09fc85d90932ecaf109830f1beac8c0e9a694693d3630","target":"graph","created_at":"2026-07-05T03:20:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.03236/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Conformal Predictors (CP) are wrappers around ML models, providing error guarantees under weak assumptions on the data distribution. They are suitable for a wide range of problems, from classification and regression to anomaly detection. Unfortunately, their very high computational complexity limits their applicability to large datasets. In this work, we show that it is possible to speed up a CP classifier considerably, by studying it in conjunction with the underlying ML method, and by exploiting incremental&decremental learning. For methods such as k-NN, KDE, and kernel LS-SVM, our approach ","authors_text":"Giovanni Cherubin, Konstantinos Chatzikokolakis, Martin Jaggi","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-05T15:31:37Z","title":"Exact Optimization of Conformal Predictors via Incremental and Decremental Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.03236","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:8452a3e99dadaf3f6e780696d798783cb526f8561d76526768fc1058fd26e497","target":"record","created_at":"2026-07-05T03:20:00Z","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":"6582a5c6cc46feb4225d72ed6a25285d5d1ed7eb2c991c506c498d72afa2ad73","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-05T15:31:37Z","title_canon_sha256":"9ab7b20eb4b6f40216491e0847b786c205bf83327b67ae971fc0bd3afdccda74"},"schema_version":"1.0","source":{"id":"2102.03236","kind":"arxiv","version":2}},"canonical_sha256":"da3835e487185306477c750e2613c5cccec08b3cc2d698da2080ca7b45bb97d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da3835e487185306477c750e2613c5cccec08b3cc2d698da2080ca7b45bb97d3","first_computed_at":"2026-07-05T03:20:00.090582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:20:00.090582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sqtKOIDTwiXH/nfLrR71f4ybGLfPwA07Yc2lnZvRQGD0AQG8kHa677+8wfM7x35udbgAGiuv56YX2s2zc+mSCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:20:00.091067Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.03236","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8452a3e99dadaf3f6e780696d798783cb526f8561d76526768fc1058fd26e497","sha256:d0c9a22c2c0ce92250c09fc85d90932ecaf109830f1beac8c0e9a694693d3630"],"state_sha256":"7d849270181aa71c049f0112fdc3fcdaea2b07eba57bda60514838536fdb9cae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pMbVM9KyrkE8a1G+J+k7vXe0bDajkomtWBqSl+h+SPKSaSShMrvDY6IifN92jPn4WZbSuy6EZOaF3qq2TgluCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-21T07:39:47.503441Z","bundle_sha256":"7b39e21f7d60e380665487511ac2a0d0bbfef9c6d485cce287ab37bf7175ce9f"}}