{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YX6HSXEQUSFIA62XMCUNBMC5PI","short_pith_number":"pith:YX6HSXEQ","canonical_record":{"source":{"id":"1508.02986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-12T16:46:29Z","cross_cats_sorted":[],"title_canon_sha256":"61b99ceb35d4087d8a891cbbc0cf005354a72eb232e6aa94605f9fce4779880c","abstract_canon_sha256":"05ce36d06c5a4cbfffefea475703848682ed56b4a786d038bc3089efd6d7a64d"},"schema_version":"1.0"},"canonical_sha256":"c5fc795c90a48a807b5760a8d0b05d7a24373b21b25cd900f89f7c7658fcd950","source":{"kind":"arxiv","id":"1508.02986","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02986","created_at":"2026-05-18T01:35:23Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02986v1","created_at":"2026-05-18T01:35:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02986","created_at":"2026-05-18T01:35:23Z"},{"alias_kind":"pith_short_12","alias_value":"YX6HSXEQUSFI","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YX6HSXEQUSFIA62X","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YX6HSXEQ","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YX6HSXEQUSFIA62XMCUNBMC5PI","target":"record","payload":{"canonical_record":{"source":{"id":"1508.02986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-12T16:46:29Z","cross_cats_sorted":[],"title_canon_sha256":"61b99ceb35d4087d8a891cbbc0cf005354a72eb232e6aa94605f9fce4779880c","abstract_canon_sha256":"05ce36d06c5a4cbfffefea475703848682ed56b4a786d038bc3089efd6d7a64d"},"schema_version":"1.0"},"canonical_sha256":"c5fc795c90a48a807b5760a8d0b05d7a24373b21b25cd900f89f7c7658fcd950","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:23.198868Z","signature_b64":"G7amxmlYgARcrKelXbRTf9hQOyT64ZLEggNjRDPXIwMmr4OFt7ttiZ02rEX1cMVRjBPk0EnTf2SPbt0z8P2OAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5fc795c90a48a807b5760a8d0b05d7a24373b21b25cd900f89f7c7658fcd950","last_reissued_at":"2026-05-18T01:35:23.198131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:23.198131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.02986","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:35:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axm56Uk/DhjjQasfJjLQVzYhxsDuZ7WYhAzvCNoqCR8MC3yTXTwBNdUiYn+SuakP9zCQf6LVR4dnzGGmC3gZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:14:43.976357Z"},"content_sha256":"199117cf96112afdc3a6ad6ac274fcd59201d7b86adb20a9a852da005a063ff9","schema_version":"1.0","event_id":"sha256:199117cf96112afdc3a6ad6ac274fcd59201d7b86adb20a9a852da005a063ff9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YX6HSXEQUSFIA62XMCUNBMC5PI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Cutting Planes Algorithms to Compression Schemes and Active Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Liva Ralaivola, Ugo Louche","submitted_at":"2015-08-12T16:46:29Z","abstract_excerpt":"Cutting-plane methods are well-studied localization(and optimization) algorithms. We show that they provide a natural framework to perform machinelearning ---and not just to solve optimization problems posed by machinelearning--- in addition to their intended optimization use. In particular, theyallow one to learn sparse classifiers and provide good compression schemes.Moreover, we show that very little effort is required to turn them intoeffective active learning methods. This last property provides a generic way todesign a whole family of active learning algorithms from existing passivemetho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02986","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:35:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8kaK6IHwjbIrf29Cq7KGrI6SolB4NFcVr+kRibBJ1h7JhqHJoqeqCol0zwEBc0C0Qa8TWJUpoiEV7ctXS9iwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:14:43.976719Z"},"content_sha256":"fe0a4aba7964b97444772b089d6596f5fe3a2b4b2608e2ee813a15bead6f58fb","schema_version":"1.0","event_id":"sha256:fe0a4aba7964b97444772b089d6596f5fe3a2b4b2608e2ee813a15bead6f58fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YX6HSXEQUSFIA62XMCUNBMC5PI/bundle.json","state_url":"https://pith.science/pith/YX6HSXEQUSFIA62XMCUNBMC5PI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YX6HSXEQUSFIA62XMCUNBMC5PI/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-04T05:14:43Z","links":{"resolver":"https://pith.science/pith/YX6HSXEQUSFIA62XMCUNBMC5PI","bundle":"https://pith.science/pith/YX6HSXEQUSFIA62XMCUNBMC5PI/bundle.json","state":"https://pith.science/pith/YX6HSXEQUSFIA62XMCUNBMC5PI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YX6HSXEQUSFIA62XMCUNBMC5PI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YX6HSXEQUSFIA62XMCUNBMC5PI","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":"05ce36d06c5a4cbfffefea475703848682ed56b4a786d038bc3089efd6d7a64d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-12T16:46:29Z","title_canon_sha256":"61b99ceb35d4087d8a891cbbc0cf005354a72eb232e6aa94605f9fce4779880c"},"schema_version":"1.0","source":{"id":"1508.02986","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02986","created_at":"2026-05-18T01:35:23Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02986v1","created_at":"2026-05-18T01:35:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02986","created_at":"2026-05-18T01:35:23Z"},{"alias_kind":"pith_short_12","alias_value":"YX6HSXEQUSFI","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YX6HSXEQUSFIA62X","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YX6HSXEQ","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:fe0a4aba7964b97444772b089d6596f5fe3a2b4b2608e2ee813a15bead6f58fb","target":"graph","created_at":"2026-05-18T01:35:23Z","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":"Cutting-plane methods are well-studied localization(and optimization) algorithms. We show that they provide a natural framework to perform machinelearning ---and not just to solve optimization problems posed by machinelearning--- in addition to their intended optimization use. In particular, theyallow one to learn sparse classifiers and provide good compression schemes.Moreover, we show that very little effort is required to turn them intoeffective active learning methods. This last property provides a generic way todesign a whole family of active learning algorithms from existing passivemetho","authors_text":"Liva Ralaivola, Ugo Louche","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-12T16:46:29Z","title":"From Cutting Planes Algorithms to Compression Schemes and Active Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02986","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:199117cf96112afdc3a6ad6ac274fcd59201d7b86adb20a9a852da005a063ff9","target":"record","created_at":"2026-05-18T01:35:23Z","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":"05ce36d06c5a4cbfffefea475703848682ed56b4a786d038bc3089efd6d7a64d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-12T16:46:29Z","title_canon_sha256":"61b99ceb35d4087d8a891cbbc0cf005354a72eb232e6aa94605f9fce4779880c"},"schema_version":"1.0","source":{"id":"1508.02986","kind":"arxiv","version":1}},"canonical_sha256":"c5fc795c90a48a807b5760a8d0b05d7a24373b21b25cd900f89f7c7658fcd950","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5fc795c90a48a807b5760a8d0b05d7a24373b21b25cd900f89f7c7658fcd950","first_computed_at":"2026-05-18T01:35:23.198131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:23.198131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G7amxmlYgARcrKelXbRTf9hQOyT64ZLEggNjRDPXIwMmr4OFt7ttiZ02rEX1cMVRjBPk0EnTf2SPbt0z8P2OAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:23.198868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02986","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:199117cf96112afdc3a6ad6ac274fcd59201d7b86adb20a9a852da005a063ff9","sha256:fe0a4aba7964b97444772b089d6596f5fe3a2b4b2608e2ee813a15bead6f58fb"],"state_sha256":"266790287fabccd077189c59009e143dee5243ebec070faaef0ce2246edce230"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"abOZaLuWcFjrql2LKpCAItsa6YXutfNg53wI7haIKPldBVXqsBN5G7VV1BhoeJ8vwd+H2QbbvtWkpD1ZTzqQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:14:43.978606Z","bundle_sha256":"b354f6e13d31dfb80da07852efcebff0065844cb03e0075d5c44f23a4e43a266"}}