{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JLLZOUIL4NVKIX66Q4JBX4VK3J","short_pith_number":"pith:JLLZOUIL","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"},"canonical_sha256":"4ad797510be36aa45fde87121bf2aada644f5aa0c1e1472b358378387160a61b","source":{"kind":"arxiv","id":"1104.3988","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3988","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3988v1","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3988","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"JLLZOUIL4NVK","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JLLZOUIL4NVKIX66","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JLLZOUIL","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JLLZOUIL4NVKIX66Q4JBX4VK3J","target":"record","payload":{"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"},"canonical_sha256":"4ad797510be36aa45fde87121bf2aada644f5aa0c1e1472b358378387160a61b","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"},"source_kind":"arxiv","source_id":"1104.3988","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3gNbkVjk9Eb8lG1GTN+aSuK33PTE5qjX5pTPQ0pWItIeViTkMI9jU1DDW1w2W9RaVcW8HCet7OJQIxM9rOQHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:50:25.193281Z"},"content_sha256":"28e37756b7838ae5cf7e97fbee864d6db5ca03f039e226796495c89909004b74","schema_version":"1.0","event_id":"sha256:28e37756b7838ae5cf7e97fbee864d6db5ca03f039e226796495c89909004b74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JLLZOUIL4NVKIX66Q4JBX4VK3J","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wLsnzd7+TcKKgtI9YnhhCgIEb6UxRTv6YgLlmYp5qIOnsdMfwLsh/AQowWbKhFeA4bYms84Y9k+bOL69KN/DBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:50:25.193880Z"},"content_sha256":"18df1872d2652bf1eb999ad3b43e77a85a2e0d046e3117d247db3ab37cd8a67d","schema_version":"1.0","event_id":"sha256:18df1872d2652bf1eb999ad3b43e77a85a2e0d046e3117d247db3ab37cd8a67d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J/bundle.json","state_url":"https://pith.science/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T08:50:25Z","links":{"resolver":"https://pith.science/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J","bundle":"https://pith.science/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J/bundle.json","state":"https://pith.science/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLLZOUIL4NVKIX66Q4JBX4VK3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JLLZOUIL4NVKIX66Q4JBX4VK3J","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3e560642d41ca5969daad14c8d362c57e1eff0fa96e05163f0ebbf9f069af1b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-20T10:45:18Z","title_canon_sha256":"49a408d31c3343db70497a7584b0f3edc01ac73b39f72e27dee9d51a35b01826"},"schema_version":"1.0","source":{"id":"1104.3988","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3988","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3988v1","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3988","created_at":"2026-05-18T04:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"JLLZOUIL4NVK","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JLLZOUIL4NVKIX66","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JLLZOUIL","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:18df1872d2652bf1eb999ad3b43e77a85a2e0d046e3117d247db3ab37cd8a67d","target":"graph","created_at":"2026-05-18T04:23:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Bal\\'azs Patk\\'os, Cory Palmer, D\\'aniel Gerbner, Nathan Lemons, Vajk Sz\\'ecsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-20T10:45:18Z","title":"Cross-Sperner families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3988","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:28e37756b7838ae5cf7e97fbee864d6db5ca03f039e226796495c89909004b74","target":"record","created_at":"2026-05-18T04:23:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3e560642d41ca5969daad14c8d362c57e1eff0fa96e05163f0ebbf9f069af1b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-20T10:45:18Z","title_canon_sha256":"49a408d31c3343db70497a7584b0f3edc01ac73b39f72e27dee9d51a35b01826"},"schema_version":"1.0","source":{"id":"1104.3988","kind":"arxiv","version":1}},"canonical_sha256":"4ad797510be36aa45fde87121bf2aada644f5aa0c1e1472b358378387160a61b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ad797510be36aa45fde87121bf2aada644f5aa0c1e1472b358378387160a61b","first_computed_at":"2026-05-18T04:23:47.287163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:47.287163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E6MTZYyJaideSxvVZEFJ1hjxJI7/GFMqvFA9c5nxiLblAI4b+sJYvaFKbJJ9D3FlJxd28n40Uv2jN+/IY+Y7DA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:47.287761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3988","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28e37756b7838ae5cf7e97fbee864d6db5ca03f039e226796495c89909004b74","sha256:18df1872d2652bf1eb999ad3b43e77a85a2e0d046e3117d247db3ab37cd8a67d"],"state_sha256":"9a991d8a8a83f4717a0ed17ab11dcdbe45f62dedd99c9b61f8abbe8257de9f5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ndOR7mIVX9Ec6FMGXxY3uMCNBsii+Vz9JsIvfGDtJq8W5Z9Brh0KhWK1KVHYIQ5x61fkQ4WrsrPiO0j21Gp9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T08:50:25.197222Z","bundle_sha256":"d65632c847985a1ef361d25b41078568e55b2c0ef2f628f61c6438b3944f3380"}}