{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:X2FZDF6BPPV4NOFCE6WZ62WDTD","short_pith_number":"pith:X2FZDF6B","schema_version":"1.0","canonical_sha256":"be8b9197c17bebc6b8a227ad9f6ac398fb3b12352cbdd81cc534e2f2b02c6811","source":{"kind":"arxiv","id":"1610.07907","version":1},"attestation_state":"computed","paper":{"title":"Two remarks on even and oddtown problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Pedro Vieira","submitted_at":"2016-10-25T14:57:37Z","abstract_excerpt":"A family $\\mathcal A$ of subsets of an $n$-element set is called an eventown (resp. oddtown) if all its sets have even (resp. odd) size and all pairwise intersections have even size. Using tools from linear algebra, it was shown by Berlekamp and Graver that the maximum size of an eventown is $2^{\\left\\lfloor n/2\\right\\rfloor}$. On the other hand (somewhat surprisingly), it was proven by Berlekamp, that oddtowns have size at most $n$. Over the last four decades, many extensions of this even/oddtown problem have been studied. In this paper we present new results on two such extensions. First, ex"},"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":"1610.07907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-25T14:57:37Z","cross_cats_sorted":[],"title_canon_sha256":"58257a3a29f157c00ef71c5e442710195ea05b34d77289784e6b99ea7594f44b","abstract_canon_sha256":"0c9acb310dfa4c1e4be45409ff3d65a5ce1fb5d5de2662c6a6e7ce301ff26660"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:17.233243Z","signature_b64":"QdcEUwKcUL1W+/vxS4bRy/KCNpdgF8cBZSTGW/mwuHlc3b6pp0IjwDlyU091mmH8rACPXKGmgTJEVZ+EWSL5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be8b9197c17bebc6b8a227ad9f6ac398fb3b12352cbdd81cc534e2f2b02c6811","last_reissued_at":"2026-05-18T01:01:17.232659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:17.232659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two remarks on even and oddtown problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Pedro Vieira","submitted_at":"2016-10-25T14:57:37Z","abstract_excerpt":"A family $\\mathcal A$ of subsets of an $n$-element set is called an eventown (resp. oddtown) if all its sets have even (resp. odd) size and all pairwise intersections have even size. Using tools from linear algebra, it was shown by Berlekamp and Graver that the maximum size of an eventown is $2^{\\left\\lfloor n/2\\right\\rfloor}$. On the other hand (somewhat surprisingly), it was proven by Berlekamp, that oddtowns have size at most $n$. Over the last four decades, many extensions of this even/oddtown problem have been studied. In this paper we present new results on two such extensions. First, ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07907","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":"1610.07907","created_at":"2026-05-18T01:01:17.232745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.07907v1","created_at":"2026-05-18T01:01:17.232745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07907","created_at":"2026-05-18T01:01:17.232745+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2FZDF6BPPV4","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2FZDF6BPPV4NOFC","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2FZDF6B","created_at":"2026-05-18T12:30:51.357362+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/X2FZDF6BPPV4NOFCE6WZ62WDTD","json":"https://pith.science/pith/X2FZDF6BPPV4NOFCE6WZ62WDTD.json","graph_json":"https://pith.science/api/pith-number/X2FZDF6BPPV4NOFCE6WZ62WDTD/graph.json","events_json":"https://pith.science/api/pith-number/X2FZDF6BPPV4NOFCE6WZ62WDTD/events.json","paper":"https://pith.science/paper/X2FZDF6B"},"agent_actions":{"view_html":"https://pith.science/pith/X2FZDF6BPPV4NOFCE6WZ62WDTD","download_json":"https://pith.science/pith/X2FZDF6BPPV4NOFCE6WZ62WDTD.json","view_paper":"https://pith.science/paper/X2FZDF6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.07907&json=true","fetch_graph":"https://pith.science/api/pith-number/X2FZDF6BPPV4NOFCE6WZ62WDTD/graph.json","fetch_events":"https://pith.science/api/pith-number/X2FZDF6BPPV4NOFCE6WZ62WDTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2FZDF6BPPV4NOFCE6WZ62WDTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2FZDF6BPPV4NOFCE6WZ62WDTD/action/storage_attestation","attest_author":"https://pith.science/pith/X2FZDF6BPPV4NOFCE6WZ62WDTD/action/author_attestation","sign_citation":"https://pith.science/pith/X2FZDF6BPPV4NOFCE6WZ62WDTD/action/citation_signature","submit_replication":"https://pith.science/pith/X2FZDF6BPPV4NOFCE6WZ62WDTD/action/replication_record"}},"created_at":"2026-05-18T01:01:17.232745+00:00","updated_at":"2026-05-18T01:01:17.232745+00:00"}