{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XYCIJTBTDNFVS7ZOB54QH3ZTGF","short_pith_number":"pith:XYCIJTBT","canonical_record":{"source":{"id":"1104.5007","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-26T19:55:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6cc80d1651f2d59e179260f883d963cff5eb0e560db6c0eaf26a71c545119450","abstract_canon_sha256":"5e84d5549269b6bb481d7147bfe6709d5a9969e24a942b6ac82ca7cbc85fb4da"},"schema_version":"1.0"},"canonical_sha256":"be0484cc331b4b597f2e0f7903ef33316709ce6c19d74b7dcf07637a21b6363a","source":{"kind":"arxiv","id":"1104.5007","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5007","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5007v3","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5007","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"XYCIJTBTDNFV","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XYCIJTBTDNFVS7ZO","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XYCIJTBT","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XYCIJTBTDNFVS7ZOB54QH3ZTGF","target":"record","payload":{"canonical_record":{"source":{"id":"1104.5007","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-26T19:55:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6cc80d1651f2d59e179260f883d963cff5eb0e560db6c0eaf26a71c545119450","abstract_canon_sha256":"5e84d5549269b6bb481d7147bfe6709d5a9969e24a942b6ac82ca7cbc85fb4da"},"schema_version":"1.0"},"canonical_sha256":"be0484cc331b4b597f2e0f7903ef33316709ce6c19d74b7dcf07637a21b6363a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:38.847050Z","signature_b64":"QXJ7CHeevXNHZO2Xfuxsb6sEp9VkAinZpuRwbF1O7XN/PfHyyB9lx++3NzrGujqgmsT3ujom1OQxSXGD821NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be0484cc331b4b597f2e0f7903ef33316709ce6c19d74b7dcf07637a21b6363a","last_reissued_at":"2026-05-18T03:35:38.845831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:38.845831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.5007","source_version":3,"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-18T03:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLJ6ynlJ+Rko4HR/i7tndnhPKiLnCzM3Q0acfye88RrBM0GrrzpQdA7Cy0fOZ8nP7P9Bi9dQFwOjAMhAB5A/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:59:49.496971Z"},"content_sha256":"094ab84585d116a996f3c7beb40ce19e5c3973eb5f6d7becb81a2dac94594f2b","schema_version":"1.0","event_id":"sha256:094ab84585d116a996f3c7beb40ce19e5c3973eb5f6d7becb81a2dac94594f2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XYCIJTBTDNFVS7ZOB54QH3ZTGF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight bounds on the maximum size of a set of permutations with bounded VC-dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Kyncl, Josef Cibulka","submitted_at":"2011-04-26T19:55:51Z","abstract_excerpt":"The VC-dimension of a family P of n-permutations is the largest integer k such that the set of restrictions of the permutations in P on some k-tuple of positions is the set of all k! permutation patterns. Let r_k(n) be the maximum size of a set of n-permutations with VC-dimension k. Raz showed that r_2(n) grows exponentially in n. We show that r_3(n)=2^Theta(n log(alpha(n))) and for every s >= 4, we have almost tight upper and lower bounds of the form 2^{n poly(alpha(n))}. We also study the maximum number p_k(n) of 1-entries in an n x n (0,1)-matrix with no (k+1)-tuple of columns containing al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5007","kind":"arxiv","version":3},"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-18T03:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PRubg1LaIve3L4Eyr0e7JX9Spzw8zcD9swfeRWAVd8cRyb4/r/aojDei6+n3UnFtU/R9km+qeW8PtBVrc7RWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:59:49.497648Z"},"content_sha256":"e1a1aa821c5f2035ceb9b180d4df99a41fb4f951e6f30be6f73d4a56e1161e97","schema_version":"1.0","event_id":"sha256:e1a1aa821c5f2035ceb9b180d4df99a41fb4f951e6f30be6f73d4a56e1161e97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF/bundle.json","state_url":"https://pith.science/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF/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-11T14:59:49Z","links":{"resolver":"https://pith.science/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF","bundle":"https://pith.science/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF/bundle.json","state":"https://pith.science/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XYCIJTBTDNFVS7ZOB54QH3ZTGF","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":"5e84d5549269b6bb481d7147bfe6709d5a9969e24a942b6ac82ca7cbc85fb4da","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-26T19:55:51Z","title_canon_sha256":"6cc80d1651f2d59e179260f883d963cff5eb0e560db6c0eaf26a71c545119450"},"schema_version":"1.0","source":{"id":"1104.5007","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5007","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5007v3","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5007","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"XYCIJTBTDNFV","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XYCIJTBTDNFVS7ZO","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XYCIJTBT","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:e1a1aa821c5f2035ceb9b180d4df99a41fb4f951e6f30be6f73d4a56e1161e97","target":"graph","created_at":"2026-05-18T03:35:38Z","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 VC-dimension of a family P of n-permutations is the largest integer k such that the set of restrictions of the permutations in P on some k-tuple of positions is the set of all k! permutation patterns. Let r_k(n) be the maximum size of a set of n-permutations with VC-dimension k. Raz showed that r_2(n) grows exponentially in n. We show that r_3(n)=2^Theta(n log(alpha(n))) and for every s >= 4, we have almost tight upper and lower bounds of the form 2^{n poly(alpha(n))}. We also study the maximum number p_k(n) of 1-entries in an n x n (0,1)-matrix with no (k+1)-tuple of columns containing al","authors_text":"Jan Kyncl, Josef Cibulka","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-26T19:55:51Z","title":"Tight bounds on the maximum size of a set of permutations with bounded VC-dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5007","kind":"arxiv","version":3},"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:094ab84585d116a996f3c7beb40ce19e5c3973eb5f6d7becb81a2dac94594f2b","target":"record","created_at":"2026-05-18T03:35:38Z","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":"5e84d5549269b6bb481d7147bfe6709d5a9969e24a942b6ac82ca7cbc85fb4da","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-26T19:55:51Z","title_canon_sha256":"6cc80d1651f2d59e179260f883d963cff5eb0e560db6c0eaf26a71c545119450"},"schema_version":"1.0","source":{"id":"1104.5007","kind":"arxiv","version":3}},"canonical_sha256":"be0484cc331b4b597f2e0f7903ef33316709ce6c19d74b7dcf07637a21b6363a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be0484cc331b4b597f2e0f7903ef33316709ce6c19d74b7dcf07637a21b6363a","first_computed_at":"2026-05-18T03:35:38.845831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:38.845831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QXJ7CHeevXNHZO2Xfuxsb6sEp9VkAinZpuRwbF1O7XN/PfHyyB9lx++3NzrGujqgmsT3ujom1OQxSXGD821NBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:38.847050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.5007","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:094ab84585d116a996f3c7beb40ce19e5c3973eb5f6d7becb81a2dac94594f2b","sha256:e1a1aa821c5f2035ceb9b180d4df99a41fb4f951e6f30be6f73d4a56e1161e97"],"state_sha256":"9170ba01232ab25ffe4eb0a31e91775d8a048e5b15c0b5de23cc3ee363690366"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kP11z50tocpUBBiZQNTp+Mvy/lwwpHsqRrmvcfy14PgIqwi5T75vIesjmDTKNgtfS5O9eWy3zTjGsURAk3/BDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:59:49.501472Z","bundle_sha256":"fccdd1e0ecefe356c93478bdad7502edd099839fc2fd381f58d10d8afbbfff65"}}