{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PCVLPTLIEAU35AKKF5SXGVO5YJ","short_pith_number":"pith:PCVLPTLI","schema_version":"1.0","canonical_sha256":"78aab7cd682029be814a2f657355ddc255e5871dcf010f7dca69f79a93abb30b","source":{"kind":"arxiv","id":"1304.3708","version":1},"attestation_state":"computed","paper":{"title":"Advice-Efficient Prediction with Expert Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Koby Crammer, Peter Bartlett, Yevgeny Seldin","submitted_at":"2013-04-12T19:09:56Z","abstract_excerpt":"Advice-efficient prediction with expert advice (in analogy to label-efficient prediction) is a variant of prediction with expert advice game, where on each round of the game we are allowed to ask for advice of a limited number $M$ out of $N$ experts. This setting is especially interesting when asking for advice of every expert on every round is expensive. We present an algorithm for advice-efficient prediction with expert advice that achieves $O(\\sqrt{\\frac{N}{M}T\\ln N})$ regret on $T$ rounds of the game."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1304.3708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-12T19:09:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9612381a1c44e9b00bbcdb6e02bb852cbfdc6376f7212b42b6f45d328c5900a5","abstract_canon_sha256":"bcb3bb34bd4b52061996825185b86a47c4b01523f1ca777a2f80b94f7d72ca4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:06.758354Z","signature_b64":"RfaLCRz3mqvMLF8q+bSvQS5ZvmX5b0ekVYToeYsUsXa1mL6Ecxuh0nNEi6XFAp0DX2sqPXSVfvjt+kjPB2tsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78aab7cd682029be814a2f657355ddc255e5871dcf010f7dca69f79a93abb30b","last_reissued_at":"2026-05-18T03:28:06.757297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:06.757297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advice-Efficient Prediction with Expert Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Koby Crammer, Peter Bartlett, Yevgeny Seldin","submitted_at":"2013-04-12T19:09:56Z","abstract_excerpt":"Advice-efficient prediction with expert advice (in analogy to label-efficient prediction) is a variant of prediction with expert advice game, where on each round of the game we are allowed to ask for advice of a limited number $M$ out of $N$ experts. This setting is especially interesting when asking for advice of every expert on every round is expensive. We present an algorithm for advice-efficient prediction with expert advice that achieves $O(\\sqrt{\\frac{N}{M}T\\ln N})$ regret on $T$ rounds of the game."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3708","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.3708","created_at":"2026-05-18T03:28:06.757669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.3708v1","created_at":"2026-05-18T03:28:06.757669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3708","created_at":"2026-05-18T03:28:06.757669+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCVLPTLIEAU3","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCVLPTLIEAU35AKK","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCVLPTLI","created_at":"2026-05-18T12:27:54.935989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PCVLPTLIEAU35AKKF5SXGVO5YJ","json":"https://pith.science/pith/PCVLPTLIEAU35AKKF5SXGVO5YJ.json","graph_json":"https://pith.science/api/pith-number/PCVLPTLIEAU35AKKF5SXGVO5YJ/graph.json","events_json":"https://pith.science/api/pith-number/PCVLPTLIEAU35AKKF5SXGVO5YJ/events.json","paper":"https://pith.science/paper/PCVLPTLI"},"agent_actions":{"view_html":"https://pith.science/pith/PCVLPTLIEAU35AKKF5SXGVO5YJ","download_json":"https://pith.science/pith/PCVLPTLIEAU35AKKF5SXGVO5YJ.json","view_paper":"https://pith.science/paper/PCVLPTLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.3708&json=true","fetch_graph":"https://pith.science/api/pith-number/PCVLPTLIEAU35AKKF5SXGVO5YJ/graph.json","fetch_events":"https://pith.science/api/pith-number/PCVLPTLIEAU35AKKF5SXGVO5YJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCVLPTLIEAU35AKKF5SXGVO5YJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCVLPTLIEAU35AKKF5SXGVO5YJ/action/storage_attestation","attest_author":"https://pith.science/pith/PCVLPTLIEAU35AKKF5SXGVO5YJ/action/author_attestation","sign_citation":"https://pith.science/pith/PCVLPTLIEAU35AKKF5SXGVO5YJ/action/citation_signature","submit_replication":"https://pith.science/pith/PCVLPTLIEAU35AKKF5SXGVO5YJ/action/replication_record"}},"created_at":"2026-05-18T03:28:06.757669+00:00","updated_at":"2026-05-18T03:28:06.757669+00:00"}