{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:G22QHIF7VZSJYU4M25WX3HJBWG","short_pith_number":"pith:G22QHIF7","canonical_record":{"source":{"id":"1312.0840","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-03T14:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"ed6a15da070948925704104fc5b506dc74f33d0a0d8a5387a1894ede928c6e86","abstract_canon_sha256":"73da8a8a4a8ca996a1107d0518274bbd32c52573710b6c4f2d86b2510897ed59"},"schema_version":"1.0"},"canonical_sha256":"36b503a0bfae649c538cd76d7d9d21b1ac292be798590732797c11793b4617c5","source":{"kind":"arxiv","id":"1312.0840","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0840","created_at":"2026-05-18T02:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0840v2","created_at":"2026-05-18T02:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0840","created_at":"2026-05-18T02:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"G22QHIF7VZSJ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G22QHIF7VZSJYU4M","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G22QHIF7","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:G22QHIF7VZSJYU4M25WX3HJBWG","target":"record","payload":{"canonical_record":{"source":{"id":"1312.0840","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-03T14:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"ed6a15da070948925704104fc5b506dc74f33d0a0d8a5387a1894ede928c6e86","abstract_canon_sha256":"73da8a8a4a8ca996a1107d0518274bbd32c52573710b6c4f2d86b2510897ed59"},"schema_version":"1.0"},"canonical_sha256":"36b503a0bfae649c538cd76d7d9d21b1ac292be798590732797c11793b4617c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:23.963087Z","signature_b64":"MIbUECqhMc6xt5lOmSHvHNRGN6WhN63Kf7lgyxSHSrQ8jx7tC+75f0c/T2Z+UduAE+Y300T64LuJEQUtnzm5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36b503a0bfae649c538cd76d7d9d21b1ac292be798590732797c11793b4617c5","last_reissued_at":"2026-05-18T02:39:23.962727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:23.962727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.0840","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-18T02:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZVAU21L3NUEZB2SXsCgPI9apMibHGnPeantX94Rqeaf6pwR3d/3PSbghV9j2PUwljtWZmPRs/FK3lZFcNvLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:10:47.654164Z"},"content_sha256":"ceace4f5e28dc484937fc77c27c64f7c6821d4f058fd2e121b5a52ac8009ce5b","schema_version":"1.0","event_id":"sha256:ceace4f5e28dc484937fc77c27c64f7c6821d4f058fd2e121b5a52ac8009ce5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:G22QHIF7VZSJYU4M25WX3HJBWG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Most Probably Intersecting Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Shagnik Das","submitted_at":"2013-12-03T14:54:58Z","abstract_excerpt":"The celebrated Erd\\H{o}s-Ko-Rado theorem shows that for $n \\ge 2k$ the largest intersecting $k$-uniform set family on $[n]$ has size $\\binom{n-1}{k-1}$. It is natural to ask how far from intersecting larger set families must be. Katona, Katona and Katona introduced the notion of most probably intersecting families, which maximise the probability of random subfamilies being intersecting.\n  We study the most probably intersecting problem for $k$-uniform set families. We provide a rough structural characterisation of the most probably intersecting families and, for families of particular sizes, s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0840","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-18T02:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+AmVlbrJ9gIfl6s1xcp/EAEcCm5ar7NTp85MXIY4gpLgGDMu72x8KIgRcw8VfhSDgLzhksZMfs98Xc9GXs5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:10:47.654643Z"},"content_sha256":"20c7487d0b2625ed91595caf6208714642b4001a3e6bb09351712d7899718199","schema_version":"1.0","event_id":"sha256:20c7487d0b2625ed91595caf6208714642b4001a3e6bb09351712d7899718199"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G22QHIF7VZSJYU4M25WX3HJBWG/bundle.json","state_url":"https://pith.science/pith/G22QHIF7VZSJYU4M25WX3HJBWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G22QHIF7VZSJYU4M25WX3HJBWG/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-30T11:10:47Z","links":{"resolver":"https://pith.science/pith/G22QHIF7VZSJYU4M25WX3HJBWG","bundle":"https://pith.science/pith/G22QHIF7VZSJYU4M25WX3HJBWG/bundle.json","state":"https://pith.science/pith/G22QHIF7VZSJYU4M25WX3HJBWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G22QHIF7VZSJYU4M25WX3HJBWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:G22QHIF7VZSJYU4M25WX3HJBWG","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":"73da8a8a4a8ca996a1107d0518274bbd32c52573710b6c4f2d86b2510897ed59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-03T14:54:58Z","title_canon_sha256":"ed6a15da070948925704104fc5b506dc74f33d0a0d8a5387a1894ede928c6e86"},"schema_version":"1.0","source":{"id":"1312.0840","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0840","created_at":"2026-05-18T02:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0840v2","created_at":"2026-05-18T02:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0840","created_at":"2026-05-18T02:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"G22QHIF7VZSJ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G22QHIF7VZSJYU4M","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G22QHIF7","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:20c7487d0b2625ed91595caf6208714642b4001a3e6bb09351712d7899718199","target":"graph","created_at":"2026-05-18T02:39:23Z","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":"The celebrated Erd\\H{o}s-Ko-Rado theorem shows that for $n \\ge 2k$ the largest intersecting $k$-uniform set family on $[n]$ has size $\\binom{n-1}{k-1}$. It is natural to ask how far from intersecting larger set families must be. Katona, Katona and Katona introduced the notion of most probably intersecting families, which maximise the probability of random subfamilies being intersecting.\n  We study the most probably intersecting problem for $k$-uniform set families. We provide a rough structural characterisation of the most probably intersecting families and, for families of particular sizes, s","authors_text":"Benny Sudakov, Shagnik Das","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-03T14:54:58Z","title":"Most Probably Intersecting Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0840","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:ceace4f5e28dc484937fc77c27c64f7c6821d4f058fd2e121b5a52ac8009ce5b","target":"record","created_at":"2026-05-18T02:39:23Z","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":"73da8a8a4a8ca996a1107d0518274bbd32c52573710b6c4f2d86b2510897ed59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-03T14:54:58Z","title_canon_sha256":"ed6a15da070948925704104fc5b506dc74f33d0a0d8a5387a1894ede928c6e86"},"schema_version":"1.0","source":{"id":"1312.0840","kind":"arxiv","version":2}},"canonical_sha256":"36b503a0bfae649c538cd76d7d9d21b1ac292be798590732797c11793b4617c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36b503a0bfae649c538cd76d7d9d21b1ac292be798590732797c11793b4617c5","first_computed_at":"2026-05-18T02:39:23.962727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:23.962727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MIbUECqhMc6xt5lOmSHvHNRGN6WhN63Kf7lgyxSHSrQ8jx7tC+75f0c/T2Z+UduAE+Y300T64LuJEQUtnzm5Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:23.963087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0840","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ceace4f5e28dc484937fc77c27c64f7c6821d4f058fd2e121b5a52ac8009ce5b","sha256:20c7487d0b2625ed91595caf6208714642b4001a3e6bb09351712d7899718199"],"state_sha256":"47fd9118007fcf6a658ab2e4a17b4c9f0432b55894f35f509ae812345306bba3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yuGnGrGZYnNu+/GUHE0+n+0+OjIKvFk7JGxzHBZ/+cdxKJjaUFlDLlu/09WJQ4EGEaWjkUfD6hlQRdeJBzidAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:10:47.658125Z","bundle_sha256":"f4626ae46b754cf4167ec6fa13e4bffd77b0c2dd02da4b9f4f95f9e02f4fb9f5"}}