{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:IUF2WL2N5RNXSS4QKV5TM5NHAB","short_pith_number":"pith:IUF2WL2N","canonical_record":{"source":{"id":"1008.3672","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-22T01:09:56Z","cross_cats_sorted":[],"title_canon_sha256":"92cdd999ef5ea80cd7dfcf2ffec929159ebcabc8529c2bb8842b8d1091234762","abstract_canon_sha256":"72288b46fb4254d76d90730123323a57aadb33055b6a17919ec2951c28cebbba"},"schema_version":"1.0"},"canonical_sha256":"450bab2f4dec5b794b90557b3675a7004fc12fbcd6a198fa5b33b29606763cd9","source":{"kind":"arxiv","id":"1008.3672","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3672","created_at":"2026-05-18T03:43:40Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3672v5","created_at":"2026-05-18T03:43:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3672","created_at":"2026-05-18T03:43:40Z"},{"alias_kind":"pith_short_12","alias_value":"IUF2WL2N5RNX","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IUF2WL2N5RNXSS4Q","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IUF2WL2N","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:IUF2WL2N5RNXSS4QKV5TM5NHAB","target":"record","payload":{"canonical_record":{"source":{"id":"1008.3672","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-22T01:09:56Z","cross_cats_sorted":[],"title_canon_sha256":"92cdd999ef5ea80cd7dfcf2ffec929159ebcabc8529c2bb8842b8d1091234762","abstract_canon_sha256":"72288b46fb4254d76d90730123323a57aadb33055b6a17919ec2951c28cebbba"},"schema_version":"1.0"},"canonical_sha256":"450bab2f4dec5b794b90557b3675a7004fc12fbcd6a198fa5b33b29606763cd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:40.688175Z","signature_b64":"TgfPjMpmP1Y5XfeAED85+Y+lnOg4bwFaZ3uwEpMd1/kdpo1VXaa1GngyoPKaBempkTele5VOQJSskauxiuSLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"450bab2f4dec5b794b90557b3675a7004fc12fbcd6a198fa5b33b29606763cd9","last_reissued_at":"2026-05-18T03:43:40.687588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:40.687588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.3672","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-18T03:43:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2ATYjoAxFpJCR0i/+D5in2Vrm4d+sJuGoGD6EGzyFhkSqm1Jjd0h4nILvb/dFqcwJ28rCAICOZwSawh2KBDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:12:21.391081Z"},"content_sha256":"af7a4647d106eb71040bc4a56a2535dfc7da57e1747a170ba1108f6899d23809","schema_version":"1.0","event_id":"sha256:af7a4647d106eb71040bc4a56a2535dfc7da57e1747a170ba1108f6899d23809"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:IUF2WL2N5RNXSS4QKV5TM5NHAB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Prediction strategies without loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Kapralov, Rina Panigrahy","submitted_at":"2010-08-22T01:09:56Z","abstract_excerpt":"Consider a sequence of bits where we are trying to predict the next bit from the previous bits. Assume we are allowed to say 'predict 0' or 'predict 1', and our payoff is +1 if the prediction is correct and -1 otherwise. We will say that at each point in time the loss of an algorithm is the number of wrong predictions minus the number of right predictions so far. In this paper we are interested in algorithms that have essentially zero (expected) loss over any string at any point in time and yet have small regret with respect to always predicting 0 or always predicting 1. For a sequence of leng"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3672","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-18T03:43:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zyKawefrOkL15k0HbQ7H4HmoAjRChaweRsie8Cbi3mIquWGALFDG2Fw7V2rUBSQlGQf/SfJOZV8u1A6XoXtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:12:21.391453Z"},"content_sha256":"3af8e1f41b4915b0a602fe2bf408c763630b8928e978467647742b1f4f52bd6f","schema_version":"1.0","event_id":"sha256:3af8e1f41b4915b0a602fe2bf408c763630b8928e978467647742b1f4f52bd6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUF2WL2N5RNXSS4QKV5TM5NHAB/bundle.json","state_url":"https://pith.science/pith/IUF2WL2N5RNXSS4QKV5TM5NHAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUF2WL2N5RNXSS4QKV5TM5NHAB/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-30T22:12:21Z","links":{"resolver":"https://pith.science/pith/IUF2WL2N5RNXSS4QKV5TM5NHAB","bundle":"https://pith.science/pith/IUF2WL2N5RNXSS4QKV5TM5NHAB/bundle.json","state":"https://pith.science/pith/IUF2WL2N5RNXSS4QKV5TM5NHAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUF2WL2N5RNXSS4QKV5TM5NHAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:IUF2WL2N5RNXSS4QKV5TM5NHAB","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":"72288b46fb4254d76d90730123323a57aadb33055b6a17919ec2951c28cebbba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-22T01:09:56Z","title_canon_sha256":"92cdd999ef5ea80cd7dfcf2ffec929159ebcabc8529c2bb8842b8d1091234762"},"schema_version":"1.0","source":{"id":"1008.3672","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3672","created_at":"2026-05-18T03:43:40Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3672v5","created_at":"2026-05-18T03:43:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3672","created_at":"2026-05-18T03:43:40Z"},{"alias_kind":"pith_short_12","alias_value":"IUF2WL2N5RNX","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IUF2WL2N5RNXSS4Q","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IUF2WL2N","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:3af8e1f41b4915b0a602fe2bf408c763630b8928e978467647742b1f4f52bd6f","target":"graph","created_at":"2026-05-18T03:43:40Z","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":"Consider a sequence of bits where we are trying to predict the next bit from the previous bits. Assume we are allowed to say 'predict 0' or 'predict 1', and our payoff is +1 if the prediction is correct and -1 otherwise. We will say that at each point in time the loss of an algorithm is the number of wrong predictions minus the number of right predictions so far. In this paper we are interested in algorithms that have essentially zero (expected) loss over any string at any point in time and yet have small regret with respect to always predicting 0 or always predicting 1. For a sequence of leng","authors_text":"Michael Kapralov, Rina Panigrahy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-22T01:09:56Z","title":"Prediction strategies without loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3672","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:af7a4647d106eb71040bc4a56a2535dfc7da57e1747a170ba1108f6899d23809","target":"record","created_at":"2026-05-18T03:43:40Z","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":"72288b46fb4254d76d90730123323a57aadb33055b6a17919ec2951c28cebbba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-22T01:09:56Z","title_canon_sha256":"92cdd999ef5ea80cd7dfcf2ffec929159ebcabc8529c2bb8842b8d1091234762"},"schema_version":"1.0","source":{"id":"1008.3672","kind":"arxiv","version":5}},"canonical_sha256":"450bab2f4dec5b794b90557b3675a7004fc12fbcd6a198fa5b33b29606763cd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"450bab2f4dec5b794b90557b3675a7004fc12fbcd6a198fa5b33b29606763cd9","first_computed_at":"2026-05-18T03:43:40.687588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:40.687588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TgfPjMpmP1Y5XfeAED85+Y+lnOg4bwFaZ3uwEpMd1/kdpo1VXaa1GngyoPKaBempkTele5VOQJSskauxiuSLBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:40.688175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3672","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af7a4647d106eb71040bc4a56a2535dfc7da57e1747a170ba1108f6899d23809","sha256:3af8e1f41b4915b0a602fe2bf408c763630b8928e978467647742b1f4f52bd6f"],"state_sha256":"7b7cec258ba24dec9d47a462971b1aee8ffebadc6cee415f03c3504c0989d96d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2R7ApFkb2DoWGHy53f6J/EQCWOv3b9e2nkEKNYrIaqX+8hzEaj9z9trcNFu6JEWOjQlxN01UUqUsgfYnFaTEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:12:21.393477Z","bundle_sha256":"f419a30ffae051c76b9259b7c9b4f2117a8925ba2af3676508ce4e52b7bf3a30"}}