{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MHUTMPGBNM3BQL5YX7Q6RA5AJW","short_pith_number":"pith:MHUTMPGB","schema_version":"1.0","canonical_sha256":"61e9363cc16b36182fb8bfe1e883a04db4ef58b56d15339cbc4245b49723f199","source":{"kind":"arxiv","id":"1303.4336","version":1},"attestation_state":"computed","paper":{"title":"Supersaturation in the Boolean lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrew P. Dove, Jean-S\\'ebastien Sereni, Jerrold R. Griggs, Ross J. Kang","submitted_at":"2013-03-18T17:44:08Z","abstract_excerpt":"We prove a \"supersaturation-type\" extension of both Sperner's Theorem (1928) and its generalization by Erdos (1945) to k-chains. Our result implies that a largest family whose size is x more than the size of a largest k-chain free family and that contains the minimum number of k-chains is the family formed by taking the middle (k-1) rows of the Boolean lattice and x elements from the k-th middle row. We prove our result using the symmetric chain decomposition method of de Bruijn, van Ebbenhorst Tengbergen, and Kruyswijk (1951)."},"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":"1303.4336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-18T17:44:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"acc3c9bc3ea34bd51b1fb5e02396680907e00823996fe4683483bf0e22007a2c","abstract_canon_sha256":"b59c72aa0d9fc07dd873bacc6638345b5b725b8f68da5805f5261d2983c4dbbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:08.808975Z","signature_b64":"AuNdA4E8OFkOZZiZRfWQT+jnOGy/3K71qxGTbbofzx+5cdjlJE0acDfktPS3h7HTa5io+YDJRiDwfVjZlZChAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61e9363cc16b36182fb8bfe1e883a04db4ef58b56d15339cbc4245b49723f199","last_reissued_at":"2026-05-18T00:40:08.808474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:08.808474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supersaturation in the Boolean lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrew P. Dove, Jean-S\\'ebastien Sereni, Jerrold R. Griggs, Ross J. Kang","submitted_at":"2013-03-18T17:44:08Z","abstract_excerpt":"We prove a \"supersaturation-type\" extension of both Sperner's Theorem (1928) and its generalization by Erdos (1945) to k-chains. Our result implies that a largest family whose size is x more than the size of a largest k-chain free family and that contains the minimum number of k-chains is the family formed by taking the middle (k-1) rows of the Boolean lattice and x elements from the k-th middle row. We prove our result using the symmetric chain decomposition method of de Bruijn, van Ebbenhorst Tengbergen, and Kruyswijk (1951)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4336","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":"1303.4336","created_at":"2026-05-18T00:40:08.808561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4336v1","created_at":"2026-05-18T00:40:08.808561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4336","created_at":"2026-05-18T00:40:08.808561+00:00"},{"alias_kind":"pith_short_12","alias_value":"MHUTMPGBNM3B","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MHUTMPGBNM3BQL5Y","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MHUTMPGB","created_at":"2026-05-18T12:27:52.871228+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/MHUTMPGBNM3BQL5YX7Q6RA5AJW","json":"https://pith.science/pith/MHUTMPGBNM3BQL5YX7Q6RA5AJW.json","graph_json":"https://pith.science/api/pith-number/MHUTMPGBNM3BQL5YX7Q6RA5AJW/graph.json","events_json":"https://pith.science/api/pith-number/MHUTMPGBNM3BQL5YX7Q6RA5AJW/events.json","paper":"https://pith.science/paper/MHUTMPGB"},"agent_actions":{"view_html":"https://pith.science/pith/MHUTMPGBNM3BQL5YX7Q6RA5AJW","download_json":"https://pith.science/pith/MHUTMPGBNM3BQL5YX7Q6RA5AJW.json","view_paper":"https://pith.science/paper/MHUTMPGB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4336&json=true","fetch_graph":"https://pith.science/api/pith-number/MHUTMPGBNM3BQL5YX7Q6RA5AJW/graph.json","fetch_events":"https://pith.science/api/pith-number/MHUTMPGBNM3BQL5YX7Q6RA5AJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MHUTMPGBNM3BQL5YX7Q6RA5AJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MHUTMPGBNM3BQL5YX7Q6RA5AJW/action/storage_attestation","attest_author":"https://pith.science/pith/MHUTMPGBNM3BQL5YX7Q6RA5AJW/action/author_attestation","sign_citation":"https://pith.science/pith/MHUTMPGBNM3BQL5YX7Q6RA5AJW/action/citation_signature","submit_replication":"https://pith.science/pith/MHUTMPGBNM3BQL5YX7Q6RA5AJW/action/replication_record"}},"created_at":"2026-05-18T00:40:08.808561+00:00","updated_at":"2026-05-18T00:40:08.808561+00:00"}