{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LGEVTHGBKA7MPKFBCPTA7VKXZQ","short_pith_number":"pith:LGEVTHGB","canonical_record":{"source":{"id":"1901.00197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-01T18:57:44Z","cross_cats_sorted":[],"title_canon_sha256":"279304bd2938d3ea78c4d25e6ba89899cad34a093ebf84a7fc2c78fbf700c916","abstract_canon_sha256":"fd0ebf23f1feb144491ee8dc1164e595abd0778954e19f5792475958f472ca99"},"schema_version":"1.0"},"canonical_sha256":"5989599cc1503ec7a8a113e60fd557cc00b44914643fb1b2e7f4f3d4f216cce5","source":{"kind":"arxiv","id":"1901.00197","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00197","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00197v2","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00197","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"pith_short_12","alias_value":"LGEVTHGBKA7M","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LGEVTHGBKA7MPKFB","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LGEVTHGB","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LGEVTHGBKA7MPKFBCPTA7VKXZQ","target":"record","payload":{"canonical_record":{"source":{"id":"1901.00197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-01T18:57:44Z","cross_cats_sorted":[],"title_canon_sha256":"279304bd2938d3ea78c4d25e6ba89899cad34a093ebf84a7fc2c78fbf700c916","abstract_canon_sha256":"fd0ebf23f1feb144491ee8dc1164e595abd0778954e19f5792475958f472ca99"},"schema_version":"1.0"},"canonical_sha256":"5989599cc1503ec7a8a113e60fd557cc00b44914643fb1b2e7f4f3d4f216cce5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:57.901467Z","signature_b64":"ZJVgtAL9HKM2I98Zep6zxgSAAe45V4dXxm+BXqkbejfC5MBaqDCTS7fAR1zKcX8KjZaG49CyPIt4Fp3Qng5nAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5989599cc1503ec7a8a113e60fd557cc00b44914643fb1b2e7f4f3d4f216cce5","last_reissued_at":"2026-05-17T23:56:57.900913Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:57.900913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.00197","source_version":2,"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:56:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uNdzLUXZPx/e2oWSeVAiqhv03HX0BNqeQA6jWkdUKdea1VMCd4rVTURMJeBetFMX137bIOEnaemzCyrURZqpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:43:44.816663Z"},"content_sha256":"24e703efd47fb6163709e17691e344f08eed69e882c4af7d5a6a05708f44c7ed","schema_version":"1.0","event_id":"sha256:24e703efd47fb6163709e17691e344f08eed69e882c4af7d5a6a05708f44c7ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LGEVTHGBKA7MPKFBCPTA7VKXZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Is the Symmetric Group Sperner?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gene B. Kim, Larry H. Harper","submitted_at":"2019-01-01T18:57:44Z","abstract_excerpt":"An antichain $\\mathcal{A}$ in a poset $\\mathcal{P}$ is a subset of $\\mathcal{P}$ in which no two elements are comparable. Sperner showed that the maximal antichain in the Boolean lattice, $\\mathcal{B}_n = \\left\\{ 0 < 1 \\right\\}^n$, is the largest rank (of size $\\binom{n}{\\lfloor n/2 \\rfloor}$). This type of problem has been since generalized, and a graded poset $\\mathcal{P}$ is said to be Sperner if the largest rank of $\\mathcal{P}$ is its maximal antichain. In this paper, we will show that the symmetric group $S_n$, partially ordered by refinement (or equivalently by absolute order), is Spern"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00197","kind":"arxiv","version":2},"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:56:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EINGR9DAZufF9COpYANic3FS9UymDp8Gf+JsHK53VY+JKybOyTaz8AKd0p89nfdEoUs76Z5TrKW/q6Msn1A4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:43:44.817003Z"},"content_sha256":"25cb8484135211361c1c9ed4770df13b4f787c465c81f9ac719f9148249005f3","schema_version":"1.0","event_id":"sha256:25cb8484135211361c1c9ed4770df13b4f787c465c81f9ac719f9148249005f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGEVTHGBKA7MPKFBCPTA7VKXZQ/bundle.json","state_url":"https://pith.science/pith/LGEVTHGBKA7MPKFBCPTA7VKXZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGEVTHGBKA7MPKFBCPTA7VKXZQ/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-29T20:43:44Z","links":{"resolver":"https://pith.science/pith/LGEVTHGBKA7MPKFBCPTA7VKXZQ","bundle":"https://pith.science/pith/LGEVTHGBKA7MPKFBCPTA7VKXZQ/bundle.json","state":"https://pith.science/pith/LGEVTHGBKA7MPKFBCPTA7VKXZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGEVTHGBKA7MPKFBCPTA7VKXZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LGEVTHGBKA7MPKFBCPTA7VKXZQ","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":"fd0ebf23f1feb144491ee8dc1164e595abd0778954e19f5792475958f472ca99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-01T18:57:44Z","title_canon_sha256":"279304bd2938d3ea78c4d25e6ba89899cad34a093ebf84a7fc2c78fbf700c916"},"schema_version":"1.0","source":{"id":"1901.00197","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00197","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00197v2","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00197","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"pith_short_12","alias_value":"LGEVTHGBKA7M","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LGEVTHGBKA7MPKFB","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LGEVTHGB","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:25cb8484135211361c1c9ed4770df13b4f787c465c81f9ac719f9148249005f3","target":"graph","created_at":"2026-05-17T23:56:57Z","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":"An antichain $\\mathcal{A}$ in a poset $\\mathcal{P}$ is a subset of $\\mathcal{P}$ in which no two elements are comparable. Sperner showed that the maximal antichain in the Boolean lattice, $\\mathcal{B}_n = \\left\\{ 0 < 1 \\right\\}^n$, is the largest rank (of size $\\binom{n}{\\lfloor n/2 \\rfloor}$). This type of problem has been since generalized, and a graded poset $\\mathcal{P}$ is said to be Sperner if the largest rank of $\\mathcal{P}$ is its maximal antichain. In this paper, we will show that the symmetric group $S_n$, partially ordered by refinement (or equivalently by absolute order), is Spern","authors_text":"Gene B. Kim, Larry H. Harper","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-01T18:57:44Z","title":"Is the Symmetric Group Sperner?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00197","kind":"arxiv","version":2},"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:24e703efd47fb6163709e17691e344f08eed69e882c4af7d5a6a05708f44c7ed","target":"record","created_at":"2026-05-17T23:56:57Z","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":"fd0ebf23f1feb144491ee8dc1164e595abd0778954e19f5792475958f472ca99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-01T18:57:44Z","title_canon_sha256":"279304bd2938d3ea78c4d25e6ba89899cad34a093ebf84a7fc2c78fbf700c916"},"schema_version":"1.0","source":{"id":"1901.00197","kind":"arxiv","version":2}},"canonical_sha256":"5989599cc1503ec7a8a113e60fd557cc00b44914643fb1b2e7f4f3d4f216cce5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5989599cc1503ec7a8a113e60fd557cc00b44914643fb1b2e7f4f3d4f216cce5","first_computed_at":"2026-05-17T23:56:57.900913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:57.900913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZJVgtAL9HKM2I98Zep6zxgSAAe45V4dXxm+BXqkbejfC5MBaqDCTS7fAR1zKcX8KjZaG49CyPIt4Fp3Qng5nAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:57.901467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00197","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24e703efd47fb6163709e17691e344f08eed69e882c4af7d5a6a05708f44c7ed","sha256:25cb8484135211361c1c9ed4770df13b4f787c465c81f9ac719f9148249005f3"],"state_sha256":"6e21c52e95aa47ebc8157785e195b07395fbeee5e102f14299fb3d6062bf9984"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5mPnUcMp0fvp/vuWHokhpaGgYRNiP1XH7jtduTDzFQsfUOjLIeB7zmh0UbNdsKPIFscelF5hlDSOaZdHlAuCBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T20:43:44.818890Z","bundle_sha256":"6c72568875c96de30231933a9381fb7decd32bc755268d8bf97a254151cdcd42"}}