{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YW4V7JMGSA7OHSRTHBD5S2WHHB","short_pith_number":"pith:YW4V7JMG","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"},"canonical_sha256":"c5b95fa586903ee3ca333847d96ac73866a902330d0dde9215642d061e6012de","source":{"kind":"arxiv","id":"1611.07258","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07258","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07258v2","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07258","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"YW4V7JMGSA7O","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YW4V7JMGSA7OHSRT","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YW4V7JMG","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YW4V7JMGSA7OHSRTHBD5S2WHHB","target":"record","payload":{"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"},"canonical_sha256":"c5b95fa586903ee3ca333847d96ac73866a902330d0dde9215642d061e6012de","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"},"source_kind":"arxiv","source_id":"1611.07258","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":"oAOoFnnde6Iz6QSwq9P8bwbyMZxw+78wcrHtTmCKxKuE2UdTt4rGdjKiyyDlxcOp0VALmYEtmtPZz5fte1VKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T16:56:14.057497Z"},"content_sha256":"fce0d61dcaf99dad9c93b9f41a00d1615dc18365d7203da3f7681250a1d55dd4","schema_version":"1.0","event_id":"sha256:fce0d61dcaf99dad9c93b9f41a00d1615dc18365d7203da3f7681250a1d55dd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YW4V7JMGSA7OHSRTHBD5S2WHHB","target":"graph","payload":{"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"},"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":"O7WGbA6U+qIHAgvdxmDNhNqgxaNTBzBIf41wnQOMQPySvhjDXBLH32zZ1/n3NSJxb33qx3jKxvA+BLvJxrjvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T16:56:14.058214Z"},"content_sha256":"8e98cfff43051ee4ab9e782ef1ecb1a271ea026d228cc6a5c92d41589923e5d9","schema_version":"1.0","event_id":"sha256:8e98cfff43051ee4ab9e782ef1ecb1a271ea026d228cc6a5c92d41589923e5d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB/bundle.json","state_url":"https://pith.science/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB/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-18T16:56:14Z","links":{"resolver":"https://pith.science/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB","bundle":"https://pith.science/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB/bundle.json","state":"https://pith.science/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YW4V7JMGSA7OHSRTHBD5S2WHHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YW4V7JMGSA7OHSRTHBD5S2WHHB","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":"51a6a2ce2897612cee9d5097657e6203d1467d740caef2c8dab88b385fccf4fb","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-22T11:41:00Z","title_canon_sha256":"43b7055a4a1ec54b0288cd72c3f406bf2add44697a9824eef0bd00f374c2fec9"},"schema_version":"1.0","source":{"id":"1611.07258","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07258","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07258v2","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07258","created_at":"2026-05-18T00:29:21Z"},{"alias_kind":"pith_short_12","alias_value":"YW4V7JMGSA7O","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YW4V7JMGSA7OHSRT","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YW4V7JMG","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:8e98cfff43051ee4ab9e782ef1ecb1a271ea026d228cc6a5c92d41589923e5d9","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":"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","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":"2016-11-22T11:41:00Z","title":"Uniform s-cross-intersecting families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07258","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:fce0d61dcaf99dad9c93b9f41a00d1615dc18365d7203da3f7681250a1d55dd4","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":"51a6a2ce2897612cee9d5097657e6203d1467d740caef2c8dab88b385fccf4fb","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-22T11:41:00Z","title_canon_sha256":"43b7055a4a1ec54b0288cd72c3f406bf2add44697a9824eef0bd00f374c2fec9"},"schema_version":"1.0","source":{"id":"1611.07258","kind":"arxiv","version":2}},"canonical_sha256":"c5b95fa586903ee3ca333847d96ac73866a902330d0dde9215642d061e6012de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5b95fa586903ee3ca333847d96ac73866a902330d0dde9215642d061e6012de","first_computed_at":"2026-05-18T00:29:21.114879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:21.114879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s5jqRPfdXJhIzCdNYYa6jK7FC2/HMtN6lB1KEQ/Vaa6sMFWodWtXJCXAh05oa4TAAQYbjSpn1JsTLiFP3XGuBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:21.115529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07258","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fce0d61dcaf99dad9c93b9f41a00d1615dc18365d7203da3f7681250a1d55dd4","sha256:8e98cfff43051ee4ab9e782ef1ecb1a271ea026d228cc6a5c92d41589923e5d9"],"state_sha256":"119a64626f3dbe17e7441c0974122bc55136231efc89b3c12d627640f9abc795"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMtrlFt4+oIGfq39a0nuAdCIrmO9KQqKU98hI9/XKbPGpQNGeJ0w9rM8x3I1ds7YAOGap6tu87w7DAqh6KKnDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T16:56:14.060385Z","bundle_sha256":"c41c9cdf7d71f097a71eef3ac9c3ae28ed4fcfd2932a1da4ef0d3cfb8c5eb1e4"}}