{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DZAP55CEHZMXXP2YIJGSTV7ZAW","short_pith_number":"pith:DZAP55CE","canonical_record":{"source":{"id":"1701.04110","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-15T21:01:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"21cb88d8af1bbe1a2b229733487796107b2b5bc501e782845e816b44193b3508","abstract_canon_sha256":"d6c566d17728242afae57b6f63613d07de047a0d00ae5dfe67cd62c295622125"},"schema_version":"1.0"},"canonical_sha256":"1e40fef4443e597bbf58424d29d7f9058fb30a7796091724699107b56d23e6ef","source":{"kind":"arxiv","id":"1701.04110","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04110","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04110v2","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04110","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"DZAP55CEHZMX","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DZAP55CEHZMXXP2Y","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DZAP55CE","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DZAP55CEHZMXXP2YIJGSTV7ZAW","target":"record","payload":{"canonical_record":{"source":{"id":"1701.04110","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-15T21:01:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"21cb88d8af1bbe1a2b229733487796107b2b5bc501e782845e816b44193b3508","abstract_canon_sha256":"d6c566d17728242afae57b6f63613d07de047a0d00ae5dfe67cd62c295622125"},"schema_version":"1.0"},"canonical_sha256":"1e40fef4443e597bbf58424d29d7f9058fb30a7796091724699107b56d23e6ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:21.041245Z","signature_b64":"IpnM+zOha7PSnN1YG49sa0FPDn3N1FtYXb2x0aTWYfJEuAwYV8zL6vuGavaR9rq1z4QYEhQCTX30Hu/RfCmYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e40fef4443e597bbf58424d29d7f9058fb30a7796091724699107b56d23e6ef","last_reissued_at":"2026-05-18T00:29:21.040443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:21.040443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.04110","source_version":2,"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-18T00:29:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dIy559pGO4m4OsWeBM0Jau0ClO2SovY3FLuILaXOkvgM15C2yxdkXvZonQ8in6W7bwzH8NtMEXc9raETn+SsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:08:43.215256Z"},"content_sha256":"6c7cff2eda9b9594ee68027a2373620120116a2cda801e6fd6a3015e60b58dc3","schema_version":"1.0","event_id":"sha256:6c7cff2eda9b9594ee68027a2373620120116a2cda801e6fd6a3015e60b58dc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DZAP55CEHZMXXP2YIJGSTV7ZAW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting intersecting and pairs of 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":"2017-01-15T21:01:55Z","abstract_excerpt":"A family of subsets of $\\{1,\\ldots,n\\}$ is called {\\it intersecting} if any two of its sets intersect. A classical result in extremal combinatorics due to Erd\\H{o}s, Ko, and Rado determines the maximum size of an intersecting family of $k$-subsets of $\\{1,\\ldots, n\\}$. In this paper we study the following problem: how many intersecting families of $k$-subsets of $\\{1,\\ldots, n\\}$ are there? Improving a result of Balogh, Das, Delcourt, Liu, and Sharifzadeh, we determine this quantity asymptotically for $n\\ge 2k+2+2\\sqrt{k\\log k}$ and $k\\to \\infty$. Moreover, under the same assumptions we also d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04110","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"},"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-18T00:29:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJKcoD7XvovTXbysbc/EUyoB7TtcPglTwP0Y2MLHSvIcKfMEqnnBkJNgNeuBKmdz/1yrtvf1PzGu4a7QD3+dDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:08:43.215613Z"},"content_sha256":"9e1d9c19308f8483edc23c070dd42ee300d9e7b9e510fd61abd492da42d519a9","schema_version":"1.0","event_id":"sha256:9e1d9c19308f8483edc23c070dd42ee300d9e7b9e510fd61abd492da42d519a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DZAP55CEHZMXXP2YIJGSTV7ZAW/bundle.json","state_url":"https://pith.science/pith/DZAP55CEHZMXXP2YIJGSTV7ZAW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DZAP55CEHZMXXP2YIJGSTV7ZAW/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-19T07:08:43Z","links":{"resolver":"https://pith.science/pith/DZAP55CEHZMXXP2YIJGSTV7ZAW","bundle":"https://pith.science/pith/DZAP55CEHZMXXP2YIJGSTV7ZAW/bundle.json","state":"https://pith.science/pith/DZAP55CEHZMXXP2YIJGSTV7ZAW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DZAP55CEHZMXXP2YIJGSTV7ZAW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DZAP55CEHZMXXP2YIJGSTV7ZAW","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":"d6c566d17728242afae57b6f63613d07de047a0d00ae5dfe67cd62c295622125","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-15T21:01:55Z","title_canon_sha256":"21cb88d8af1bbe1a2b229733487796107b2b5bc501e782845e816b44193b3508"},"schema_version":"1.0","source":{"id":"1701.04110","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04110","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04110v2","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04110","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"DZAP55CEHZMX","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DZAP55CEHZMXXP2Y","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DZAP55CE","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:9e1d9c19308f8483edc23c070dd42ee300d9e7b9e510fd61abd492da42d519a9","target":"graph","created_at":"2026-05-18T00:29:21Z","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 subsets of $\\{1,\\ldots,n\\}$ is called {\\it intersecting} if any two of its sets intersect. A classical result in extremal combinatorics due to Erd\\H{o}s, Ko, and Rado determines the maximum size of an intersecting family of $k$-subsets of $\\{1,\\ldots, n\\}$. In this paper we study the following problem: how many intersecting families of $k$-subsets of $\\{1,\\ldots, n\\}$ are there? Improving a result of Balogh, Das, Delcourt, Liu, and Sharifzadeh, we determine this quantity asymptotically for $n\\ge 2k+2+2\\sqrt{k\\log k}$ and $k\\to \\infty$. Moreover, under the same assumptions we also d","authors_text":"Andrey Kupavskii, Peter Frankl","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-15T21:01:55Z","title":"Counting intersecting and pairs of cross-intersecting families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04110","kind":"arxiv","version":2},"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:6c7cff2eda9b9594ee68027a2373620120116a2cda801e6fd6a3015e60b58dc3","target":"record","created_at":"2026-05-18T00:29:21Z","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":"d6c566d17728242afae57b6f63613d07de047a0d00ae5dfe67cd62c295622125","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-15T21:01:55Z","title_canon_sha256":"21cb88d8af1bbe1a2b229733487796107b2b5bc501e782845e816b44193b3508"},"schema_version":"1.0","source":{"id":"1701.04110","kind":"arxiv","version":2}},"canonical_sha256":"1e40fef4443e597bbf58424d29d7f9058fb30a7796091724699107b56d23e6ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e40fef4443e597bbf58424d29d7f9058fb30a7796091724699107b56d23e6ef","first_computed_at":"2026-05-18T00:29:21.040443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:21.040443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IpnM+zOha7PSnN1YG49sa0FPDn3N1FtYXb2x0aTWYfJEuAwYV8zL6vuGavaR9rq1z4QYEhQCTX30Hu/RfCmYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:21.041245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04110","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c7cff2eda9b9594ee68027a2373620120116a2cda801e6fd6a3015e60b58dc3","sha256:9e1d9c19308f8483edc23c070dd42ee300d9e7b9e510fd61abd492da42d519a9"],"state_sha256":"c1a3335ccd4ea8c745befb3e92007a55163fcb9309dd0c0bbbb8fba98163cd20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H1JrKvn6kZAow9N7CFIISBtjRlfdAXvC+U8RU70DsjYpW9e0m4RyyNSidXVoQmzJQrGgxNbvJ1YLLvzUolZDAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T07:08:43.217253Z","bundle_sha256":"e1a62eda804e80aefd8215c68f48876e18efbcaf39d633018a049b71727c9c7e"}}