{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EW2OWHRMWOR2WSQOMSCVXIBL2A","short_pith_number":"pith:EW2OWHRM","schema_version":"1.0","canonical_sha256":"25b4eb1e2cb3a3ab4a0e64855ba02bd012fc5f0b2c7334dbc562aa0e91c3657c","source":{"kind":"arxiv","id":"2408.08221","version":1},"attestation_state":"computed","paper":{"title":"Intersection problems and a correlation inequality for integer sequences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Peter Frankl","submitted_at":"2024-08-15T15:36:55Z","abstract_excerpt":"Let us consider a collection $\\mathcal G$ of codewords of length $n$ over an alphabet of size $s$. Let $t_1,\\ldots, t_s$ be nonnegative integers. What is the maximum of $|\\mathcal G|$ subject to the condition that any two codewords should have at least $t_i$ positions where both have letter $i$ ($1\\le i\\le s$). In the case $s=2$ it is a longstanding open question. Quite surprisingly, we obtain an almost complete answer for $s\\ge 3$. The main tool is a correlation inequality."},"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":"2408.08221","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-15T15:36:55Z","cross_cats_sorted":[],"title_canon_sha256":"ba4f26a9e374bfa7265788a2360c64582d5785990d9fe9e513b3bb6c7c157e48","abstract_canon_sha256":"c7a5f687545253dd2d2647f87c55a1db248471eca1341570bcf032b6b4c7b8a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:55:46.057738Z","signature_b64":"hN6cYn8F7M27Cfgkes0/EVD9SiPHvqMSdj2mQAloQbL+/d3uCGAx8JdOA4Cye5YdLbW+OUiGcMtDiI0yCbOADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25b4eb1e2cb3a3ab4a0e64855ba02bd012fc5f0b2c7334dbc562aa0e91c3657c","last_reissued_at":"2026-07-05T08:55:46.057276Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:55:46.057276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intersection problems and a correlation inequality for integer sequences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Peter Frankl","submitted_at":"2024-08-15T15:36:55Z","abstract_excerpt":"Let us consider a collection $\\mathcal G$ of codewords of length $n$ over an alphabet of size $s$. Let $t_1,\\ldots, t_s$ be nonnegative integers. What is the maximum of $|\\mathcal G|$ subject to the condition that any two codewords should have at least $t_i$ positions where both have letter $i$ ($1\\le i\\le s$). In the case $s=2$ it is a longstanding open question. Quite surprisingly, we obtain an almost complete answer for $s\\ge 3$. The main tool is a correlation inequality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08221","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/2408.08221/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":"2408.08221","created_at":"2026-07-05T08:55:46.057351+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.08221v1","created_at":"2026-07-05T08:55:46.057351+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08221","created_at":"2026-07-05T08:55:46.057351+00:00"},{"alias_kind":"pith_short_12","alias_value":"EW2OWHRMWOR2","created_at":"2026-07-05T08:55:46.057351+00:00"},{"alias_kind":"pith_short_16","alias_value":"EW2OWHRMWOR2WSQO","created_at":"2026-07-05T08:55:46.057351+00:00"},{"alias_kind":"pith_short_8","alias_value":"EW2OWHRM","created_at":"2026-07-05T08:55:46.057351+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/EW2OWHRMWOR2WSQOMSCVXIBL2A","json":"https://pith.science/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A.json","graph_json":"https://pith.science/api/pith-number/EW2OWHRMWOR2WSQOMSCVXIBL2A/graph.json","events_json":"https://pith.science/api/pith-number/EW2OWHRMWOR2WSQOMSCVXIBL2A/events.json","paper":"https://pith.science/paper/EW2OWHRM"},"agent_actions":{"view_html":"https://pith.science/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A","download_json":"https://pith.science/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A.json","view_paper":"https://pith.science/paper/EW2OWHRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.08221&json=true","fetch_graph":"https://pith.science/api/pith-number/EW2OWHRMWOR2WSQOMSCVXIBL2A/graph.json","fetch_events":"https://pith.science/api/pith-number/EW2OWHRMWOR2WSQOMSCVXIBL2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A/action/storage_attestation","attest_author":"https://pith.science/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A/action/author_attestation","sign_citation":"https://pith.science/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A/action/citation_signature","submit_replication":"https://pith.science/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A/action/replication_record"}},"created_at":"2026-07-05T08:55:46.057351+00:00","updated_at":"2026-07-05T08:55:46.057351+00:00"}