{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KWIRKMD35KU7F57CLAJJCXRTAO","short_pith_number":"pith:KWIRKMD3","canonical_record":{"source":{"id":"1206.3007","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T05:13:34Z","cross_cats_sorted":[],"title_canon_sha256":"d519618c2b323e17ea01b7336b0d2e16b54548bcdc4711ab4e22feb566008a37","abstract_canon_sha256":"00565430e2eea52c2f0c76615964e696259a28f6a43dc2c09dccd29661847392"},"schema_version":"1.0"},"canonical_sha256":"559115307beaa9f2f7e25812915e3303a9c8803f8993e780fbdc92e43336fd2d","source":{"kind":"arxiv","id":"1206.3007","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3007","created_at":"2026-05-18T03:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3007v3","created_at":"2026-05-18T03:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3007","created_at":"2026-05-18T03:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"KWIRKMD35KU7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KWIRKMD35KU7F57C","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KWIRKMD3","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KWIRKMD35KU7F57CLAJJCXRTAO","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3007","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T05:13:34Z","cross_cats_sorted":[],"title_canon_sha256":"d519618c2b323e17ea01b7336b0d2e16b54548bcdc4711ab4e22feb566008a37","abstract_canon_sha256":"00565430e2eea52c2f0c76615964e696259a28f6a43dc2c09dccd29661847392"},"schema_version":"1.0"},"canonical_sha256":"559115307beaa9f2f7e25812915e3303a9c8803f8993e780fbdc92e43336fd2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:30.579493Z","signature_b64":"csoHfdMv+VmdOa/jMokiExnVGPqM8l2YF2Y/bKJTAvmF6uaBL2vDNYqxOWBRAP3na/+abSosTjOYLwF58r0WAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"559115307beaa9f2f7e25812915e3303a9c8803f8993e780fbdc92e43336fd2d","last_reissued_at":"2026-05-18T03:28:30.578833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:30.578833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3007","source_version":3,"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-18T03:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"piU7D5dZXvcDPP0UM1wUpakCzCyy5UVyGZX+g2TGjK16s1L/OAThgR86ErzpitvH1bZkhXLlvSJeAYLq+i0bDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:30:38.300103Z"},"content_sha256":"5b009add43a274afda0391ae8a6ea09ded2b4116d49e051cdcd35ea718a27f4b","schema_version":"1.0","event_id":"sha256:5b009add43a274afda0391ae8a6ea09ded2b4116d49e051cdcd35ea718a27f4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KWIRKMD35KU7F57CLAJJCXRTAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal antichains of minimum size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ian T. Roberts, Thomas Kalinowski, Uwe Leck","submitted_at":"2012-06-14T05:13:34Z","abstract_excerpt":"Let $n\\geqslant 4$ be a natural number, and let $K$ be a set $K\\subseteq [n]:={1,2,...,n}$. We study the problem to find the smallest possible size of a maximal family $\\mathcal{A}$ of subsets of $[n]$ such that $\\mathcal{A}$ contains only sets whose size is in $K$, and $A\\not\\subseteq B$ for all ${A,B}\\subseteq\\mathcal{A}$, i.e. $\\mathcal{A}$ is an antichain. We present a general construction of such antichains for sets $K$ containing 2, but not 1. If $3\\in K$ our construction asymptotically yields the smallest possible size of such a family, up to an $o(n^2)$ error. We conjecture our constru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3007","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"},"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-18T03:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5budaEiFYkLdXVnF7jo/tpsqA6gK3ol7TVcpNPeBTFnvprSXanhrynPAF2PboixjUZVisZVmaUY7eTYlogbrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:30:38.300748Z"},"content_sha256":"daefb820398d8b418c842a6c641f9377c4a094da1b82a1a0aab20661527b3c29","schema_version":"1.0","event_id":"sha256:daefb820398d8b418c842a6c641f9377c4a094da1b82a1a0aab20661527b3c29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWIRKMD35KU7F57CLAJJCXRTAO/bundle.json","state_url":"https://pith.science/pith/KWIRKMD35KU7F57CLAJJCXRTAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWIRKMD35KU7F57CLAJJCXRTAO/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-07T16:30:38Z","links":{"resolver":"https://pith.science/pith/KWIRKMD35KU7F57CLAJJCXRTAO","bundle":"https://pith.science/pith/KWIRKMD35KU7F57CLAJJCXRTAO/bundle.json","state":"https://pith.science/pith/KWIRKMD35KU7F57CLAJJCXRTAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWIRKMD35KU7F57CLAJJCXRTAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KWIRKMD35KU7F57CLAJJCXRTAO","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":"00565430e2eea52c2f0c76615964e696259a28f6a43dc2c09dccd29661847392","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T05:13:34Z","title_canon_sha256":"d519618c2b323e17ea01b7336b0d2e16b54548bcdc4711ab4e22feb566008a37"},"schema_version":"1.0","source":{"id":"1206.3007","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3007","created_at":"2026-05-18T03:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3007v3","created_at":"2026-05-18T03:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3007","created_at":"2026-05-18T03:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"KWIRKMD35KU7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KWIRKMD35KU7F57C","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KWIRKMD3","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:daefb820398d8b418c842a6c641f9377c4a094da1b82a1a0aab20661527b3c29","target":"graph","created_at":"2026-05-18T03:28:30Z","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":"Let $n\\geqslant 4$ be a natural number, and let $K$ be a set $K\\subseteq [n]:={1,2,...,n}$. We study the problem to find the smallest possible size of a maximal family $\\mathcal{A}$ of subsets of $[n]$ such that $\\mathcal{A}$ contains only sets whose size is in $K$, and $A\\not\\subseteq B$ for all ${A,B}\\subseteq\\mathcal{A}$, i.e. $\\mathcal{A}$ is an antichain. We present a general construction of such antichains for sets $K$ containing 2, but not 1. If $3\\in K$ our construction asymptotically yields the smallest possible size of such a family, up to an $o(n^2)$ error. We conjecture our constru","authors_text":"Ian T. Roberts, Thomas Kalinowski, Uwe Leck","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T05:13:34Z","title":"Maximal antichains of minimum size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3007","kind":"arxiv","version":3},"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:5b009add43a274afda0391ae8a6ea09ded2b4116d49e051cdcd35ea718a27f4b","target":"record","created_at":"2026-05-18T03:28:30Z","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":"00565430e2eea52c2f0c76615964e696259a28f6a43dc2c09dccd29661847392","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T05:13:34Z","title_canon_sha256":"d519618c2b323e17ea01b7336b0d2e16b54548bcdc4711ab4e22feb566008a37"},"schema_version":"1.0","source":{"id":"1206.3007","kind":"arxiv","version":3}},"canonical_sha256":"559115307beaa9f2f7e25812915e3303a9c8803f8993e780fbdc92e43336fd2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"559115307beaa9f2f7e25812915e3303a9c8803f8993e780fbdc92e43336fd2d","first_computed_at":"2026-05-18T03:28:30.578833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:30.578833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"csoHfdMv+VmdOa/jMokiExnVGPqM8l2YF2Y/bKJTAvmF6uaBL2vDNYqxOWBRAP3na/+abSosTjOYLwF58r0WAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:30.579493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3007","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b009add43a274afda0391ae8a6ea09ded2b4116d49e051cdcd35ea718a27f4b","sha256:daefb820398d8b418c842a6c641f9377c4a094da1b82a1a0aab20661527b3c29"],"state_sha256":"9b4e609732a36131e4c4e043b2060b7752baa5f4b1ea84e1a3d91a76f8fff9fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y3TF3E39VXWK9uRMEPCb5R33Xi8sJOOz0F1WqbxSJHNVeAnG7TLAXy3fxCbV3lp1DVhnCXZh8CZnDpKkzxAgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:30:38.304720Z","bundle_sha256":"8c2c6e5e11efb0fe36cf0e702db599f4f4cff4adbe597b02b6335c1c09d801bc"}}