{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2BTCT64Z7TAQOD46LRDQ27GK43","short_pith_number":"pith:2BTCT64Z","canonical_record":{"source":{"id":"1606.05228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-16T15:38:20Z","cross_cats_sorted":["cs.CV","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"c5ef244af3495e2608f9d937f0417d06c0f68b12a71cc47acad576d637805c51","abstract_canon_sha256":"65fc6abd75e282ec8400107f9e4cb8de069e861e09086694754de4f6b6ae570b"},"schema_version":"1.0"},"canonical_sha256":"d06629fb99fcc1070f9e5c470d7ccae6f5efa3e3da012b3323680e7e81f51b35","source":{"kind":"arxiv","id":"1606.05228","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05228","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05228v1","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05228","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"2BTCT64Z7TAQ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"2BTCT64Z7TAQOD46","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"2BTCT64Z","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2BTCT64Z7TAQOD46LRDQ27GK43","target":"record","payload":{"canonical_record":{"source":{"id":"1606.05228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-16T15:38:20Z","cross_cats_sorted":["cs.CV","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"c5ef244af3495e2608f9d937f0417d06c0f68b12a71cc47acad576d637805c51","abstract_canon_sha256":"65fc6abd75e282ec8400107f9e4cb8de069e861e09086694754de4f6b6ae570b"},"schema_version":"1.0"},"canonical_sha256":"d06629fb99fcc1070f9e5c470d7ccae6f5efa3e3da012b3323680e7e81f51b35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:21.774013Z","signature_b64":"fOHvmoDl79QM10f6jknSo/cnXtFTpBHV09z8q7+fxkzNHVrWh6z/Y1VvMjB+o7eDIxPxoIf2Rz3Ni892He6OCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d06629fb99fcc1070f9e5c470d7ccae6f5efa3e3da012b3323680e7e81f51b35","last_reissued_at":"2026-05-18T01:12:21.773664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:21.773664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.05228","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-18T01:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTv9D8KLymjXfMLUEWBX3+bss3Qy7RUH7fcjwaX7L0JWGwrrjadMIgAxWK8xIq6ljlATFki2W9yJ85spt5URAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:59:41.048488Z"},"content_sha256":"25b7e3d6b7a1686c3f177174cdde5a93bae84fb6d4c13bb94fd96a07be19561f","schema_version":"1.0","event_id":"sha256:25b7e3d6b7a1686c3f177174cdde5a93bae84fb6d4c13bb94fd96a07be19561f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2BTCT64Z7TAQOD46LRDQ27GK43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How many faces can be recognized? Performance extrapolation for multi-class classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Charles Y. Zheng, Rakesh Achanta, Yuval Benjamini","submitted_at":"2016-06-16T15:38:20Z","abstract_excerpt":"The difficulty of multi-class classification generally increases with the number of classes. Using data from a subset of the classes, can we predict how well a classifier will scale with an increased number of classes? Under the assumption that the classes are sampled exchangeably, and under the assumption that the classifier is generative (e.g. QDA or Naive Bayes), we show that the expected accuracy when the classifier is trained on $k$ classes is the $k-1$st moment of a \\emph{conditional accuracy distribution}, which can be estimated from data. This provides the theoretical foundation for pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05228","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-18T01:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oGntPBbRzAL/CMiM3ZwyDiIchwsx+oXox6gHhvg+QRUsFmkkaHf95Uu3CN1HWmXKeDnWf14Fmw9xI1z9FgXoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:59:41.048832Z"},"content_sha256":"90c446ea2d56919df1446eb2db2c8fcd6e5aa3d0dcce291510bf1e7849cfd8b7","schema_version":"1.0","event_id":"sha256:90c446ea2d56919df1446eb2db2c8fcd6e5aa3d0dcce291510bf1e7849cfd8b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2BTCT64Z7TAQOD46LRDQ27GK43/bundle.json","state_url":"https://pith.science/pith/2BTCT64Z7TAQOD46LRDQ27GK43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2BTCT64Z7TAQOD46LRDQ27GK43/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-06-01T23:59:41Z","links":{"resolver":"https://pith.science/pith/2BTCT64Z7TAQOD46LRDQ27GK43","bundle":"https://pith.science/pith/2BTCT64Z7TAQOD46LRDQ27GK43/bundle.json","state":"https://pith.science/pith/2BTCT64Z7TAQOD46LRDQ27GK43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2BTCT64Z7TAQOD46LRDQ27GK43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2BTCT64Z7TAQOD46LRDQ27GK43","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":"65fc6abd75e282ec8400107f9e4cb8de069e861e09086694754de4f6b6ae570b","cross_cats_sorted":["cs.CV","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-16T15:38:20Z","title_canon_sha256":"c5ef244af3495e2608f9d937f0417d06c0f68b12a71cc47acad576d637805c51"},"schema_version":"1.0","source":{"id":"1606.05228","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05228","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05228v1","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05228","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"2BTCT64Z7TAQ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"2BTCT64Z7TAQOD46","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"2BTCT64Z","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:90c446ea2d56919df1446eb2db2c8fcd6e5aa3d0dcce291510bf1e7849cfd8b7","target":"graph","created_at":"2026-05-18T01:12:21Z","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":"The difficulty of multi-class classification generally increases with the number of classes. Using data from a subset of the classes, can we predict how well a classifier will scale with an increased number of classes? Under the assumption that the classes are sampled exchangeably, and under the assumption that the classifier is generative (e.g. QDA or Naive Bayes), we show that the expected accuracy when the classifier is trained on $k$ classes is the $k-1$st moment of a \\emph{conditional accuracy distribution}, which can be estimated from data. This provides the theoretical foundation for pe","authors_text":"Charles Y. Zheng, Rakesh Achanta, Yuval Benjamini","cross_cats":["cs.CV","cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-16T15:38:20Z","title":"How many faces can be recognized? Performance extrapolation for multi-class classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05228","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:25b7e3d6b7a1686c3f177174cdde5a93bae84fb6d4c13bb94fd96a07be19561f","target":"record","created_at":"2026-05-18T01:12:21Z","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":"65fc6abd75e282ec8400107f9e4cb8de069e861e09086694754de4f6b6ae570b","cross_cats_sorted":["cs.CV","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-16T15:38:20Z","title_canon_sha256":"c5ef244af3495e2608f9d937f0417d06c0f68b12a71cc47acad576d637805c51"},"schema_version":"1.0","source":{"id":"1606.05228","kind":"arxiv","version":1}},"canonical_sha256":"d06629fb99fcc1070f9e5c470d7ccae6f5efa3e3da012b3323680e7e81f51b35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d06629fb99fcc1070f9e5c470d7ccae6f5efa3e3da012b3323680e7e81f51b35","first_computed_at":"2026-05-18T01:12:21.773664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:21.773664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fOHvmoDl79QM10f6jknSo/cnXtFTpBHV09z8q7+fxkzNHVrWh6z/Y1VvMjB+o7eDIxPxoIf2Rz3Ni892He6OCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:21.774013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05228","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25b7e3d6b7a1686c3f177174cdde5a93bae84fb6d4c13bb94fd96a07be19561f","sha256:90c446ea2d56919df1446eb2db2c8fcd6e5aa3d0dcce291510bf1e7849cfd8b7"],"state_sha256":"401d6dc1f05635dd5c34b5df0d092d833762a9e17e01f3afdb7b706058dd7cc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ht6/fQfLPpiTPdYcLUKRZs5YiRy+W6zjME3Vhh28dkxwx2cA5VM7TEsbL9W7pFpKlMvW3isap+4Ci7kaWJ9hDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:59:41.050913Z","bundle_sha256":"a24a31bd9036b6ae584e891b40d1a8c717e1204f5c162871b688ac5d5dd3ceea"}}