{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QSGMJZNULQ5RPKJI4EFCEJVKXP","short_pith_number":"pith:QSGMJZNU","canonical_record":{"source":{"id":"1902.01301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-04T16:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"d28b2aba81af06575072431fcf71fc7ee46e6adacf702c7c6c77c51484f69302","abstract_canon_sha256":"8c0b211490fa6c01bd81c88b8565e6725cebd265a8474839675ed9ec03beccea"},"schema_version":"1.0"},"canonical_sha256":"848cc4e5b45c3b17a928e10a2226aabbf8a02e60b5f2ac35aa281707a6e4b766","source":{"kind":"arxiv","id":"1902.01301","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01301","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01301v1","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01301","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"pith_short_12","alias_value":"QSGMJZNULQ5R","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QSGMJZNULQ5RPKJI","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QSGMJZNU","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QSGMJZNULQ5RPKJI4EFCEJVKXP","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-04T16:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"d28b2aba81af06575072431fcf71fc7ee46e6adacf702c7c6c77c51484f69302","abstract_canon_sha256":"8c0b211490fa6c01bd81c88b8565e6725cebd265a8474839675ed9ec03beccea"},"schema_version":"1.0"},"canonical_sha256":"848cc4e5b45c3b17a928e10a2226aabbf8a02e60b5f2ac35aa281707a6e4b766","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:49.217402Z","signature_b64":"UXPQeJC+HU7UY3Gxtx0i8l26dkYKeHwdRjWW4TaXwtMNiaG8c/zVISDF5aDfp1tF8SmNHipDOJrALEAefQWQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"848cc4e5b45c3b17a928e10a2226aabbf8a02e60b5f2ac35aa281707a6e4b766","last_reissued_at":"2026-05-17T23:54:49.216736Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:49.216736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01301","source_version":1,"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-05-17T23:54:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bVqKmcYmFi9RTM+aFdYuP7JHASuggmVuLgNYdEhCw1sGcY+ROWRxUh+gd32fHFz/HH09sBq/NX1x0nR5YeljAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:56:37.132198Z"},"content_sha256":"25b82c2d74ed3072fd0ca87eb9c1b8863a38c7f7701757999896cb04db746a8b","schema_version":"1.0","event_id":"sha256:25b82c2d74ed3072fd0ca87eb9c1b8863a38c7f7701757999896cb04db746a8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QSGMJZNULQ5RPKJI4EFCEJVKXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructive Methods in Gallai-Ramsey Theory for Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Penland, Joshua Hiller, Mark Budden","submitted_at":"2019-02-04T16:46:16Z","abstract_excerpt":"Much recent progress in hypergraph Ramsey theory has focused on constructions that lead to lower bounds for the corresponding Ramsey numbers. In this paper, we consider applications of these results to Gallai colorings. That is, we focus on the Ramsey numbers resulting from only considering $t$-colorings of the hyperedges of complete $r$-uniform hypergraphs in which no rainbow $K_{r+1}^{(r)}$-subhypergraphs exists. We also provide new constructions which imply improved lower bounds for many $3$ and $4$-uniform Ramsey numbers and $3$ and $4$-uniform Gallai-Ramsey numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01301","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:54:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wEeObYIQeeI0chJ7PkOwz6MfDzcka896ZtYjCZz/4j887oy0qEH4lHgU6dXXsKkHiYaMnEav0+46xfVuVgD8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:56:37.132555Z"},"content_sha256":"c1807f1f8f20576d024c2efe4c118172a395a05d7a5e6198e62cd82aa7384d0f","schema_version":"1.0","event_id":"sha256:c1807f1f8f20576d024c2efe4c118172a395a05d7a5e6198e62cd82aa7384d0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSGMJZNULQ5RPKJI4EFCEJVKXP/bundle.json","state_url":"https://pith.science/pith/QSGMJZNULQ5RPKJI4EFCEJVKXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSGMJZNULQ5RPKJI4EFCEJVKXP/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-06-22T07:56:37Z","links":{"resolver":"https://pith.science/pith/QSGMJZNULQ5RPKJI4EFCEJVKXP","bundle":"https://pith.science/pith/QSGMJZNULQ5RPKJI4EFCEJVKXP/bundle.json","state":"https://pith.science/pith/QSGMJZNULQ5RPKJI4EFCEJVKXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSGMJZNULQ5RPKJI4EFCEJVKXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QSGMJZNULQ5RPKJI4EFCEJVKXP","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":"8c0b211490fa6c01bd81c88b8565e6725cebd265a8474839675ed9ec03beccea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-04T16:46:16Z","title_canon_sha256":"d28b2aba81af06575072431fcf71fc7ee46e6adacf702c7c6c77c51484f69302"},"schema_version":"1.0","source":{"id":"1902.01301","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01301","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01301v1","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01301","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"pith_short_12","alias_value":"QSGMJZNULQ5R","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QSGMJZNULQ5RPKJI","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QSGMJZNU","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:c1807f1f8f20576d024c2efe4c118172a395a05d7a5e6198e62cd82aa7384d0f","target":"graph","created_at":"2026-05-17T23:54:49Z","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"},"paper":{"abstract_excerpt":"Much recent progress in hypergraph Ramsey theory has focused on constructions that lead to lower bounds for the corresponding Ramsey numbers. In this paper, we consider applications of these results to Gallai colorings. That is, we focus on the Ramsey numbers resulting from only considering $t$-colorings of the hyperedges of complete $r$-uniform hypergraphs in which no rainbow $K_{r+1}^{(r)}$-subhypergraphs exists. We also provide new constructions which imply improved lower bounds for many $3$ and $4$-uniform Ramsey numbers and $3$ and $4$-uniform Gallai-Ramsey numbers.","authors_text":"Andrew Penland, Joshua Hiller, Mark Budden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-04T16:46:16Z","title":"Constructive Methods in Gallai-Ramsey Theory for Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01301","kind":"arxiv","version":1},"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:25b82c2d74ed3072fd0ca87eb9c1b8863a38c7f7701757999896cb04db746a8b","target":"record","created_at":"2026-05-17T23:54:49Z","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":"8c0b211490fa6c01bd81c88b8565e6725cebd265a8474839675ed9ec03beccea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-04T16:46:16Z","title_canon_sha256":"d28b2aba81af06575072431fcf71fc7ee46e6adacf702c7c6c77c51484f69302"},"schema_version":"1.0","source":{"id":"1902.01301","kind":"arxiv","version":1}},"canonical_sha256":"848cc4e5b45c3b17a928e10a2226aabbf8a02e60b5f2ac35aa281707a6e4b766","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"848cc4e5b45c3b17a928e10a2226aabbf8a02e60b5f2ac35aa281707a6e4b766","first_computed_at":"2026-05-17T23:54:49.216736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:49.216736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UXPQeJC+HU7UY3Gxtx0i8l26dkYKeHwdRjWW4TaXwtMNiaG8c/zVISDF5aDfp1tF8SmNHipDOJrALEAefQWQDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:49.217402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01301","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25b82c2d74ed3072fd0ca87eb9c1b8863a38c7f7701757999896cb04db746a8b","sha256:c1807f1f8f20576d024c2efe4c118172a395a05d7a5e6198e62cd82aa7384d0f"],"state_sha256":"2aac6fb8caef6c19900e3c13cadee21579f8ac627e6511de320cb880e7c3ea0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wBSUX86rlyzerBCdVxcz3hfvvIz9ES5a7iL09dYuubAVtVHHxngtENt7acHa9YxiaBVnmvfOeVj96yqRGTGnCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T07:56:37.134468Z","bundle_sha256":"0a3b9bc8c007529be9bbf15538bbcb2d54b4120fc96f54077e19bb1711af870e"}}