{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:UODT2DJGZGC4FJT5QBGJFNDNI7","short_pith_number":"pith:UODT2DJG","canonical_record":{"source":{"id":"2104.02822","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-04-06T22:53:45Z","cross_cats_sorted":[],"title_canon_sha256":"1894fd72f35b75c6ff41a127a6d1346c38d1f73c21c5bfd14130d499dad267e9","abstract_canon_sha256":"663f959fd786637eb71ca8e98b320d6303c6dfa63955a3a3f7c0d04374245c9e"},"schema_version":"1.0"},"canonical_sha256":"a3873d0d26c985c2a67d804c92b46d47fc9bbde7d0d84375801ee11a7647d51a","source":{"kind":"arxiv","id":"2104.02822","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.02822","created_at":"2026-07-05T03:59:21Z"},{"alias_kind":"arxiv_version","alias_value":"2104.02822v3","created_at":"2026-07-05T03:59:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.02822","created_at":"2026-07-05T03:59:21Z"},{"alias_kind":"pith_short_12","alias_value":"UODT2DJGZGC4","created_at":"2026-07-05T03:59:21Z"},{"alias_kind":"pith_short_16","alias_value":"UODT2DJGZGC4FJT5","created_at":"2026-07-05T03:59:21Z"},{"alias_kind":"pith_short_8","alias_value":"UODT2DJG","created_at":"2026-07-05T03:59:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:UODT2DJGZGC4FJT5QBGJFNDNI7","target":"record","payload":{"canonical_record":{"source":{"id":"2104.02822","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-04-06T22:53:45Z","cross_cats_sorted":[],"title_canon_sha256":"1894fd72f35b75c6ff41a127a6d1346c38d1f73c21c5bfd14130d499dad267e9","abstract_canon_sha256":"663f959fd786637eb71ca8e98b320d6303c6dfa63955a3a3f7c0d04374245c9e"},"schema_version":"1.0"},"canonical_sha256":"a3873d0d26c985c2a67d804c92b46d47fc9bbde7d0d84375801ee11a7647d51a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:59:21.872614Z","signature_b64":"VimlwWqd8G1i8bMjQj3bx6zp6oti/p6mD3FKXUHrlZOzWi82DEC8YLWxyRxgrivm5Ka9nwVQ8MRucFiFWvl7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3873d0d26c985c2a67d804c92b46d47fc9bbde7d0d84375801ee11a7647d51a","last_reissued_at":"2026-07-05T03:59:21.872130Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:59:21.872130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2104.02822","source_version":3,"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:59:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dPhNtsJYRNsbOCoMQVp727xLgob0sOPstMswC2FgnH5fuAo4Zu52z8qprvvQdWHGb6myrGfQr3JESOtOvhZ7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T10:52:09.536510Z"},"content_sha256":"19000d0007f3d7c9613335deafe006c5710c2cd0c76ea618e9801aeb73e16004","schema_version":"1.0","event_id":"sha256:19000d0007f3d7c9613335deafe006c5710c2cd0c76ea618e9801aeb73e16004"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:UODT2DJGZGC4FJT5QBGJFNDNI7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Regret Active learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cenk Baykal, Dan Feldman, Daniela Rus, Lucas Liebenwein","submitted_at":"2021-04-06T22:53:45Z","abstract_excerpt":"We develop an online learning algorithm for identifying unlabeled data points that are most informative for training (i.e., active learning). By formulating the active learning problem as the prediction with sleeping experts problem, we provide a regret minimization framework for identifying relevant data with respect to any given definition of informativeness. Motivated by the successes of ensembles in active learning, we define regret with respect to an omnipotent algorithm that has access to an infinity large ensemble. At the core of our work is an efficient algorithm for sleeping experts t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.02822","kind":"arxiv","version":3},"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/2104.02822/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:59:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C9A1iOwzzF0CFuCRcuP92wK4Q8Y8BhX8cyWkBLYxbJqNkVytBkaftLTJ5xKKpdyARwjs+8YUshAVZeHQhJfaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T10:52:09.537044Z"},"content_sha256":"2906be5eaf738d406c94bc81b07ab97fd9228b49ce57eea22086f1b11fea416b","schema_version":"1.0","event_id":"sha256:2906be5eaf738d406c94bc81b07ab97fd9228b49ce57eea22086f1b11fea416b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UODT2DJGZGC4FJT5QBGJFNDNI7/bundle.json","state_url":"https://pith.science/pith/UODT2DJGZGC4FJT5QBGJFNDNI7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UODT2DJGZGC4FJT5QBGJFNDNI7/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-08-06T10:52:09Z","links":{"resolver":"https://pith.science/pith/UODT2DJGZGC4FJT5QBGJFNDNI7","bundle":"https://pith.science/pith/UODT2DJGZGC4FJT5QBGJFNDNI7/bundle.json","state":"https://pith.science/pith/UODT2DJGZGC4FJT5QBGJFNDNI7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UODT2DJGZGC4FJT5QBGJFNDNI7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:UODT2DJGZGC4FJT5QBGJFNDNI7","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":"663f959fd786637eb71ca8e98b320d6303c6dfa63955a3a3f7c0d04374245c9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-04-06T22:53:45Z","title_canon_sha256":"1894fd72f35b75c6ff41a127a6d1346c38d1f73c21c5bfd14130d499dad267e9"},"schema_version":"1.0","source":{"id":"2104.02822","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.02822","created_at":"2026-07-05T03:59:21Z"},{"alias_kind":"arxiv_version","alias_value":"2104.02822v3","created_at":"2026-07-05T03:59:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.02822","created_at":"2026-07-05T03:59:21Z"},{"alias_kind":"pith_short_12","alias_value":"UODT2DJGZGC4","created_at":"2026-07-05T03:59:21Z"},{"alias_kind":"pith_short_16","alias_value":"UODT2DJGZGC4FJT5","created_at":"2026-07-05T03:59:21Z"},{"alias_kind":"pith_short_8","alias_value":"UODT2DJG","created_at":"2026-07-05T03:59:21Z"}],"graph_snapshots":[{"event_id":"sha256:2906be5eaf738d406c94bc81b07ab97fd9228b49ce57eea22086f1b11fea416b","target":"graph","created_at":"2026-07-05T03:59:21Z","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/2104.02822/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop an online learning algorithm for identifying unlabeled data points that are most informative for training (i.e., active learning). By formulating the active learning problem as the prediction with sleeping experts problem, we provide a regret minimization framework for identifying relevant data with respect to any given definition of informativeness. Motivated by the successes of ensembles in active learning, we define regret with respect to an omnipotent algorithm that has access to an infinity large ensemble. At the core of our work is an efficient algorithm for sleeping experts t","authors_text":"Cenk Baykal, Dan Feldman, Daniela Rus, Lucas Liebenwein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-04-06T22:53:45Z","title":"Low-Regret Active learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.02822","kind":"arxiv","version":3},"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:19000d0007f3d7c9613335deafe006c5710c2cd0c76ea618e9801aeb73e16004","target":"record","created_at":"2026-07-05T03:59:21Z","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":"663f959fd786637eb71ca8e98b320d6303c6dfa63955a3a3f7c0d04374245c9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-04-06T22:53:45Z","title_canon_sha256":"1894fd72f35b75c6ff41a127a6d1346c38d1f73c21c5bfd14130d499dad267e9"},"schema_version":"1.0","source":{"id":"2104.02822","kind":"arxiv","version":3}},"canonical_sha256":"a3873d0d26c985c2a67d804c92b46d47fc9bbde7d0d84375801ee11a7647d51a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3873d0d26c985c2a67d804c92b46d47fc9bbde7d0d84375801ee11a7647d51a","first_computed_at":"2026-07-05T03:59:21.872130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:59:21.872130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VimlwWqd8G1i8bMjQj3bx6zp6oti/p6mD3FKXUHrlZOzWi82DEC8YLWxyRxgrivm5Ka9nwVQ8MRucFiFWvl7AA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:59:21.872614Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.02822","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19000d0007f3d7c9613335deafe006c5710c2cd0c76ea618e9801aeb73e16004","sha256:2906be5eaf738d406c94bc81b07ab97fd9228b49ce57eea22086f1b11fea416b"],"state_sha256":"6c635e4ba4361a17a76e356299246560356a07ea7a7af5f648ec9603f3587371"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rp8CCHT1w00WA6XzEOWKnzIyUO5WPvk7S24/u//Fr7JRZAG/rTxVD7upEV70FLQkjec/VdEAvuOHcUKVjFPeAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T10:52:09.540577Z","bundle_sha256":"ec8e17b2591c18921e13286a4e79143c035c9070dbd5730e7c7840fb14139496"}}