{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:U4QHPK3P4OPTN2IOY5U3TU3IZA","short_pith_number":"pith:U4QHPK3P","schema_version":"1.0","canonical_sha256":"a72077ab6fe39f36e90ec769b9d368c8068cc16316295d9658105c9df1eaee70","source":{"kind":"arxiv","id":"2508.14334","version":1},"attestation_state":"computed","paper":{"title":"Maxmum Size of a Uniform Family with Bounded VC-dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tianchi Yang, Xingxing Yu","submitted_at":"2025-08-20T01:15:44Z","abstract_excerpt":"In 1984, Frankl and Pach proved that, for positive integers $n$ and $d$, the maximum size of a $(d+1)$-uniform set family $\\mathcal{F}$ on an $n$-element set with VC-dimension at most $d$ is at most ${n\\choose d}$; and they suspected that ${n\\choose d}$ could be replaced by ${n-1\\choose d}$, which would generalize the famous Erd\\H{o}s-Ko-Rado theorem and was mentioned by Erd\\H{o}s as Frankl--Pach conjecture. However, Ahlswede and Khachatrian in 1997 constructed $(d+1)$-uniform families on an $n$-element set with VC-dimension at most $d$ and size exactly $\\binom{n-1}{d}+\\binom{n-4}{d-2}$, and M"},"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":"2508.14334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-08-20T01:15:44Z","cross_cats_sorted":[],"title_canon_sha256":"55785a7fe567dfe6626daec1d894fd70b7c8aee11c44f3a2cf15ceed29c86aa4","abstract_canon_sha256":"c5831b7d852f1847dd1a9c1460791f556383cdeaaea93fdbb613ec300ed1b2af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:30.009694Z","signature_b64":"+LNDAd6yjngw+8VcRrSPQe6S1GxlTOUPWEG5aLlEFlTKsg/L60+B5PZ0mIaLv32VQhM8obM7j7N3lQv9avgADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a72077ab6fe39f36e90ec769b9d368c8068cc16316295d9658105c9df1eaee70","last_reissued_at":"2026-07-05T11:56:30.009256Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:30.009256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maxmum Size of a Uniform Family with Bounded VC-dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tianchi Yang, Xingxing Yu","submitted_at":"2025-08-20T01:15:44Z","abstract_excerpt":"In 1984, Frankl and Pach proved that, for positive integers $n$ and $d$, the maximum size of a $(d+1)$-uniform set family $\\mathcal{F}$ on an $n$-element set with VC-dimension at most $d$ is at most ${n\\choose d}$; and they suspected that ${n\\choose d}$ could be replaced by ${n-1\\choose d}$, which would generalize the famous Erd\\H{o}s-Ko-Rado theorem and was mentioned by Erd\\H{o}s as Frankl--Pach conjecture. However, Ahlswede and Khachatrian in 1997 constructed $(d+1)$-uniform families on an $n$-element set with VC-dimension at most $d$ and size exactly $\\binom{n-1}{d}+\\binom{n-4}{d-2}$, and M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.14334","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.14334/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2508.14334","created_at":"2026-07-05T11:56:30.009311+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.14334v1","created_at":"2026-07-05T11:56:30.009311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14334","created_at":"2026-07-05T11:56:30.009311+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4QHPK3P4OPT","created_at":"2026-07-05T11:56:30.009311+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4QHPK3P4OPTN2IO","created_at":"2026-07-05T11:56:30.009311+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4QHPK3P","created_at":"2026-07-05T11:56:30.009311+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24776","citing_title":"A disproof of the uniform witness conjecture","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2606.23469","citing_title":"Beating the Ahlswede--Khachatrian bound for the Erd\\H{o}s--Frankl--Pach problem","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U4QHPK3P4OPTN2IOY5U3TU3IZA","json":"https://pith.science/pith/U4QHPK3P4OPTN2IOY5U3TU3IZA.json","graph_json":"https://pith.science/api/pith-number/U4QHPK3P4OPTN2IOY5U3TU3IZA/graph.json","events_json":"https://pith.science/api/pith-number/U4QHPK3P4OPTN2IOY5U3TU3IZA/events.json","paper":"https://pith.science/paper/U4QHPK3P"},"agent_actions":{"view_html":"https://pith.science/pith/U4QHPK3P4OPTN2IOY5U3TU3IZA","download_json":"https://pith.science/pith/U4QHPK3P4OPTN2IOY5U3TU3IZA.json","view_paper":"https://pith.science/paper/U4QHPK3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.14334&json=true","fetch_graph":"https://pith.science/api/pith-number/U4QHPK3P4OPTN2IOY5U3TU3IZA/graph.json","fetch_events":"https://pith.science/api/pith-number/U4QHPK3P4OPTN2IOY5U3TU3IZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4QHPK3P4OPTN2IOY5U3TU3IZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4QHPK3P4OPTN2IOY5U3TU3IZA/action/storage_attestation","attest_author":"https://pith.science/pith/U4QHPK3P4OPTN2IOY5U3TU3IZA/action/author_attestation","sign_citation":"https://pith.science/pith/U4QHPK3P4OPTN2IOY5U3TU3IZA/action/citation_signature","submit_replication":"https://pith.science/pith/U4QHPK3P4OPTN2IOY5U3TU3IZA/action/replication_record"}},"created_at":"2026-07-05T11:56:30.009311+00:00","updated_at":"2026-07-05T11:56:30.009311+00:00"}