{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:4LMYNYC4LMOFPZ6LOHKJCSIDDM","short_pith_number":"pith:4LMYNYC4","canonical_record":{"source":{"id":"2401.05794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-11T09:56:08Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"1bac459fafc5f5e0f67a13a4a501e6d99dd795200e9cda0be7cc3875aa692259","abstract_canon_sha256":"97b10d748decf8365c0ed6327f18953559e22cae8d542685eb2a0ab61307dff2"},"schema_version":"1.0"},"canonical_sha256":"e2d986e05c5b1c57e7cb71d49149031b31ed9949bdfaa0caebd7bebee7294f10","source":{"kind":"arxiv","id":"2401.05794","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.05794","created_at":"2026-07-05T07:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"2401.05794v2","created_at":"2026-07-05T07:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.05794","created_at":"2026-07-05T07:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"4LMYNYC4LMOF","created_at":"2026-07-05T07:34:37Z"},{"alias_kind":"pith_short_16","alias_value":"4LMYNYC4LMOFPZ6L","created_at":"2026-07-05T07:34:37Z"},{"alias_kind":"pith_short_8","alias_value":"4LMYNYC4","created_at":"2026-07-05T07:34:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:4LMYNYC4LMOFPZ6LOHKJCSIDDM","target":"record","payload":{"canonical_record":{"source":{"id":"2401.05794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-11T09:56:08Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"1bac459fafc5f5e0f67a13a4a501e6d99dd795200e9cda0be7cc3875aa692259","abstract_canon_sha256":"97b10d748decf8365c0ed6327f18953559e22cae8d542685eb2a0ab61307dff2"},"schema_version":"1.0"},"canonical_sha256":"e2d986e05c5b1c57e7cb71d49149031b31ed9949bdfaa0caebd7bebee7294f10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:34:37.073514Z","signature_b64":"IUtUGRTyJKQWnNqJt7JI6J6QxjeuIfge4Ju+0Pk/R9NMUzXGWJG4ZxwMJUB1KMHeJbqAv4Q5oQG3TBGWjHOMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2d986e05c5b1c57e7cb71d49149031b31ed9949bdfaa0caebd7bebee7294f10","last_reissued_at":"2026-07-05T07:34:37.072956Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:34:37.072956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.05794","source_version":2,"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-07-05T07:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gbW4tltDqxjCOZRdxJlOwSEZJYCAaRdCaf0ki0rL/elS6uiPEOEDDY1uknxdAQq1Yg2JYsZe3yL/luEQXrOsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:13:28.358620Z"},"content_sha256":"40660296b40d2e074566821a5c04070ee0b144887dad0fb7923046c6d8786286","schema_version":"1.0","event_id":"sha256:40660296b40d2e074566821a5c04070ee0b144887dad0fb7923046c6d8786286"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:4LMYNYC4LMOFPZ6LOHKJCSIDDM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the price of feedback for mistake-bounded online learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.LG","authors_text":"Jesse Geneson, Linus Tang","submitted_at":"2024-01-11T09:56:08Z","abstract_excerpt":"We improve several worst-case bounds for various online learning scenarios from (Auer and Long, Machine Learning, 1999). In particular, we sharpen an upper bound for delayed ambiguous reinforcement learning by a factor of 2 and an upper bound for learning compositions of families of functions by a factor of 2.41. We also improve a lower bound from the same paper for learning compositions of $k$ families of functions by a factor of $\\Theta(\\ln{k})$, matching the upper bound up to a constant factor. In addition, we solve a problem from (Long, Theoretical Computer Science, 2020) on the price of b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.05794","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.05794/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hHoLzbpLc6T31CKhH8VYH84nzKktxcyQpB9bSVPNx9WG569vuJrRESeNmyCMq6mDxDAZDdTUPTmum7gm22YrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:13:28.359169Z"},"content_sha256":"9ff082b3efc89a53707012e61e6a8e01e9fbac7987ed960cd3a2905c35291f82","schema_version":"1.0","event_id":"sha256:9ff082b3efc89a53707012e61e6a8e01e9fbac7987ed960cd3a2905c35291f82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LMYNYC4LMOFPZ6LOHKJCSIDDM/bundle.json","state_url":"https://pith.science/pith/4LMYNYC4LMOFPZ6LOHKJCSIDDM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LMYNYC4LMOFPZ6LOHKJCSIDDM/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-08-05T07:13:28Z","links":{"resolver":"https://pith.science/pith/4LMYNYC4LMOFPZ6LOHKJCSIDDM","bundle":"https://pith.science/pith/4LMYNYC4LMOFPZ6LOHKJCSIDDM/bundle.json","state":"https://pith.science/pith/4LMYNYC4LMOFPZ6LOHKJCSIDDM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LMYNYC4LMOFPZ6LOHKJCSIDDM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4LMYNYC4LMOFPZ6LOHKJCSIDDM","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":"97b10d748decf8365c0ed6327f18953559e22cae8d542685eb2a0ab61307dff2","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-11T09:56:08Z","title_canon_sha256":"1bac459fafc5f5e0f67a13a4a501e6d99dd795200e9cda0be7cc3875aa692259"},"schema_version":"1.0","source":{"id":"2401.05794","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.05794","created_at":"2026-07-05T07:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"2401.05794v2","created_at":"2026-07-05T07:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.05794","created_at":"2026-07-05T07:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"4LMYNYC4LMOF","created_at":"2026-07-05T07:34:37Z"},{"alias_kind":"pith_short_16","alias_value":"4LMYNYC4LMOFPZ6L","created_at":"2026-07-05T07:34:37Z"},{"alias_kind":"pith_short_8","alias_value":"4LMYNYC4","created_at":"2026-07-05T07:34:37Z"}],"graph_snapshots":[{"event_id":"sha256:9ff082b3efc89a53707012e61e6a8e01e9fbac7987ed960cd3a2905c35291f82","target":"graph","created_at":"2026-07-05T07:34:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.05794/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We improve several worst-case bounds for various online learning scenarios from (Auer and Long, Machine Learning, 1999). In particular, we sharpen an upper bound for delayed ambiguous reinforcement learning by a factor of 2 and an upper bound for learning compositions of families of functions by a factor of 2.41. We also improve a lower bound from the same paper for learning compositions of $k$ families of functions by a factor of $\\Theta(\\ln{k})$, matching the upper bound up to a constant factor. In addition, we solve a problem from (Long, Theoretical Computer Science, 2020) on the price of b","authors_text":"Jesse Geneson, Linus Tang","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-11T09:56:08Z","title":"Bounds on the price of feedback for mistake-bounded online learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.05794","kind":"arxiv","version":2},"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:40660296b40d2e074566821a5c04070ee0b144887dad0fb7923046c6d8786286","target":"record","created_at":"2026-07-05T07:34:37Z","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":"97b10d748decf8365c0ed6327f18953559e22cae8d542685eb2a0ab61307dff2","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-11T09:56:08Z","title_canon_sha256":"1bac459fafc5f5e0f67a13a4a501e6d99dd795200e9cda0be7cc3875aa692259"},"schema_version":"1.0","source":{"id":"2401.05794","kind":"arxiv","version":2}},"canonical_sha256":"e2d986e05c5b1c57e7cb71d49149031b31ed9949bdfaa0caebd7bebee7294f10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2d986e05c5b1c57e7cb71d49149031b31ed9949bdfaa0caebd7bebee7294f10","first_computed_at":"2026-07-05T07:34:37.072956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:34:37.072956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IUtUGRTyJKQWnNqJt7JI6J6QxjeuIfge4Ju+0Pk/R9NMUzXGWJG4ZxwMJUB1KMHeJbqAv4Q5oQG3TBGWjHOMBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:34:37.073514Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.05794","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40660296b40d2e074566821a5c04070ee0b144887dad0fb7923046c6d8786286","sha256:9ff082b3efc89a53707012e61e6a8e01e9fbac7987ed960cd3a2905c35291f82"],"state_sha256":"43574f5671548109d58f8af7b825d1733b3c31360af1ef0ad90a5013bd3a002b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgnLbUuagO6JBLS3h0BXqK1gSd/U9ojBNpAxStEJUcS0X6ra64caq2EXncSvajXMyxTA5P7Mbr8g4j97zyiZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T07:13:28.364873Z","bundle_sha256":"72fb6625993113de9be903e81657aa17ebadaebd8227864a771a7b7f701526fc"}}