{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YW4V7JMGSA7OHSRTHBD5S2WHHB","short_pith_number":"pith:YW4V7JMG","schema_version":"1.0","canonical_sha256":"c5b95fa586903ee3ca333847d96ac73866a902330d0dde9215642d061e6012de","source":{"kind":"arxiv","id":"1611.07258","version":2},"attestation_state":"computed","paper":{"title":"Uniform s-cross-intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Peter Frankl","submitted_at":"2016-11-22T11:41:00Z","abstract_excerpt":"In this paper we study a question related to the classical Erd\\H{o}s-Ko-Rado theorem, which states that any family of $k$-element subsets of the set $[n] = \\{1,\\ldots,n\\}$ in which any two sets intersect, has cardinality at most ${n-1\\choose k-1}$.\n  We say that two non-empty families are $\\mathcal A, \\mathcal B\\subset {[n]\\choose k}$ are {\\it $s$-cross-intersecting}, if for any $A\\in\\mathcal A,B\\in \\mathcal B$ we have $|A\\cap B|\\ge s$. In this paper we determine the maximum of $|\\mathcal A|+|\\mathcal B|$ for all $n$. This generalizes a result of Hilton and Milner, who determined the maximum o"},"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":"1611.07258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-22T11:41:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"43b7055a4a1ec54b0288cd72c3f406bf2add44697a9824eef0bd00f374c2fec9","abstract_canon_sha256":"51a6a2ce2897612cee9d5097657e6203d1467d740caef2c8dab88b385fccf4fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:21.115529Z","signature_b64":"s5jqRPfdXJhIzCdNYYa6jK7FC2/HMtN6lB1KEQ/Vaa6sMFWodWtXJCXAh05oa4TAAQYbjSpn1JsTLiFP3XGuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5b95fa586903ee3ca333847d96ac73866a902330d0dde9215642d061e6012de","last_reissued_at":"2026-05-18T00:29:21.114879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:21.114879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniform s-cross-intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Peter Frankl","submitted_at":"2016-11-22T11:41:00Z","abstract_excerpt":"In this paper we study a question related to the classical Erd\\H{o}s-Ko-Rado theorem, which states that any family of $k$-element subsets of the set $[n] = \\{1,\\ldots,n\\}$ in which any two sets intersect, has cardinality at most ${n-1\\choose k-1}$.\n  We say that two non-empty families are $\\mathcal A, \\mathcal B\\subset {[n]\\choose k}$ are {\\it $s$-cross-intersecting}, if for any $A\\in\\mathcal A,B\\in \\mathcal B$ we have $|A\\cap B|\\ge s$. In this paper we determine the maximum of $|\\mathcal A|+|\\mathcal B|$ for all $n$. This generalizes a result of Hilton and Milner, who determined the maximum o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07258","kind":"arxiv","version":2},"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":"1611.07258","created_at":"2026-05-18T00:29:21.114965+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07258v2","created_at":"2026-05-18T00:29:21.114965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07258","created_at":"2026-05-18T00:29:21.114965+00:00"},{"alias_kind":"pith_short_12","alias_value":"YW4V7JMGSA7O","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YW4V7JMGSA7OHSRT","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YW4V7JMG","created_at":"2026-05-18T12:30:53.716459+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/YW4V7JMGSA7OHSRTHBD5S2WHHB","json":"https://pith.science/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB.json","graph_json":"https://pith.science/api/pith-number/YW4V7JMGSA7OHSRTHBD5S2WHHB/graph.json","events_json":"https://pith.science/api/pith-number/YW4V7JMGSA7OHSRTHBD5S2WHHB/events.json","paper":"https://pith.science/paper/YW4V7JMG"},"agent_actions":{"view_html":"https://pith.science/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB","download_json":"https://pith.science/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB.json","view_paper":"https://pith.science/paper/YW4V7JMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07258&json=true","fetch_graph":"https://pith.science/api/pith-number/YW4V7JMGSA7OHSRTHBD5S2WHHB/graph.json","fetch_events":"https://pith.science/api/pith-number/YW4V7JMGSA7OHSRTHBD5S2WHHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB/action/storage_attestation","attest_author":"https://pith.science/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB/action/author_attestation","sign_citation":"https://pith.science/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB/action/citation_signature","submit_replication":"https://pith.science/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB/action/replication_record"}},"created_at":"2026-05-18T00:29:21.114965+00:00","updated_at":"2026-05-18T00:29:21.114965+00:00"}