{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HLS4XQZFKD3DHHZLA5YPRDIRI7","short_pith_number":"pith:HLS4XQZF","canonical_record":{"source":{"id":"1503.08363","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-28T22:54:12Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"5267c83751e66312f75ea1bdd24a73d2a2d12043309c883703ec4d017ab9546e","abstract_canon_sha256":"8bc8798a703ec5e04a139f3275f77c43767f12e187b1bc86779f6003b095c0a1"},"schema_version":"1.0"},"canonical_sha256":"3ae5cbc32550f6339f2b0770f88d1147d6e2434042c6e326cb34d72f4b3240ad","source":{"kind":"arxiv","id":"1503.08363","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08363","created_at":"2026-05-18T02:20:02Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08363v1","created_at":"2026-05-18T02:20:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08363","created_at":"2026-05-18T02:20:02Z"},{"alias_kind":"pith_short_12","alias_value":"HLS4XQZFKD3D","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HLS4XQZFKD3DHHZL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HLS4XQZF","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HLS4XQZFKD3DHHZLA5YPRDIRI7","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08363","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-28T22:54:12Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"5267c83751e66312f75ea1bdd24a73d2a2d12043309c883703ec4d017ab9546e","abstract_canon_sha256":"8bc8798a703ec5e04a139f3275f77c43767f12e187b1bc86779f6003b095c0a1"},"schema_version":"1.0"},"canonical_sha256":"3ae5cbc32550f6339f2b0770f88d1147d6e2434042c6e326cb34d72f4b3240ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:02.048508Z","signature_b64":"TMm6ZNo5PO6w8sGHzzYyiQ7DoTHTzBT5S4ZbnvsbjrSldth9FfK/o3eO62lYVlTwSz77ntniVAIdDR2ubMaCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ae5cbc32550f6339f2b0770f88d1147d6e2434042c6e326cb34d72f4b3240ad","last_reissued_at":"2026-05-18T02:20:02.047666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:02.047666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08363","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-18T02:20:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W7+Nzg3ID6zXNn3JYXZTo/pz0MPEDeSkzQOrDnx/eQfDBM0iwIxUKqCovxXquQYXBJR65rHWdOeCCb9xM3iVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:52:03.966350Z"},"content_sha256":"2fe6e3d3e25fdf1b1219951e4132b87a42fd54f13c8861cbcef41c0922cf9b3c","schema_version":"1.0","event_id":"sha256:2fe6e3d3e25fdf1b1219951e4132b87a42fd54f13c8861cbcef41c0922cf9b3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HLS4XQZFKD3DHHZLA5YPRDIRI7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Active Model Aggregation via Stochastic Mirror Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Ravi Ganti","submitted_at":"2015-03-28T22:54:12Z","abstract_excerpt":"We consider the problem of learning convex aggregation of models, that is as good as the best convex aggregation, for the binary classification problem. Working in the stream based active learning setting, where the active learner has to make a decision on-the-fly, if it wants to query for the label of the point currently seen in the stream, we propose a stochastic-mirror descent algorithm, called SMD-AMA, with entropy regularization. We establish an excess risk bounds for the loss of the convex aggregate returned by SMD-AMA to be of the order of $O\\left(\\sqrt{\\frac{\\log(M)}{{T^{1-\\mu}}}}\\righ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08363","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-18T02:20:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4SXLWyjuTG+YxVP4k1LpYMKu5Td/Am6t4oASMqeyASuto5gYBvcQyGh2mKvNjFYPpE5yLyvXp9AXNaxFIDbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:52:03.967050Z"},"content_sha256":"6f05f79a0ccf5c038bee22dad131069d1aa70942422abb26b4d37bfd108844ee","schema_version":"1.0","event_id":"sha256:6f05f79a0ccf5c038bee22dad131069d1aa70942422abb26b4d37bfd108844ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLS4XQZFKD3DHHZLA5YPRDIRI7/bundle.json","state_url":"https://pith.science/pith/HLS4XQZFKD3DHHZLA5YPRDIRI7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLS4XQZFKD3DHHZLA5YPRDIRI7/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-09T06:52:03Z","links":{"resolver":"https://pith.science/pith/HLS4XQZFKD3DHHZLA5YPRDIRI7","bundle":"https://pith.science/pith/HLS4XQZFKD3DHHZLA5YPRDIRI7/bundle.json","state":"https://pith.science/pith/HLS4XQZFKD3DHHZLA5YPRDIRI7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLS4XQZFKD3DHHZLA5YPRDIRI7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HLS4XQZFKD3DHHZLA5YPRDIRI7","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":"8bc8798a703ec5e04a139f3275f77c43767f12e187b1bc86779f6003b095c0a1","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-28T22:54:12Z","title_canon_sha256":"5267c83751e66312f75ea1bdd24a73d2a2d12043309c883703ec4d017ab9546e"},"schema_version":"1.0","source":{"id":"1503.08363","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08363","created_at":"2026-05-18T02:20:02Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08363v1","created_at":"2026-05-18T02:20:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08363","created_at":"2026-05-18T02:20:02Z"},{"alias_kind":"pith_short_12","alias_value":"HLS4XQZFKD3D","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HLS4XQZFKD3DHHZL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HLS4XQZF","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:6f05f79a0ccf5c038bee22dad131069d1aa70942422abb26b4d37bfd108844ee","target":"graph","created_at":"2026-05-18T02:20:02Z","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 consider the problem of learning convex aggregation of models, that is as good as the best convex aggregation, for the binary classification problem. Working in the stream based active learning setting, where the active learner has to make a decision on-the-fly, if it wants to query for the label of the point currently seen in the stream, we propose a stochastic-mirror descent algorithm, called SMD-AMA, with entropy regularization. We establish an excess risk bounds for the loss of the convex aggregate returned by SMD-AMA to be of the order of $O\\left(\\sqrt{\\frac{\\log(M)}{{T^{1-\\mu}}}}\\righ","authors_text":"Ravi Ganti","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-28T22:54:12Z","title":"Active Model Aggregation via Stochastic Mirror Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08363","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:2fe6e3d3e25fdf1b1219951e4132b87a42fd54f13c8861cbcef41c0922cf9b3c","target":"record","created_at":"2026-05-18T02:20:02Z","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":"8bc8798a703ec5e04a139f3275f77c43767f12e187b1bc86779f6003b095c0a1","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-28T22:54:12Z","title_canon_sha256":"5267c83751e66312f75ea1bdd24a73d2a2d12043309c883703ec4d017ab9546e"},"schema_version":"1.0","source":{"id":"1503.08363","kind":"arxiv","version":1}},"canonical_sha256":"3ae5cbc32550f6339f2b0770f88d1147d6e2434042c6e326cb34d72f4b3240ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ae5cbc32550f6339f2b0770f88d1147d6e2434042c6e326cb34d72f4b3240ad","first_computed_at":"2026-05-18T02:20:02.047666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:02.047666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TMm6ZNo5PO6w8sGHzzYyiQ7DoTHTzBT5S4ZbnvsbjrSldth9FfK/o3eO62lYVlTwSz77ntniVAIdDR2ubMaCCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:02.048508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08363","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fe6e3d3e25fdf1b1219951e4132b87a42fd54f13c8861cbcef41c0922cf9b3c","sha256:6f05f79a0ccf5c038bee22dad131069d1aa70942422abb26b4d37bfd108844ee"],"state_sha256":"0c4e990c9b73e5b3adb9c1518260e66796091d47fc7596765bfcc01e5b66a1e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPkYTLLyn3Aw2Y/xLhs6rJ4YwLeCcRliEOb7ymH8uehDJgO8eEmsXrEM77M8zPufbauL7oJkoS0iV+wCy0z+Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:52:03.970930Z","bundle_sha256":"7a19e7a2668af97e29ca3ebf87400cadbce2fd7a5ae24efaaf26a0766fe7cf2e"}}