{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JLLZOUIL4NVKIX66Q4JBX4VK3J","short_pith_number":"pith:JLLZOUIL","schema_version":"1.0","canonical_sha256":"4ad797510be36aa45fde87121bf2aada644f5aa0c1e1472b358378387160a61b","source":{"kind":"arxiv","id":"1104.3988","version":1},"attestation_state":"computed","paper":{"title":"Cross-Sperner families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os, Cory Palmer, D\\'aniel Gerbner, Nathan Lemons, Vajk Sz\\'ecsi","submitted_at":"2011-04-20T10:45:18Z","abstract_excerpt":"A pair of families $(\\cF,\\cG)$ is said to be \\emph{cross-Sperner} if there exists no pair of sets $F \\in \\cF, G \\in \\cG$ with $F \\subseteq G$ or $G \\subseteq F$. There are two ways to measure the size of the pair $(\\cF,\\cG)$: with the sum $|\\cF|+|\\cG|$ or with the product $|\\cF|\\cdot |\\cG|$. We show that if $\\cF, \\cG \\subseteq 2^{[n]}$, then $|\\cF||\\cG| \\le 2^{2n-4}$ and $|\\cF|+|\\cG|$ is maximal if $\\cF$ or $\\cG$ consists of exactly one set of size $\\lceil n/2 \\rceil$ provided the size of the ground set $n$ is large enough and both $\\cF$ and $\\cG$ are non-empty."},"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":"1104.3988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-20T10:45:18Z","cross_cats_sorted":[],"title_canon_sha256":"49a408d31c3343db70497a7584b0f3edc01ac73b39f72e27dee9d51a35b01826","abstract_canon_sha256":"3e560642d41ca5969daad14c8d362c57e1eff0fa96e05163f0ebbf9f069af1b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:47.287761Z","signature_b64":"E6MTZYyJaideSxvVZEFJ1hjxJI7/GFMqvFA9c5nxiLblAI4b+sJYvaFKbJJ9D3FlJxd28n40Uv2jN+/IY+Y7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ad797510be36aa45fde87121bf2aada644f5aa0c1e1472b358378387160a61b","last_reissued_at":"2026-05-18T04:23:47.287163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:47.287163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cross-Sperner families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os, Cory Palmer, D\\'aniel Gerbner, Nathan Lemons, Vajk Sz\\'ecsi","submitted_at":"2011-04-20T10:45:18Z","abstract_excerpt":"A pair of families $(\\cF,\\cG)$ is said to be \\emph{cross-Sperner} if there exists no pair of sets $F \\in \\cF, G \\in \\cG$ with $F \\subseteq G$ or $G \\subseteq F$. There are two ways to measure the size of the pair $(\\cF,\\cG)$: with the sum $|\\cF|+|\\cG|$ or with the product $|\\cF|\\cdot |\\cG|$. We show that if $\\cF, \\cG \\subseteq 2^{[n]}$, then $|\\cF||\\cG| \\le 2^{2n-4}$ and $|\\cF|+|\\cG|$ is maximal if $\\cF$ or $\\cG$ consists of exactly one set of size $\\lceil n/2 \\rceil$ provided the size of the ground set $n$ is large enough and both $\\cF$ and $\\cG$ are non-empty."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3988","kind":"arxiv","version":1},"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":"1104.3988","created_at":"2026-05-18T04:23:47.287238+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3988v1","created_at":"2026-05-18T04:23:47.287238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3988","created_at":"2026-05-18T04:23:47.287238+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLLZOUIL4NVK","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLLZOUIL4NVKIX66","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLLZOUIL","created_at":"2026-05-18T12:26:32.869790+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/JLLZOUIL4NVKIX66Q4JBX4VK3J","json":"https://pith.science/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J.json","graph_json":"https://pith.science/api/pith-number/JLLZOUIL4NVKIX66Q4JBX4VK3J/graph.json","events_json":"https://pith.science/api/pith-number/JLLZOUIL4NVKIX66Q4JBX4VK3J/events.json","paper":"https://pith.science/paper/JLLZOUIL"},"agent_actions":{"view_html":"https://pith.science/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J","download_json":"https://pith.science/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J.json","view_paper":"https://pith.science/paper/JLLZOUIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3988&json=true","fetch_graph":"https://pith.science/api/pith-number/JLLZOUIL4NVKIX66Q4JBX4VK3J/graph.json","fetch_events":"https://pith.science/api/pith-number/JLLZOUIL4NVKIX66Q4JBX4VK3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J/action/storage_attestation","attest_author":"https://pith.science/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J/action/author_attestation","sign_citation":"https://pith.science/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J/action/citation_signature","submit_replication":"https://pith.science/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J/action/replication_record"}},"created_at":"2026-05-18T04:23:47.287238+00:00","updated_at":"2026-05-18T04:23:47.287238+00:00"}