{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:36LT7FXNKAUOPG4SGEYS42KL2F","short_pith_number":"pith:36LT7FXN","schema_version":"1.0","canonical_sha256":"df973f96ed5028e79b9231312e694bd1548ea813179f0aa816eb1a6d0c574c76","source":{"kind":"arxiv","id":"1706.00215","version":1},"attestation_state":"computed","paper":{"title":"Partition-free families of sets","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-06-01T09:04:17Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1706.00215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-01T09:04:17Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"dab47982565e29fbf71c97482ae5f7626f7111303d00712ad00ada402197387b","abstract_canon_sha256":"dded294cb8d2a4207c5aadef5446f2fb65bae6aaefa1ee586ec2ec4c0a7e38f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:18.687498Z","signature_b64":"RcLMNZlbHfe7/L5Jx2C2ABmNHyCNN4sAvTm+QOJwyg66E9HjsXMaC+VOmGP3YCjRyugDjh7NVddC/MmUzNmODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df973f96ed5028e79b9231312e694bd1548ea813179f0aa816eb1a6d0c574c76","last_reissued_at":"2026-05-18T00:29:18.686812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:18.686812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partition-free families of sets","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-06-01T09:04:17Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00215","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.00215","created_at":"2026-05-18T00:29:18.686915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00215v1","created_at":"2026-05-18T00:29:18.686915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00215","created_at":"2026-05-18T00:29:18.686915+00:00"},{"alias_kind":"pith_short_12","alias_value":"36LT7FXNKAUO","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"36LT7FXNKAUOPG4S","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"36LT7FXN","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/36LT7FXNKAUOPG4SGEYS42KL2F","json":"https://pith.science/pith/36LT7FXNKAUOPG4SGEYS42KL2F.json","graph_json":"https://pith.science/api/pith-number/36LT7FXNKAUOPG4SGEYS42KL2F/graph.json","events_json":"https://pith.science/api/pith-number/36LT7FXNKAUOPG4SGEYS42KL2F/events.json","paper":"https://pith.science/paper/36LT7FXN"},"agent_actions":{"view_html":"https://pith.science/pith/36LT7FXNKAUOPG4SGEYS42KL2F","download_json":"https://pith.science/pith/36LT7FXNKAUOPG4SGEYS42KL2F.json","view_paper":"https://pith.science/paper/36LT7FXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00215&json=true","fetch_graph":"https://pith.science/api/pith-number/36LT7FXNKAUOPG4SGEYS42KL2F/graph.json","fetch_events":"https://pith.science/api/pith-number/36LT7FXNKAUOPG4SGEYS42KL2F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36LT7FXNKAUOPG4SGEYS42KL2F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36LT7FXNKAUOPG4SGEYS42KL2F/action/storage_attestation","attest_author":"https://pith.science/pith/36LT7FXNKAUOPG4SGEYS42KL2F/action/author_attestation","sign_citation":"https://pith.science/pith/36LT7FXNKAUOPG4SGEYS42KL2F/action/citation_signature","submit_replication":"https://pith.science/pith/36LT7FXNKAUOPG4SGEYS42KL2F/action/replication_record"}},"created_at":"2026-05-18T00:29:18.686915+00:00","updated_at":"2026-05-18T00:29:18.686915+00:00"}