{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:P65WUFROFJH2OQ3AEVLPZGSJDH","short_pith_number":"pith:P65WUFRO","canonical_record":{"source":{"id":"2211.10385","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-18T17:32:35Z","cross_cats_sorted":[],"title_canon_sha256":"eb132cf3d5734334095bfe1c015a8232041cc84bb5fc092380669d92465b1f6b","abstract_canon_sha256":"30439c0bdc49de4045798d9a4f92003f5849d672356a33c783e65b25c7221d21"},"schema_version":"1.0"},"canonical_sha256":"7fbb6a162e2a4fa743602556fc9a4919d05276a05e6429558fdc76802534b98d","source":{"kind":"arxiv","id":"2211.10385","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.10385","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"2211.10385v2","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10385","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"P65WUFROFJH2","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_16","alias_value":"P65WUFROFJH2OQ3A","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_8","alias_value":"P65WUFRO","created_at":"2026-07-05T08:32:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:P65WUFROFJH2OQ3AEVLPZGSJDH","target":"record","payload":{"canonical_record":{"source":{"id":"2211.10385","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-18T17:32:35Z","cross_cats_sorted":[],"title_canon_sha256":"eb132cf3d5734334095bfe1c015a8232041cc84bb5fc092380669d92465b1f6b","abstract_canon_sha256":"30439c0bdc49de4045798d9a4f92003f5849d672356a33c783e65b25c7221d21"},"schema_version":"1.0"},"canonical_sha256":"7fbb6a162e2a4fa743602556fc9a4919d05276a05e6429558fdc76802534b98d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:58.820609Z","signature_b64":"Ng9vczH9IQ1+A78cLEVZpJ60/OIj2CdwUcovVwoTdZkql3av3IaYFter7LOrdrf7EyMxETlbu8jW7D4zfxbMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fbb6a162e2a4fa743602556fc9a4919d05276a05e6429558fdc76802534b98d","last_reissued_at":"2026-07-05T08:32:58.820135Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:58.820135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.10385","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-05T08:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L1n5+njmq3l37xHd7M19lkghe4uX/Y7foS0hLIJxqtigCgjHWVJmdo4QLTm8FyUoujFxjiF2C8WbbH2MddP0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:53:08.974055Z"},"content_sha256":"1cf9ccd338e9da61ebb6fac66f36c7057dab914c8cb0391c7e1a7d0791164ba6","schema_version":"1.0","event_id":"sha256:1cf9ccd338e9da61ebb6fac66f36c7057dab914c8cb0391c7e1a7d0791164ba6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:P65WUFROFJH2OQ3AEVLPZGSJDH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Ramsey number of daisies II","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marcelo Sales","submitted_at":"2022-11-18T17:32:35Z","abstract_excerpt":"A $(k+r)$-uniform hypergraph $H$ on $(k+m)$ vertices is an $(r,m,k)$-daisy if there exists a partition of the vertices $V(H)=K\\cup M$ with $|K|=k$, $|M|=m$ such that the set of edges of $H$ is all the $(k+r)$-tuples $K\\cup P$, where $P$ is an $r$-tuple of $M$. Complementing results in [\"On the Ramsey number of daisies I\"], we obtain an $(r-2)$-iterated exponential lower bound to the Ramsey number of an $(r,m,k)$-daisy for $2$-colors. This matches the order of magnitude of the best lower bounds for the Ramsey number of a complete $r$-graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.10385","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/2211.10385/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:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/C6wja8RuluZTMj4x5mLmvYu3bJS1VRk8fkO11dKDO1giorGC3ay26EL8wmuGCN/2bAUZcJ+XKibuomknJaaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:53:08.974433Z"},"content_sha256":"a2c312ffba9b1d80eefe93e83486805b7b990969602979b5f3064620b5387a98","schema_version":"1.0","event_id":"sha256:a2c312ffba9b1d80eefe93e83486805b7b990969602979b5f3064620b5387a98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P65WUFROFJH2OQ3AEVLPZGSJDH/bundle.json","state_url":"https://pith.science/pith/P65WUFROFJH2OQ3AEVLPZGSJDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P65WUFROFJH2OQ3AEVLPZGSJDH/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-07T08:53:08Z","links":{"resolver":"https://pith.science/pith/P65WUFROFJH2OQ3AEVLPZGSJDH","bundle":"https://pith.science/pith/P65WUFROFJH2OQ3AEVLPZGSJDH/bundle.json","state":"https://pith.science/pith/P65WUFROFJH2OQ3AEVLPZGSJDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P65WUFROFJH2OQ3AEVLPZGSJDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:P65WUFROFJH2OQ3AEVLPZGSJDH","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":"30439c0bdc49de4045798d9a4f92003f5849d672356a33c783e65b25c7221d21","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-18T17:32:35Z","title_canon_sha256":"eb132cf3d5734334095bfe1c015a8232041cc84bb5fc092380669d92465b1f6b"},"schema_version":"1.0","source":{"id":"2211.10385","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.10385","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"2211.10385v2","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10385","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"P65WUFROFJH2","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_16","alias_value":"P65WUFROFJH2OQ3A","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_8","alias_value":"P65WUFRO","created_at":"2026-07-05T08:32:58Z"}],"graph_snapshots":[{"event_id":"sha256:a2c312ffba9b1d80eefe93e83486805b7b990969602979b5f3064620b5387a98","target":"graph","created_at":"2026-07-05T08:32:58Z","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/2211.10385/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A $(k+r)$-uniform hypergraph $H$ on $(k+m)$ vertices is an $(r,m,k)$-daisy if there exists a partition of the vertices $V(H)=K\\cup M$ with $|K|=k$, $|M|=m$ such that the set of edges of $H$ is all the $(k+r)$-tuples $K\\cup P$, where $P$ is an $r$-tuple of $M$. Complementing results in [\"On the Ramsey number of daisies I\"], we obtain an $(r-2)$-iterated exponential lower bound to the Ramsey number of an $(r,m,k)$-daisy for $2$-colors. This matches the order of magnitude of the best lower bounds for the Ramsey number of a complete $r$-graph.","authors_text":"Marcelo Sales","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-18T17:32:35Z","title":"On the Ramsey number of daisies II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.10385","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:1cf9ccd338e9da61ebb6fac66f36c7057dab914c8cb0391c7e1a7d0791164ba6","target":"record","created_at":"2026-07-05T08:32:58Z","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":"30439c0bdc49de4045798d9a4f92003f5849d672356a33c783e65b25c7221d21","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-18T17:32:35Z","title_canon_sha256":"eb132cf3d5734334095bfe1c015a8232041cc84bb5fc092380669d92465b1f6b"},"schema_version":"1.0","source":{"id":"2211.10385","kind":"arxiv","version":2}},"canonical_sha256":"7fbb6a162e2a4fa743602556fc9a4919d05276a05e6429558fdc76802534b98d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fbb6a162e2a4fa743602556fc9a4919d05276a05e6429558fdc76802534b98d","first_computed_at":"2026-07-05T08:32:58.820135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:32:58.820135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ng9vczH9IQ1+A78cLEVZpJ60/OIj2CdwUcovVwoTdZkql3av3IaYFter7LOrdrf7EyMxETlbu8jW7D4zfxbMAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:32:58.820609Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.10385","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cf9ccd338e9da61ebb6fac66f36c7057dab914c8cb0391c7e1a7d0791164ba6","sha256:a2c312ffba9b1d80eefe93e83486805b7b990969602979b5f3064620b5387a98"],"state_sha256":"3607cafcf7228904e12f2465d6e114f537bccee434eba470b476ed20f91c0a1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jr0FZaakvUdF/LIALGCqyKMINOzy+QyZhJNjsjxOheo1eCb/oIuV+WoM7QYnKyWO1MACqZ4SUU531EUqHmNNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:53:08.976290Z","bundle_sha256":"52a7c206baf4127949ac2af34f18af903d9781af9b4157e5eed1da91af48443a"}}