{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:4JF6HSEM4G7UZPN4E2REG3WBSW","short_pith_number":"pith:4JF6HSEM","schema_version":"1.0","canonical_sha256":"e24be3c88ce1bf4cbdbc26a2436ec195899800dc3b1a22b65872a6a28652a0f0","source":{"kind":"arxiv","id":"2212.09279","version":2},"attestation_state":"computed","paper":{"title":"The number of abundant elements in union-closed families without small sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Kabela, Jakub Teska, Michal Pol\\'ak","submitted_at":"2022-12-19T07:20:41Z","abstract_excerpt":"We let $\\mathcal{F}$ be a finite family of sets closed under taking unions and $\\emptyset \\not \\in \\mathcal{F}$, and call an element abundant if it belongs to more than half of the sets of $\\mathcal{F}$. In this notation, the classical Frankl's conjecture (1979) asserts that $\\mathcal{F}$ has an abundant element. As possible strengthenings, Poonen (1992) conjectured that if $\\mathcal{F}$ has precisely one abundant element, then this element belongs to each set of $\\mathcal{F}$, and Cui and Hu (2019) investigated whether $\\mathcal{F}$ has at least $k$ abundant elements if a smallest set of $\\ma"},"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":"2212.09279","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-19T07:20:41Z","cross_cats_sorted":[],"title_canon_sha256":"0ec762a570fcacc7956881470423688d1f7da4118f9f9ce6803b60e3b44f9330","abstract_canon_sha256":"2807a3362f17cf81525b1398075075637cfc7f25c6d4a700943245863a6fff28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:15:19.999756Z","signature_b64":"kQPNZVZgPm/SKEo0HUxQ/8dJlV+WNLm0dIrCZm+If77LKNKozItN8Q6ntiM7Uy5jZvh8T8OX4DMdRbXkLVMgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e24be3c88ce1bf4cbdbc26a2436ec195899800dc3b1a22b65872a6a28652a0f0","last_reissued_at":"2026-07-05T06:15:19.999188Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:15:19.999188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number of abundant elements in union-closed families without small sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Kabela, Jakub Teska, Michal Pol\\'ak","submitted_at":"2022-12-19T07:20:41Z","abstract_excerpt":"We let $\\mathcal{F}$ be a finite family of sets closed under taking unions and $\\emptyset \\not \\in \\mathcal{F}$, and call an element abundant if it belongs to more than half of the sets of $\\mathcal{F}$. In this notation, the classical Frankl's conjecture (1979) asserts that $\\mathcal{F}$ has an abundant element. As possible strengthenings, Poonen (1992) conjectured that if $\\mathcal{F}$ has precisely one abundant element, then this element belongs to each set of $\\mathcal{F}$, and Cui and Hu (2019) investigated whether $\\mathcal{F}$ has at least $k$ abundant elements if a smallest set of $\\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.09279","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/2212.09279/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":"2212.09279","created_at":"2026-07-05T06:15:19.999261+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.09279v2","created_at":"2026-07-05T06:15:19.999261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09279","created_at":"2026-07-05T06:15:19.999261+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JF6HSEM4G7U","created_at":"2026-07-05T06:15:19.999261+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JF6HSEM4G7UZPN4","created_at":"2026-07-05T06:15:19.999261+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JF6HSEM","created_at":"2026-07-05T06:15:19.999261+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.11008","citing_title":"A lemma on a finite union-closed family of finite sets and its applications","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4JF6HSEM4G7UZPN4E2REG3WBSW","json":"https://pith.science/pith/4JF6HSEM4G7UZPN4E2REG3WBSW.json","graph_json":"https://pith.science/api/pith-number/4JF6HSEM4G7UZPN4E2REG3WBSW/graph.json","events_json":"https://pith.science/api/pith-number/4JF6HSEM4G7UZPN4E2REG3WBSW/events.json","paper":"https://pith.science/paper/4JF6HSEM"},"agent_actions":{"view_html":"https://pith.science/pith/4JF6HSEM4G7UZPN4E2REG3WBSW","download_json":"https://pith.science/pith/4JF6HSEM4G7UZPN4E2REG3WBSW.json","view_paper":"https://pith.science/paper/4JF6HSEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.09279&json=true","fetch_graph":"https://pith.science/api/pith-number/4JF6HSEM4G7UZPN4E2REG3WBSW/graph.json","fetch_events":"https://pith.science/api/pith-number/4JF6HSEM4G7UZPN4E2REG3WBSW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JF6HSEM4G7UZPN4E2REG3WBSW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JF6HSEM4G7UZPN4E2REG3WBSW/action/storage_attestation","attest_author":"https://pith.science/pith/4JF6HSEM4G7UZPN4E2REG3WBSW/action/author_attestation","sign_citation":"https://pith.science/pith/4JF6HSEM4G7UZPN4E2REG3WBSW/action/citation_signature","submit_replication":"https://pith.science/pith/4JF6HSEM4G7UZPN4E2REG3WBSW/action/replication_record"}},"created_at":"2026-07-05T06:15:19.999261+00:00","updated_at":"2026-07-05T06:15:19.999261+00:00"}