{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QBGASPRUTJ3U5XQVUUPWDUC3YT","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":"05cdc18963a009a30037fe78159bb8aa8acd61c4171a78076803101e80923669","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-16T20:18:27Z","title_canon_sha256":"c188f091246e01760745cfd72ed40d1a7aefb62ca5a5356d73bc393e8999cf48"},"schema_version":"1.0","source":{"id":"1801.05471","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05471","created_at":"2026-05-17T23:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05471v3","created_at":"2026-05-17T23:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05471","created_at":"2026-05-17T23:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"QBGASPRUTJ3U","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QBGASPRUTJ3U5XQV","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QBGASPRU","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:5dbf5c249e2dd70736d152ea5dbba61081e60e8b382ce796d4cceb02dd97ea7f","target":"graph","created_at":"2026-05-17T23:58:48Z","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":"We call a family $\\mathcal{F}$ of subsets of $[n]$ $s$-saturated if it contains no $s$ pairwise disjoint sets, and moreover no set can be added to $\\mathcal{F}$ while preserving this property (here $[n] = \\{1,\\ldots,n\\}$).\n  More than 40 years ago, Erd\\H{o}s and Kleitman conjectured that an $s$-saturated family of subsets of $[n]$ has size at least $(1 - 2^{-(s-1)})2^n$. It is easy to show that every $s$-saturated family has size at least $\\frac{1}{2}\\cdot 2^n$, but, as was mentioned by Frankl and Tokushige, even obtaining a slightly better bound of $(1/2 + \\varepsilon)2^n$, for some fixed $\\v","authors_text":"Benny Sudakov, Matija Buci\\'c, Shoham Letzter, Tuan Tran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-16T20:18:27Z","title":"Minimum saturated families of sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05471","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:30e8a6814d0fe61cb9778838198f16ec0fb9c610f29462acf266313f5aef6b02","target":"record","created_at":"2026-05-17T23:58:48Z","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":"05cdc18963a009a30037fe78159bb8aa8acd61c4171a78076803101e80923669","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-16T20:18:27Z","title_canon_sha256":"c188f091246e01760745cfd72ed40d1a7aefb62ca5a5356d73bc393e8999cf48"},"schema_version":"1.0","source":{"id":"1801.05471","kind":"arxiv","version":3}},"canonical_sha256":"804c093e349a774ede15a51f61d05bc4f11998dc115549b46435d94db044a9f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"804c093e349a774ede15a51f61d05bc4f11998dc115549b46435d94db044a9f5","first_computed_at":"2026-05-17T23:58:48.355715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:48.355715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sAyOqXlQuu7RfOySVvtvG5s4pyUCKZwXweUGL0E/JzKo7t9maOigkP58XuqC2xliUbW0mzMKFrPIjkfUBWXzBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:48.356207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05471","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30e8a6814d0fe61cb9778838198f16ec0fb9c610f29462acf266313f5aef6b02","sha256:5dbf5c249e2dd70736d152ea5dbba61081e60e8b382ce796d4cceb02dd97ea7f"],"state_sha256":"e977db57f07abfaae94f62be6f012b02eca99ef9d2b45f64773953ff81b51c73"}