{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AG65BQIPJMIFFIXPQC4WW532E3","short_pith_number":"pith:AG65BQIP","schema_version":"1.0","canonical_sha256":"01bdd0c10f4b1052a2ef80b96b777a26e0c8c34c75dc6966d301410745cc84cd","source":{"kind":"arxiv","id":"2109.09925","version":2},"attestation_state":"computed","paper":{"title":"A short note on supersaturation for oddtown and eventown","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jason O'Neill","submitted_at":"2021-09-21T02:57:32Z","abstract_excerpt":"Given a collection $\\mathcal{A}$ of subsets of an $n$ element set, let $\\text{op}(\\mathcal{A})$ denote the number of distinct pairs $A,B \\in \\mathcal{A}$ for which $|A \\cap B|$ is odd. For $s \\in \\{1,2\\}$, we prove $\\text{op}(\\mathcal{A}) \\geq s \\cdot 2^{\\lfloor n/2 \\rfloor-1}$ for any collection $\\mathcal{A}$ of $2^{\\lfloor n/2 \\rfloor}+s$ even-sized subsets of an $n$ element set. We also prove $\\text{op}(\\mathcal{A}) \\geq 3$ for any collection $\\mathcal{A}$ of $n+1$ odd-sized subsets of an $n$ element set that. Moreover, we show that both of these results are best possible. We then consider "},"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":"2109.09925","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-21T02:57:32Z","cross_cats_sorted":[],"title_canon_sha256":"9d8e6a4a639a68bee7b18bf6c044e9e78fef7cb15794995ac3148c6ffa9ec6b0","abstract_canon_sha256":"b5c4e434d07bb5cc7ef9f99d832c25b3e30f6e0552ca7c6db0e5223e2ab35eee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:12:26.292281Z","signature_b64":"bzILaKiAqQPbW9gxIXA77SFPYyGY1tjLoswrCLq+hDhtl/Laswt+KwTge7OjuvURCv4rgS/VnUOmebRWpqLZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01bdd0c10f4b1052a2ef80b96b777a26e0c8c34c75dc6966d301410745cc84cd","last_reissued_at":"2026-07-05T05:12:26.291803Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:12:26.291803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A short note on supersaturation for oddtown and eventown","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jason O'Neill","submitted_at":"2021-09-21T02:57:32Z","abstract_excerpt":"Given a collection $\\mathcal{A}$ of subsets of an $n$ element set, let $\\text{op}(\\mathcal{A})$ denote the number of distinct pairs $A,B \\in \\mathcal{A}$ for which $|A \\cap B|$ is odd. For $s \\in \\{1,2\\}$, we prove $\\text{op}(\\mathcal{A}) \\geq s \\cdot 2^{\\lfloor n/2 \\rfloor-1}$ for any collection $\\mathcal{A}$ of $2^{\\lfloor n/2 \\rfloor}+s$ even-sized subsets of an $n$ element set. We also prove $\\text{op}(\\mathcal{A}) \\geq 3$ for any collection $\\mathcal{A}$ of $n+1$ odd-sized subsets of an $n$ element set that. Moreover, we show that both of these results are best possible. We then consider "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09925","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/2109.09925/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":"2109.09925","created_at":"2026-07-05T05:12:26.291878+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.09925v2","created_at":"2026-07-05T05:12:26.291878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09925","created_at":"2026-07-05T05:12:26.291878+00:00"},{"alias_kind":"pith_short_12","alias_value":"AG65BQIPJMIF","created_at":"2026-07-05T05:12:26.291878+00:00"},{"alias_kind":"pith_short_16","alias_value":"AG65BQIPJMIFFIXP","created_at":"2026-07-05T05:12:26.291878+00:00"},{"alias_kind":"pith_short_8","alias_value":"AG65BQIP","created_at":"2026-07-05T05:12:26.291878+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/AG65BQIPJMIFFIXPQC4WW532E3","json":"https://pith.science/pith/AG65BQIPJMIFFIXPQC4WW532E3.json","graph_json":"https://pith.science/api/pith-number/AG65BQIPJMIFFIXPQC4WW532E3/graph.json","events_json":"https://pith.science/api/pith-number/AG65BQIPJMIFFIXPQC4WW532E3/events.json","paper":"https://pith.science/paper/AG65BQIP"},"agent_actions":{"view_html":"https://pith.science/pith/AG65BQIPJMIFFIXPQC4WW532E3","download_json":"https://pith.science/pith/AG65BQIPJMIFFIXPQC4WW532E3.json","view_paper":"https://pith.science/paper/AG65BQIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.09925&json=true","fetch_graph":"https://pith.science/api/pith-number/AG65BQIPJMIFFIXPQC4WW532E3/graph.json","fetch_events":"https://pith.science/api/pith-number/AG65BQIPJMIFFIXPQC4WW532E3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AG65BQIPJMIFFIXPQC4WW532E3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AG65BQIPJMIFFIXPQC4WW532E3/action/storage_attestation","attest_author":"https://pith.science/pith/AG65BQIPJMIFFIXPQC4WW532E3/action/author_attestation","sign_citation":"https://pith.science/pith/AG65BQIPJMIFFIXPQC4WW532E3/action/citation_signature","submit_replication":"https://pith.science/pith/AG65BQIPJMIFFIXPQC4WW532E3/action/replication_record"}},"created_at":"2026-07-05T05:12:26.291878+00:00","updated_at":"2026-07-05T05:12:26.291878+00:00"}