{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7Z7WJF5QAIPXLK2KI6EDS2O5HH","short_pith_number":"pith:7Z7WJF5Q","schema_version":"1.0","canonical_sha256":"fe7f6497b0021f75ab4a47883969dd39d5caa2f4c37bb27e0f3bb7226ffa396b","source":{"kind":"arxiv","id":"1302.5210","version":3},"attestation_state":"computed","paper":{"title":"Sperner's Theorem and a Problem of Erdos-Katona-Kleitman","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-02-21T08:29:41Z","abstract_excerpt":"A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives the size of the largest family of subsets of [n] not containing a 2-chain. Erdos extended this theorem to determine the largest family without a k-chain. Erdos and Katona, followed by Kleitman, asked how many chains must appear in families with sizes larger than the corresponding extremal bounds.\n  In 1966, Kleitman resolved this question for 2-chains, showing that the number of such chains is minimized by taking sets as close to the middle level as possible. Moreover, he conjectured the extrema"},"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":"1302.5210","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-21T08:29:41Z","cross_cats_sorted":[],"title_canon_sha256":"f39116afc6ebfff33e78d851ccc73c697ecba6727e4e9fcb74787260b7f3cb8b","abstract_canon_sha256":"3290fe4c135c04ee8b6985ebf08b8e9678f2e10ec65169f23eacbfa129be0b9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:13.449026Z","signature_b64":"ZjPXN/ME7KrUfNclBgLR0CEEgdKFyf3v5w9w8I7siWT6CZRutkyLzVRZkWg95con4iQ8VmC917jRp5IuYVXPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe7f6497b0021f75ab4a47883969dd39d5caa2f4c37bb27e0f3bb7226ffa396b","last_reissued_at":"2026-05-18T03:27:13.448431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:13.448431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sperner's Theorem and a Problem of Erdos-Katona-Kleitman","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-02-21T08:29:41Z","abstract_excerpt":"A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives the size of the largest family of subsets of [n] not containing a 2-chain. Erdos extended this theorem to determine the largest family without a k-chain. Erdos and Katona, followed by Kleitman, asked how many chains must appear in families with sizes larger than the corresponding extremal bounds.\n  In 1966, Kleitman resolved this question for 2-chains, showing that the number of such chains is minimized by taking sets as close to the middle level as possible. Moreover, he conjectured the extrema"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5210","kind":"arxiv","version":3},"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":"1302.5210","created_at":"2026-05-18T03:27:13.448531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.5210v3","created_at":"2026-05-18T03:27:13.448531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5210","created_at":"2026-05-18T03:27:13.448531+00:00"},{"alias_kind":"pith_short_12","alias_value":"7Z7WJF5QAIPX","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"7Z7WJF5QAIPXLK2K","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"7Z7WJF5Q","created_at":"2026-05-18T12:27:38.830355+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/7Z7WJF5QAIPXLK2KI6EDS2O5HH","json":"https://pith.science/pith/7Z7WJF5QAIPXLK2KI6EDS2O5HH.json","graph_json":"https://pith.science/api/pith-number/7Z7WJF5QAIPXLK2KI6EDS2O5HH/graph.json","events_json":"https://pith.science/api/pith-number/7Z7WJF5QAIPXLK2KI6EDS2O5HH/events.json","paper":"https://pith.science/paper/7Z7WJF5Q"},"agent_actions":{"view_html":"https://pith.science/pith/7Z7WJF5QAIPXLK2KI6EDS2O5HH","download_json":"https://pith.science/pith/7Z7WJF5QAIPXLK2KI6EDS2O5HH.json","view_paper":"https://pith.science/paper/7Z7WJF5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.5210&json=true","fetch_graph":"https://pith.science/api/pith-number/7Z7WJF5QAIPXLK2KI6EDS2O5HH/graph.json","fetch_events":"https://pith.science/api/pith-number/7Z7WJF5QAIPXLK2KI6EDS2O5HH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7Z7WJF5QAIPXLK2KI6EDS2O5HH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7Z7WJF5QAIPXLK2KI6EDS2O5HH/action/storage_attestation","attest_author":"https://pith.science/pith/7Z7WJF5QAIPXLK2KI6EDS2O5HH/action/author_attestation","sign_citation":"https://pith.science/pith/7Z7WJF5QAIPXLK2KI6EDS2O5HH/action/citation_signature","submit_replication":"https://pith.science/pith/7Z7WJF5QAIPXLK2KI6EDS2O5HH/action/replication_record"}},"created_at":"2026-05-18T03:27:13.448531+00:00","updated_at":"2026-05-18T03:27:13.448531+00:00"}