{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DJEGJ6X6AK3MNGHC7TMYYNMIIK","short_pith_number":"pith:DJEGJ6X6","schema_version":"1.0","canonical_sha256":"1a4864fafe02b6c698e2fcd98c35884296462e82b537235380d1de76d95042fc","source":{"kind":"arxiv","id":"1110.2755","version":3},"attestation_state":"computed","paper":{"title":"Efficient Tracking of Large Classes of Experts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Andr\\'as Gyorgy, G\\'abor Lugosi, Tam\\'as Linder","submitted_at":"2011-10-12T18:48:09Z","abstract_excerpt":"In the framework of prediction of individual sequences, sequential prediction methods are to be constructed that perform nearly as well as the best expert from a given class. We consider prediction strategies that compete with the class of switching strategies that can segment a given sequence into several blocks, and follow the advice of a different \"base\" expert in each block. As usual, the performance of the algorithm is measured by the regret defined as the excess loss relative to the best switching strategy selected in hindsight for the particular sequence to be predicted. In this paper w"},"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":"1110.2755","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-10-12T18:48:09Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5b348af185a2a8d8e2733c234a8320bf947f120d98d9d295f280ef26d1488819","abstract_canon_sha256":"bb75644c66611e09d01964a96fbb4194152318aebd38b0197a3a1e25ff2934b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:23.754964Z","signature_b64":"qRet8H6QIV/SasWmv3vSxRj4LsbFBNv082+2ZsE8swzu5eBSCPsRDjIasgFB98Ttqs8RFaUG3J13F0acV6NCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a4864fafe02b6c698e2fcd98c35884296462e82b537235380d1de76d95042fc","last_reissued_at":"2026-05-18T03:51:23.754231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:23.754231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Tracking of Large Classes of Experts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Andr\\'as Gyorgy, G\\'abor Lugosi, Tam\\'as Linder","submitted_at":"2011-10-12T18:48:09Z","abstract_excerpt":"In the framework of prediction of individual sequences, sequential prediction methods are to be constructed that perform nearly as well as the best expert from a given class. We consider prediction strategies that compete with the class of switching strategies that can segment a given sequence into several blocks, and follow the advice of a different \"base\" expert in each block. As usual, the performance of the algorithm is measured by the regret defined as the excess loss relative to the best switching strategy selected in hindsight for the particular sequence to be predicted. In this paper w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2755","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":""},"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":"1110.2755","created_at":"2026-05-18T03:51:23.754332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.2755v3","created_at":"2026-05-18T03:51:23.754332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2755","created_at":"2026-05-18T03:51:23.754332+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJEGJ6X6AK3M","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJEGJ6X6AK3MNGHC","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJEGJ6X6","created_at":"2026-05-18T12:26:26.731475+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/DJEGJ6X6AK3MNGHC7TMYYNMIIK","json":"https://pith.science/pith/DJEGJ6X6AK3MNGHC7TMYYNMIIK.json","graph_json":"https://pith.science/api/pith-number/DJEGJ6X6AK3MNGHC7TMYYNMIIK/graph.json","events_json":"https://pith.science/api/pith-number/DJEGJ6X6AK3MNGHC7TMYYNMIIK/events.json","paper":"https://pith.science/paper/DJEGJ6X6"},"agent_actions":{"view_html":"https://pith.science/pith/DJEGJ6X6AK3MNGHC7TMYYNMIIK","download_json":"https://pith.science/pith/DJEGJ6X6AK3MNGHC7TMYYNMIIK.json","view_paper":"https://pith.science/paper/DJEGJ6X6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.2755&json=true","fetch_graph":"https://pith.science/api/pith-number/DJEGJ6X6AK3MNGHC7TMYYNMIIK/graph.json","fetch_events":"https://pith.science/api/pith-number/DJEGJ6X6AK3MNGHC7TMYYNMIIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJEGJ6X6AK3MNGHC7TMYYNMIIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJEGJ6X6AK3MNGHC7TMYYNMIIK/action/storage_attestation","attest_author":"https://pith.science/pith/DJEGJ6X6AK3MNGHC7TMYYNMIIK/action/author_attestation","sign_citation":"https://pith.science/pith/DJEGJ6X6AK3MNGHC7TMYYNMIIK/action/citation_signature","submit_replication":"https://pith.science/pith/DJEGJ6X6AK3MNGHC7TMYYNMIIK/action/replication_record"}},"created_at":"2026-05-18T03:51:23.754332+00:00","updated_at":"2026-05-18T03:51:23.754332+00:00"}