{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:K7PCWGIUARX5JVUUMBE3V2TSBJ","short_pith_number":"pith:K7PCWGIU","canonical_record":{"source":{"id":"1305.6715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T08:09:46Z","cross_cats_sorted":[],"title_canon_sha256":"f53a9ec74b24445f2d28be443d0ebf4169243f8e36d5c62d55e3640f66e25c45","abstract_canon_sha256":"625732cdd9feee6d08933007b777a3a167910f91b518e7cd11a6cd4fead4ca75"},"schema_version":"1.0"},"canonical_sha256":"57de2b1914046fd4d6946049baea720a587fa2c8459a590ae3ef05a11d20fdcb","source":{"kind":"arxiv","id":"1305.6715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6715","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6715v1","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6715","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"K7PCWGIUARX5","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K7PCWGIUARX5JVUU","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K7PCWGIU","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:K7PCWGIUARX5JVUUMBE3V2TSBJ","target":"record","payload":{"canonical_record":{"source":{"id":"1305.6715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T08:09:46Z","cross_cats_sorted":[],"title_canon_sha256":"f53a9ec74b24445f2d28be443d0ebf4169243f8e36d5c62d55e3640f66e25c45","abstract_canon_sha256":"625732cdd9feee6d08933007b777a3a167910f91b518e7cd11a6cd4fead4ca75"},"schema_version":"1.0"},"canonical_sha256":"57de2b1914046fd4d6946049baea720a587fa2c8459a590ae3ef05a11d20fdcb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:18.059422Z","signature_b64":"Q4ybHcE1dAHGeNFDmdJDLuMYxcBl6SZdNsCROlU7lM59x7uuhr6AXxt2NqeQHVoQywFDNP9fy7vrCMPiWMg+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57de2b1914046fd4d6946049baea720a587fa2c8459a590ae3ef05a11d20fdcb","last_reissued_at":"2026-05-18T03:22:18.058991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:18.058991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.6715","source_version":1,"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-18T03:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YytHgZgAYUDndyQ/UOG1MbU58Zv19Z+57QeKu5gMC1CH8/12vEc1wZ+VkhnWfDOoeLwba7CWgu9GHeoTDePuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:59:53.529005Z"},"content_sha256":"3e99e0dd981fa6fbd226001a171c0b2a9b206c3eba70ebf800f9851cd0693eda","schema_version":"1.0","event_id":"sha256:3e99e0dd981fa6fbd226001a171c0b2a9b206c3eba70ebf800f9851cd0693eda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:K7PCWGIUARX5JVUUMBE3V2TSBJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The minimum number of disjoint pairs in set systems and related problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Shagnik Das, Wenying Gan","submitted_at":"2013-05-29T08:09:46Z","abstract_excerpt":"Let F be a set system on [n] with all sets having k elements and every pair of sets intersecting. The celebrated theorem of Erdos-Ko-Rado from 1961 says that any such system has size at most ${n-1 \\choose k-1}$. A natural question, which was asked by Ahlswede in 1980, is how many disjoint pairs must appear in a set system of larger size. Except for the case k=2, solved by Ahlswede and Katona, this problem has remained open for the last three decades.\n  In this paper, we determine the minimum number of disjoint pairs in small k-uniform families, thus confirming a conjecture of Bollobas and Lead"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6715","kind":"arxiv","version":1},"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-18T03:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"haTeKsOaU3KJcjBoOlj8YYVIADHdDifJo7EIlCgTAfDYN8YofMo580fO3gVQpijzvsA6uN9y3ZmcRaXrG+SyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:59:53.529742Z"},"content_sha256":"91fce1e9341dce48fd957300706d7c8c5b410fe2e4704f67692cdd8e469b8fa7","schema_version":"1.0","event_id":"sha256:91fce1e9341dce48fd957300706d7c8c5b410fe2e4704f67692cdd8e469b8fa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7PCWGIUARX5JVUUMBE3V2TSBJ/bundle.json","state_url":"https://pith.science/pith/K7PCWGIUARX5JVUUMBE3V2TSBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7PCWGIUARX5JVUUMBE3V2TSBJ/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-31T21:59:53Z","links":{"resolver":"https://pith.science/pith/K7PCWGIUARX5JVUUMBE3V2TSBJ","bundle":"https://pith.science/pith/K7PCWGIUARX5JVUUMBE3V2TSBJ/bundle.json","state":"https://pith.science/pith/K7PCWGIUARX5JVUUMBE3V2TSBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7PCWGIUARX5JVUUMBE3V2TSBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:K7PCWGIUARX5JVUUMBE3V2TSBJ","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":"625732cdd9feee6d08933007b777a3a167910f91b518e7cd11a6cd4fead4ca75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T08:09:46Z","title_canon_sha256":"f53a9ec74b24445f2d28be443d0ebf4169243f8e36d5c62d55e3640f66e25c45"},"schema_version":"1.0","source":{"id":"1305.6715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6715","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6715v1","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6715","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"K7PCWGIUARX5","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K7PCWGIUARX5JVUU","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K7PCWGIU","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:91fce1e9341dce48fd957300706d7c8c5b410fe2e4704f67692cdd8e469b8fa7","target":"graph","created_at":"2026-05-18T03:22:18Z","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":"Let F be a set system on [n] with all sets having k elements and every pair of sets intersecting. The celebrated theorem of Erdos-Ko-Rado from 1961 says that any such system has size at most ${n-1 \\choose k-1}$. A natural question, which was asked by Ahlswede in 1980, is how many disjoint pairs must appear in a set system of larger size. Except for the case k=2, solved by Ahlswede and Katona, this problem has remained open for the last three decades.\n  In this paper, we determine the minimum number of disjoint pairs in small k-uniform families, thus confirming a conjecture of Bollobas and Lead","authors_text":"Benny Sudakov, Shagnik Das, Wenying Gan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T08:09:46Z","title":"The minimum number of disjoint pairs in set systems and related problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6715","kind":"arxiv","version":1},"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:3e99e0dd981fa6fbd226001a171c0b2a9b206c3eba70ebf800f9851cd0693eda","target":"record","created_at":"2026-05-18T03:22:18Z","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":"625732cdd9feee6d08933007b777a3a167910f91b518e7cd11a6cd4fead4ca75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T08:09:46Z","title_canon_sha256":"f53a9ec74b24445f2d28be443d0ebf4169243f8e36d5c62d55e3640f66e25c45"},"schema_version":"1.0","source":{"id":"1305.6715","kind":"arxiv","version":1}},"canonical_sha256":"57de2b1914046fd4d6946049baea720a587fa2c8459a590ae3ef05a11d20fdcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57de2b1914046fd4d6946049baea720a587fa2c8459a590ae3ef05a11d20fdcb","first_computed_at":"2026-05-18T03:22:18.058991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:18.058991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q4ybHcE1dAHGeNFDmdJDLuMYxcBl6SZdNsCROlU7lM59x7uuhr6AXxt2NqeQHVoQywFDNP9fy7vrCMPiWMg+AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:18.059422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e99e0dd981fa6fbd226001a171c0b2a9b206c3eba70ebf800f9851cd0693eda","sha256:91fce1e9341dce48fd957300706d7c8c5b410fe2e4704f67692cdd8e469b8fa7"],"state_sha256":"0f4cd4658aa3ff93a854b70c1c6f40ff30069845dff07f0e243c45d5cebf9bc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WLjVUWIZExdXvjAlbCjEuZN5KL2lIN3aUrUIBJNMjSL3rkniBGdtmNqxsDFBv0krTE3PwkrOPq6dcY0HesHrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:59:53.533500Z","bundle_sha256":"4cd8109118fa8cae392d6e73913059f622e342479c4d4ec34a11dc36c9731573"}}