{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:FPMV427C4EUS2AGSYEVD7MOFAK","short_pith_number":"pith:FPMV427C","canonical_record":{"source":{"id":"2403.12732","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-03-19T13:47:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8d39b2a74b92a6a5b6d37b6428e5331b88b9e598c10ef684cd74ef5c1fcef162","abstract_canon_sha256":"0ace108b976d1e8b8468869b222e0edde757f6e168eabfbb5d61bb91ac2b7704"},"schema_version":"1.0"},"canonical_sha256":"2bd95e6be2e1292d00d2c12a3fb1c5028621d79b9012454f5c4000f09addf4a0","source":{"kind":"arxiv","id":"2403.12732","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.12732","created_at":"2026-07-05T09:33:29Z"},{"alias_kind":"arxiv_version","alias_value":"2403.12732v2","created_at":"2026-07-05T09:33:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.12732","created_at":"2026-07-05T09:33:29Z"},{"alias_kind":"pith_short_12","alias_value":"FPMV427C4EUS","created_at":"2026-07-05T09:33:29Z"},{"alias_kind":"pith_short_16","alias_value":"FPMV427C4EUS2AGS","created_at":"2026-07-05T09:33:29Z"},{"alias_kind":"pith_short_8","alias_value":"FPMV427C","created_at":"2026-07-05T09:33:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:FPMV427C4EUS2AGSYEVD7MOFAK","target":"record","payload":{"canonical_record":{"source":{"id":"2403.12732","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-03-19T13:47:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8d39b2a74b92a6a5b6d37b6428e5331b88b9e598c10ef684cd74ef5c1fcef162","abstract_canon_sha256":"0ace108b976d1e8b8468869b222e0edde757f6e168eabfbb5d61bb91ac2b7704"},"schema_version":"1.0"},"canonical_sha256":"2bd95e6be2e1292d00d2c12a3fb1c5028621d79b9012454f5c4000f09addf4a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:29.997720Z","signature_b64":"t68TGtdrzoGn99+MaUhUmTZ8xBzgfq255qxbOSlsavOzvIblHTQGp2WZ/pxb3KHbErg4aL46OoRYLm72ui7vBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bd95e6be2e1292d00d2c12a3fb1c5028621d79b9012454f5c4000f09addf4a0","last_reissued_at":"2026-07-05T09:33:29.997222Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:29.997222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.12732","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-05T09:33:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3+gsN/4nYUL9l56FrjL2kYEIrbpwRlfe23JQq6rNg//nyDKVBrh0CGFDsMbc3yJ5dE+78smfseu2Nzrw6r1CAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T08:06:59.042974Z"},"content_sha256":"9624b600de48b2d89740b74e2e37db636905f08c5e9bbcfbe29b8f838b16194e","schema_version":"1.0","event_id":"sha256:9624b600de48b2d89740b74e2e37db636905f08c5e9bbcfbe29b8f838b16194e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:FPMV427C4EUS2AGSYEVD7MOFAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tighter Confidence Bounds for Sequential Kernel Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"David Reeb, Hamish Flynn","submitted_at":"2024-03-19T13:47:35Z","abstract_excerpt":"Confidence bounds are an essential tool for rigorously quantifying the uncertainty of predictions. They are a core component in many sequential learning and decision-making algorithms, with tighter confidence bounds giving rise to algorithms with better empirical performance and better performance guarantees. In this work, we use martingale tail inequalities to establish new confidence bounds for sequential kernel regression. Our confidence bounds can be computed by solving a conic program, although this bare version quickly becomes impractical, because the number of variables grows with the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.12732","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/2403.12732/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-05T09:33:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j9wuW57iPKloLaW4Fs3sETBf74xtPH9HRhvT8KLD2SCZ6sawbCtuu7CAOJ0aHi/WMoMAfCKiXESCrF+34zjnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T08:06:59.044072Z"},"content_sha256":"f02bf2bb1cc9d08ace439dde9ef64ee78d1a51b6940561e0eb3a867e9e1893cd","schema_version":"1.0","event_id":"sha256:f02bf2bb1cc9d08ace439dde9ef64ee78d1a51b6940561e0eb3a867e9e1893cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPMV427C4EUS2AGSYEVD7MOFAK/bundle.json","state_url":"https://pith.science/pith/FPMV427C4EUS2AGSYEVD7MOFAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPMV427C4EUS2AGSYEVD7MOFAK/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-22T08:06:59Z","links":{"resolver":"https://pith.science/pith/FPMV427C4EUS2AGSYEVD7MOFAK","bundle":"https://pith.science/pith/FPMV427C4EUS2AGSYEVD7MOFAK/bundle.json","state":"https://pith.science/pith/FPMV427C4EUS2AGSYEVD7MOFAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPMV427C4EUS2AGSYEVD7MOFAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FPMV427C4EUS2AGSYEVD7MOFAK","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":"0ace108b976d1e8b8468869b222e0edde757f6e168eabfbb5d61bb91ac2b7704","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-03-19T13:47:35Z","title_canon_sha256":"8d39b2a74b92a6a5b6d37b6428e5331b88b9e598c10ef684cd74ef5c1fcef162"},"schema_version":"1.0","source":{"id":"2403.12732","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.12732","created_at":"2026-07-05T09:33:29Z"},{"alias_kind":"arxiv_version","alias_value":"2403.12732v2","created_at":"2026-07-05T09:33:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.12732","created_at":"2026-07-05T09:33:29Z"},{"alias_kind":"pith_short_12","alias_value":"FPMV427C4EUS","created_at":"2026-07-05T09:33:29Z"},{"alias_kind":"pith_short_16","alias_value":"FPMV427C4EUS2AGS","created_at":"2026-07-05T09:33:29Z"},{"alias_kind":"pith_short_8","alias_value":"FPMV427C","created_at":"2026-07-05T09:33:29Z"}],"graph_snapshots":[{"event_id":"sha256:f02bf2bb1cc9d08ace439dde9ef64ee78d1a51b6940561e0eb3a867e9e1893cd","target":"graph","created_at":"2026-07-05T09:33:29Z","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/2403.12732/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Confidence bounds are an essential tool for rigorously quantifying the uncertainty of predictions. They are a core component in many sequential learning and decision-making algorithms, with tighter confidence bounds giving rise to algorithms with better empirical performance and better performance guarantees. In this work, we use martingale tail inequalities to establish new confidence bounds for sequential kernel regression. Our confidence bounds can be computed by solving a conic program, although this bare version quickly becomes impractical, because the number of variables grows with the s","authors_text":"David Reeb, Hamish Flynn","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-03-19T13:47:35Z","title":"Tighter Confidence Bounds for Sequential Kernel Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.12732","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:9624b600de48b2d89740b74e2e37db636905f08c5e9bbcfbe29b8f838b16194e","target":"record","created_at":"2026-07-05T09:33:29Z","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":"0ace108b976d1e8b8468869b222e0edde757f6e168eabfbb5d61bb91ac2b7704","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-03-19T13:47:35Z","title_canon_sha256":"8d39b2a74b92a6a5b6d37b6428e5331b88b9e598c10ef684cd74ef5c1fcef162"},"schema_version":"1.0","source":{"id":"2403.12732","kind":"arxiv","version":2}},"canonical_sha256":"2bd95e6be2e1292d00d2c12a3fb1c5028621d79b9012454f5c4000f09addf4a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bd95e6be2e1292d00d2c12a3fb1c5028621d79b9012454f5c4000f09addf4a0","first_computed_at":"2026-07-05T09:33:29.997222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:33:29.997222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t68TGtdrzoGn99+MaUhUmTZ8xBzgfq255qxbOSlsavOzvIblHTQGp2WZ/pxb3KHbErg4aL46OoRYLm72ui7vBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:33:29.997720Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.12732","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9624b600de48b2d89740b74e2e37db636905f08c5e9bbcfbe29b8f838b16194e","sha256:f02bf2bb1cc9d08ace439dde9ef64ee78d1a51b6940561e0eb3a867e9e1893cd"],"state_sha256":"e757bed323cdd80c802f702cbd95e5b9aa00304beff7221e23b19c4c91b74cfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8NMp0pTSYwQt1FZ48TC3gYDqbwbQSSKpghyvtubPpyCNauTpwU/37QusGcJAwLESdnTuQqeElZSCEOyxnoAsCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T08:06:59.049615Z","bundle_sha256":"f930a918f5652e58f0e0466df1d83447beef4e044b82e0f5f3aefcbda1a8d683"}}