{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:CFY2IKIQJV2KFM33Q3QPTC4JTN","short_pith_number":"pith:CFY2IKIQ","schema_version":"1.0","canonical_sha256":"1171a429104d74a2b37b86e0f98b899b7ddcc78233c19efbb1ce6b434da94874","source":{"kind":"arxiv","id":"2211.09055","version":2},"attestation_state":"computed","paper":{"title":"A constant lower bound for the union-closed sets conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Justin Gilmer","submitted_at":"2022-11-16T17:17:42Z","abstract_excerpt":"We show that for any union-closed family $\\mathcal{F} \\subseteq 2^{[n]}, \\mathcal{F} \\neq \\{\\emptyset\\}$, there exists an $i \\in [n]$ which is contained in a $0.01$ fraction of the sets in $\\mathcal{F}$. This is the first known constant lower bound, and improves upon the $\\Omega(\\log_2(|\\mathcal{F}|)^{-1})$ bounds of Knill and W\\'{o}jick. Our result follows from an information theoretic strengthening of the conjecture. Specifically, we show that if $A, B$ are independent samples from a distribution over subsets of $[n]$ such that $Pr[i \\in A] < 0.01$ for all $i$ and $H(A) > 0$, then $H(A \\cup "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2211.09055","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-16T17:17:42Z","cross_cats_sorted":[],"title_canon_sha256":"37cfec0a080cd456b20d1fff20238aca3d0d097f74dd1a929c0348c649248c76","abstract_canon_sha256":"d9917eec784b192a22e6016b833e152494d85c602e19cb73c7540c6671b21c37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:19:56.118307Z","signature_b64":"F7TKiwjs6wgnr8gMHwGL+ENFDxLR+NDB56s2k+ExGb6dOc6WC/vZGrGupwR0WkygdY//9vo3aPBXx4bwYfnBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1171a429104d74a2b37b86e0f98b899b7ddcc78233c19efbb1ce6b434da94874","last_reissued_at":"2026-07-05T05:19:56.117876Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:19:56.117876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A constant lower bound for the union-closed sets conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Justin Gilmer","submitted_at":"2022-11-16T17:17:42Z","abstract_excerpt":"We show that for any union-closed family $\\mathcal{F} \\subseteq 2^{[n]}, \\mathcal{F} \\neq \\{\\emptyset\\}$, there exists an $i \\in [n]$ which is contained in a $0.01$ fraction of the sets in $\\mathcal{F}$. This is the first known constant lower bound, and improves upon the $\\Omega(\\log_2(|\\mathcal{F}|)^{-1})$ bounds of Knill and W\\'{o}jick. Our result follows from an information theoretic strengthening of the conjecture. Specifically, we show that if $A, B$ are independent samples from a distribution over subsets of $[n]$ such that $Pr[i \\in A] < 0.01$ for all $i$ and $H(A) > 0$, then $H(A \\cup "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.09055","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.09055/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2211.09055","created_at":"2026-07-05T05:19:56.117933+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.09055v2","created_at":"2026-07-05T05:19:56.117933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.09055","created_at":"2026-07-05T05:19:56.117933+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFY2IKIQJV2K","created_at":"2026-07-05T05:19:56.117933+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFY2IKIQJV2KFM33","created_at":"2026-07-05T05:19:56.117933+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFY2IKIQ","created_at":"2026-07-05T05:19:56.117933+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.03451","citing_title":"Redundancy Is All You Need (for CSP Sparsification)","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01508","citing_title":"Multiplicative error set system sparsification: A simpler proof via chain length contraction","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CFY2IKIQJV2KFM33Q3QPTC4JTN","json":"https://pith.science/pith/CFY2IKIQJV2KFM33Q3QPTC4JTN.json","graph_json":"https://pith.science/api/pith-number/CFY2IKIQJV2KFM33Q3QPTC4JTN/graph.json","events_json":"https://pith.science/api/pith-number/CFY2IKIQJV2KFM33Q3QPTC4JTN/events.json","paper":"https://pith.science/paper/CFY2IKIQ"},"agent_actions":{"view_html":"https://pith.science/pith/CFY2IKIQJV2KFM33Q3QPTC4JTN","download_json":"https://pith.science/pith/CFY2IKIQJV2KFM33Q3QPTC4JTN.json","view_paper":"https://pith.science/paper/CFY2IKIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.09055&json=true","fetch_graph":"https://pith.science/api/pith-number/CFY2IKIQJV2KFM33Q3QPTC4JTN/graph.json","fetch_events":"https://pith.science/api/pith-number/CFY2IKIQJV2KFM33Q3QPTC4JTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFY2IKIQJV2KFM33Q3QPTC4JTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFY2IKIQJV2KFM33Q3QPTC4JTN/action/storage_attestation","attest_author":"https://pith.science/pith/CFY2IKIQJV2KFM33Q3QPTC4JTN/action/author_attestation","sign_citation":"https://pith.science/pith/CFY2IKIQJV2KFM33Q3QPTC4JTN/action/citation_signature","submit_replication":"https://pith.science/pith/CFY2IKIQJV2KFM33Q3QPTC4JTN/action/replication_record"}},"created_at":"2026-07-05T05:19:56.117933+00:00","updated_at":"2026-07-05T05:19:56.117933+00:00"}