{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KZCXFZPTRRR6QOQBCEBYL7NBWA","short_pith_number":"pith:KZCXFZPT","canonical_record":{"source":{"id":"1908.08483","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-22T16:33:22Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"cd0d1d12b14283818a228fda257bfd3653d07d6808caac5a4256b22d9598a7d8","abstract_canon_sha256":"e26425993d01c77e355bc4f54c0917fb34dfdea50f0e3735c3c8e8226485a414"},"schema_version":"1.0"},"canonical_sha256":"564572e5f38c63e83a01110385fda1b0396da7177cbda93b0b3c1e9d098cc6c4","source":{"kind":"arxiv","id":"1908.08483","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08483","created_at":"2026-07-05T03:09:54Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08483v3","created_at":"2026-07-05T03:09:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08483","created_at":"2026-07-05T03:09:54Z"},{"alias_kind":"pith_short_12","alias_value":"KZCXFZPTRRR6","created_at":"2026-07-05T03:09:54Z"},{"alias_kind":"pith_short_16","alias_value":"KZCXFZPTRRR6QOQB","created_at":"2026-07-05T03:09:54Z"},{"alias_kind":"pith_short_8","alias_value":"KZCXFZPT","created_at":"2026-07-05T03:09:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KZCXFZPTRRR6QOQBCEBYL7NBWA","target":"record","payload":{"canonical_record":{"source":{"id":"1908.08483","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-22T16:33:22Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"cd0d1d12b14283818a228fda257bfd3653d07d6808caac5a4256b22d9598a7d8","abstract_canon_sha256":"e26425993d01c77e355bc4f54c0917fb34dfdea50f0e3735c3c8e8226485a414"},"schema_version":"1.0"},"canonical_sha256":"564572e5f38c63e83a01110385fda1b0396da7177cbda93b0b3c1e9d098cc6c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:09:54.190636Z","signature_b64":"/nNS73s90KBfNvnFLmd+ihm1SagTEzY94ovjTWjwxD39Yp1kEDkDrgOeYm0ecnFfSov37vzo8u74rLowCCMMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"564572e5f38c63e83a01110385fda1b0396da7177cbda93b0b3c1e9d098cc6c4","last_reissued_at":"2026-07-05T03:09:54.190234Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:09:54.190234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.08483","source_version":3,"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-05T03:09:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LedRq5//2V006l7XRJf9e9ub/+XNR7S5i7/ostQIgN2PGyebcXEcdT7aMljcOmhpyz34BldDqQbFxgvB8LZBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:55:01.341555Z"},"content_sha256":"610333c1d4238dc05e8b7fde042f9a6089a93a40b05c197bb103d67bd911cbce","schema_version":"1.0","event_id":"sha256:610333c1d4238dc05e8b7fde042f9a6089a93a40b05c197bb103d67bd911cbce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KZCXFZPTRRR6QOQBCEBYL7NBWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved bounds for the sunflower lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Jiapeng Zhang, Kewen Wu, Ryan Alweiss, Shachar Lovett","submitted_at":"2019-08-22T16:33:22Z","abstract_excerpt":"A sunflower with $r$ petals is a collection of $r$ sets so that the intersection of each pair is equal to the intersection of all of them. Erd\\H{o}s and Rado proved the sunflower lemma: for any fixed $r$, any family of sets of size $w$, with at least about $w^w$ sets, must contain a sunflower with $r$ petals. The famous sunflower conjecture states that the bound on the number of sets can be improved to $c^w$ for some constant $c$. In this paper, we improve the bound to about $(\\log w)^w$. In fact, we prove the result for a robust notion of sunflowers, for which the bound we obtain is sharp up "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08483","kind":"arxiv","version":3},"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/1908.08483/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-05T03:09:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b+0Gi75ceOPY6Sa4ehidNWmv7EWNbVWgtHNTVWVW+/Z9gx0/dLxv93fecVsKZjvpki1tb7hQIMsx4rpnLN/pBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:55:01.342114Z"},"content_sha256":"951c14c62aef7da2cb23822ec46053a12c5892f0f0b65c4fd1513aa27db4d293","schema_version":"1.0","event_id":"sha256:951c14c62aef7da2cb23822ec46053a12c5892f0f0b65c4fd1513aa27db4d293"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZCXFZPTRRR6QOQBCEBYL7NBWA/bundle.json","state_url":"https://pith.science/pith/KZCXFZPTRRR6QOQBCEBYL7NBWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZCXFZPTRRR6QOQBCEBYL7NBWA/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-08-06T01:55:01Z","links":{"resolver":"https://pith.science/pith/KZCXFZPTRRR6QOQBCEBYL7NBWA","bundle":"https://pith.science/pith/KZCXFZPTRRR6QOQBCEBYL7NBWA/bundle.json","state":"https://pith.science/pith/KZCXFZPTRRR6QOQBCEBYL7NBWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZCXFZPTRRR6QOQBCEBYL7NBWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KZCXFZPTRRR6QOQBCEBYL7NBWA","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":"e26425993d01c77e355bc4f54c0917fb34dfdea50f0e3735c3c8e8226485a414","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-22T16:33:22Z","title_canon_sha256":"cd0d1d12b14283818a228fda257bfd3653d07d6808caac5a4256b22d9598a7d8"},"schema_version":"1.0","source":{"id":"1908.08483","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08483","created_at":"2026-07-05T03:09:54Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08483v3","created_at":"2026-07-05T03:09:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08483","created_at":"2026-07-05T03:09:54Z"},{"alias_kind":"pith_short_12","alias_value":"KZCXFZPTRRR6","created_at":"2026-07-05T03:09:54Z"},{"alias_kind":"pith_short_16","alias_value":"KZCXFZPTRRR6QOQB","created_at":"2026-07-05T03:09:54Z"},{"alias_kind":"pith_short_8","alias_value":"KZCXFZPT","created_at":"2026-07-05T03:09:54Z"}],"graph_snapshots":[{"event_id":"sha256:951c14c62aef7da2cb23822ec46053a12c5892f0f0b65c4fd1513aa27db4d293","target":"graph","created_at":"2026-07-05T03:09:54Z","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/1908.08483/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A sunflower with $r$ petals is a collection of $r$ sets so that the intersection of each pair is equal to the intersection of all of them. Erd\\H{o}s and Rado proved the sunflower lemma: for any fixed $r$, any family of sets of size $w$, with at least about $w^w$ sets, must contain a sunflower with $r$ petals. The famous sunflower conjecture states that the bound on the number of sets can be improved to $c^w$ for some constant $c$. In this paper, we improve the bound to about $(\\log w)^w$. In fact, we prove the result for a robust notion of sunflowers, for which the bound we obtain is sharp up ","authors_text":"Jiapeng Zhang, Kewen Wu, Ryan Alweiss, Shachar Lovett","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-22T16:33:22Z","title":"Improved bounds for the sunflower lemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08483","kind":"arxiv","version":3},"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:610333c1d4238dc05e8b7fde042f9a6089a93a40b05c197bb103d67bd911cbce","target":"record","created_at":"2026-07-05T03:09:54Z","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":"e26425993d01c77e355bc4f54c0917fb34dfdea50f0e3735c3c8e8226485a414","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-22T16:33:22Z","title_canon_sha256":"cd0d1d12b14283818a228fda257bfd3653d07d6808caac5a4256b22d9598a7d8"},"schema_version":"1.0","source":{"id":"1908.08483","kind":"arxiv","version":3}},"canonical_sha256":"564572e5f38c63e83a01110385fda1b0396da7177cbda93b0b3c1e9d098cc6c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"564572e5f38c63e83a01110385fda1b0396da7177cbda93b0b3c1e9d098cc6c4","first_computed_at":"2026-07-05T03:09:54.190234Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:09:54.190234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/nNS73s90KBfNvnFLmd+ihm1SagTEzY94ovjTWjwxD39Yp1kEDkDrgOeYm0ecnFfSov37vzo8u74rLowCCMMCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:09:54.190636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08483","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:610333c1d4238dc05e8b7fde042f9a6089a93a40b05c197bb103d67bd911cbce","sha256:951c14c62aef7da2cb23822ec46053a12c5892f0f0b65c4fd1513aa27db4d293"],"state_sha256":"572a9beed081f3f76dcbab1646a7705bc48a76d99c426e1f4b958481c6a194d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xJY08q1nhucaepuPa4y25VPw63C72KDeVOzqsgbF2MqDjHPMB3aJtWiAGzkFE9L2eQ3NOFVrvpT+qu3QGlJSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T01:55:01.347595Z","bundle_sha256":"3b676fb2ef2f750c7350cd60c6d6c69cee69d5b41bb599aea5f6e60cbdbcbf77"}}