{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7QJ4NJZ5V5OOMV42UNGRC5T6JL","short_pith_number":"pith:7QJ4NJZ5","canonical_record":{"source":{"id":"1905.10360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T17:59:32Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"fad524bf3fa340fd2f0184c7c2619db0b012c370447617c9f27c203c092431c7","abstract_canon_sha256":"8588b5d1ceae2eb299c20680e050f6b72dec40bdca06449fb3b9d66e8d3f4a5e"},"schema_version":"1.0"},"canonical_sha256":"fc13c6a73daf5ce6579aa34d11767e4ae33f2c1388ef614e0e104ecd2d285b71","source":{"kind":"arxiv","id":"1905.10360","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10360","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10360v1","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10360","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"7QJ4NJZ5V5OO","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7QJ4NJZ5V5OOMV42","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7QJ4NJZ5","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7QJ4NJZ5V5OOMV42UNGRC5T6JL","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T17:59:32Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"fad524bf3fa340fd2f0184c7c2619db0b012c370447617c9f27c203c092431c7","abstract_canon_sha256":"8588b5d1ceae2eb299c20680e050f6b72dec40bdca06449fb3b9d66e8d3f4a5e"},"schema_version":"1.0"},"canonical_sha256":"fc13c6a73daf5ce6579aa34d11767e4ae33f2c1388ef614e0e104ecd2d285b71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:10.477425Z","signature_b64":"MmD0ozwdaXjxXT6IZjhcEALwYGlX3FpZwSyvzau8N3hDLcPVozGvxnqvrArIY2AsTeyayQleVF/WX8NmNAefCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc13c6a73daf5ce6579aa34d11767e4ae33f2c1388ef614e0e104ecd2d285b71","last_reissued_at":"2026-05-17T23:45:10.476632Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:10.476632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10360","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-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wt6To8HJNk6nMVF8oC7LzpdGGixcVRtAkYSXzAuvl+tHkB9rsQzjN5HqQ42eY0L3nVnNK0375vsa3DiIjKuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:58:58.597967Z"},"content_sha256":"7fb8258150684056f57d564c598e03abf132316b2fa7d5eb4f1c3cb2e1755af5","schema_version":"1.0","event_id":"sha256:7fb8258150684056f57d564c598e03abf132316b2fa7d5eb4f1c3cb2e1755af5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7QJ4NJZ5V5OOMV42UNGRC5T6JL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The advantages of multiple classes for reducing overfitting from test set reuse","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Moritz Hardt, Roy Frostig, Vitaly Feldman","submitted_at":"2019-05-24T17:59:32Z","abstract_excerpt":"Excessive reuse of holdout data can lead to overfitting. However, there is little concrete evidence of significant overfitting due to holdout reuse in popular multiclass benchmarks today. Known results show that, in the worst-case, revealing the accuracy of $k$ adaptively chosen classifiers on a data set of size $n$ allows to create a classifier with bias of $\\Theta(\\sqrt{k/n})$ for any binary prediction problem. We show a new upper bound of $\\tilde O(\\max\\{\\sqrt{k\\log(n)/(mn)},k/n\\})$ on the worst-case bias that any attack can achieve in a prediction problem with $m$ classes. Moreover, we pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10360","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-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yijDMAkBIPuDI5z4iPUihqcOrJDkzKaWMOv8Cul0JIri/sW6y4FG6YQwwKWyoEM2lhKw0eRR0ecOEqaywjzwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:58:58.598601Z"},"content_sha256":"f3611fd909f596b06d54bb9a910c0ec2f5f91493fc9599efe9d5a4d14e9d7fed","schema_version":"1.0","event_id":"sha256:f3611fd909f596b06d54bb9a910c0ec2f5f91493fc9599efe9d5a4d14e9d7fed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QJ4NJZ5V5OOMV42UNGRC5T6JL/bundle.json","state_url":"https://pith.science/pith/7QJ4NJZ5V5OOMV42UNGRC5T6JL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QJ4NJZ5V5OOMV42UNGRC5T6JL/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-27T15:58:58Z","links":{"resolver":"https://pith.science/pith/7QJ4NJZ5V5OOMV42UNGRC5T6JL","bundle":"https://pith.science/pith/7QJ4NJZ5V5OOMV42UNGRC5T6JL/bundle.json","state":"https://pith.science/pith/7QJ4NJZ5V5OOMV42UNGRC5T6JL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QJ4NJZ5V5OOMV42UNGRC5T6JL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7QJ4NJZ5V5OOMV42UNGRC5T6JL","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":"8588b5d1ceae2eb299c20680e050f6b72dec40bdca06449fb3b9d66e8d3f4a5e","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T17:59:32Z","title_canon_sha256":"fad524bf3fa340fd2f0184c7c2619db0b012c370447617c9f27c203c092431c7"},"schema_version":"1.0","source":{"id":"1905.10360","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10360","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10360v1","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10360","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"7QJ4NJZ5V5OO","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7QJ4NJZ5V5OOMV42","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7QJ4NJZ5","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:f3611fd909f596b06d54bb9a910c0ec2f5f91493fc9599efe9d5a4d14e9d7fed","target":"graph","created_at":"2026-05-17T23:45:10Z","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":"Excessive reuse of holdout data can lead to overfitting. However, there is little concrete evidence of significant overfitting due to holdout reuse in popular multiclass benchmarks today. Known results show that, in the worst-case, revealing the accuracy of $k$ adaptively chosen classifiers on a data set of size $n$ allows to create a classifier with bias of $\\Theta(\\sqrt{k/n})$ for any binary prediction problem. We show a new upper bound of $\\tilde O(\\max\\{\\sqrt{k\\log(n)/(mn)},k/n\\})$ on the worst-case bias that any attack can achieve in a prediction problem with $m$ classes. Moreover, we pre","authors_text":"Moritz Hardt, Roy Frostig, Vitaly Feldman","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T17:59:32Z","title":"The advantages of multiple classes for reducing overfitting from test set reuse"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10360","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:7fb8258150684056f57d564c598e03abf132316b2fa7d5eb4f1c3cb2e1755af5","target":"record","created_at":"2026-05-17T23:45:10Z","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":"8588b5d1ceae2eb299c20680e050f6b72dec40bdca06449fb3b9d66e8d3f4a5e","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T17:59:32Z","title_canon_sha256":"fad524bf3fa340fd2f0184c7c2619db0b012c370447617c9f27c203c092431c7"},"schema_version":"1.0","source":{"id":"1905.10360","kind":"arxiv","version":1}},"canonical_sha256":"fc13c6a73daf5ce6579aa34d11767e4ae33f2c1388ef614e0e104ecd2d285b71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc13c6a73daf5ce6579aa34d11767e4ae33f2c1388ef614e0e104ecd2d285b71","first_computed_at":"2026-05-17T23:45:10.476632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:10.476632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MmD0ozwdaXjxXT6IZjhcEALwYGlX3FpZwSyvzau8N3hDLcPVozGvxnqvrArIY2AsTeyayQleVF/WX8NmNAefCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:10.477425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10360","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fb8258150684056f57d564c598e03abf132316b2fa7d5eb4f1c3cb2e1755af5","sha256:f3611fd909f596b06d54bb9a910c0ec2f5f91493fc9599efe9d5a4d14e9d7fed"],"state_sha256":"efc3797237466ce79231bd0e98b828b5a32b31766af27b2e78570188a4e9b48d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PN5MdComABUxmS/k8ISV1+ZlbBSi/e6rFr8pT8G4stqbLte0nwVEuTHWbKxuHeH1a8NdbLV7i4yWfwIxnp25DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:58:58.601625Z","bundle_sha256":"ba8300b8ced4358e4dc9ff62944fd0aba6bb486652c93232ecfd0832b49306c0"}}