{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XC7FPCMGMNRDWOS22V6AEMAIVB","short_pith_number":"pith:XC7FPCMG","schema_version":"1.0","canonical_sha256":"b8be57898663623b3a5ad57c023008a874043cf6961064d65c67e8e9ee3b07ab","source":{"kind":"arxiv","id":"2308.16365","version":2},"attestation_state":"computed","paper":{"title":"New bounds on the generalized Ramsey number $f(n,5,8)$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Parker, Coy Schwieder, Emily Heath, Enrique Gomez-Leos, Shira Zerbib","submitted_at":"2023-08-30T23:44:49Z","abstract_excerpt":"Let $f(n,p,q)$ denote the minimum number of colors needed to color the edges of $K_n$ so that every copy of $K_p$ receives at least $q$ distinct colors. In this note, we show $\\frac{6}{7}(n-1) \\leq f(n,5,8) \\leq n + o(n)$. The upper bound is proven using the \"conflict-free hypergraph matchings method\" which was recently used by Mubayi and Joos to prove $f(n,4,5) = \\frac{5}{6}n + o(n)$."},"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":"2308.16365","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-30T23:44:49Z","cross_cats_sorted":[],"title_canon_sha256":"8adf07fc666234a55cfb8a703187e07ecbd3ab19ed9fce397698b63e61836283","abstract_canon_sha256":"0a61a6103fd51bb82b6eeeedb803a61a034efc92f78c5dcc66c4b6bbe61affd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:58:22.796124Z","signature_b64":"KUyQP0fj40cjqREuaSERbaQ186+RtD3NkpWPR2K7gXDaeYhUWw6qRzaXEyOPPqbmjNJuG75MBTSE9Okq8/5FBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8be57898663623b3a5ad57c023008a874043cf6961064d65c67e8e9ee3b07ab","last_reissued_at":"2026-07-05T07:58:22.795602Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:58:22.795602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New bounds on the generalized Ramsey number $f(n,5,8)$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Parker, Coy Schwieder, Emily Heath, Enrique Gomez-Leos, Shira Zerbib","submitted_at":"2023-08-30T23:44:49Z","abstract_excerpt":"Let $f(n,p,q)$ denote the minimum number of colors needed to color the edges of $K_n$ so that every copy of $K_p$ receives at least $q$ distinct colors. In this note, we show $\\frac{6}{7}(n-1) \\leq f(n,5,8) \\leq n + o(n)$. The upper bound is proven using the \"conflict-free hypergraph matchings method\" which was recently used by Mubayi and Joos to prove $f(n,4,5) = \\frac{5}{6}n + o(n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.16365","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/2308.16365/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":"2308.16365","created_at":"2026-07-05T07:58:22.795671+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.16365v2","created_at":"2026-07-05T07:58:22.795671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.16365","created_at":"2026-07-05T07:58:22.795671+00:00"},{"alias_kind":"pith_short_12","alias_value":"XC7FPCMGMNRD","created_at":"2026-07-05T07:58:22.795671+00:00"},{"alias_kind":"pith_short_16","alias_value":"XC7FPCMGMNRDWOS2","created_at":"2026-07-05T07:58:22.795671+00:00"},{"alias_kind":"pith_short_8","alias_value":"XC7FPCMG","created_at":"2026-07-05T07:58:22.795671+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/XC7FPCMGMNRDWOS22V6AEMAIVB","json":"https://pith.science/pith/XC7FPCMGMNRDWOS22V6AEMAIVB.json","graph_json":"https://pith.science/api/pith-number/XC7FPCMGMNRDWOS22V6AEMAIVB/graph.json","events_json":"https://pith.science/api/pith-number/XC7FPCMGMNRDWOS22V6AEMAIVB/events.json","paper":"https://pith.science/paper/XC7FPCMG"},"agent_actions":{"view_html":"https://pith.science/pith/XC7FPCMGMNRDWOS22V6AEMAIVB","download_json":"https://pith.science/pith/XC7FPCMGMNRDWOS22V6AEMAIVB.json","view_paper":"https://pith.science/paper/XC7FPCMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.16365&json=true","fetch_graph":"https://pith.science/api/pith-number/XC7FPCMGMNRDWOS22V6AEMAIVB/graph.json","fetch_events":"https://pith.science/api/pith-number/XC7FPCMGMNRDWOS22V6AEMAIVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XC7FPCMGMNRDWOS22V6AEMAIVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XC7FPCMGMNRDWOS22V6AEMAIVB/action/storage_attestation","attest_author":"https://pith.science/pith/XC7FPCMGMNRDWOS22V6AEMAIVB/action/author_attestation","sign_citation":"https://pith.science/pith/XC7FPCMGMNRDWOS22V6AEMAIVB/action/citation_signature","submit_replication":"https://pith.science/pith/XC7FPCMGMNRDWOS22V6AEMAIVB/action/replication_record"}},"created_at":"2026-07-05T07:58:22.795671+00:00","updated_at":"2026-07-05T07:58:22.795671+00:00"}