{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PNEI6X2N2PL7EXA3W7JXU5IIAG","short_pith_number":"pith:PNEI6X2N","canonical_record":{"source":{"id":"2509.03892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-04T05:26:43Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"36269ba24980ff20eb15eb2d33d6880c1800ab106e12e3ff3b32077056e31e67","abstract_canon_sha256":"50f138ff989fe9324d620c58245fa651b1f51f660bd0bacc5855810edc139963"},"schema_version":"1.0"},"canonical_sha256":"7b488f5f4dd3d7f25c1bb7d37a750801810b38fcbc87ee42a474e7b84c05f128","source":{"kind":"arxiv","id":"2509.03892","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.03892","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2509.03892v1","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03892","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"PNEI6X2N2PL7","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"PNEI6X2N2PL7EXA3","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"PNEI6X2N","created_at":"2026-07-05T12:04:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PNEI6X2N2PL7EXA3W7JXU5IIAG","target":"record","payload":{"canonical_record":{"source":{"id":"2509.03892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-04T05:26:43Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"36269ba24980ff20eb15eb2d33d6880c1800ab106e12e3ff3b32077056e31e67","abstract_canon_sha256":"50f138ff989fe9324d620c58245fa651b1f51f660bd0bacc5855810edc139963"},"schema_version":"1.0"},"canonical_sha256":"7b488f5f4dd3d7f25c1bb7d37a750801810b38fcbc87ee42a474e7b84c05f128","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:49.252352Z","signature_b64":"AWMAvi3yz3MvvUbKW2d4xZBb3wweAxvhaIONlM5KvOFLTsTOm/6QgLRVhApIXI9MOWvX3RB/zWCy/+UMQYVyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b488f5f4dd3d7f25c1bb7d37a750801810b38fcbc87ee42a474e7b84c05f128","last_reissued_at":"2026-07-05T12:04:49.251807Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:49.251807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.03892","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-07-05T12:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9nYOfVZ2vwM15ouQElH3ttZZz5gXHdlGo8XRbcu01cFVezShItweBCzHG6koCPEbXuDupw/3kSR7T0rI9vGAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:54:21.848484Z"},"content_sha256":"5a1ff2a691038dd289af41804d81cfc2f626a0088e7013ab49e7536fd8b3a16e","schema_version":"1.0","event_id":"sha256:5a1ff2a691038dd289af41804d81cfc2f626a0088e7013ab49e7536fd8b3a16e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PNEI6X2N2PL7EXA3W7JXU5IIAG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mistake-bounded online learning with operation caps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.LG","authors_text":"Jesse Geneson, Linus Tang, Meien Li","submitted_at":"2025-09-04T05:26:43Z","abstract_excerpt":"We investigate the mistake-bound model of online learning with caps on the number of arithmetic operations per round. We prove general bounds on the minimum number of arithmetic operations per round that are necessary to learn an arbitrary family of functions with finitely many mistakes. We solve a problem on agnostic mistake-bounded online learning with bandit feedback from (Filmus et al, 2024) and (Geneson \\& Tang, 2024). We also extend this result to the setting of operation caps."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.03892","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.03892/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-05T12:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6+xMIDqVmMIXgX012gVKwtcZIB3q7BEWmVDR+i1EDwM1SiaqAQnAdm3E9ieVOlhD4Nt0togvuyDwqG1UNJ+zBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:54:21.848996Z"},"content_sha256":"4fa3b5bd5040cce62f73c07b7076324897634ce41bf7cb4a3cff7fdf679e8a07","schema_version":"1.0","event_id":"sha256:4fa3b5bd5040cce62f73c07b7076324897634ce41bf7cb4a3cff7fdf679e8a07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PNEI6X2N2PL7EXA3W7JXU5IIAG/bundle.json","state_url":"https://pith.science/pith/PNEI6X2N2PL7EXA3W7JXU5IIAG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PNEI6X2N2PL7EXA3W7JXU5IIAG/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-08T13:54:21Z","links":{"resolver":"https://pith.science/pith/PNEI6X2N2PL7EXA3W7JXU5IIAG","bundle":"https://pith.science/pith/PNEI6X2N2PL7EXA3W7JXU5IIAG/bundle.json","state":"https://pith.science/pith/PNEI6X2N2PL7EXA3W7JXU5IIAG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PNEI6X2N2PL7EXA3W7JXU5IIAG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PNEI6X2N2PL7EXA3W7JXU5IIAG","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":"50f138ff989fe9324d620c58245fa651b1f51f660bd0bacc5855810edc139963","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-04T05:26:43Z","title_canon_sha256":"36269ba24980ff20eb15eb2d33d6880c1800ab106e12e3ff3b32077056e31e67"},"schema_version":"1.0","source":{"id":"2509.03892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.03892","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"2509.03892v1","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03892","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"PNEI6X2N2PL7","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"pith_short_16","alias_value":"PNEI6X2N2PL7EXA3","created_at":"2026-07-05T12:04:49Z"},{"alias_kind":"pith_short_8","alias_value":"PNEI6X2N","created_at":"2026-07-05T12:04:49Z"}],"graph_snapshots":[{"event_id":"sha256:4fa3b5bd5040cce62f73c07b7076324897634ce41bf7cb4a3cff7fdf679e8a07","target":"graph","created_at":"2026-07-05T12:04:49Z","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/2509.03892/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate the mistake-bound model of online learning with caps on the number of arithmetic operations per round. We prove general bounds on the minimum number of arithmetic operations per round that are necessary to learn an arbitrary family of functions with finitely many mistakes. We solve a problem on agnostic mistake-bounded online learning with bandit feedback from (Filmus et al, 2024) and (Geneson \\& Tang, 2024). We also extend this result to the setting of operation caps.","authors_text":"Jesse Geneson, Linus Tang, Meien Li","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-04T05:26:43Z","title":"Mistake-bounded online learning with operation caps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.03892","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:5a1ff2a691038dd289af41804d81cfc2f626a0088e7013ab49e7536fd8b3a16e","target":"record","created_at":"2026-07-05T12:04:49Z","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":"50f138ff989fe9324d620c58245fa651b1f51f660bd0bacc5855810edc139963","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-04T05:26:43Z","title_canon_sha256":"36269ba24980ff20eb15eb2d33d6880c1800ab106e12e3ff3b32077056e31e67"},"schema_version":"1.0","source":{"id":"2509.03892","kind":"arxiv","version":1}},"canonical_sha256":"7b488f5f4dd3d7f25c1bb7d37a750801810b38fcbc87ee42a474e7b84c05f128","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b488f5f4dd3d7f25c1bb7d37a750801810b38fcbc87ee42a474e7b84c05f128","first_computed_at":"2026-07-05T12:04:49.251807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:04:49.251807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AWMAvi3yz3MvvUbKW2d4xZBb3wweAxvhaIONlM5KvOFLTsTOm/6QgLRVhApIXI9MOWvX3RB/zWCy/+UMQYVyCA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:04:49.252352Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.03892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a1ff2a691038dd289af41804d81cfc2f626a0088e7013ab49e7536fd8b3a16e","sha256:4fa3b5bd5040cce62f73c07b7076324897634ce41bf7cb4a3cff7fdf679e8a07"],"state_sha256":"18b9df7867403269067d2fc720fb84d6787a6a3338e5f78b43281f423ed494bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KXER+rcSs55qTw6UF1rhaCJ7B+rRuudBlcCAE3LyaWUE/Xo8R7rhLxiN2OvOIUKuBdWbQa7l8TZmoM5l7ox6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:54:21.855059Z","bundle_sha256":"f17cdf0b1ab6c1ad8d9b6afe3765d526af3ac08c8ee1017e8ae0d6d87359c1a0"}}