{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZPNJ6XELZ3Y7SANEB5HGCQESI2","short_pith_number":"pith:ZPNJ6XEL","canonical_record":{"source":{"id":"1710.08509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T21:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"46565641fccce0bacb7bf4694250313a3328690fb5fa1ced60a8278a7563f92e","abstract_canon_sha256":"8e03090bfaf8cb28912a478e6393e7922e451569ff76df0401c4dbc63c2837e8"},"schema_version":"1.0"},"canonical_sha256":"cbda9f5c8bcef1f901a40f4e6140924691d67b9ceb07ad53dbd91e15aa92276b","source":{"kind":"arxiv","id":"1710.08509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08509","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08509v1","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08509","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"ZPNJ6XELZ3Y7","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZPNJ6XELZ3Y7SANE","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZPNJ6XEL","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZPNJ6XELZ3Y7SANEB5HGCQESI2","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T21:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"46565641fccce0bacb7bf4694250313a3328690fb5fa1ced60a8278a7563f92e","abstract_canon_sha256":"8e03090bfaf8cb28912a478e6393e7922e451569ff76df0401c4dbc63c2837e8"},"schema_version":"1.0"},"canonical_sha256":"cbda9f5c8bcef1f901a40f4e6140924691d67b9ceb07ad53dbd91e15aa92276b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:15.848524Z","signature_b64":"WJtttDz2rN2yMbYUeyuzPmP/YhHSMb+4Tio6g8VnzSZQRXwhgzMBnlr4QvNOxv31bjmGFnrNp7tS0lngh4shAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbda9f5c8bcef1f901a40f4e6140924691d67b9ceb07ad53dbd91e15aa92276b","last_reissued_at":"2026-05-18T00:32:15.847907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:15.847907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08509","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:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6lS6+MkqRGsJArBsMXkch0RKJEVhxJsI8u4GAUzIvjOO/hxZXk0w4z+zTJOSTu4/y6Tk4e20TqIcnzAU3KyODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:56:40.601727Z"},"content_sha256":"8113bc474f6646bff7b81a5c7664f782c475abc97cccecf0293fb915f79a472b","schema_version":"1.0","event_id":"sha256:8113bc474f6646bff7b81a5c7664f782c475abc97cccecf0293fb915f79a472b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZPNJ6XELZ3Y7SANEB5HGCQESI2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two results about the hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Zsolt Wagner, Jozsef Balogh, Tamas Meszaros","submitted_at":"2017-10-23T21:20:09Z","abstract_excerpt":"First we consider families in the hypercube $Q_n$ with bounded VC dimension. Frankl raised the problem of estimating the number $m(n,k)$ of maximal families of VC dimension $k$. Alon, Moran and Yehudayoff showed that $$n^{(1+o(1))\\frac{1}{k+1}\\binom{n}{k}}\\leq m(n,k)\\leq n^{(1+o(1))\\binom{n}{k}}.$$ We close the gap by showing that $\\log \\left(m(n,k)\\right)= {(1+o(1))\\binom{n}{k}}\\log n$ and show how a tight asymptotic for the logarithm of the number of induced matchings between two adjacent small layers of $Q_n$ follows as a corollary.\n  Next, we consider the integrity $I(Q_n)$ of the hypercub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08509","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:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DLNoXMnMg/vhvN1ceY3WKm7p+yEfYskYkamfaVHYkvu4GJ/oGhg2gMRslWxjezsTrEvd1NA3QodMRbcqRqXPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:56:40.602079Z"},"content_sha256":"e9d3f138b032661d3af80030fc07abdc9618baf9dead9eda8172b42a24473902","schema_version":"1.0","event_id":"sha256:e9d3f138b032661d3af80030fc07abdc9618baf9dead9eda8172b42a24473902"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZPNJ6XELZ3Y7SANEB5HGCQESI2/bundle.json","state_url":"https://pith.science/pith/ZPNJ6XELZ3Y7SANEB5HGCQESI2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZPNJ6XELZ3Y7SANEB5HGCQESI2/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-09T09:56:40Z","links":{"resolver":"https://pith.science/pith/ZPNJ6XELZ3Y7SANEB5HGCQESI2","bundle":"https://pith.science/pith/ZPNJ6XELZ3Y7SANEB5HGCQESI2/bundle.json","state":"https://pith.science/pith/ZPNJ6XELZ3Y7SANEB5HGCQESI2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZPNJ6XELZ3Y7SANEB5HGCQESI2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZPNJ6XELZ3Y7SANEB5HGCQESI2","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":"8e03090bfaf8cb28912a478e6393e7922e451569ff76df0401c4dbc63c2837e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T21:20:09Z","title_canon_sha256":"46565641fccce0bacb7bf4694250313a3328690fb5fa1ced60a8278a7563f92e"},"schema_version":"1.0","source":{"id":"1710.08509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08509","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08509v1","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08509","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"ZPNJ6XELZ3Y7","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZPNJ6XELZ3Y7SANE","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZPNJ6XEL","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:e9d3f138b032661d3af80030fc07abdc9618baf9dead9eda8172b42a24473902","target":"graph","created_at":"2026-05-18T00:32:15Z","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":"First we consider families in the hypercube $Q_n$ with bounded VC dimension. Frankl raised the problem of estimating the number $m(n,k)$ of maximal families of VC dimension $k$. Alon, Moran and Yehudayoff showed that $$n^{(1+o(1))\\frac{1}{k+1}\\binom{n}{k}}\\leq m(n,k)\\leq n^{(1+o(1))\\binom{n}{k}}.$$ We close the gap by showing that $\\log \\left(m(n,k)\\right)= {(1+o(1))\\binom{n}{k}}\\log n$ and show how a tight asymptotic for the logarithm of the number of induced matchings between two adjacent small layers of $Q_n$ follows as a corollary.\n  Next, we consider the integrity $I(Q_n)$ of the hypercub","authors_text":"Adam Zsolt Wagner, Jozsef Balogh, Tamas Meszaros","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T21:20:09Z","title":"Two results about the hypercube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08509","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:8113bc474f6646bff7b81a5c7664f782c475abc97cccecf0293fb915f79a472b","target":"record","created_at":"2026-05-18T00:32:15Z","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":"8e03090bfaf8cb28912a478e6393e7922e451569ff76df0401c4dbc63c2837e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T21:20:09Z","title_canon_sha256":"46565641fccce0bacb7bf4694250313a3328690fb5fa1ced60a8278a7563f92e"},"schema_version":"1.0","source":{"id":"1710.08509","kind":"arxiv","version":1}},"canonical_sha256":"cbda9f5c8bcef1f901a40f4e6140924691d67b9ceb07ad53dbd91e15aa92276b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbda9f5c8bcef1f901a40f4e6140924691d67b9ceb07ad53dbd91e15aa92276b","first_computed_at":"2026-05-18T00:32:15.847907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:15.847907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WJtttDz2rN2yMbYUeyuzPmP/YhHSMb+4Tio6g8VnzSZQRXwhgzMBnlr4QvNOxv31bjmGFnrNp7tS0lngh4shAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:15.848524Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8113bc474f6646bff7b81a5c7664f782c475abc97cccecf0293fb915f79a472b","sha256:e9d3f138b032661d3af80030fc07abdc9618baf9dead9eda8172b42a24473902"],"state_sha256":"1443b56eb2895cf9886c3890b1f75d8ed292e9d04577c106d19c9ab08649bfac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3grSDEvBh1Ql8URlNSyFx2nbwF5AW1x6COwkT8F1oCJ7BAdnyaakLQ4v5x4HmhtzO/VJ1bMF1qE06ErV5JWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:56:40.604079Z","bundle_sha256":"fa31552f8f8673fe2bbaf152a4d12160ec6a0a26d40a7df838d70f7e11f9f142"}}