{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BRFONEZWY2RFUFGE5PQTJEGGGA","short_pith_number":"pith:BRFONEZW","canonical_record":{"source":{"id":"1706.02733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T18:48:38Z","cross_cats_sorted":[],"title_canon_sha256":"e44107f2111c89066c85d7c56cb472e42ed2a61a5177cf1cefcc2543c87bf702","abstract_canon_sha256":"f42fb1bb8fc2027175bcc91961dc20b8ff7f27a60fcb44fee9d1fa515ae1a758"},"schema_version":"1.0"},"canonical_sha256":"0c4ae69336c6a25a14c4ebe13490c6303c38bf846a3862080d04098a8e2f0f96","source":{"kind":"arxiv","id":"1706.02733","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02733","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02733v1","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02733","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"BRFONEZWY2RF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BRFONEZWY2RFUFGE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BRFONEZW","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BRFONEZWY2RFUFGE5PQTJEGGGA","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T18:48:38Z","cross_cats_sorted":[],"title_canon_sha256":"e44107f2111c89066c85d7c56cb472e42ed2a61a5177cf1cefcc2543c87bf702","abstract_canon_sha256":"f42fb1bb8fc2027175bcc91961dc20b8ff7f27a60fcb44fee9d1fa515ae1a758"},"schema_version":"1.0"},"canonical_sha256":"0c4ae69336c6a25a14c4ebe13490c6303c38bf846a3862080d04098a8e2f0f96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:43.252048Z","signature_b64":"mlPqKuvM5lM7NmdIWAQgU2d4b2KHuskRF9sK7vCcbTg6HRq6ZXhhSVUvPKtyEnmTbenBY+aXE8TrxAfPY1ZhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c4ae69336c6a25a14c4ebe13490c6303c38bf846a3862080d04098a8e2f0f96","last_reissued_at":"2026-05-18T00:42:43.251371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:43.251371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02733","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-05-18T00:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SAdM2eWyJWIxihT4cD1Wr/asejAxj4tV78V4HzSZu6KckEpFOtKmZwnA3ZG/u6c0Kv3NuiGcJwEvTgkswq5QAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T21:25:35.743636Z"},"content_sha256":"eb66cacf88acde0fa92b3febc6090fe090500d2d794f377ee97c6a3b8cd2c749","schema_version":"1.0","event_id":"sha256:eb66cacf88acde0fa92b3febc6090fe090500d2d794f377ee97c6a3b8cd2c749"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BRFONEZWY2RFUFGE5PQTJEGGGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Climbing a shaky ladder: Better adaptive risk estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Moritz Hardt","submitted_at":"2017-06-08T18:48:38Z","abstract_excerpt":"We revisit the \\emph{leaderboard problem} introduced by Blum and Hardt (2015) in an effort to reduce overfitting in machine learning benchmarks. We show that a randomized version of their Ladder algorithm achieves leaderboard error O(1/n^{0.4}) compared with the previous best rate of O(1/n^{1/3}).\n  Short of proving that our algorithm is optimal, we point out a major obstacle toward further progress. Specifically, any improvement to our upper bound would lead to asymptotic improvements in the general adaptive estimation setting as have remained elusive in recent years. This connection also dir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02733","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":""},"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-18T00:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QoarO7o9yTKpdPFVZ1HvSCdG9Erj56710eWZ32Vb2ttf2sfQEAv1mKfnOATLU6ootjx99KLZIj/kHrqdf9NdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T21:25:35.744110Z"},"content_sha256":"d0b607232301276147f89f3890a64db3520161e2f61704b32ed013f987eaf1e5","schema_version":"1.0","event_id":"sha256:d0b607232301276147f89f3890a64db3520161e2f61704b32ed013f987eaf1e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BRFONEZWY2RFUFGE5PQTJEGGGA/bundle.json","state_url":"https://pith.science/pith/BRFONEZWY2RFUFGE5PQTJEGGGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BRFONEZWY2RFUFGE5PQTJEGGGA/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-09T21:25:35Z","links":{"resolver":"https://pith.science/pith/BRFONEZWY2RFUFGE5PQTJEGGGA","bundle":"https://pith.science/pith/BRFONEZWY2RFUFGE5PQTJEGGGA/bundle.json","state":"https://pith.science/pith/BRFONEZWY2RFUFGE5PQTJEGGGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BRFONEZWY2RFUFGE5PQTJEGGGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BRFONEZWY2RFUFGE5PQTJEGGGA","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":"f42fb1bb8fc2027175bcc91961dc20b8ff7f27a60fcb44fee9d1fa515ae1a758","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T18:48:38Z","title_canon_sha256":"e44107f2111c89066c85d7c56cb472e42ed2a61a5177cf1cefcc2543c87bf702"},"schema_version":"1.0","source":{"id":"1706.02733","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02733","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02733v1","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02733","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"BRFONEZWY2RF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BRFONEZWY2RFUFGE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BRFONEZW","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:d0b607232301276147f89f3890a64db3520161e2f61704b32ed013f987eaf1e5","target":"graph","created_at":"2026-05-18T00:42:43Z","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":"We revisit the \\emph{leaderboard problem} introduced by Blum and Hardt (2015) in an effort to reduce overfitting in machine learning benchmarks. We show that a randomized version of their Ladder algorithm achieves leaderboard error O(1/n^{0.4}) compared with the previous best rate of O(1/n^{1/3}).\n  Short of proving that our algorithm is optimal, we point out a major obstacle toward further progress. Specifically, any improvement to our upper bound would lead to asymptotic improvements in the general adaptive estimation setting as have remained elusive in recent years. This connection also dir","authors_text":"Moritz Hardt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T18:48:38Z","title":"Climbing a shaky ladder: Better adaptive risk estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02733","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:eb66cacf88acde0fa92b3febc6090fe090500d2d794f377ee97c6a3b8cd2c749","target":"record","created_at":"2026-05-18T00:42:43Z","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":"f42fb1bb8fc2027175bcc91961dc20b8ff7f27a60fcb44fee9d1fa515ae1a758","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-08T18:48:38Z","title_canon_sha256":"e44107f2111c89066c85d7c56cb472e42ed2a61a5177cf1cefcc2543c87bf702"},"schema_version":"1.0","source":{"id":"1706.02733","kind":"arxiv","version":1}},"canonical_sha256":"0c4ae69336c6a25a14c4ebe13490c6303c38bf846a3862080d04098a8e2f0f96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c4ae69336c6a25a14c4ebe13490c6303c38bf846a3862080d04098a8e2f0f96","first_computed_at":"2026-05-18T00:42:43.251371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:43.251371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mlPqKuvM5lM7NmdIWAQgU2d4b2KHuskRF9sK7vCcbTg6HRq6ZXhhSVUvPKtyEnmTbenBY+aXE8TrxAfPY1ZhAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:43.252048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02733","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb66cacf88acde0fa92b3febc6090fe090500d2d794f377ee97c6a3b8cd2c749","sha256:d0b607232301276147f89f3890a64db3520161e2f61704b32ed013f987eaf1e5"],"state_sha256":"fea6545a9ddeae7cf45ef0a40187711f72b3d310ad11173ba8d10efe411471d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2XNfRlykWHTg2GEUI+2zp3Nzu63P4xbJn6wZGf3VFDx18gZ+8OUIisSenpvSgyV9AzSb5Y9+fdvIVQ24mYHKBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T21:25:35.749490Z","bundle_sha256":"5a3638a0747955ae84d610be159e3d4c36b04624f6e1fe15ab761e619ea8f34e"}}