{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:DBNK35ILG543HQCKA4HDUZ2PBD","short_pith_number":"pith:DBNK35IL","schema_version":"1.0","canonical_sha256":"185aadf50b3779b3c04a070e3a674f08e18b3dce2bdf38951dcf72eaf91f4bfd","source":{"kind":"arxiv","id":"2211.11731","version":4},"attestation_state":"computed","paper":{"title":"Improved Lower Bound for Frankl's Union-Closed Sets Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brice Huang, Mark Sellke, Ryan Alweiss","submitted_at":"2022-11-21T18:53:06Z","abstract_excerpt":"We verify an explicit inequality conjectured recently by Gilmer, thus proving that for any nonempty union-closed family $F \\subseteq 2^{[n]}$, some $i\\in [n]$ is contained in at least a $\\frac{3-\\sqrt{5}}{2} \\approx 0.38$ fraction of the sets in $F$. One case, an explicit one-variable inequality, is checked by computer calculation."},"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.11731","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-21T18:53:06Z","cross_cats_sorted":[],"title_canon_sha256":"078390bbf54c44f5866013083bdfa13c9adfd5249194b79398b0f0a960573192","abstract_canon_sha256":"52a27e938d19035fa52f98603310968061258c505ef4b84c8fb11df5cd9fce14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:51.857783Z","signature_b64":"jCV3ih5CAWgCtFWNjkwJWLpayNenQk6XXBzWAHPHEqDFSGa8y1VEVCxwBWLr1ilbeaun/vdmxMZl3AwdH5uICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"185aadf50b3779b3c04a070e3a674f08e18b3dce2bdf38951dcf72eaf91f4bfd","last_reissued_at":"2026-07-05T08:40:51.857356Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:51.857356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Lower Bound for Frankl's Union-Closed Sets Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brice Huang, Mark Sellke, Ryan Alweiss","submitted_at":"2022-11-21T18:53:06Z","abstract_excerpt":"We verify an explicit inequality conjectured recently by Gilmer, thus proving that for any nonempty union-closed family $F \\subseteq 2^{[n]}$, some $i\\in [n]$ is contained in at least a $\\frac{3-\\sqrt{5}}{2} \\approx 0.38$ fraction of the sets in $F$. One case, an explicit one-variable inequality, is checked by computer calculation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.11731","kind":"arxiv","version":4},"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.11731/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.11731","created_at":"2026-07-05T08:40:51.857414+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.11731v4","created_at":"2026-07-05T08:40:51.857414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.11731","created_at":"2026-07-05T08:40:51.857414+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBNK35ILG543","created_at":"2026-07-05T08:40:51.857414+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBNK35ILG543HQCK","created_at":"2026-07-05T08:40:51.857414+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBNK35IL","created_at":"2026-07-05T08:40:51.857414+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.03451","citing_title":"Redundancy Is All You Need (for CSP Sparsification)","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DBNK35ILG543HQCKA4HDUZ2PBD","json":"https://pith.science/pith/DBNK35ILG543HQCKA4HDUZ2PBD.json","graph_json":"https://pith.science/api/pith-number/DBNK35ILG543HQCKA4HDUZ2PBD/graph.json","events_json":"https://pith.science/api/pith-number/DBNK35ILG543HQCKA4HDUZ2PBD/events.json","paper":"https://pith.science/paper/DBNK35IL"},"agent_actions":{"view_html":"https://pith.science/pith/DBNK35ILG543HQCKA4HDUZ2PBD","download_json":"https://pith.science/pith/DBNK35ILG543HQCKA4HDUZ2PBD.json","view_paper":"https://pith.science/paper/DBNK35IL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.11731&json=true","fetch_graph":"https://pith.science/api/pith-number/DBNK35ILG543HQCKA4HDUZ2PBD/graph.json","fetch_events":"https://pith.science/api/pith-number/DBNK35ILG543HQCKA4HDUZ2PBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBNK35ILG543HQCKA4HDUZ2PBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBNK35ILG543HQCKA4HDUZ2PBD/action/storage_attestation","attest_author":"https://pith.science/pith/DBNK35ILG543HQCKA4HDUZ2PBD/action/author_attestation","sign_citation":"https://pith.science/pith/DBNK35ILG543HQCKA4HDUZ2PBD/action/citation_signature","submit_replication":"https://pith.science/pith/DBNK35ILG543HQCKA4HDUZ2PBD/action/replication_record"}},"created_at":"2026-07-05T08:40:51.857414+00:00","updated_at":"2026-07-05T08:40:51.857414+00:00"}