{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:3M7VKMQROA3SV6SP5J3UKKQ6I7","short_pith_number":"pith:3M7VKMQR","canonical_record":{"source":{"id":"2110.11319","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-21T17:51:48Z","cross_cats_sorted":[],"title_canon_sha256":"4b027caa253eb27fb56a190c7aea9ed05c8e981ca118624d14b88bbf6dfb25b5","abstract_canon_sha256":"caedd012ee5de9a12a49d9ca25902415d04c2e34903992aa61ed363d88c502ea"},"schema_version":"1.0"},"canonical_sha256":"db3f55321170372afa4fea77452a1e47ee611813e2a35467f4b0ac0ec1dc1452","source":{"kind":"arxiv","id":"2110.11319","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.11319","created_at":"2026-07-05T03:24:46Z"},{"alias_kind":"arxiv_version","alias_value":"2110.11319v2","created_at":"2026-07-05T03:24:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.11319","created_at":"2026-07-05T03:24:46Z"},{"alias_kind":"pith_short_12","alias_value":"3M7VKMQROA3S","created_at":"2026-07-05T03:24:46Z"},{"alias_kind":"pith_short_16","alias_value":"3M7VKMQROA3SV6SP","created_at":"2026-07-05T03:24:46Z"},{"alias_kind":"pith_short_8","alias_value":"3M7VKMQR","created_at":"2026-07-05T03:24:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:3M7VKMQROA3SV6SP5J3UKKQ6I7","target":"record","payload":{"canonical_record":{"source":{"id":"2110.11319","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-21T17:51:48Z","cross_cats_sorted":[],"title_canon_sha256":"4b027caa253eb27fb56a190c7aea9ed05c8e981ca118624d14b88bbf6dfb25b5","abstract_canon_sha256":"caedd012ee5de9a12a49d9ca25902415d04c2e34903992aa61ed363d88c502ea"},"schema_version":"1.0"},"canonical_sha256":"db3f55321170372afa4fea77452a1e47ee611813e2a35467f4b0ac0ec1dc1452","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:46.087626Z","signature_b64":"oaoNfR/k2QNjhmbfMdvA59G7QwQ2lkiB800j6qsbtyWOXSOvsyr1Ymlx7od1GnUy2HE4TSPlgtR7FcCcwq/HAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db3f55321170372afa4fea77452a1e47ee611813e2a35467f4b0ac0ec1dc1452","last_reissued_at":"2026-07-05T03:24:46.087088Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:46.087088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.11319","source_version":2,"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:24:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xyjrs80juzVU2ivBGJsXUaY8hHfnLlEaJSf7SuDhxHj+WBgHuE5koLJPf6v3yZCJLWYLOySw7sczCiXwXAjKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T19:48:08.476241Z"},"content_sha256":"3dbc4c5eefa32738abbec5feeeeaa320d1273ab63171de4727021e65ee433794","schema_version":"1.0","event_id":"sha256:3dbc4c5eefa32738abbec5feeeeaa320d1273ab63171de4727021e65ee433794"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:3M7VKMQROA3SV6SP5J3UKKQ6I7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tur\\'{a}n numbers of sunflowers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Domagoj Brada\\v{c}, Matija Buci\\'c","submitted_at":"2021-10-21T17:51:48Z","abstract_excerpt":"A collection of distinct sets is called a sunflower if the intersection of any pair of sets equals the common intersection of all the sets. Sunflowers are fundamental objects in extremal set theory with relations and applications to many other areas of mathematics as well as theoretical computer science. A central problem in the area due to Erd\\H{o}s and Rado from 1960 asks for the minimum number of sets of size $r$ needed to guarantee the existence of a sunflower of a given size. Despite a lot of recent attention including a polymath project and some amazing breakthroughs, even the asymptotic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.11319","kind":"arxiv","version":2},"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/2110.11319/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:24:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DQm/cwUSzQmS5dWyERzRftXeGQqS0x4L2CrVJA8QNWfGI/yUSArfQ5r1ULR3WlDLbysd0Yl2tsmSe3uj0ckwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T19:48:08.476803Z"},"content_sha256":"07f29a38a130d6e8c1e7c6db0544ece0e9da9ae227eea955f78489e7c8110095","schema_version":"1.0","event_id":"sha256:07f29a38a130d6e8c1e7c6db0544ece0e9da9ae227eea955f78489e7c8110095"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3M7VKMQROA3SV6SP5J3UKKQ6I7/bundle.json","state_url":"https://pith.science/pith/3M7VKMQROA3SV6SP5J3UKKQ6I7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3M7VKMQROA3SV6SP5J3UKKQ6I7/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-16T19:48:08Z","links":{"resolver":"https://pith.science/pith/3M7VKMQROA3SV6SP5J3UKKQ6I7","bundle":"https://pith.science/pith/3M7VKMQROA3SV6SP5J3UKKQ6I7/bundle.json","state":"https://pith.science/pith/3M7VKMQROA3SV6SP5J3UKKQ6I7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3M7VKMQROA3SV6SP5J3UKKQ6I7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:3M7VKMQROA3SV6SP5J3UKKQ6I7","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":"caedd012ee5de9a12a49d9ca25902415d04c2e34903992aa61ed363d88c502ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-21T17:51:48Z","title_canon_sha256":"4b027caa253eb27fb56a190c7aea9ed05c8e981ca118624d14b88bbf6dfb25b5"},"schema_version":"1.0","source":{"id":"2110.11319","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.11319","created_at":"2026-07-05T03:24:46Z"},{"alias_kind":"arxiv_version","alias_value":"2110.11319v2","created_at":"2026-07-05T03:24:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.11319","created_at":"2026-07-05T03:24:46Z"},{"alias_kind":"pith_short_12","alias_value":"3M7VKMQROA3S","created_at":"2026-07-05T03:24:46Z"},{"alias_kind":"pith_short_16","alias_value":"3M7VKMQROA3SV6SP","created_at":"2026-07-05T03:24:46Z"},{"alias_kind":"pith_short_8","alias_value":"3M7VKMQR","created_at":"2026-07-05T03:24:46Z"}],"graph_snapshots":[{"event_id":"sha256:07f29a38a130d6e8c1e7c6db0544ece0e9da9ae227eea955f78489e7c8110095","target":"graph","created_at":"2026-07-05T03:24: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/2110.11319/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A collection of distinct sets is called a sunflower if the intersection of any pair of sets equals the common intersection of all the sets. Sunflowers are fundamental objects in extremal set theory with relations and applications to many other areas of mathematics as well as theoretical computer science. A central problem in the area due to Erd\\H{o}s and Rado from 1960 asks for the minimum number of sets of size $r$ needed to guarantee the existence of a sunflower of a given size. Despite a lot of recent attention including a polymath project and some amazing breakthroughs, even the asymptotic","authors_text":"Benny Sudakov, Domagoj Brada\\v{c}, Matija Buci\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-21T17:51:48Z","title":"Tur\\'{a}n numbers of sunflowers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.11319","kind":"arxiv","version":2},"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:3dbc4c5eefa32738abbec5feeeeaa320d1273ab63171de4727021e65ee433794","target":"record","created_at":"2026-07-05T03:24: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":"caedd012ee5de9a12a49d9ca25902415d04c2e34903992aa61ed363d88c502ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-21T17:51:48Z","title_canon_sha256":"4b027caa253eb27fb56a190c7aea9ed05c8e981ca118624d14b88bbf6dfb25b5"},"schema_version":"1.0","source":{"id":"2110.11319","kind":"arxiv","version":2}},"canonical_sha256":"db3f55321170372afa4fea77452a1e47ee611813e2a35467f4b0ac0ec1dc1452","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db3f55321170372afa4fea77452a1e47ee611813e2a35467f4b0ac0ec1dc1452","first_computed_at":"2026-07-05T03:24:46.087088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:24:46.087088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oaoNfR/k2QNjhmbfMdvA59G7QwQ2lkiB800j6qsbtyWOXSOvsyr1Ymlx7od1GnUy2HE4TSPlgtR7FcCcwq/HAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:24:46.087626Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.11319","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dbc4c5eefa32738abbec5feeeeaa320d1273ab63171de4727021e65ee433794","sha256:07f29a38a130d6e8c1e7c6db0544ece0e9da9ae227eea955f78489e7c8110095"],"state_sha256":"f93ac89c6de1e94da3a8a1d0bd41d93b7d1aa7bd87730651e2f84f926b48205c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ySRwWkcORxFCTPCJYgUa5p6fpS9iV2t+/sD7N4XaaT5T72F3s2KGvvMG5FJPwUIgyEx2WEnFcM19Z/SBXQd+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T19:48:08.481526Z","bundle_sha256":"3412bf4c93084ab5bd075ab22dc15768a221bbdf9020839051aaff411e35ebb8"}}