{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:EW2OWHRMWOR2WSQOMSCVXIBL2A","short_pith_number":"pith:EW2OWHRM","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"},"canonical_sha256":"25b4eb1e2cb3a3ab4a0e64855ba02bd012fc5f0b2c7334dbc562aa0e91c3657c","source":{"kind":"arxiv","id":"2408.08221","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.08221","created_at":"2026-07-05T08:55:46Z"},{"alias_kind":"arxiv_version","alias_value":"2408.08221v1","created_at":"2026-07-05T08:55:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08221","created_at":"2026-07-05T08:55:46Z"},{"alias_kind":"pith_short_12","alias_value":"EW2OWHRMWOR2","created_at":"2026-07-05T08:55:46Z"},{"alias_kind":"pith_short_16","alias_value":"EW2OWHRMWOR2WSQO","created_at":"2026-07-05T08:55:46Z"},{"alias_kind":"pith_short_8","alias_value":"EW2OWHRM","created_at":"2026-07-05T08:55:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:EW2OWHRMWOR2WSQOMSCVXIBL2A","target":"record","payload":{"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"},"canonical_sha256":"25b4eb1e2cb3a3ab4a0e64855ba02bd012fc5f0b2c7334dbc562aa0e91c3657c","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"},"source_kind":"arxiv","source_id":"2408.08221","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-05T08:55:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PFknvGJ4l5DuW4aiwLU40gCwHEab7ZRPO5Hv9EiTJQ/yp5rFXseH6UD9Tkgv41rJ6w2R4/QYvANIEzFTxh2CAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:28:39.253192Z"},"content_sha256":"98ff0353c4d90e5bf1e575197be7fe8a7a85df957e54494f4815367bd2fcba33","schema_version":"1.0","event_id":"sha256:98ff0353c4d90e5bf1e575197be7fe8a7a85df957e54494f4815367bd2fcba33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:EW2OWHRMWOR2WSQOMSCVXIBL2A","target":"graph","payload":{"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"},"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-05T08:55:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UeeYWE3VIKaT+n0Kab0zgNKhAGBj+UQMAxXeVoBGQbdjjruTYEG57waL7co7kpWaNXsYVnTiZ1ES+zsPWdzuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:28:39.253577Z"},"content_sha256":"9a90ed2798a426e307702e7341b85c2d98b1c732b6d7f6898529026daaad7552","schema_version":"1.0","event_id":"sha256:9a90ed2798a426e307702e7341b85c2d98b1c732b6d7f6898529026daaad7552"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A/bundle.json","state_url":"https://pith.science/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A/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-07-07T11:28:39Z","links":{"resolver":"https://pith.science/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A","bundle":"https://pith.science/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A/bundle.json","state":"https://pith.science/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EW2OWHRMWOR2WSQOMSCVXIBL2A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:EW2OWHRMWOR2WSQOMSCVXIBL2A","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":"c7a5f687545253dd2d2647f87c55a1db248471eca1341570bcf032b6b4c7b8a2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-15T15:36:55Z","title_canon_sha256":"ba4f26a9e374bfa7265788a2360c64582d5785990d9fe9e513b3bb6c7c157e48"},"schema_version":"1.0","source":{"id":"2408.08221","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.08221","created_at":"2026-07-05T08:55:46Z"},{"alias_kind":"arxiv_version","alias_value":"2408.08221v1","created_at":"2026-07-05T08:55:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08221","created_at":"2026-07-05T08:55:46Z"},{"alias_kind":"pith_short_12","alias_value":"EW2OWHRMWOR2","created_at":"2026-07-05T08:55:46Z"},{"alias_kind":"pith_short_16","alias_value":"EW2OWHRMWOR2WSQO","created_at":"2026-07-05T08:55:46Z"},{"alias_kind":"pith_short_8","alias_value":"EW2OWHRM","created_at":"2026-07-05T08:55:46Z"}],"graph_snapshots":[{"event_id":"sha256:9a90ed2798a426e307702e7341b85c2d98b1c732b6d7f6898529026daaad7552","target":"graph","created_at":"2026-07-05T08:55:46Z","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/2408.08221/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Andrey Kupavskii, Peter Frankl","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-15T15:36:55Z","title":"Intersection problems and a correlation inequality for integer sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08221","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:98ff0353c4d90e5bf1e575197be7fe8a7a85df957e54494f4815367bd2fcba33","target":"record","created_at":"2026-07-05T08:55:46Z","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":"c7a5f687545253dd2d2647f87c55a1db248471eca1341570bcf032b6b4c7b8a2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-15T15:36:55Z","title_canon_sha256":"ba4f26a9e374bfa7265788a2360c64582d5785990d9fe9e513b3bb6c7c157e48"},"schema_version":"1.0","source":{"id":"2408.08221","kind":"arxiv","version":1}},"canonical_sha256":"25b4eb1e2cb3a3ab4a0e64855ba02bd012fc5f0b2c7334dbc562aa0e91c3657c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25b4eb1e2cb3a3ab4a0e64855ba02bd012fc5f0b2c7334dbc562aa0e91c3657c","first_computed_at":"2026-07-05T08:55:46.057276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:55:46.057276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hN6cYn8F7M27Cfgkes0/EVD9SiPHvqMSdj2mQAloQbL+/d3uCGAx8JdOA4Cye5YdLbW+OUiGcMtDiI0yCbOADg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:55:46.057738Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.08221","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98ff0353c4d90e5bf1e575197be7fe8a7a85df957e54494f4815367bd2fcba33","sha256:9a90ed2798a426e307702e7341b85c2d98b1c732b6d7f6898529026daaad7552"],"state_sha256":"503aeba293402842a7ed34ab30d6ea9439e402e3ecff6c7bab7d8573306c05de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8M+F8G5/nwE5n9Ts8UEfRdhzWF6JNiEGwBFE2XGGYyzSHTAAJpg2f6/yw5ZothXqXbHJl94yAkMxfMzr5RcAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:28:39.255548Z","bundle_sha256":"9a39775c1a3216be88e4ddeb3386d08416a9178a1b257af8edfcf22dc8cd113f"}}