{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:53RRJYJSEFC5T27NXDOIJ4GWIX","short_pith_number":"pith:53RRJYJS","schema_version":"1.0","canonical_sha256":"eee314e1322145d9ebedb8dc84f0d645edba699e2e1a339e52b06c8ce66c077b","source":{"kind":"arxiv","id":"2212.10542","version":3},"attestation_state":"computed","paper":{"title":"On generalized Ramsey numbers in the non-integral regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lina Li, Luke Postle, Michelle Delcourt, Patrick Bennett","submitted_at":"2022-12-20T18:49:33Z","abstract_excerpt":"A $(p,q)$-coloring of a graph $G$ is an edge-coloring of $G$ such that every $p$-clique receives at least $q$ colors. In 1975, Erd\\H{o}s and Shelah introduced the generalized Ramsey number $f(n,p,q)$ which is the minimum number of colors needed in a $(p,q)$-coloring of $K_n$. In 1997, Erd\\H{o}s and Gy\\'arf\\'as showed that $f(n,p,q)$ is at most a constant times $n^{\\frac{p-2}{\\binom{p}{2} - q + 1}}$. Very recently the first author, Dudek, and English improved this bound by a factor of $\\log n^{\\frac{-1}{\\binom{p}{2} - q + 1}} $ for all $q \\le \\frac{p^2 - 26p + 55}{4}$, and they ask if this impr"},"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":"2212.10542","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-20T18:49:33Z","cross_cats_sorted":[],"title_canon_sha256":"92b76b0ac34f11ec4c8cd4c1111da4cd4995a556bc64c46af3c993c354cdb56c","abstract_canon_sha256":"e6420783a81c6c980bb95d8b2bae0a130dbb3a47528c7628297ee20d43c2f225"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:20:36.368081Z","signature_b64":"wlYFsgPDe5D6IUVrZ87XR50a7VSsmulZc/dHnhwJt2Z48coUBRS1B89tOniDW4YDJ3d5SCLiiCYnn22MmCZ/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eee314e1322145d9ebedb8dc84f0d645edba699e2e1a339e52b06c8ce66c077b","last_reissued_at":"2026-07-05T09:20:36.367632Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:20:36.367632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On generalized Ramsey numbers in the non-integral regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lina Li, Luke Postle, Michelle Delcourt, Patrick Bennett","submitted_at":"2022-12-20T18:49:33Z","abstract_excerpt":"A $(p,q)$-coloring of a graph $G$ is an edge-coloring of $G$ such that every $p$-clique receives at least $q$ colors. In 1975, Erd\\H{o}s and Shelah introduced the generalized Ramsey number $f(n,p,q)$ which is the minimum number of colors needed in a $(p,q)$-coloring of $K_n$. In 1997, Erd\\H{o}s and Gy\\'arf\\'as showed that $f(n,p,q)$ is at most a constant times $n^{\\frac{p-2}{\\binom{p}{2} - q + 1}}$. Very recently the first author, Dudek, and English improved this bound by a factor of $\\log n^{\\frac{-1}{\\binom{p}{2} - q + 1}} $ for all $q \\le \\frac{p^2 - 26p + 55}{4}$, and they ask if this impr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.10542","kind":"arxiv","version":3},"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/2212.10542/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":"2212.10542","created_at":"2026-07-05T09:20:36.367694+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.10542v3","created_at":"2026-07-05T09:20:36.367694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.10542","created_at":"2026-07-05T09:20:36.367694+00:00"},{"alias_kind":"pith_short_12","alias_value":"53RRJYJSEFC5","created_at":"2026-07-05T09:20:36.367694+00:00"},{"alias_kind":"pith_short_16","alias_value":"53RRJYJSEFC5T27N","created_at":"2026-07-05T09:20:36.367694+00:00"},{"alias_kind":"pith_short_8","alias_value":"53RRJYJS","created_at":"2026-07-05T09:20:36.367694+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.19456","citing_title":"Odd Ramsey numbers of multipartite graphs and hypergraphs","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/53RRJYJSEFC5T27NXDOIJ4GWIX","json":"https://pith.science/pith/53RRJYJSEFC5T27NXDOIJ4GWIX.json","graph_json":"https://pith.science/api/pith-number/53RRJYJSEFC5T27NXDOIJ4GWIX/graph.json","events_json":"https://pith.science/api/pith-number/53RRJYJSEFC5T27NXDOIJ4GWIX/events.json","paper":"https://pith.science/paper/53RRJYJS"},"agent_actions":{"view_html":"https://pith.science/pith/53RRJYJSEFC5T27NXDOIJ4GWIX","download_json":"https://pith.science/pith/53RRJYJSEFC5T27NXDOIJ4GWIX.json","view_paper":"https://pith.science/paper/53RRJYJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.10542&json=true","fetch_graph":"https://pith.science/api/pith-number/53RRJYJSEFC5T27NXDOIJ4GWIX/graph.json","fetch_events":"https://pith.science/api/pith-number/53RRJYJSEFC5T27NXDOIJ4GWIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53RRJYJSEFC5T27NXDOIJ4GWIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53RRJYJSEFC5T27NXDOIJ4GWIX/action/storage_attestation","attest_author":"https://pith.science/pith/53RRJYJSEFC5T27NXDOIJ4GWIX/action/author_attestation","sign_citation":"https://pith.science/pith/53RRJYJSEFC5T27NXDOIJ4GWIX/action/citation_signature","submit_replication":"https://pith.science/pith/53RRJYJSEFC5T27NXDOIJ4GWIX/action/replication_record"}},"created_at":"2026-07-05T09:20:36.367694+00:00","updated_at":"2026-07-05T09:20:36.367694+00:00"}