{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:63TZHPVO6FKOVMI4QTTQISZ36N","short_pith_number":"pith:63TZHPVO","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"},"canonical_sha256":"f6e793beaef154eab11c84e7044b3bf372a8be316b45f10545a0459a968d4270","source":{"kind":"arxiv","id":"1712.09942","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09942","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09942v6","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09942","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"63TZHPVO6FKO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"63TZHPVO6FKOVMI4","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"63TZHPVO","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:63TZHPVO6FKOVMI4QTTQISZ36N","target":"record","payload":{"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"},"canonical_sha256":"f6e793beaef154eab11c84e7044b3bf372a8be316b45f10545a0459a968d4270","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"},"source_kind":"arxiv","source_id":"1712.09942","source_version":6,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"53xKIa68o1nLkrzKxt6RAQWlJuwfj/8Paz9mNCd4CXpD6HvCRd9l+7fTQ35ZMEuvd/YJjRg3pvcXG8pwkqqhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:21:27.858959Z"},"content_sha256":"d6ff73e4af0d2d179089cd142c9ffce967c0b91c4c0f1169a9c9820051738b5a","schema_version":"1.0","event_id":"sha256:d6ff73e4af0d2d179089cd142c9ffce967c0b91c4c0f1169a9c9820051738b5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:63TZHPVO6FKOVMI4QTTQISZ36N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HhxgY8BlqoQP/Zr58Yatz+ThNl0jgWkbNt4g9dNy4S32bHimhaDZpHPxEopT80YSbJspTErVX0Gok7os03O3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:21:27.859334Z"},"content_sha256":"20be4ad94f4e888c40fb51dc1873f8a2fc590d803828125c1195980c9046dee5","schema_version":"1.0","event_id":"sha256:20be4ad94f4e888c40fb51dc1873f8a2fc590d803828125c1195980c9046dee5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63TZHPVO6FKOVMI4QTTQISZ36N/bundle.json","state_url":"https://pith.science/pith/63TZHPVO6FKOVMI4QTTQISZ36N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63TZHPVO6FKOVMI4QTTQISZ36N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T22:21:27Z","links":{"resolver":"https://pith.science/pith/63TZHPVO6FKOVMI4QTTQISZ36N","bundle":"https://pith.science/pith/63TZHPVO6FKOVMI4QTTQISZ36N/bundle.json","state":"https://pith.science/pith/63TZHPVO6FKOVMI4QTTQISZ36N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63TZHPVO6FKOVMI4QTTQISZ36N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:63TZHPVO6FKOVMI4QTTQISZ36N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f0aad9a58b4c7199eac39584fab029f1d899bb23bed88c846ebb76e756c780a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-28T17:18:11Z","title_canon_sha256":"a4631daf9169fdfd26b299926bc1eb2086cae8df3632c2f0fe71e5506a1d3d59"},"schema_version":"1.0","source":{"id":"1712.09942","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09942","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09942v6","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09942","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"63TZHPVO6FKO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"63TZHPVO6FKOVMI4","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"63TZHPVO","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:20be4ad94f4e888c40fb51dc1873f8a2fc590d803828125c1195980c9046dee5","target":"graph","created_at":"2026-05-17T23:53:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Carl Feghali","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-28T17:18:11Z","title":"Intersecting non-uniform families containing subfamilies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09942","kind":"arxiv","version":6},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d6ff73e4af0d2d179089cd142c9ffce967c0b91c4c0f1169a9c9820051738b5a","target":"record","created_at":"2026-05-17T23:53:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f0aad9a58b4c7199eac39584fab029f1d899bb23bed88c846ebb76e756c780a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-28T17:18:11Z","title_canon_sha256":"a4631daf9169fdfd26b299926bc1eb2086cae8df3632c2f0fe71e5506a1d3d59"},"schema_version":"1.0","source":{"id":"1712.09942","kind":"arxiv","version":6}},"canonical_sha256":"f6e793beaef154eab11c84e7044b3bf372a8be316b45f10545a0459a968d4270","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6e793beaef154eab11c84e7044b3bf372a8be316b45f10545a0459a968d4270","first_computed_at":"2026-05-17T23:53:51.849795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:51.849795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uoxshMWekLrajzM5j+AUVmDT9B3lwC2A+M3o8rvdjieUbKaOvapxVXP/GZeArKktC4OIAFjn+b2CIyQunJm/BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:51.850485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09942","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6ff73e4af0d2d179089cd142c9ffce967c0b91c4c0f1169a9c9820051738b5a","sha256:20be4ad94f4e888c40fb51dc1873f8a2fc590d803828125c1195980c9046dee5"],"state_sha256":"aae4161c2509a92fd26a73e75162d474898d1eab9c130668725d49e985095e5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YYMDGEHgFSbHBp5Cyva2YivjEr9M4jRS5yoZLMNQFtBPTDjipID0TPdglJAKrm6SxLLpfFMPLELjaIo4xgneDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:21:27.862580Z","bundle_sha256":"c29113ecfca8dc3b3606c9b734b7bde1b10245efb917b096ffa0866ead7a4a26"}}