{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CFEKMYPFOPRDU2U4CVZRGIUMHG","short_pith_number":"pith:CFEKMYPF","canonical_record":{"source":{"id":"1905.11794","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-05-28T13:19:01Z","cross_cats_sorted":[],"title_canon_sha256":"1c0fb249311c7379dd285889358d0b93c59bc0101b61b950cb1317886bc96ae6","abstract_canon_sha256":"99304e1be7adee87da70f8fc148c9f6b34ee71a21f117d0ed3cbfd16a05c4bcd"},"schema_version":"1.0"},"canonical_sha256":"1148a661e573e23a6a9c157313228c3995f7d71d97c160b0b0e53745055b027e","source":{"kind":"arxiv","id":"1905.11794","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11794","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11794v1","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11794","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"pith_short_12","alias_value":"CFEKMYPFOPRD","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"CFEKMYPFOPRDU2U4","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"CFEKMYPF","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CFEKMYPFOPRDU2U4CVZRGIUMHG","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11794","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-05-28T13:19:01Z","cross_cats_sorted":[],"title_canon_sha256":"1c0fb249311c7379dd285889358d0b93c59bc0101b61b950cb1317886bc96ae6","abstract_canon_sha256":"99304e1be7adee87da70f8fc148c9f6b34ee71a21f117d0ed3cbfd16a05c4bcd"},"schema_version":"1.0"},"canonical_sha256":"1148a661e573e23a6a9c157313228c3995f7d71d97c160b0b0e53745055b027e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:52.238261Z","signature_b64":"KRLyUOyCtMf49o/oGm+HwGfvTFk5wZNxdTXcXge2fy689UjN4P0b6E+F8ufxfbQ14rs7wnDwwZKswZf/CnGWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1148a661e573e23a6a9c157313228c3995f7d71d97c160b0b0e53745055b027e","last_reissued_at":"2026-05-17T23:44:52.237656Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:52.237656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11794","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:44:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JV9Zszb82+Sk0imSEte+kaWtx9u6wbBkvhSw9/sB9FLMI858JC3vwK2iQKpItxOXP2/1mT5RqsuxJhlQRPWiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:14:17.306826Z"},"content_sha256":"d0d1b4efb71f4d5471a24944191b471d7a47414a7716e01578664ef6ee01b401","schema_version":"1.0","event_id":"sha256:d0d1b4efb71f4d5471a24944191b471d7a47414a7716e01578664ef6ee01b401"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CFEKMYPFOPRDU2U4CVZRGIUMHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Note on a generalization of Gallai-Ramsey numbers","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colton Magnant, Zhuojun Magnant","submitted_at":"2019-05-28T13:19:01Z","abstract_excerpt":"A colored complete graph is said to be Gallai-colored if it contains no rainbow triangle. This property has been shown to be equivalent to the existence of a partition of the vertices (of every induced subgraph) in which at most two colors appear on edges between the parts and at most one color appears on edges in between each pair of parts. We extend this notion by defining a coloring of a complete graph to be $k$-Gallai if every induced subgraph has a nontrivial partition of the vertices such that there are at most $k$ colors present in between parts of the partition. The generalized $(k, \\e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11794","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:44:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vb2FMPb5hP+n/VmkCQpFWg7hUgKBUJRUokf6xTc8mIijbLZ5wfoN43rIlM3cjyVoZx5gwgGvfZVo20SLqQf1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:14:17.307528Z"},"content_sha256":"063f8c046357c2e2d6ba5dc9504fec3078ac1fce8cffbd9bae9ff485edadacc9","schema_version":"1.0","event_id":"sha256:063f8c046357c2e2d6ba5dc9504fec3078ac1fce8cffbd9bae9ff485edadacc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFEKMYPFOPRDU2U4CVZRGIUMHG/bundle.json","state_url":"https://pith.science/pith/CFEKMYPFOPRDU2U4CVZRGIUMHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFEKMYPFOPRDU2U4CVZRGIUMHG/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-05-26T11:14:17Z","links":{"resolver":"https://pith.science/pith/CFEKMYPFOPRDU2U4CVZRGIUMHG","bundle":"https://pith.science/pith/CFEKMYPFOPRDU2U4CVZRGIUMHG/bundle.json","state":"https://pith.science/pith/CFEKMYPFOPRDU2U4CVZRGIUMHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFEKMYPFOPRDU2U4CVZRGIUMHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CFEKMYPFOPRDU2U4CVZRGIUMHG","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":"99304e1be7adee87da70f8fc148c9f6b34ee71a21f117d0ed3cbfd16a05c4bcd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-05-28T13:19:01Z","title_canon_sha256":"1c0fb249311c7379dd285889358d0b93c59bc0101b61b950cb1317886bc96ae6"},"schema_version":"1.0","source":{"id":"1905.11794","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11794","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11794v1","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11794","created_at":"2026-05-17T23:44:52Z"},{"alias_kind":"pith_short_12","alias_value":"CFEKMYPFOPRD","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"CFEKMYPFOPRDU2U4","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"CFEKMYPF","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:063f8c046357c2e2d6ba5dc9504fec3078ac1fce8cffbd9bae9ff485edadacc9","target":"graph","created_at":"2026-05-17T23:44:52Z","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":"A colored complete graph is said to be Gallai-colored if it contains no rainbow triangle. This property has been shown to be equivalent to the existence of a partition of the vertices (of every induced subgraph) in which at most two colors appear on edges between the parts and at most one color appears on edges in between each pair of parts. We extend this notion by defining a coloring of a complete graph to be $k$-Gallai if every induced subgraph has a nontrivial partition of the vertices such that there are at most $k$ colors present in between parts of the partition. The generalized $(k, \\e","authors_text":"Colton Magnant, Zhuojun Magnant","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-05-28T13:19:01Z","title":"Note on a generalization of Gallai-Ramsey numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11794","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:d0d1b4efb71f4d5471a24944191b471d7a47414a7716e01578664ef6ee01b401","target":"record","created_at":"2026-05-17T23:44:52Z","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":"99304e1be7adee87da70f8fc148c9f6b34ee71a21f117d0ed3cbfd16a05c4bcd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-05-28T13:19:01Z","title_canon_sha256":"1c0fb249311c7379dd285889358d0b93c59bc0101b61b950cb1317886bc96ae6"},"schema_version":"1.0","source":{"id":"1905.11794","kind":"arxiv","version":1}},"canonical_sha256":"1148a661e573e23a6a9c157313228c3995f7d71d97c160b0b0e53745055b027e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1148a661e573e23a6a9c157313228c3995f7d71d97c160b0b0e53745055b027e","first_computed_at":"2026-05-17T23:44:52.237656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:52.237656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KRLyUOyCtMf49o/oGm+HwGfvTFk5wZNxdTXcXge2fy689UjN4P0b6E+F8ufxfbQ14rs7wnDwwZKswZf/CnGWCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:52.238261Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11794","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0d1b4efb71f4d5471a24944191b471d7a47414a7716e01578664ef6ee01b401","sha256:063f8c046357c2e2d6ba5dc9504fec3078ac1fce8cffbd9bae9ff485edadacc9"],"state_sha256":"2f46c64db291775f4d918e2df11c196a3a5b158bc7d8a709f2217b87238cf5e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYjtx/aR6rd+Bcp1I16gBpL+gU1ouwiCtqWZRoiCwZtMOZrWvHqzP3gxc8rb11i/IFoJTWl4tIzMCHkwc/lsBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:14:17.312681Z","bundle_sha256":"1a6747dc127775f35e904ed52ad2a15bef7cd139779884fc968b439c978164ca"}}