{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QKVRSPYQLSZVQUKM7BO7EK6AU7","short_pith_number":"pith:QKVRSPYQ","canonical_record":{"source":{"id":"2506.05704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-06T03:08:43Z","cross_cats_sorted":[],"title_canon_sha256":"deb6fce32f4a6f8aea47642b58cc975c17903f2159ba74318446a2636c496306","abstract_canon_sha256":"6b7e624fb08e6c7a7f6672c7b3a0cea3c38c7e42d7ccce236604efea3077618e"},"schema_version":"1.0"},"canonical_sha256":"82ab193f105cb358514cf85df22bc0a7eee463f1e5bc5e990a38981b10f4a0a4","source":{"kind":"arxiv","id":"2506.05704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05704","created_at":"2026-07-05T11:17:08Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05704v1","created_at":"2026-07-05T11:17:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05704","created_at":"2026-07-05T11:17:08Z"},{"alias_kind":"pith_short_12","alias_value":"QKVRSPYQLSZV","created_at":"2026-07-05T11:17:08Z"},{"alias_kind":"pith_short_16","alias_value":"QKVRSPYQLSZVQUKM","created_at":"2026-07-05T11:17:08Z"},{"alias_kind":"pith_short_8","alias_value":"QKVRSPYQ","created_at":"2026-07-05T11:17:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QKVRSPYQLSZVQUKM7BO7EK6AU7","target":"record","payload":{"canonical_record":{"source":{"id":"2506.05704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-06T03:08:43Z","cross_cats_sorted":[],"title_canon_sha256":"deb6fce32f4a6f8aea47642b58cc975c17903f2159ba74318446a2636c496306","abstract_canon_sha256":"6b7e624fb08e6c7a7f6672c7b3a0cea3c38c7e42d7ccce236604efea3077618e"},"schema_version":"1.0"},"canonical_sha256":"82ab193f105cb358514cf85df22bc0a7eee463f1e5bc5e990a38981b10f4a0a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:08.337992Z","signature_b64":"NSJFS15A6BoJfFRjA/H/xgL3Zn33SWMfb77DprKfwQgjKwTKHDwldbKq9rD5GHArhnrL5TayhxlBCT3ahoRdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82ab193f105cb358514cf85df22bc0a7eee463f1e5bc5e990a38981b10f4a0a4","last_reissued_at":"2026-07-05T11:17:08.337415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:08.337415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.05704","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-07-05T11:17:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3vzAYtZZMm7emhTGWPvpkCiiRFfcbMKfwFORa86CdyoV6ogJqr+2k3e2PanmdOYv072h1/DBTicXF2DgseOcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:39:11.109945Z"},"content_sha256":"b706dc9e7d3c94709c6271a281d435c87e31009e0eb747014957b47c9ec7dbc6","schema_version":"1.0","event_id":"sha256:b706dc9e7d3c94709c6271a281d435c87e31009e0eb747014957b47c9ec7dbc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QKVRSPYQLSZVQUKM7BO7EK6AU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The overflow in the Katona Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Peter Frankl","submitted_at":"2025-06-06T03:08:43Z","abstract_excerpt":"Let $n>2r>0$ be integers. We consider families $\\mathcal{F}$ of subsets of an $n$-element set, in which the union of any two members has size at most $2r$. One of our results states that for $n\\geq 6r$ the number of members of size exceeding $r$ in $\\mathcal{F}$ is at most $\\binom{n-2}{r-1}$. Another result shows that for $n>3.5r$ the number of sets of size at least $r$ is at most $\\binom{n}{r}$. Both bounds are best possible and the latter sharpens the classical Katona Theorem. Similar results are proved for the odd case of the Katona Theorem as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05704","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.05704/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"},"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-07-05T11:17:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUE9dQ8ErukF7nZcU9GJHI+NwWEzwLn2flvovZSpubUYBF2RGpg7re/rcUY5odHvZ9jWKNiGNqWj0W+lJxEfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:39:11.110444Z"},"content_sha256":"0cf0e8d0f1becd7b15054533dab5b8d8f2b3d4aabe50bf33735c402f549bfa43","schema_version":"1.0","event_id":"sha256:0cf0e8d0f1becd7b15054533dab5b8d8f2b3d4aabe50bf33735c402f549bfa43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QKVRSPYQLSZVQUKM7BO7EK6AU7/bundle.json","state_url":"https://pith.science/pith/QKVRSPYQLSZVQUKM7BO7EK6AU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QKVRSPYQLSZVQUKM7BO7EK6AU7/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-08-03T20:39:11Z","links":{"resolver":"https://pith.science/pith/QKVRSPYQLSZVQUKM7BO7EK6AU7","bundle":"https://pith.science/pith/QKVRSPYQLSZVQUKM7BO7EK6AU7/bundle.json","state":"https://pith.science/pith/QKVRSPYQLSZVQUKM7BO7EK6AU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QKVRSPYQLSZVQUKM7BO7EK6AU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QKVRSPYQLSZVQUKM7BO7EK6AU7","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":"6b7e624fb08e6c7a7f6672c7b3a0cea3c38c7e42d7ccce236604efea3077618e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-06T03:08:43Z","title_canon_sha256":"deb6fce32f4a6f8aea47642b58cc975c17903f2159ba74318446a2636c496306"},"schema_version":"1.0","source":{"id":"2506.05704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05704","created_at":"2026-07-05T11:17:08Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05704v1","created_at":"2026-07-05T11:17:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05704","created_at":"2026-07-05T11:17:08Z"},{"alias_kind":"pith_short_12","alias_value":"QKVRSPYQLSZV","created_at":"2026-07-05T11:17:08Z"},{"alias_kind":"pith_short_16","alias_value":"QKVRSPYQLSZVQUKM","created_at":"2026-07-05T11:17:08Z"},{"alias_kind":"pith_short_8","alias_value":"QKVRSPYQ","created_at":"2026-07-05T11:17:08Z"}],"graph_snapshots":[{"event_id":"sha256:0cf0e8d0f1becd7b15054533dab5b8d8f2b3d4aabe50bf33735c402f549bfa43","target":"graph","created_at":"2026-07-05T11:17:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.05704/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $n>2r>0$ be integers. We consider families $\\mathcal{F}$ of subsets of an $n$-element set, in which the union of any two members has size at most $2r$. One of our results states that for $n\\geq 6r$ the number of members of size exceeding $r$ in $\\mathcal{F}$ is at most $\\binom{n-2}{r-1}$. Another result shows that for $n>3.5r$ the number of sets of size at least $r$ is at most $\\binom{n}{r}$. Both bounds are best possible and the latter sharpens the classical Katona Theorem. Similar results are proved for the odd case of the Katona Theorem as well.","authors_text":"Jian Wang, Peter Frankl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-06T03:08:43Z","title":"The overflow in the Katona Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05704","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:b706dc9e7d3c94709c6271a281d435c87e31009e0eb747014957b47c9ec7dbc6","target":"record","created_at":"2026-07-05T11:17:08Z","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":"6b7e624fb08e6c7a7f6672c7b3a0cea3c38c7e42d7ccce236604efea3077618e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-06T03:08:43Z","title_canon_sha256":"deb6fce32f4a6f8aea47642b58cc975c17903f2159ba74318446a2636c496306"},"schema_version":"1.0","source":{"id":"2506.05704","kind":"arxiv","version":1}},"canonical_sha256":"82ab193f105cb358514cf85df22bc0a7eee463f1e5bc5e990a38981b10f4a0a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82ab193f105cb358514cf85df22bc0a7eee463f1e5bc5e990a38981b10f4a0a4","first_computed_at":"2026-07-05T11:17:08.337415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:17:08.337415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NSJFS15A6BoJfFRjA/H/xgL3Zn33SWMfb77DprKfwQgjKwTKHDwldbKq9rD5GHArhnrL5TayhxlBCT3ahoRdBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:17:08.337992Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.05704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b706dc9e7d3c94709c6271a281d435c87e31009e0eb747014957b47c9ec7dbc6","sha256:0cf0e8d0f1becd7b15054533dab5b8d8f2b3d4aabe50bf33735c402f549bfa43"],"state_sha256":"68e7535b3684723c4dd2c0a551a722808aa9aa5b386270382b1915e70c4ba688"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGDt/Nj5IVX9ykutuU/B3NDETqp+R1OA6KYyLJsxm4QfTVJ3Olnf7JkLrcWFZcrcDqhygyM8WflvU+/QT/BZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T20:39:11.115632Z","bundle_sha256":"f7e586ce608d9f57d39dfc4c0726ad2ba4588bc9da90b741017fbeec05148f1a"}}