{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:36LT7FXNKAUOPG4SGEYS42KL2F","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":"dded294cb8d2a4207c5aadef5446f2fb65bae6aaefa1ee586ec2ec4c0a7e38f0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-01T09:04:17Z","title_canon_sha256":"dab47982565e29fbf71c97482ae5f7626f7111303d00712ad00ada402197387b"},"schema_version":"1.0","source":{"id":"1706.00215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00215","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00215v1","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00215","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"pith_short_12","alias_value":"36LT7FXNKAUO","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"36LT7FXNKAUOPG4S","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"36LT7FXN","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:7d10d301a9d54f76834426d057e69cf2350e6e776a265182fa869b9b05e48d39","target":"graph","created_at":"2026-05-18T00:29: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 $m(n)$ denote the maximum size of a family of subsets which does not contain two disjoint sets along with their union. In 1968 Kleitman proved that $m(n) = {n\\choose m+1}+\\ldots +{n\\choose 2m+1}$ if $n=3m+1$. Confirming the conjecture of Kleitman, we establish the same equality for the cases $n=3m$ and $n=3m+2$, and also determine all extremal families. Unlike the case $n=3m+1$, the extremal families are not unique. This is a plausible reason behind the relative difficulty of our proofs. We completely settle the case of several families as well.","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-06-01T09:04:17Z","title":"Partition-free families of sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00215","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:f8009a71f2d79a34d77da13531649bb7f3ed59387b114c01ae7ffb17594c4aa9","target":"record","created_at":"2026-05-18T00:29: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":"dded294cb8d2a4207c5aadef5446f2fb65bae6aaefa1ee586ec2ec4c0a7e38f0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-01T09:04:17Z","title_canon_sha256":"dab47982565e29fbf71c97482ae5f7626f7111303d00712ad00ada402197387b"},"schema_version":"1.0","source":{"id":"1706.00215","kind":"arxiv","version":1}},"canonical_sha256":"df973f96ed5028e79b9231312e694bd1548ea813179f0aa816eb1a6d0c574c76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df973f96ed5028e79b9231312e694bd1548ea813179f0aa816eb1a6d0c574c76","first_computed_at":"2026-05-18T00:29:18.686812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:18.686812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RcLMNZlbHfe7/L5Jx2C2ABmNHyCNN4sAvTm+QOJwyg66E9HjsXMaC+VOmGP3YCjRyugDjh7NVddC/MmUzNmODw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:18.687498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8009a71f2d79a34d77da13531649bb7f3ed59387b114c01ae7ffb17594c4aa9","sha256:7d10d301a9d54f76834426d057e69cf2350e6e776a265182fa869b9b05e48d39"],"state_sha256":"3bcf2496daafa9d47a7d40ecea7784839894f9462ceaeb5ef9fbfe8b912c08dc"}