{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Y2Z3BDSYNXFBVDP5QUAP2TGAMY","short_pith_number":"pith:Y2Z3BDSY","schema_version":"1.0","canonical_sha256":"c6b3b08e586dca1a8dfd8500fd4cc0662380d520f767907a84131937282fee58","source":{"kind":"arxiv","id":"2405.16653","version":2},"attestation_state":"computed","paper":{"title":"Generalized Ramsey numbers via conflict-free hypergraph matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Lane, Natasha Morrison","submitted_at":"2024-05-26T18:11:41Z","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"},"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":"2405.16653","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-05-26T18:11:41Z","cross_cats_sorted":[],"title_canon_sha256":"660145bec725581f99e5fcc76e7684e5c0e1d68b152709860dd37e5508a3d5f1","abstract_canon_sha256":"9465f68ac47c0aaf8af93e10b9ee087098673d53d2674be38ea42872c14d3919"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:26.242948Z","signature_b64":"7XUOL9nU/iisABlbOqY+dFMlybazSupoIa7ysuC5mq6yO2FV9zK5pMVCt/cLKM3tUeg2TMA1qwPy3+3Z3xd7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6b3b08e586dca1a8dfd8500fd4cc0662380d520f767907a84131937282fee58","last_reissued_at":"2026-07-05T08:27:26.242448Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:26.242448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Ramsey numbers via conflict-free hypergraph matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Lane, Natasha Morrison","submitted_at":"2024-05-26T18:11:41Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16653","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/2405.16653/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":"2405.16653","created_at":"2026-07-05T08:27:26.242506+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.16653v2","created_at":"2026-07-05T08:27:26.242506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16653","created_at":"2026-07-05T08:27:26.242506+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2Z3BDSYNXFB","created_at":"2026-07-05T08:27:26.242506+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2Z3BDSYNXFBVDP5","created_at":"2026-07-05T08:27:26.242506+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2Z3BDSY","created_at":"2026-07-05T08:27:26.242506+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.13329","citing_title":"Edge-coloring $K_{n, n}$ with no 2-colored $C_{2k}$","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y2Z3BDSYNXFBVDP5QUAP2TGAMY","json":"https://pith.science/pith/Y2Z3BDSYNXFBVDP5QUAP2TGAMY.json","graph_json":"https://pith.science/api/pith-number/Y2Z3BDSYNXFBVDP5QUAP2TGAMY/graph.json","events_json":"https://pith.science/api/pith-number/Y2Z3BDSYNXFBVDP5QUAP2TGAMY/events.json","paper":"https://pith.science/paper/Y2Z3BDSY"},"agent_actions":{"view_html":"https://pith.science/pith/Y2Z3BDSYNXFBVDP5QUAP2TGAMY","download_json":"https://pith.science/pith/Y2Z3BDSYNXFBVDP5QUAP2TGAMY.json","view_paper":"https://pith.science/paper/Y2Z3BDSY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.16653&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2Z3BDSYNXFBVDP5QUAP2TGAMY/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2Z3BDSYNXFBVDP5QUAP2TGAMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2Z3BDSYNXFBVDP5QUAP2TGAMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2Z3BDSYNXFBVDP5QUAP2TGAMY/action/storage_attestation","attest_author":"https://pith.science/pith/Y2Z3BDSYNXFBVDP5QUAP2TGAMY/action/author_attestation","sign_citation":"https://pith.science/pith/Y2Z3BDSYNXFBVDP5QUAP2TGAMY/action/citation_signature","submit_replication":"https://pith.science/pith/Y2Z3BDSYNXFBVDP5QUAP2TGAMY/action/replication_record"}},"created_at":"2026-07-05T08:27:26.242506+00:00","updated_at":"2026-07-05T08:27:26.242506+00:00"}