{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:P65WUFROFJH2OQ3AEVLPZGSJDH","short_pith_number":"pith:P65WUFRO","schema_version":"1.0","canonical_sha256":"7fbb6a162e2a4fa743602556fc9a4919d05276a05e6429558fdc76802534b98d","source":{"kind":"arxiv","id":"2211.10385","version":2},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2211.10385","created_at":"2026-07-05T08:32:58.820193+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.10385v2","created_at":"2026-07-05T08:32:58.820193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10385","created_at":"2026-07-05T08:32:58.820193+00:00"},{"alias_kind":"pith_short_12","alias_value":"P65WUFROFJH2","created_at":"2026-07-05T08:32:58.820193+00:00"},{"alias_kind":"pith_short_16","alias_value":"P65WUFROFJH2OQ3A","created_at":"2026-07-05T08:32:58.820193+00:00"},{"alias_kind":"pith_short_8","alias_value":"P65WUFRO","created_at":"2026-07-05T08:32:58.820193+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P65WUFROFJH2OQ3AEVLPZGSJDH","json":"https://pith.science/pith/P65WUFROFJH2OQ3AEVLPZGSJDH.json","graph_json":"https://pith.science/api/pith-number/P65WUFROFJH2OQ3AEVLPZGSJDH/graph.json","events_json":"https://pith.science/api/pith-number/P65WUFROFJH2OQ3AEVLPZGSJDH/events.json","paper":"https://pith.science/paper/P65WUFRO"},"agent_actions":{"view_html":"https://pith.science/pith/P65WUFROFJH2OQ3AEVLPZGSJDH","download_json":"https://pith.science/pith/P65WUFROFJH2OQ3AEVLPZGSJDH.json","view_paper":"https://pith.science/paper/P65WUFRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.10385&json=true","fetch_graph":"https://pith.science/api/pith-number/P65WUFROFJH2OQ3AEVLPZGSJDH/graph.json","fetch_events":"https://pith.science/api/pith-number/P65WUFROFJH2OQ3AEVLPZGSJDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P65WUFROFJH2OQ3AEVLPZGSJDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P65WUFROFJH2OQ3AEVLPZGSJDH/action/storage_attestation","attest_author":"https://pith.science/pith/P65WUFROFJH2OQ3AEVLPZGSJDH/action/author_attestation","sign_citation":"https://pith.science/pith/P65WUFROFJH2OQ3AEVLPZGSJDH/action/citation_signature","submit_replication":"https://pith.science/pith/P65WUFROFJH2OQ3AEVLPZGSJDH/action/replication_record"}},"created_at":"2026-07-05T08:32:58.820193+00:00","updated_at":"2026-07-05T08:32:58.820193+00:00"}