{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:XC7FPCMGMNRDWOS22V6AEMAIVB","short_pith_number":"pith:XC7FPCMG","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"},"canonical_sha256":"b8be57898663623b3a5ad57c023008a874043cf6961064d65c67e8e9ee3b07ab","source":{"kind":"arxiv","id":"2308.16365","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.16365","created_at":"2026-07-05T07:58:22Z"},{"alias_kind":"arxiv_version","alias_value":"2308.16365v2","created_at":"2026-07-05T07:58:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.16365","created_at":"2026-07-05T07:58:22Z"},{"alias_kind":"pith_short_12","alias_value":"XC7FPCMGMNRD","created_at":"2026-07-05T07:58:22Z"},{"alias_kind":"pith_short_16","alias_value":"XC7FPCMGMNRDWOS2","created_at":"2026-07-05T07:58:22Z"},{"alias_kind":"pith_short_8","alias_value":"XC7FPCMG","created_at":"2026-07-05T07:58:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:XC7FPCMGMNRDWOS22V6AEMAIVB","target":"record","payload":{"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"},"canonical_sha256":"b8be57898663623b3a5ad57c023008a874043cf6961064d65c67e8e9ee3b07ab","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"},"source_kind":"arxiv","source_id":"2308.16365","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:58:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lGZGYk8PUVRyEWw6uJAldcNeF33VSDgfgbiIsz6gua1zl80TQXYXhkTAjPONqeeDGEBagZS+4zzB+M1U+V+hCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:51:16.044919Z"},"content_sha256":"5c27867f22fddcf7b5c4680f29cbc217f13a164071122ec4c26b05312be44660","schema_version":"1.0","event_id":"sha256:5c27867f22fddcf7b5c4680f29cbc217f13a164071122ec4c26b05312be44660"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:XC7FPCMGMNRDWOS22V6AEMAIVB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:58:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibdB3hJB47dzD7NIHlA+DgzXwbO+FgY7OP5frxfWjZmgyZW/ry4hiZjqgxajvMd3a2HvkrjzTO9Ex5brhjpJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:51:16.045293Z"},"content_sha256":"6c493f839a8d2db7d69705e325f7501fc3f2f4a38532b049ddaad1fa19ff45c7","schema_version":"1.0","event_id":"sha256:6c493f839a8d2db7d69705e325f7501fc3f2f4a38532b049ddaad1fa19ff45c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XC7FPCMGMNRDWOS22V6AEMAIVB/bundle.json","state_url":"https://pith.science/pith/XC7FPCMGMNRDWOS22V6AEMAIVB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XC7FPCMGMNRDWOS22V6AEMAIVB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T04:51:16Z","links":{"resolver":"https://pith.science/pith/XC7FPCMGMNRDWOS22V6AEMAIVB","bundle":"https://pith.science/pith/XC7FPCMGMNRDWOS22V6AEMAIVB/bundle.json","state":"https://pith.science/pith/XC7FPCMGMNRDWOS22V6AEMAIVB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XC7FPCMGMNRDWOS22V6AEMAIVB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:XC7FPCMGMNRDWOS22V6AEMAIVB","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":"0a61a6103fd51bb82b6eeeedb803a61a034efc92f78c5dcc66c4b6bbe61affd9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-30T23:44:49Z","title_canon_sha256":"8adf07fc666234a55cfb8a703187e07ecbd3ab19ed9fce397698b63e61836283"},"schema_version":"1.0","source":{"id":"2308.16365","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.16365","created_at":"2026-07-05T07:58:22Z"},{"alias_kind":"arxiv_version","alias_value":"2308.16365v2","created_at":"2026-07-05T07:58:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.16365","created_at":"2026-07-05T07:58:22Z"},{"alias_kind":"pith_short_12","alias_value":"XC7FPCMGMNRD","created_at":"2026-07-05T07:58:22Z"},{"alias_kind":"pith_short_16","alias_value":"XC7FPCMGMNRDWOS2","created_at":"2026-07-05T07:58:22Z"},{"alias_kind":"pith_short_8","alias_value":"XC7FPCMG","created_at":"2026-07-05T07:58:22Z"}],"graph_snapshots":[{"event_id":"sha256:6c493f839a8d2db7d69705e325f7501fc3f2f4a38532b049ddaad1fa19ff45c7","target":"graph","created_at":"2026-07-05T07:58:22Z","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/2308.16365/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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)$.","authors_text":"Alex Parker, Coy Schwieder, Emily Heath, Enrique Gomez-Leos, Shira Zerbib","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-30T23:44:49Z","title":"New bounds on the generalized Ramsey number $f(n,5,8)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.16365","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:5c27867f22fddcf7b5c4680f29cbc217f13a164071122ec4c26b05312be44660","target":"record","created_at":"2026-07-05T07:58:22Z","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":"0a61a6103fd51bb82b6eeeedb803a61a034efc92f78c5dcc66c4b6bbe61affd9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-30T23:44:49Z","title_canon_sha256":"8adf07fc666234a55cfb8a703187e07ecbd3ab19ed9fce397698b63e61836283"},"schema_version":"1.0","source":{"id":"2308.16365","kind":"arxiv","version":2}},"canonical_sha256":"b8be57898663623b3a5ad57c023008a874043cf6961064d65c67e8e9ee3b07ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8be57898663623b3a5ad57c023008a874043cf6961064d65c67e8e9ee3b07ab","first_computed_at":"2026-07-05T07:58:22.795602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:58:22.795602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KUyQP0fj40cjqREuaSERbaQ186+RtD3NkpWPR2K7gXDaeYhUWw6qRzaXEyOPPqbmjNJuG75MBTSE9Okq8/5FBw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:58:22.796124Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.16365","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c27867f22fddcf7b5c4680f29cbc217f13a164071122ec4c26b05312be44660","sha256:6c493f839a8d2db7d69705e325f7501fc3f2f4a38532b049ddaad1fa19ff45c7"],"state_sha256":"fb5bca29c9a2124d2e0e3a2770608a38f88554ed8b7e568df6c6a128b241fb04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a6TYfDnDtfrDJFy6J7gM+lIhbyOyzC1gISLmUcwmnJkln95PAYLGng+Iugwr73M18VdLXrFxK1WuzyujbeAGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:51:16.047699Z","bundle_sha256":"dc7ec61f30a26a335c3a32a377a48e2861f8986681a435be084d0646f836acef"}}