{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AHNYCZ65PK36NQJKKF76REAN4M","short_pith_number":"pith:AHNYCZ65","canonical_record":{"source":{"id":"1704.02598","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-09T13:17:52Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"6e81df7458a0f90bca79743af26cb2b4474c52255f4873a15975cd67ab056a71","abstract_canon_sha256":"d16f9d4c8b2076e2e5bbf6533509592c60394e3c8272edeca438f4195b668f3f"},"schema_version":"1.0"},"canonical_sha256":"01db8167dd7ab7e6c12a517fe8900de338ee9ed4a43face9a4bfbd4f6876ff38","source":{"kind":"arxiv","id":"1704.02598","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02598","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02598v2","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02598","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"pith_short_12","alias_value":"AHNYCZ65PK36","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AHNYCZ65PK36NQJK","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AHNYCZ65","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AHNYCZ65PK36NQJKKF76REAN4M","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02598","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-09T13:17:52Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"6e81df7458a0f90bca79743af26cb2b4474c52255f4873a15975cd67ab056a71","abstract_canon_sha256":"d16f9d4c8b2076e2e5bbf6533509592c60394e3c8272edeca438f4195b668f3f"},"schema_version":"1.0"},"canonical_sha256":"01db8167dd7ab7e6c12a517fe8900de338ee9ed4a43face9a4bfbd4f6876ff38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:18.337477Z","signature_b64":"/rZ04LnVd2zx2Ff2Pdex6UaH2r9QTi9/dg2vCZOR6KNHGMsyZ2ylXLOpi0BCeDFLhHVS9oYCHO5jWrRwzNwbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01db8167dd7ab7e6c12a517fe8900de338ee9ed4a43face9a4bfbd4f6876ff38","last_reissued_at":"2026-05-18T00:46:18.337075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:18.337075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02598","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-05-18T00:46:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Dr4YcfJVUA1CrJ7hmMGyMO5oCGx4YAqewpHG8qiTQop31iss1DEiua5+ns0h8q593LBhGEd+selLdQIjQInAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:37:29.121764Z"},"content_sha256":"7fff46982491a1ea95c90fd4201586a50f9c682eb16114a20b73914c0023892a","schema_version":"1.0","event_id":"sha256:7fff46982491a1ea95c90fd4201586a50f9c682eb16114a20b73914c0023892a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AHNYCZ65PK36NQJKKF76REAN4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Sample Complexity Measure with Applications to Learning Optimal Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"cs.GT","authors_text":"Vasilis Syrgkanis","submitted_at":"2017-04-09T13:17:52Z","abstract_excerpt":"We introduce a new sample complexity measure, which we refer to as split-sample growth rate. For any hypothesis $H$ and for any sample $S$ of size $m$, the split-sample growth rate $\\hat{\\tau}_H(m)$ counts how many different hypotheses can empirical risk minimization output on any sub-sample of $S$ of size $m/2$. We show that the expected generalization error is upper bounded by $O\\left(\\sqrt{\\frac{\\log(\\hat{\\tau}_H(2m))}{m}}\\right)$. Our result is enabled by a strengthening of the Rademacher complexity analysis of the expected generalization error. We show that this sample complexity measure,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02598","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":""},"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:46:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qmg8MlRiDVB146AiaPh3XJZQsKTpsayV7RN+RZN1nnfZhLmD6ibDMFUhM3MVPGb5IBpX5lzQwyHazjVOybviBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:37:29.122439Z"},"content_sha256":"0f4e096205347f180609649ec427771d07ca90632b149763db386f73ef950e48","schema_version":"1.0","event_id":"sha256:0f4e096205347f180609649ec427771d07ca90632b149763db386f73ef950e48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHNYCZ65PK36NQJKKF76REAN4M/bundle.json","state_url":"https://pith.science/pith/AHNYCZ65PK36NQJKKF76REAN4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHNYCZ65PK36NQJKKF76REAN4M/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-27T09:37:29Z","links":{"resolver":"https://pith.science/pith/AHNYCZ65PK36NQJKKF76REAN4M","bundle":"https://pith.science/pith/AHNYCZ65PK36NQJKKF76REAN4M/bundle.json","state":"https://pith.science/pith/AHNYCZ65PK36NQJKKF76REAN4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHNYCZ65PK36NQJKKF76REAN4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AHNYCZ65PK36NQJKKF76REAN4M","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":"d16f9d4c8b2076e2e5bbf6533509592c60394e3c8272edeca438f4195b668f3f","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-09T13:17:52Z","title_canon_sha256":"6e81df7458a0f90bca79743af26cb2b4474c52255f4873a15975cd67ab056a71"},"schema_version":"1.0","source":{"id":"1704.02598","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02598","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02598v2","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02598","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"pith_short_12","alias_value":"AHNYCZ65PK36","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AHNYCZ65PK36NQJK","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AHNYCZ65","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:0f4e096205347f180609649ec427771d07ca90632b149763db386f73ef950e48","target":"graph","created_at":"2026-05-18T00:46:18Z","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 introduce a new sample complexity measure, which we refer to as split-sample growth rate. For any hypothesis $H$ and for any sample $S$ of size $m$, the split-sample growth rate $\\hat{\\tau}_H(m)$ counts how many different hypotheses can empirical risk minimization output on any sub-sample of $S$ of size $m/2$. We show that the expected generalization error is upper bounded by $O\\left(\\sqrt{\\frac{\\log(\\hat{\\tau}_H(2m))}{m}}\\right)$. Our result is enabled by a strengthening of the Rademacher complexity analysis of the expected generalization error. We show that this sample complexity measure,","authors_text":"Vasilis Syrgkanis","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-09T13:17:52Z","title":"A Sample Complexity Measure with Applications to Learning Optimal Auctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02598","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:7fff46982491a1ea95c90fd4201586a50f9c682eb16114a20b73914c0023892a","target":"record","created_at":"2026-05-18T00:46:18Z","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":"d16f9d4c8b2076e2e5bbf6533509592c60394e3c8272edeca438f4195b668f3f","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-09T13:17:52Z","title_canon_sha256":"6e81df7458a0f90bca79743af26cb2b4474c52255f4873a15975cd67ab056a71"},"schema_version":"1.0","source":{"id":"1704.02598","kind":"arxiv","version":2}},"canonical_sha256":"01db8167dd7ab7e6c12a517fe8900de338ee9ed4a43face9a4bfbd4f6876ff38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01db8167dd7ab7e6c12a517fe8900de338ee9ed4a43face9a4bfbd4f6876ff38","first_computed_at":"2026-05-18T00:46:18.337075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:18.337075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/rZ04LnVd2zx2Ff2Pdex6UaH2r9QTi9/dg2vCZOR6KNHGMsyZ2ylXLOpi0BCeDFLhHVS9oYCHO5jWrRwzNwbAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:18.337477Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02598","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fff46982491a1ea95c90fd4201586a50f9c682eb16114a20b73914c0023892a","sha256:0f4e096205347f180609649ec427771d07ca90632b149763db386f73ef950e48"],"state_sha256":"e848759286ee402daa212d3f7e3aba3b56ff62530e5dd8fba060058df98b0e0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bsl84nUcbDCqF0cLPoTDEMzuF54VvdbcVK3pyPlNYZXLBWDMZmFGUVnVp45H5eg9MC+wP3dHkLzXvuK4ao+IBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:37:29.126114Z","bundle_sha256":"26e2c1a0cfd739e7dc37a844e8c07967a4f1876ab6dcd2539878787eca0f9ae8"}}