{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XYCIJTBTDNFVS7ZOB54QH3ZTGF","short_pith_number":"pith:XYCIJTBT","schema_version":"1.0","canonical_sha256":"be0484cc331b4b597f2e0f7903ef33316709ce6c19d74b7dcf07637a21b6363a","source":{"kind":"arxiv","id":"1104.5007","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.5007","created_at":"2026-05-18T03:35:38.846340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.5007v3","created_at":"2026-05-18T03:35:38.846340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5007","created_at":"2026-05-18T03:35:38.846340+00:00"},{"alias_kind":"pith_short_12","alias_value":"XYCIJTBTDNFV","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"XYCIJTBTDNFVS7ZO","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"XYCIJTBT","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF","json":"https://pith.science/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF.json","graph_json":"https://pith.science/api/pith-number/XYCIJTBTDNFVS7ZOB54QH3ZTGF/graph.json","events_json":"https://pith.science/api/pith-number/XYCIJTBTDNFVS7ZOB54QH3ZTGF/events.json","paper":"https://pith.science/paper/XYCIJTBT"},"agent_actions":{"view_html":"https://pith.science/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF","download_json":"https://pith.science/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF.json","view_paper":"https://pith.science/paper/XYCIJTBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.5007&json=true","fetch_graph":"https://pith.science/api/pith-number/XYCIJTBTDNFVS7ZOB54QH3ZTGF/graph.json","fetch_events":"https://pith.science/api/pith-number/XYCIJTBTDNFVS7ZOB54QH3ZTGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF/action/storage_attestation","attest_author":"https://pith.science/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF/action/author_attestation","sign_citation":"https://pith.science/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF/action/citation_signature","submit_replication":"https://pith.science/pith/XYCIJTBTDNFVS7ZOB54QH3ZTGF/action/replication_record"}},"created_at":"2026-05-18T03:35:38.846340+00:00","updated_at":"2026-05-18T03:35:38.846340+00:00"}