{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:63TZHPVO6FKOVMI4QTTQISZ36N","short_pith_number":"pith:63TZHPVO","schema_version":"1.0","canonical_sha256":"f6e793beaef154eab11c84e7044b3bf372a8be316b45f10545a0459a968d4270","source":{"kind":"arxiv","id":"1712.09942","version":6},"attestation_state":"computed","paper":{"title":"Intersecting non-uniform families containing subfamilies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Feghali","submitted_at":"2017-12-28T17:18:11Z","abstract_excerpt":"A family of sets is said to be intersecting if every pair of sets in the family have non-empty intersection. In this paper, we initiate the study of intersecting non-uniform families of sets of one of two sizes containing given subfamilies. For a set $X$ and integer $r$, let $\\binom{X}{r}$ denote the family $\\{A \\subseteq X: |X| = r\\}$. Let $a$, $b$, and $n$ be positive integers such that $a < b$. We determine the maximum size of an intersecting family in $\\binom{[n]}{a} \\cup \\binom{[2n]}{b}$ whenever $n > b$. For $n$ sufficiently large, we also determine the maximum size of an intersecting fa"},"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":"1712.09942","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-28T17:18:11Z","cross_cats_sorted":[],"title_canon_sha256":"a4631daf9169fdfd26b299926bc1eb2086cae8df3632c2f0fe71e5506a1d3d59","abstract_canon_sha256":"f0aad9a58b4c7199eac39584fab029f1d899bb23bed88c846ebb76e756c780a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:51.850485Z","signature_b64":"uoxshMWekLrajzM5j+AUVmDT9B3lwC2A+M3o8rvdjieUbKaOvapxVXP/GZeArKktC4OIAFjn+b2CIyQunJm/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6e793beaef154eab11c84e7044b3bf372a8be316b45f10545a0459a968d4270","last_reissued_at":"2026-05-17T23:53:51.849795Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:51.849795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intersecting non-uniform families containing subfamilies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Feghali","submitted_at":"2017-12-28T17:18:11Z","abstract_excerpt":"A family of sets is said to be intersecting if every pair of sets in the family have non-empty intersection. In this paper, we initiate the study of intersecting non-uniform families of sets of one of two sizes containing given subfamilies. For a set $X$ and integer $r$, let $\\binom{X}{r}$ denote the family $\\{A \\subseteq X: |X| = r\\}$. Let $a$, $b$, and $n$ be positive integers such that $a < b$. We determine the maximum size of an intersecting family in $\\binom{[n]}{a} \\cup \\binom{[2n]}{b}$ whenever $n > b$. For $n$ sufficiently large, we also determine the maximum size of an intersecting fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09942","kind":"arxiv","version":6},"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":"1712.09942","created_at":"2026-05-17T23:53:51.849916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09942v6","created_at":"2026-05-17T23:53:51.849916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09942","created_at":"2026-05-17T23:53:51.849916+00:00"},{"alias_kind":"pith_short_12","alias_value":"63TZHPVO6FKO","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"63TZHPVO6FKOVMI4","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"63TZHPVO","created_at":"2026-05-18T12:31:03.183658+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/63TZHPVO6FKOVMI4QTTQISZ36N","json":"https://pith.science/pith/63TZHPVO6FKOVMI4QTTQISZ36N.json","graph_json":"https://pith.science/api/pith-number/63TZHPVO6FKOVMI4QTTQISZ36N/graph.json","events_json":"https://pith.science/api/pith-number/63TZHPVO6FKOVMI4QTTQISZ36N/events.json","paper":"https://pith.science/paper/63TZHPVO"},"agent_actions":{"view_html":"https://pith.science/pith/63TZHPVO6FKOVMI4QTTQISZ36N","download_json":"https://pith.science/pith/63TZHPVO6FKOVMI4QTTQISZ36N.json","view_paper":"https://pith.science/paper/63TZHPVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09942&json=true","fetch_graph":"https://pith.science/api/pith-number/63TZHPVO6FKOVMI4QTTQISZ36N/graph.json","fetch_events":"https://pith.science/api/pith-number/63TZHPVO6FKOVMI4QTTQISZ36N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63TZHPVO6FKOVMI4QTTQISZ36N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63TZHPVO6FKOVMI4QTTQISZ36N/action/storage_attestation","attest_author":"https://pith.science/pith/63TZHPVO6FKOVMI4QTTQISZ36N/action/author_attestation","sign_citation":"https://pith.science/pith/63TZHPVO6FKOVMI4QTTQISZ36N/action/citation_signature","submit_replication":"https://pith.science/pith/63TZHPVO6FKOVMI4QTTQISZ36N/action/replication_record"}},"created_at":"2026-05-17T23:53:51.849916+00:00","updated_at":"2026-05-17T23:53:51.849916+00:00"}