{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:R6IZS62HLJELUXLIZCW25WFIMN","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":"297089e415450cf745729824b5f1440545cd4ab2620375f038c11d903839fd2a","cross_cats_sorted":["cs.DM","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-21T17:46:21Z","title_canon_sha256":"d911903918bfc74ce2921f45c6455da64b97427a7d2d61061686d84dafe5bf92"},"schema_version":"1.0","source":{"id":"2504.15264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.15264","created_at":"2026-07-05T10:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"2504.15264v1","created_at":"2026-07-05T10:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15264","created_at":"2026-07-05T10:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"R6IZS62HLJEL","created_at":"2026-07-05T10:51:59Z"},{"alias_kind":"pith_short_16","alias_value":"R6IZS62HLJELUXLI","created_at":"2026-07-05T10:51:59Z"},{"alias_kind":"pith_short_8","alias_value":"R6IZS62H","created_at":"2026-07-05T10:51:59Z"}],"graph_snapshots":[{"event_id":"sha256:680e98f7e7f9d8b42e30eb2946e157ed39501852a50db8b43c60a9c731dcb8b5","target":"graph","created_at":"2026-07-05T10:51:59Z","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/2504.15264/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Extremal problems on set systems with restricted intersections have been an important part of combinatorics in the last 70 year. In this paper, we study the following Ramsey version of these problems. Given a set $L\\subseteq \\{0,\\dots,k-1\\}$ and a family $\\mathcal{F}$ of $k$-element sets which does not contain a sunflower with $m$ petals whose kernel size is in $L$, how large a subfamily of $\\mathcal{F}$ can we find in which no pair has intersection size in $L$? We give matching upper and lower bounds, determining the dependence on $m$ for all $k$ and $L$. This problem also finds applications ","authors_text":"Barnab\\'as Janzer, Benny Sudakov, Kewen Wu, Zhihan Jin","cross_cats":["cs.DM","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-21T17:46:21Z","title":"Sunflowers and Ramsey problems for restricted intersections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15264","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:727acde65b465a481df21f838abc3484de0bd1c1126384467e962eecf577f47f","target":"record","created_at":"2026-07-05T10:51:59Z","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":"297089e415450cf745729824b5f1440545cd4ab2620375f038c11d903839fd2a","cross_cats_sorted":["cs.DM","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-21T17:46:21Z","title_canon_sha256":"d911903918bfc74ce2921f45c6455da64b97427a7d2d61061686d84dafe5bf92"},"schema_version":"1.0","source":{"id":"2504.15264","kind":"arxiv","version":1}},"canonical_sha256":"8f91997b475a48ba5d68c8adaed8a8636e811c360b2499c846f0b5013123d041","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f91997b475a48ba5d68c8adaed8a8636e811c360b2499c846f0b5013123d041","first_computed_at":"2026-07-05T10:51:59.021588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:51:59.021588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S1TPTGi2X3vCWY9WYevAFqCNkklIounaP1igiLFC2oXbQD1WhP3dBgzv7lA+YRkcRG0Njws7F+JbndYIMhrMCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:51:59.022164Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.15264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:727acde65b465a481df21f838abc3484de0bd1c1126384467e962eecf577f47f","sha256:680e98f7e7f9d8b42e30eb2946e157ed39501852a50db8b43c60a9c731dcb8b5"],"state_sha256":"05aa9df7ff0f0e75ab5d7a74772c31c80db2508b92726e77720a2024aeb120e7"}