{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZDYHDF5EHZSFZFSWNC6LQNYYPP","short_pith_number":"pith:ZDYHDF5E","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"},"canonical_sha256":"c8f07197a43e645c965668bcb837187bde2585a7edf4d0cb0c2c2a18c95c17a9","source":{"kind":"arxiv","id":"1309.4643","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4643","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4643v1","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4643","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"pith_short_12","alias_value":"ZDYHDF5EHZSF","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZDYHDF5EHZSFZFSW","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZDYHDF5E","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZDYHDF5EHZSFZFSWNC6LQNYYPP","target":"record","payload":{"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"},"canonical_sha256":"c8f07197a43e645c965668bcb837187bde2585a7edf4d0cb0c2c2a18c95c17a9","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"},"source_kind":"arxiv","source_id":"1309.4643","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDsSPHl2vPjUsY8iXmzzu9FNw4ICQpUVEqtQlNhqVno09vaYyPPDa5ofp5f0LldAOPcOGULY9JUh512ToAfyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:23:20.298105Z"},"content_sha256":"721086bf33d6b331b0d347a67bee3b95cb749147bcd94a81d6eb45d9f14cebb9","schema_version":"1.0","event_id":"sha256:721086bf33d6b331b0d347a67bee3b95cb749147bcd94a81d6eb45d9f14cebb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZDYHDF5EHZSFZFSWNC6LQNYYPP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4YwCF+MaJ7VGpYbva6IWLXL7lBP/vTtpiUl7lGWrToKwElYyrX+EVQ6pEFR5ZYkFbq226IQ+Wj4XMpv2yEv8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:23:20.298461Z"},"content_sha256":"c78cfa6c7f0ba66d48d1f137d0016e7cf92606ddca1422feb26d8733b929e8e7","schema_version":"1.0","event_id":"sha256:c78cfa6c7f0ba66d48d1f137d0016e7cf92606ddca1422feb26d8733b929e8e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP/bundle.json","state_url":"https://pith.science/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T13:23:20Z","links":{"resolver":"https://pith.science/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP","bundle":"https://pith.science/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP/bundle.json","state":"https://pith.science/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDYHDF5EHZSFZFSWNC6LQNYYPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZDYHDF5EHZSFZFSWNC6LQNYYPP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2512a4de76ee4f37ac9f0f6b7a3bf53052b3683335817f93e65f91dce2e805c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-18T13:47:48Z","title_canon_sha256":"5f11b96a5d4786fe56cbe7c173b2552cf1722db84da71248dd4d1a6493f82f72"},"schema_version":"1.0","source":{"id":"1309.4643","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4643","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4643v1","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4643","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"pith_short_12","alias_value":"ZDYHDF5EHZSF","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZDYHDF5EHZSFZFSW","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZDYHDF5E","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:c78cfa6c7f0ba66d48d1f137d0016e7cf92606ddca1422feb26d8733b929e8e7","target":"graph","created_at":"2026-05-17T23:53:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Imre Leader, J. Robert Johnson, Paul A. Russell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-18T13:47:48Z","title":"Set Systems Containing Many Maximal Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4643","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:721086bf33d6b331b0d347a67bee3b95cb749147bcd94a81d6eb45d9f14cebb9","target":"record","created_at":"2026-05-17T23:53:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2512a4de76ee4f37ac9f0f6b7a3bf53052b3683335817f93e65f91dce2e805c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-18T13:47:48Z","title_canon_sha256":"5f11b96a5d4786fe56cbe7c173b2552cf1722db84da71248dd4d1a6493f82f72"},"schema_version":"1.0","source":{"id":"1309.4643","kind":"arxiv","version":1}},"canonical_sha256":"c8f07197a43e645c965668bcb837187bde2585a7edf4d0cb0c2c2a18c95c17a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8f07197a43e645c965668bcb837187bde2585a7edf4d0cb0c2c2a18c95c17a9","first_computed_at":"2026-05-17T23:53:35.311040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:35.311040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ERWzshAfZ3KYdnogIBiCH0ySss6mRJUyljgnDEY+KtsptNEk3BI5z13m4GAEFjTCILgshW+gH+fHadgUDoc/DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:35.311758Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.4643","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:721086bf33d6b331b0d347a67bee3b95cb749147bcd94a81d6eb45d9f14cebb9","sha256:c78cfa6c7f0ba66d48d1f137d0016e7cf92606ddca1422feb26d8733b929e8e7"],"state_sha256":"021573a3ed69582b5c6440214c9a74485b25a4d8ecee8c46da1c207e4df9380a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XyNZjiSoup85kABeJcOlJ7lx0xgZ6gm7LPiuzLUK1lD8E9MWwSICQV8c3AWZa9yE50KR2MnShr0u/JM4DtorCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:23:20.300416Z","bundle_sha256":"c80e29eb960d227e5c9b93578bc7499fa6daf8a8b4358744b68310fec22b62cd"}}