{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BDNVUGKSVJZRICG6BSCUBAOLSJ","short_pith_number":"pith:BDNVUGKS","canonical_record":{"source":{"id":"1411.4196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-15T23:29:39Z","cross_cats_sorted":[],"title_canon_sha256":"a4a299f6212bdafe1b0649ba3505cb26d31d920a637edf8a2fb825dbb16dd2d0","abstract_canon_sha256":"b7b087b4622118e9e0ca6bab49dce35dd1e26d16f0140800d4b2c99b717c79ec"},"schema_version":"1.0"},"canonical_sha256":"08db5a1952aa731408de0c854081cb925ba83b6ae8e6dab80a58aede42fce1f0","source":{"kind":"arxiv","id":"1411.4196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4196","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4196v1","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4196","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"BDNVUGKSVJZR","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BDNVUGKSVJZRICG6","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BDNVUGKS","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BDNVUGKSVJZRICG6BSCUBAOLSJ","target":"record","payload":{"canonical_record":{"source":{"id":"1411.4196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-15T23:29:39Z","cross_cats_sorted":[],"title_canon_sha256":"a4a299f6212bdafe1b0649ba3505cb26d31d920a637edf8a2fb825dbb16dd2d0","abstract_canon_sha256":"b7b087b4622118e9e0ca6bab49dce35dd1e26d16f0140800d4b2c99b717c79ec"},"schema_version":"1.0"},"canonical_sha256":"08db5a1952aa731408de0c854081cb925ba83b6ae8e6dab80a58aede42fce1f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:46.266207Z","signature_b64":"odZ4Wu0LuhlRI7ptv+V+aUOBLu1YvZCVnXZNsfw5xHX9Qzo8S6IFefci7t3psJ+KPQ2hj9VBtEH6Mh9JgGiIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08db5a1952aa731408de0c854081cb925ba83b6ae8e6dab80a58aede42fce1f0","last_reissued_at":"2026-05-18T02:35:46.265794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:46.265794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.4196","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-18T02:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b33gSpZcU9/3vsM19Cxe7K+me6DeQ8SsbF+F7pCk2mYEPAfEGYBo7e1GlM9enzSRMvdG7iIbod+qx8EU75LQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:12:41.539522Z"},"content_sha256":"972d5f4aeb065ceba71fee91caa7aef4c28cb644469591ca106d59e5c85a3bfe","schema_version":"1.0","event_id":"sha256:972d5f4aeb065ceba71fee91caa7aef4c28cb644469591ca106d59e5c85a3bfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BDNVUGKSVJZRICG6BSCUBAOLSJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comparable pairs in families of sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Noga Alon, Roman Glebov, Shagnik Das","submitted_at":"2014-11-15T23:29:39Z","abstract_excerpt":"Given a family $\\mathcal{F}$ of subsets of $[n]$, we say two sets $A, B \\in \\mathcal{F}$ are comparable if $A \\subset B$ or $B \\subset A$. Sperner's celebrated theorem gives the size of the largest family without any comparable pairs. This result was later generalised by Kleitman, who gave the minimum number of comparable pairs appearing in families of a given size.\n  In this paper we study a complementary problem posed by Erd\\H{o}s and Daykin and Frankl in the early '80s. They asked for the maximum number of comparable pairs that can appear in a family of $m$ subsets of $[n]$, a quantity we d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4196","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-18T02:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CaYz1/qUDns+ziANkyFVfVOfUXZB6tOMv67SCPcaLRsGyT7p03eX2CVUkjgfxd1iqNx95dUDTEg6yeb5JYuGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:12:41.540411Z"},"content_sha256":"c18cdc1b5efd0d3f25b28266f82a90bd5b601d2a20c68b206300794af31ef7f4","schema_version":"1.0","event_id":"sha256:c18cdc1b5efd0d3f25b28266f82a90bd5b601d2a20c68b206300794af31ef7f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDNVUGKSVJZRICG6BSCUBAOLSJ/bundle.json","state_url":"https://pith.science/pith/BDNVUGKSVJZRICG6BSCUBAOLSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDNVUGKSVJZRICG6BSCUBAOLSJ/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-30T11:12:41Z","links":{"resolver":"https://pith.science/pith/BDNVUGKSVJZRICG6BSCUBAOLSJ","bundle":"https://pith.science/pith/BDNVUGKSVJZRICG6BSCUBAOLSJ/bundle.json","state":"https://pith.science/pith/BDNVUGKSVJZRICG6BSCUBAOLSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDNVUGKSVJZRICG6BSCUBAOLSJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BDNVUGKSVJZRICG6BSCUBAOLSJ","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":"b7b087b4622118e9e0ca6bab49dce35dd1e26d16f0140800d4b2c99b717c79ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-15T23:29:39Z","title_canon_sha256":"a4a299f6212bdafe1b0649ba3505cb26d31d920a637edf8a2fb825dbb16dd2d0"},"schema_version":"1.0","source":{"id":"1411.4196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4196","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4196v1","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4196","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"BDNVUGKSVJZR","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BDNVUGKSVJZRICG6","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BDNVUGKS","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:c18cdc1b5efd0d3f25b28266f82a90bd5b601d2a20c68b206300794af31ef7f4","target":"graph","created_at":"2026-05-18T02:35:46Z","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":"Given a family $\\mathcal{F}$ of subsets of $[n]$, we say two sets $A, B \\in \\mathcal{F}$ are comparable if $A \\subset B$ or $B \\subset A$. Sperner's celebrated theorem gives the size of the largest family without any comparable pairs. This result was later generalised by Kleitman, who gave the minimum number of comparable pairs appearing in families of a given size.\n  In this paper we study a complementary problem posed by Erd\\H{o}s and Daykin and Frankl in the early '80s. They asked for the maximum number of comparable pairs that can appear in a family of $m$ subsets of $[n]$, a quantity we d","authors_text":"Benny Sudakov, Noga Alon, Roman Glebov, Shagnik Das","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-15T23:29:39Z","title":"Comparable pairs in families of sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4196","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:972d5f4aeb065ceba71fee91caa7aef4c28cb644469591ca106d59e5c85a3bfe","target":"record","created_at":"2026-05-18T02:35:46Z","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":"b7b087b4622118e9e0ca6bab49dce35dd1e26d16f0140800d4b2c99b717c79ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-15T23:29:39Z","title_canon_sha256":"a4a299f6212bdafe1b0649ba3505cb26d31d920a637edf8a2fb825dbb16dd2d0"},"schema_version":"1.0","source":{"id":"1411.4196","kind":"arxiv","version":1}},"canonical_sha256":"08db5a1952aa731408de0c854081cb925ba83b6ae8e6dab80a58aede42fce1f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08db5a1952aa731408de0c854081cb925ba83b6ae8e6dab80a58aede42fce1f0","first_computed_at":"2026-05-18T02:35:46.265794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:46.265794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"odZ4Wu0LuhlRI7ptv+V+aUOBLu1YvZCVnXZNsfw5xHX9Qzo8S6IFefci7t3psJ+KPQ2hj9VBtEH6Mh9JgGiIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:46.266207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:972d5f4aeb065ceba71fee91caa7aef4c28cb644469591ca106d59e5c85a3bfe","sha256:c18cdc1b5efd0d3f25b28266f82a90bd5b601d2a20c68b206300794af31ef7f4"],"state_sha256":"b56385095b9a56a72e7d0331c539d482c62361f63108dcc4b72a26e5cd42d52a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QYDcYaBnoG+xURht+1jt2ydKciz3+EPMWZHaEx27G1J/cOWniCs5VEDsNBTPghBICI11dtr48i2QO6fxBJnTDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:12:41.544397Z","bundle_sha256":"1851dd8d75952aba76c846a69af0d693b96b7e8d58f41f97ce248e8c45fdaf7c"}}