{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KWE24BADKUMTYQQLTEWVYQ26WU","short_pith_number":"pith:KWE24BAD","schema_version":"1.0","canonical_sha256":"5589ae040355193c420b992d5c435eb518ea6dec906f9dd76ce6aeb8104ec344","source":{"kind":"arxiv","id":"1609.02262","version":2},"attestation_state":"computed","paper":{"title":"Kleitman's conjecture about families of given size minimizing the number of $k$-chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Zsolt Wagner, Jozsef Balogh","submitted_at":"2016-09-08T04:20:46Z","abstract_excerpt":"A central theorem in combinatorics is Sperner's Theorem, which determines the maximum size of a family $\\mathcal{F}\\subseteq \\mathcal{P}(n)$ that does not contain a $2$-chain $F_1\\subsetneq F_2$. Erd\\H{o}s later extended this result and determined the largest family not containing a $k$-chain $F_1\\subsetneq \\ldots \\subsetneq F_k$. Erd\\H{o}s and Katona and later Kleitman asked how many such chains must appear in families whose size is larger than the corresponding extremal result.\n  This question was resolved for $2$-chains by Kleitman in $1966$, who showed that amongst families of size $M$ in "},"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":"1609.02262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-08T04:20:46Z","cross_cats_sorted":[],"title_canon_sha256":"4e306bafca9fbdf6da8b735a3088dab756b4fa05ec3009145fc1d335b8a14963","abstract_canon_sha256":"aa81ebe203010ea1b34b7967a64bf4a72f2be08b55e60e26a010bcf380ba1bfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:42.491604Z","signature_b64":"8bC2z040ehhRkzX2Pz1PITMZCT6nwcGXgjBblj2Io6rrbEBK/MTwSJmFZAjLCERvYgQrt1MIBzeXSWiXSyBhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5589ae040355193c420b992d5c435eb518ea6dec906f9dd76ce6aeb8104ec344","last_reissued_at":"2026-05-18T01:03:42.491124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:42.491124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kleitman's conjecture about families of given size minimizing the number of $k$-chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Zsolt Wagner, Jozsef Balogh","submitted_at":"2016-09-08T04:20:46Z","abstract_excerpt":"A central theorem in combinatorics is Sperner's Theorem, which determines the maximum size of a family $\\mathcal{F}\\subseteq \\mathcal{P}(n)$ that does not contain a $2$-chain $F_1\\subsetneq F_2$. Erd\\H{o}s later extended this result and determined the largest family not containing a $k$-chain $F_1\\subsetneq \\ldots \\subsetneq F_k$. Erd\\H{o}s and Katona and later Kleitman asked how many such chains must appear in families whose size is larger than the corresponding extremal result.\n  This question was resolved for $2$-chains by Kleitman in $1966$, who showed that amongst families of size $M$ in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02262","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.02262","created_at":"2026-05-18T01:03:42.491200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.02262v2","created_at":"2026-05-18T01:03:42.491200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02262","created_at":"2026-05-18T01:03:42.491200+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWE24BADKUMT","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWE24BADKUMTYQQL","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWE24BAD","created_at":"2026-05-18T12:30:29.479603+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/KWE24BADKUMTYQQLTEWVYQ26WU","json":"https://pith.science/pith/KWE24BADKUMTYQQLTEWVYQ26WU.json","graph_json":"https://pith.science/api/pith-number/KWE24BADKUMTYQQLTEWVYQ26WU/graph.json","events_json":"https://pith.science/api/pith-number/KWE24BADKUMTYQQLTEWVYQ26WU/events.json","paper":"https://pith.science/paper/KWE24BAD"},"agent_actions":{"view_html":"https://pith.science/pith/KWE24BADKUMTYQQLTEWVYQ26WU","download_json":"https://pith.science/pith/KWE24BADKUMTYQQLTEWVYQ26WU.json","view_paper":"https://pith.science/paper/KWE24BAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.02262&json=true","fetch_graph":"https://pith.science/api/pith-number/KWE24BADKUMTYQQLTEWVYQ26WU/graph.json","fetch_events":"https://pith.science/api/pith-number/KWE24BADKUMTYQQLTEWVYQ26WU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWE24BADKUMTYQQLTEWVYQ26WU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWE24BADKUMTYQQLTEWVYQ26WU/action/storage_attestation","attest_author":"https://pith.science/pith/KWE24BADKUMTYQQLTEWVYQ26WU/action/author_attestation","sign_citation":"https://pith.science/pith/KWE24BADKUMTYQQLTEWVYQ26WU/action/citation_signature","submit_replication":"https://pith.science/pith/KWE24BADKUMTYQQLTEWVYQ26WU/action/replication_record"}},"created_at":"2026-05-18T01:03:42.491200+00:00","updated_at":"2026-05-18T01:03:42.491200+00:00"}