{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5EZHWNBJU3CK46NJJVI4N3LF35","short_pith_number":"pith:5EZHWNBJ","schema_version":"1.0","canonical_sha256":"e9327b3429a6c4ae79a94d51c6ed65df7adb2cf8d01d78ce85fa5432ba5d4514","source":{"kind":"arxiv","id":"2304.11089","version":1},"attestation_state":"computed","paper":{"title":"Improved bounds on the maximum diversity of intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Peter Frankl","submitted_at":"2023-04-20T15:07:37Z","abstract_excerpt":"A family $\\mathcal{F}\\subset \\binom{[n]}{k}$ is called an intersecting family if $F\\cap F'\\neq \\emptyset$ for all $F,F'\\in \\mathcal{F}$. If $\\cap \\mathcal{F}\\neq \\emptyset$ then $\\mathcal{F}$ is called a star. The diversity of an intersecting family $\\mathcal{F}$ is defined as the minimum number of $k$-sets in $\\mathcal{F}$, whose deletion results in a star. In the present paper, we prove that for $n>36k$ any intersecting family $\\mathcal{F}\\subset \\binom{[n]}{k}$ has diversity at most $\\binom{n-3}{k-2}$, which improves the previous best bound $n>72k$ due to the first author. This result is de"},"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":"2304.11089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-20T15:07:37Z","cross_cats_sorted":[],"title_canon_sha256":"b84adf6aa373bdb71936026768f63998802756a8ff8d65cf4510f0e23ee9c4fe","abstract_canon_sha256":"c374b2470b676820da9afcc8cb64cd1e109299a7f2dd658d77648977611355eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:03:18.982729Z","signature_b64":"IdbYmvEvJ/JsqsOgfH1jh06amkub7lLqQNbYdQsV5UJT5+PvWl8yBKJbLRe0+ZUdH/ig38IsSYV51bhIDj1uCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9327b3429a6c4ae79a94d51c6ed65df7adb2cf8d01d78ce85fa5432ba5d4514","last_reissued_at":"2026-07-05T06:03:18.982332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:03:18.982332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved bounds on the maximum diversity of intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Peter Frankl","submitted_at":"2023-04-20T15:07:37Z","abstract_excerpt":"A family $\\mathcal{F}\\subset \\binom{[n]}{k}$ is called an intersecting family if $F\\cap F'\\neq \\emptyset$ for all $F,F'\\in \\mathcal{F}$. If $\\cap \\mathcal{F}\\neq \\emptyset$ then $\\mathcal{F}$ is called a star. The diversity of an intersecting family $\\mathcal{F}$ is defined as the minimum number of $k$-sets in $\\mathcal{F}$, whose deletion results in a star. In the present paper, we prove that for $n>36k$ any intersecting family $\\mathcal{F}\\subset \\binom{[n]}{k}$ has diversity at most $\\binom{n-3}{k-2}$, which improves the previous best bound $n>72k$ due to the first author. This result is de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.11089","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/2304.11089/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":"2304.11089","created_at":"2026-07-05T06:03:18.982395+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.11089v1","created_at":"2026-07-05T06:03:18.982395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.11089","created_at":"2026-07-05T06:03:18.982395+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EZHWNBJU3CK","created_at":"2026-07-05T06:03:18.982395+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EZHWNBJU3CK46NJ","created_at":"2026-07-05T06:03:18.982395+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EZHWNBJ","created_at":"2026-07-05T06:03:18.982395+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05704","citing_title":"The overflow in the Katona Theorem","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5EZHWNBJU3CK46NJJVI4N3LF35","json":"https://pith.science/pith/5EZHWNBJU3CK46NJJVI4N3LF35.json","graph_json":"https://pith.science/api/pith-number/5EZHWNBJU3CK46NJJVI4N3LF35/graph.json","events_json":"https://pith.science/api/pith-number/5EZHWNBJU3CK46NJJVI4N3LF35/events.json","paper":"https://pith.science/paper/5EZHWNBJ"},"agent_actions":{"view_html":"https://pith.science/pith/5EZHWNBJU3CK46NJJVI4N3LF35","download_json":"https://pith.science/pith/5EZHWNBJU3CK46NJJVI4N3LF35.json","view_paper":"https://pith.science/paper/5EZHWNBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.11089&json=true","fetch_graph":"https://pith.science/api/pith-number/5EZHWNBJU3CK46NJJVI4N3LF35/graph.json","fetch_events":"https://pith.science/api/pith-number/5EZHWNBJU3CK46NJJVI4N3LF35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EZHWNBJU3CK46NJJVI4N3LF35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EZHWNBJU3CK46NJJVI4N3LF35/action/storage_attestation","attest_author":"https://pith.science/pith/5EZHWNBJU3CK46NJJVI4N3LF35/action/author_attestation","sign_citation":"https://pith.science/pith/5EZHWNBJU3CK46NJJVI4N3LF35/action/citation_signature","submit_replication":"https://pith.science/pith/5EZHWNBJU3CK46NJJVI4N3LF35/action/replication_record"}},"created_at":"2026-07-05T06:03:18.982395+00:00","updated_at":"2026-07-05T06:03:18.982395+00:00"}