{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Y2Z3BDSYNXFBVDP5QUAP2TGAMY","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":"9465f68ac47c0aaf8af93e10b9ee087098673d53d2674be38ea42872c14d3919","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-05-26T18:11:41Z","title_canon_sha256":"660145bec725581f99e5fcc76e7684e5c0e1d68b152709860dd37e5508a3d5f1"},"schema_version":"1.0","source":{"id":"2405.16653","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.16653","created_at":"2026-07-05T08:27:26Z"},{"alias_kind":"arxiv_version","alias_value":"2405.16653v2","created_at":"2026-07-05T08:27:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16653","created_at":"2026-07-05T08:27:26Z"},{"alias_kind":"pith_short_12","alias_value":"Y2Z3BDSYNXFB","created_at":"2026-07-05T08:27:26Z"},{"alias_kind":"pith_short_16","alias_value":"Y2Z3BDSYNXFBVDP5","created_at":"2026-07-05T08:27:26Z"},{"alias_kind":"pith_short_8","alias_value":"Y2Z3BDSY","created_at":"2026-07-05T08:27:26Z"}],"graph_snapshots":[{"event_id":"sha256:cd8b89aed314abfe6e71188e14fe52e805e42af3af7cb53aaa8177218bf43423","target":"graph","created_at":"2026-07-05T08:27:26Z","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/2405.16653/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given graphs $G, H$ and an integer $q \\ge 2$, the generalized Ramsey number, denoted $r(G,H,q)$, is the minimum number of colours needed to edge-colour $G$ such that every copy of $H$ receives at least $q$ colours. In this paper, we prove that for a fixed integer $k \\ge 3$, we have $r(K_n,C_k,3) = n/(k-2)+o(n)$. This generalises work of Joos and Muybayi, who proved $r(K_n,C_4,3) = n/2+o(n)$. We also provide an upper bound on $r(K_{n,n}, C_k, 3)$, which generalises a result of Joos and Mubayi that $r(K_{n,n},C_4,3) = 2n/3+o(n)$. Both of our results are in fact specific cases of more general the","authors_text":"Andrew Lane, Natasha Morrison","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-05-26T18:11:41Z","title":"Generalized Ramsey numbers via conflict-free hypergraph matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16653","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:314eabd3b76b51c0010e22af1860f45a2ff8edce74430af74cb081012761201f","target":"record","created_at":"2026-07-05T08:27:26Z","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":"9465f68ac47c0aaf8af93e10b9ee087098673d53d2674be38ea42872c14d3919","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-05-26T18:11:41Z","title_canon_sha256":"660145bec725581f99e5fcc76e7684e5c0e1d68b152709860dd37e5508a3d5f1"},"schema_version":"1.0","source":{"id":"2405.16653","kind":"arxiv","version":2}},"canonical_sha256":"c6b3b08e586dca1a8dfd8500fd4cc0662380d520f767907a84131937282fee58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6b3b08e586dca1a8dfd8500fd4cc0662380d520f767907a84131937282fee58","first_computed_at":"2026-07-05T08:27:26.242448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:27:26.242448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7XUOL9nU/iisABlbOqY+dFMlybazSupoIa7ysuC5mq6yO2FV9zK5pMVCt/cLKM3tUeg2TMA1qwPy3+3Z3xd7Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:27:26.242948Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.16653","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:314eabd3b76b51c0010e22af1860f45a2ff8edce74430af74cb081012761201f","sha256:cd8b89aed314abfe6e71188e14fe52e805e42af3af7cb53aaa8177218bf43423"],"state_sha256":"4e534b3e327276a6859b121e3611eedbf8d3b0bb7c9b929b98accbe7c008e323"}