{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:6LLQDNJKJBJ7MSDICFFGDAQII2","short_pith_number":"pith:6LLQDNJK","schema_version":"1.0","canonical_sha256":"f2d701b52a4853f64868114a61820846a9a0e73b716dffd554e71b4759fd84c1","source":{"kind":"arxiv","id":"math/0112068","version":3},"attestation_state":"computed","paper":{"title":"A shorter, simpler, stronger proof of the Meshalkin-Hochberg-Hirsch bounds on componentwise antichains","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthias Beck, Thomas Zaslavsky","submitted_at":"2001-12-07T02:38:32Z","abstract_excerpt":"Meshalkin's theorem states that a class of ordered p-partitions of an n-set has at most $\\max \\binom{n}{a_1,...,a_p}$ members if for each k the k'th parts form an antichain. We give a new proof of this and the corresponding LYM inequality due to Hochberg and Hirsch, which is simpler and more general than previous proofs. It extends to a common generalization of Meshalkin's theorem and Erdos's theorem about r-chain-free set families."},"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":"math/0112068","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2001-12-07T02:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"68e7492fb6955b8026ac45d862c132c9c87c2b41c02f5a8002f144cfa7329ae8","abstract_canon_sha256":"9a4eadec4f6db63b2a0e657dbcba09199274622f7b7cd235caed97121e432135"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:34.904689Z","signature_b64":"uTgUItA0mhnZaP2mAaNIQ2uqDkK2zhr0pPhRDqLQSzrPWFQR548kxIc0OIpBujW9jqr54nEd+REHCAfoeuDqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2d701b52a4853f64868114a61820846a9a0e73b716dffd554e71b4759fd84c1","last_reissued_at":"2026-05-18T01:01:34.904153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:34.904153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A shorter, simpler, stronger proof of the Meshalkin-Hochberg-Hirsch bounds on componentwise antichains","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthias Beck, Thomas Zaslavsky","submitted_at":"2001-12-07T02:38:32Z","abstract_excerpt":"Meshalkin's theorem states that a class of ordered p-partitions of an n-set has at most $\\max \\binom{n}{a_1,...,a_p}$ members if for each k the k'th parts form an antichain. We give a new proof of this and the corresponding LYM inequality due to Hochberg and Hirsch, which is simpler and more general than previous proofs. It extends to a common generalization of Meshalkin's theorem and Erdos's theorem about r-chain-free set families."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0112068","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":"math/0112068","created_at":"2026-05-18T01:01:34.904242+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0112068v3","created_at":"2026-05-18T01:01:34.904242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0112068","created_at":"2026-05-18T01:01:34.904242+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LLQDNJKJBJ7","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LLQDNJKJBJ7MSDI","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LLQDNJK","created_at":"2026-05-18T12:25:50.254431+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/6LLQDNJKJBJ7MSDICFFGDAQII2","json":"https://pith.science/pith/6LLQDNJKJBJ7MSDICFFGDAQII2.json","graph_json":"https://pith.science/api/pith-number/6LLQDNJKJBJ7MSDICFFGDAQII2/graph.json","events_json":"https://pith.science/api/pith-number/6LLQDNJKJBJ7MSDICFFGDAQII2/events.json","paper":"https://pith.science/paper/6LLQDNJK"},"agent_actions":{"view_html":"https://pith.science/pith/6LLQDNJKJBJ7MSDICFFGDAQII2","download_json":"https://pith.science/pith/6LLQDNJKJBJ7MSDICFFGDAQII2.json","view_paper":"https://pith.science/paper/6LLQDNJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0112068&json=true","fetch_graph":"https://pith.science/api/pith-number/6LLQDNJKJBJ7MSDICFFGDAQII2/graph.json","fetch_events":"https://pith.science/api/pith-number/6LLQDNJKJBJ7MSDICFFGDAQII2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LLQDNJKJBJ7MSDICFFGDAQII2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LLQDNJKJBJ7MSDICFFGDAQII2/action/storage_attestation","attest_author":"https://pith.science/pith/6LLQDNJKJBJ7MSDICFFGDAQII2/action/author_attestation","sign_citation":"https://pith.science/pith/6LLQDNJKJBJ7MSDICFFGDAQII2/action/citation_signature","submit_replication":"https://pith.science/pith/6LLQDNJKJBJ7MSDICFFGDAQII2/action/replication_record"}},"created_at":"2026-05-18T01:01:34.904242+00:00","updated_at":"2026-05-18T01:01:34.904242+00:00"}