{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WLSFQCWHQ5PFD7MWRSFRTFOZK7","short_pith_number":"pith:WLSFQCWH","canonical_record":{"source":{"id":"1510.00452","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-01T23:58:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"07dfd5ecdea4034474b757b7626e8539b5bdb543c6c71528c3340c6cd01f3d0a","abstract_canon_sha256":"46cfe6469973d616fcc6acee623701e19c099c3a04bc6a93c49b1f0e8bb5de85"},"schema_version":"1.0"},"canonical_sha256":"b2e4580ac7875e51fd968c8b1995d957eea04c5b38deb19cf430db19e27c4344","source":{"kind":"arxiv","id":"1510.00452","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00452","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00452v5","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00452","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"pith_short_12","alias_value":"WLSFQCWHQ5PF","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WLSFQCWHQ5PFD7MW","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WLSFQCWH","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WLSFQCWHQ5PFD7MWRSFRTFOZK7","target":"record","payload":{"canonical_record":{"source":{"id":"1510.00452","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-01T23:58:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"07dfd5ecdea4034474b757b7626e8539b5bdb543c6c71528c3340c6cd01f3d0a","abstract_canon_sha256":"46cfe6469973d616fcc6acee623701e19c099c3a04bc6a93c49b1f0e8bb5de85"},"schema_version":"1.0"},"canonical_sha256":"b2e4580ac7875e51fd968c8b1995d957eea04c5b38deb19cf430db19e27c4344","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:10.062260Z","signature_b64":"vUZNGf3uoQpFcJvouRVqMt9h22eDcXHeIGe0JAoRMirAQWF8d7SepkNNDjO8kVLWRN6NXr/aNld0pR2PiIW6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2e4580ac7875e51fd968c8b1995d957eea04c5b38deb19cf430db19e27c4344","last_reissued_at":"2026-05-18T01:00:10.061614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:10.061614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.00452","source_version":5,"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:00:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QQqRKAWQC5Ycs6qpReMCVidC724T+00cc0PXQKQjPSuvjvBhpwXq1bVOO7M74jmEL9T8qTmugqt39/Yv+w2QBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:57:50.992404Z"},"content_sha256":"d98530d8353c395d44cd67b294e8e17b7e3735dd8357c07adee46a5ae8d60d1d","schema_version":"1.0","event_id":"sha256:d98530d8353c395d44cd67b294e8e17b7e3735dd8357c07adee46a5ae8d60d1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WLSFQCWHQ5PFD7MWRSFRTFOZK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Binary Classifier Aggregation for General Losses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Akshay Balsubramani, Yoav Freund","submitted_at":"2015-10-01T23:58:46Z","abstract_excerpt":"We address the problem of aggregating an ensemble of predictors with known loss bounds in a semi-supervised binary classification setting, to minimize prediction loss incurred on the unlabeled data. We find the minimax optimal predictions for a very general class of loss functions including all convex and many non-convex losses, extending a recent analysis of the problem for misclassification error. The result is a family of semi-supervised ensemble aggregation algorithms which are as efficient as linear learning by convex optimization, but are minimax optimal without any relaxations. Their de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00452","kind":"arxiv","version":5},"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:00:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fFZD5MUxb13jLhU0fJC5DM6YGVENHEPpTFBg2ShT9aSsO0WKk9So6Sbl8F/0yhjAGXVfKtn0mNLHeTUFa2EVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:57:50.993058Z"},"content_sha256":"14d8fa7714befddd03e2b154aeaa82dab2d51a3b02044f35b3cec55a42b26ab6","schema_version":"1.0","event_id":"sha256:14d8fa7714befddd03e2b154aeaa82dab2d51a3b02044f35b3cec55a42b26ab6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WLSFQCWHQ5PFD7MWRSFRTFOZK7/bundle.json","state_url":"https://pith.science/pith/WLSFQCWHQ5PFD7MWRSFRTFOZK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WLSFQCWHQ5PFD7MWRSFRTFOZK7/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-05-25T20:57:50Z","links":{"resolver":"https://pith.science/pith/WLSFQCWHQ5PFD7MWRSFRTFOZK7","bundle":"https://pith.science/pith/WLSFQCWHQ5PFD7MWRSFRTFOZK7/bundle.json","state":"https://pith.science/pith/WLSFQCWHQ5PFD7MWRSFRTFOZK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WLSFQCWHQ5PFD7MWRSFRTFOZK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WLSFQCWHQ5PFD7MWRSFRTFOZK7","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":"46cfe6469973d616fcc6acee623701e19c099c3a04bc6a93c49b1f0e8bb5de85","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-01T23:58:46Z","title_canon_sha256":"07dfd5ecdea4034474b757b7626e8539b5bdb543c6c71528c3340c6cd01f3d0a"},"schema_version":"1.0","source":{"id":"1510.00452","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00452","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00452v5","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00452","created_at":"2026-05-18T01:00:10Z"},{"alias_kind":"pith_short_12","alias_value":"WLSFQCWHQ5PF","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WLSFQCWHQ5PFD7MW","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WLSFQCWH","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:14d8fa7714befddd03e2b154aeaa82dab2d51a3b02044f35b3cec55a42b26ab6","target":"graph","created_at":"2026-05-18T01:00:10Z","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 address the problem of aggregating an ensemble of predictors with known loss bounds in a semi-supervised binary classification setting, to minimize prediction loss incurred on the unlabeled data. We find the minimax optimal predictions for a very general class of loss functions including all convex and many non-convex losses, extending a recent analysis of the problem for misclassification error. The result is a family of semi-supervised ensemble aggregation algorithms which are as efficient as linear learning by convex optimization, but are minimax optimal without any relaxations. Their de","authors_text":"Akshay Balsubramani, Yoav Freund","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-01T23:58:46Z","title":"Optimal Binary Classifier Aggregation for General Losses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00452","kind":"arxiv","version":5},"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:d98530d8353c395d44cd67b294e8e17b7e3735dd8357c07adee46a5ae8d60d1d","target":"record","created_at":"2026-05-18T01:00:10Z","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":"46cfe6469973d616fcc6acee623701e19c099c3a04bc6a93c49b1f0e8bb5de85","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-01T23:58:46Z","title_canon_sha256":"07dfd5ecdea4034474b757b7626e8539b5bdb543c6c71528c3340c6cd01f3d0a"},"schema_version":"1.0","source":{"id":"1510.00452","kind":"arxiv","version":5}},"canonical_sha256":"b2e4580ac7875e51fd968c8b1995d957eea04c5b38deb19cf430db19e27c4344","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2e4580ac7875e51fd968c8b1995d957eea04c5b38deb19cf430db19e27c4344","first_computed_at":"2026-05-18T01:00:10.061614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:10.061614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vUZNGf3uoQpFcJvouRVqMt9h22eDcXHeIGe0JAoRMirAQWF8d7SepkNNDjO8kVLWRN6NXr/aNld0pR2PiIW6BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:10.062260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.00452","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d98530d8353c395d44cd67b294e8e17b7e3735dd8357c07adee46a5ae8d60d1d","sha256:14d8fa7714befddd03e2b154aeaa82dab2d51a3b02044f35b3cec55a42b26ab6"],"state_sha256":"9383e0af179daaa8288872364720067c92d7be5c6603799834b157f0b4b1c755"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d58kFWgAKlvOLo4U5JvVU3bEnqps2PjI9o74VKYzfKLgkeVN22drP/F88Nljyyfkf9YKDk9CDYKyKLmQ22S+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:57:50.996106Z","bundle_sha256":"7022f49fef29450e794f4b154db5c9b69814b2a971e289a624da5bcd7f0c9080"}}