{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AIFLI4H5Q3TMCXBETPJ2PSXOGI","short_pith_number":"pith:AIFLI4H5","canonical_record":{"source":{"id":"1708.02436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-08T10:09:42Z","cross_cats_sorted":[],"title_canon_sha256":"1ece5fb9da49a0e095b16c53de269514bb7d3f24419ba9aa20bd632b3098b467","abstract_canon_sha256":"d99bbc55eff25cc2fc74f0f36e68da6e4de37a221a21bab1171a7f44f9cfdbd5"},"schema_version":"1.0"},"canonical_sha256":"020ab470fd86e6c15c249bd3a7caee323a6801f5fa186b728040e286978d1a4f","source":{"kind":"arxiv","id":"1708.02436","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02436","created_at":"2026-05-18T00:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02436v1","created_at":"2026-05-18T00:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02436","created_at":"2026-05-18T00:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"AIFLI4H5Q3TM","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIFLI4H5Q3TMCXBE","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIFLI4H5","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AIFLI4H5Q3TMCXBETPJ2PSXOGI","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-08T10:09:42Z","cross_cats_sorted":[],"title_canon_sha256":"1ece5fb9da49a0e095b16c53de269514bb7d3f24419ba9aa20bd632b3098b467","abstract_canon_sha256":"d99bbc55eff25cc2fc74f0f36e68da6e4de37a221a21bab1171a7f44f9cfdbd5"},"schema_version":"1.0"},"canonical_sha256":"020ab470fd86e6c15c249bd3a7caee323a6801f5fa186b728040e286978d1a4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:24.277581Z","signature_b64":"Ka5lZUxn1FUYQcWnrEEEKgcc029Nidg0M4xfLJs6OvJkHR3J0dXlOj3oUIDvAVekhRZUEfNJsb0QdzpxwEb5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"020ab470fd86e6c15c249bd3a7caee323a6801f5fa186b728040e286978d1a4f","last_reissued_at":"2026-05-18T00:38:24.276824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:24.276824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02436","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-18T00:38:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSkHZXlpY31+CTmoawSo59ZRAk5JE2FxYJgVWvLa+3uQV7hDvr6oSLAO1yxiTC8cCVsEVLfeAO62Ej8OF45oDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T11:19:37.219058Z"},"content_sha256":"0e56f444fbe6f5889b92f3198160f3cea98291ec4147f452e2137266fe2df70a","schema_version":"1.0","event_id":"sha256:0e56f444fbe6f5889b92f3198160f3cea98291ec4147f452e2137266fe2df70a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AIFLI4H5Q3TMCXBETPJ2PSXOGI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subsets of posets minimising the number of chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wojciech Samotij","submitted_at":"2017-08-08T10:09:42Z","abstract_excerpt":"A well-known theorem of Sperner describes the largest collections of subsets of an $n$-element set none of which contains another set from the collection. Generalising this result, Erd\\H{o}s characterised the largest families of subsets of an $n$-element set that do not contain a chain of sets $A_1 \\subset \\dotsc \\subset A_k$ of an arbitrary length $k$. The extremal families contain all subsets whose cardinalities belong to an interval of length $k-1$ centred at $n/2$. In a far-reaching extension of Sperner's theorem, Kleitman determined the smallest number of chains of length two that have to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02436","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-18T00:38:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jMAd38i1tGypgKhHZXLfBGNA2GSje1byfSx7rSsnZt0xwavWMaxwZwizlzaVsDceQqp1Pe/XWE0d6ynSuMPvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T11:19:37.219439Z"},"content_sha256":"93b53241b48a774523e02b7c752c51861f08e6e6cb11c0c9fe04425e568cb53b","schema_version":"1.0","event_id":"sha256:93b53241b48a774523e02b7c752c51861f08e6e6cb11c0c9fe04425e568cb53b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIFLI4H5Q3TMCXBETPJ2PSXOGI/bundle.json","state_url":"https://pith.science/pith/AIFLI4H5Q3TMCXBETPJ2PSXOGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIFLI4H5Q3TMCXBETPJ2PSXOGI/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-05-20T11:19:37Z","links":{"resolver":"https://pith.science/pith/AIFLI4H5Q3TMCXBETPJ2PSXOGI","bundle":"https://pith.science/pith/AIFLI4H5Q3TMCXBETPJ2PSXOGI/bundle.json","state":"https://pith.science/pith/AIFLI4H5Q3TMCXBETPJ2PSXOGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIFLI4H5Q3TMCXBETPJ2PSXOGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AIFLI4H5Q3TMCXBETPJ2PSXOGI","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":"d99bbc55eff25cc2fc74f0f36e68da6e4de37a221a21bab1171a7f44f9cfdbd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-08T10:09:42Z","title_canon_sha256":"1ece5fb9da49a0e095b16c53de269514bb7d3f24419ba9aa20bd632b3098b467"},"schema_version":"1.0","source":{"id":"1708.02436","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02436","created_at":"2026-05-18T00:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02436v1","created_at":"2026-05-18T00:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02436","created_at":"2026-05-18T00:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"AIFLI4H5Q3TM","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIFLI4H5Q3TMCXBE","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIFLI4H5","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:93b53241b48a774523e02b7c752c51861f08e6e6cb11c0c9fe04425e568cb53b","target":"graph","created_at":"2026-05-18T00:38:24Z","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":"A well-known theorem of Sperner describes the largest collections of subsets of an $n$-element set none of which contains another set from the collection. Generalising this result, Erd\\H{o}s characterised the largest families of subsets of an $n$-element set that do not contain a chain of sets $A_1 \\subset \\dotsc \\subset A_k$ of an arbitrary length $k$. The extremal families contain all subsets whose cardinalities belong to an interval of length $k-1$ centred at $n/2$. In a far-reaching extension of Sperner's theorem, Kleitman determined the smallest number of chains of length two that have to","authors_text":"Wojciech Samotij","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-08T10:09:42Z","title":"Subsets of posets minimising the number of chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02436","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:0e56f444fbe6f5889b92f3198160f3cea98291ec4147f452e2137266fe2df70a","target":"record","created_at":"2026-05-18T00:38:24Z","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":"d99bbc55eff25cc2fc74f0f36e68da6e4de37a221a21bab1171a7f44f9cfdbd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-08T10:09:42Z","title_canon_sha256":"1ece5fb9da49a0e095b16c53de269514bb7d3f24419ba9aa20bd632b3098b467"},"schema_version":"1.0","source":{"id":"1708.02436","kind":"arxiv","version":1}},"canonical_sha256":"020ab470fd86e6c15c249bd3a7caee323a6801f5fa186b728040e286978d1a4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"020ab470fd86e6c15c249bd3a7caee323a6801f5fa186b728040e286978d1a4f","first_computed_at":"2026-05-18T00:38:24.276824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:24.276824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ka5lZUxn1FUYQcWnrEEEKgcc029Nidg0M4xfLJs6OvJkHR3J0dXlOj3oUIDvAVekhRZUEfNJsb0QdzpxwEb5CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:24.277581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02436","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e56f444fbe6f5889b92f3198160f3cea98291ec4147f452e2137266fe2df70a","sha256:93b53241b48a774523e02b7c752c51861f08e6e6cb11c0c9fe04425e568cb53b"],"state_sha256":"7c7d73e6eff6b23c4569670d4e753343383469304af4ce35f5a3c025e7951b26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KtLZPzOkS/iwMT5KIaF9MGZ7116hqlq3BECHooyU7ntAgCMTInA6/142LA49hKsR7HDlevn5KQnRruG7nfAHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T11:19:37.221350Z","bundle_sha256":"0e8caee7f290199cb28c26e664f7ab36a52a1f53dcaef40ea9fe2a73bb56f183"}}