{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RC7FEN4EQATHHPTHJNPTFGWAUT","short_pith_number":"pith:RC7FEN4E","schema_version":"1.0","canonical_sha256":"88be523784802673be674b5f329ac0a4ff5b42918c2e14059b2a63101d2e29cd","source":{"kind":"arxiv","id":"1208.5371","version":2},"attestation_state":"computed","paper":{"title":"Union-Closed vs Upward-Closed Families of Finite Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emanuele Rodaro","submitted_at":"2012-08-27T12:15:53Z","abstract_excerpt":"A finite family $\\mathrsfs{F}$ of subsets of a finite set $X$ is union-closed whenever $f,g\\in\\mathrsfs{F}$ implies $f\\cup g\\in\\mathrsfs{F}$. These families are well known because of Frankl's conjecture. In this paper we developed further the connection between union-closed families and upward-closed families started in Reimer (2003) using rising operators. With these techniques we are able to obtain tight lower bounds to the average of the length of the elements of $\\mathrsfs{F}$ and to prove that the number of joint-irreducible elements of $\\mathrsfs{F}$ can not exceed $2{n\\choose \\lfloor n/"},"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":"1208.5371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-27T12:15:53Z","cross_cats_sorted":[],"title_canon_sha256":"202055d13ebea46914a13d5c815eb6fe7845c45423086b910fd770002b86a011","abstract_canon_sha256":"f77d6f189b0f1676e697ac70a5b135f48b991366530d485259dc88bbe32aac6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:17.857492Z","signature_b64":"TnGHdVdlL9h9P/aHIgxngpCUPX3M2KVVycY1PDMeOOL0gHbuLxXjNwcEbwe+BAq788Y/8K30+9yN7B0/7vgRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88be523784802673be674b5f329ac0a4ff5b42918c2e14059b2a63101d2e29cd","last_reissued_at":"2026-05-18T03:43:17.856933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:17.856933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Union-Closed vs Upward-Closed Families of Finite Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emanuele Rodaro","submitted_at":"2012-08-27T12:15:53Z","abstract_excerpt":"A finite family $\\mathrsfs{F}$ of subsets of a finite set $X$ is union-closed whenever $f,g\\in\\mathrsfs{F}$ implies $f\\cup g\\in\\mathrsfs{F}$. These families are well known because of Frankl's conjecture. In this paper we developed further the connection between union-closed families and upward-closed families started in Reimer (2003) using rising operators. With these techniques we are able to obtain tight lower bounds to the average of the length of the elements of $\\mathrsfs{F}$ and to prove that the number of joint-irreducible elements of $\\mathrsfs{F}$ can not exceed $2{n\\choose \\lfloor n/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5371","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":""},"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":"1208.5371","created_at":"2026-05-18T03:43:17.857027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.5371v2","created_at":"2026-05-18T03:43:17.857027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5371","created_at":"2026-05-18T03:43:17.857027+00:00"},{"alias_kind":"pith_short_12","alias_value":"RC7FEN4EQATH","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RC7FEN4EQATHHPTH","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RC7FEN4E","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RC7FEN4EQATHHPTHJNPTFGWAUT","json":"https://pith.science/pith/RC7FEN4EQATHHPTHJNPTFGWAUT.json","graph_json":"https://pith.science/api/pith-number/RC7FEN4EQATHHPTHJNPTFGWAUT/graph.json","events_json":"https://pith.science/api/pith-number/RC7FEN4EQATHHPTHJNPTFGWAUT/events.json","paper":"https://pith.science/paper/RC7FEN4E"},"agent_actions":{"view_html":"https://pith.science/pith/RC7FEN4EQATHHPTHJNPTFGWAUT","download_json":"https://pith.science/pith/RC7FEN4EQATHHPTHJNPTFGWAUT.json","view_paper":"https://pith.science/paper/RC7FEN4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.5371&json=true","fetch_graph":"https://pith.science/api/pith-number/RC7FEN4EQATHHPTHJNPTFGWAUT/graph.json","fetch_events":"https://pith.science/api/pith-number/RC7FEN4EQATHHPTHJNPTFGWAUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RC7FEN4EQATHHPTHJNPTFGWAUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RC7FEN4EQATHHPTHJNPTFGWAUT/action/storage_attestation","attest_author":"https://pith.science/pith/RC7FEN4EQATHHPTHJNPTFGWAUT/action/author_attestation","sign_citation":"https://pith.science/pith/RC7FEN4EQATHHPTHJNPTFGWAUT/action/citation_signature","submit_replication":"https://pith.science/pith/RC7FEN4EQATHHPTHJNPTFGWAUT/action/replication_record"}},"created_at":"2026-05-18T03:43:17.857027+00:00","updated_at":"2026-05-18T03:43:17.857027+00:00"}