{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZDYHDF5EHZSFZFSWNC6LQNYYPP","short_pith_number":"pith:ZDYHDF5E","schema_version":"1.0","canonical_sha256":"c8f07197a43e645c965668bcb837187bde2585a7edf4d0cb0c2c2a18c95c17a9","source":{"kind":"arxiv","id":"1309.4643","version":1},"attestation_state":"computed","paper":{"title":"Set Systems Containing Many Maximal Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Imre Leader, J. Robert Johnson, Paul A. Russell","submitted_at":"2013-09-18T13:47:48Z","abstract_excerpt":"The purpose of this short problem paper is to raise an extremal question on set systems which seems to be natural and appealing. Our question is: which set systems of a given size maximise the number of $(n+1)$-element chains in the power set $\\mathcal{P}(\\{1,2,\\dots,n\\})$? We will show that for each fixed $\\alpha>0$ there is a family of $\\alpha 2^n$ sets containing $(\\alpha+o(1))n!$ such chains, and that this is asymptotically best possible. For smaller set systems we are unable to answer the question. We conjecture that a `tower of cubes' construction is extremal. We finish by mentioning bri"},"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":"1309.4643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-18T13:47:48Z","cross_cats_sorted":[],"title_canon_sha256":"5f11b96a5d4786fe56cbe7c173b2552cf1722db84da71248dd4d1a6493f82f72","abstract_canon_sha256":"2512a4de76ee4f37ac9f0f6b7a3bf53052b3683335817f93e65f91dce2e805c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:35.311758Z","signature_b64":"ERWzshAfZ3KYdnogIBiCH0ySss6mRJUyljgnDEY+KtsptNEk3BI5z13m4GAEFjTCILgshW+gH+fHadgUDoc/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8f07197a43e645c965668bcb837187bde2585a7edf4d0cb0c2c2a18c95c17a9","last_reissued_at":"2026-05-17T23:53:35.311040Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:35.311040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set Systems Containing Many Maximal Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Imre Leader, J. Robert Johnson, Paul A. Russell","submitted_at":"2013-09-18T13:47:48Z","abstract_excerpt":"The purpose of this short problem paper is to raise an extremal question on set systems which seems to be natural and appealing. Our question is: which set systems of a given size maximise the number of $(n+1)$-element chains in the power set $\\mathcal{P}(\\{1,2,\\dots,n\\})$? We will show that for each fixed $\\alpha>0$ there is a family of $\\alpha 2^n$ sets containing $(\\alpha+o(1))n!$ such chains, and that this is asymptotically best possible. For smaller set systems we are unable to answer the question. We conjecture that a `tower of cubes' construction is extremal. We finish by mentioning bri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4643","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":"1309.4643","created_at":"2026-05-17T23:53:35.311141+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.4643v1","created_at":"2026-05-17T23:53:35.311141+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4643","created_at":"2026-05-17T23:53:35.311141+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDYHDF5EHZSF","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDYHDF5EHZSFZFSW","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDYHDF5E","created_at":"2026-05-18T12:28:09.283467+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/ZDYHDF5EHZSFZFSWNC6LQNYYPP","json":"https://pith.science/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP.json","graph_json":"https://pith.science/api/pith-number/ZDYHDF5EHZSFZFSWNC6LQNYYPP/graph.json","events_json":"https://pith.science/api/pith-number/ZDYHDF5EHZSFZFSWNC6LQNYYPP/events.json","paper":"https://pith.science/paper/ZDYHDF5E"},"agent_actions":{"view_html":"https://pith.science/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP","download_json":"https://pith.science/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP.json","view_paper":"https://pith.science/paper/ZDYHDF5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.4643&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDYHDF5EHZSFZFSWNC6LQNYYPP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDYHDF5EHZSFZFSWNC6LQNYYPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP/action/storage_attestation","attest_author":"https://pith.science/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP/action/author_attestation","sign_citation":"https://pith.science/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP/action/citation_signature","submit_replication":"https://pith.science/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP/action/replication_record"}},"created_at":"2026-05-17T23:53:35.311141+00:00","updated_at":"2026-05-17T23:53:35.311141+00:00"}