{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OWAJ7AA7HOSJPEHCOJIUHXONGP","short_pith_number":"pith:OWAJ7AA7","canonical_record":{"source":{"id":"1809.10298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-26T17:58:39Z","cross_cats_sorted":[],"title_canon_sha256":"2a182955cfad9eb609a13a43be70ec6e384c58665b35c12eff52e9989f3a97a0","abstract_canon_sha256":"c4f7a1eb13a8daffd7063b8029b31528d9f634de878f7f658288f016678e4382"},"schema_version":"1.0"},"canonical_sha256":"75809f801f3ba49790e2725143ddcd33c22907de20e7fb09e28fbc28893d5acd","source":{"kind":"arxiv","id":"1809.10298","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10298","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10298v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10298","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"OWAJ7AA7HOSJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OWAJ7AA7HOSJPEHC","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OWAJ7AA7","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OWAJ7AA7HOSJPEHCOJIUHXONGP","target":"record","payload":{"canonical_record":{"source":{"id":"1809.10298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-26T17:58:39Z","cross_cats_sorted":[],"title_canon_sha256":"2a182955cfad9eb609a13a43be70ec6e384c58665b35c12eff52e9989f3a97a0","abstract_canon_sha256":"c4f7a1eb13a8daffd7063b8029b31528d9f634de878f7f658288f016678e4382"},"schema_version":"1.0"},"canonical_sha256":"75809f801f3ba49790e2725143ddcd33c22907de20e7fb09e28fbc28893d5acd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:38.668272Z","signature_b64":"atJv/rSgGF26UdfCgGAZ44rOhiNRE3kz40F+jdiYjEcsKPPQMhzpgp7DELnQK+vnkaZC9psi5DFI1/412SKkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75809f801f3ba49790e2725143ddcd33c22907de20e7fb09e28fbc28893d5acd","last_reissued_at":"2026-05-18T00:04:38.667709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:38.667709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.10298","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-18T00:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2E/dFYa5Dv09W1ZW6JP2P6RCuapN7aJl0wZD05YPWbXUAMnWJhDVluAfWAGBxGQz5QF+FLT3T394abxzZzPOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:45:58.315569Z"},"content_sha256":"7ea33ea8a777618da77b26e07b46a0690fe261a1620a9102a58817e5ca58b026","schema_version":"1.0","event_id":"sha256:7ea33ea8a777618da77b26e07b46a0690fe261a1620a9102a58817e5ca58b026"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OWAJ7AA7HOSJPEHCOJIUHXONGP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colton Magnant, Jinyu Zou, Yaping Mao, Zhao Wang","submitted_at":"2018-09-26T17:58:39Z","abstract_excerpt":"Given a graph $G$ and a positive integer $k$, define the \\emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$-edge coloring of $K_n$ contains either a rainbow (all different colored) triangle or a monochromatic copy of $G$. In this paper, we consider two classes of unicyclic graphs, the star with an extra edge and the path with a triangle at one end. We provide the $2$-color Ramsey numbers for these two classes of graphs and use these to obtain general upper and lower bounds on the Gallai-Ramsey numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10298","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-18T00:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7ks7WNLEMRqTu/uMGpH5PRYClRxFEd9vMTIgxC1o2cvF25uhJJxVAxGy/zPYZcjskCDCvg7hPforq8ulwz0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:45:58.316216Z"},"content_sha256":"9ccc6fd00bd6f7516b5996b8e1b5d1cda94b08b7e69dfe3dce0abd063a2c10cb","schema_version":"1.0","event_id":"sha256:9ccc6fd00bd6f7516b5996b8e1b5d1cda94b08b7e69dfe3dce0abd063a2c10cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OWAJ7AA7HOSJPEHCOJIUHXONGP/bundle.json","state_url":"https://pith.science/pith/OWAJ7AA7HOSJPEHCOJIUHXONGP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OWAJ7AA7HOSJPEHCOJIUHXONGP/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-26T13:45:58Z","links":{"resolver":"https://pith.science/pith/OWAJ7AA7HOSJPEHCOJIUHXONGP","bundle":"https://pith.science/pith/OWAJ7AA7HOSJPEHCOJIUHXONGP/bundle.json","state":"https://pith.science/pith/OWAJ7AA7HOSJPEHCOJIUHXONGP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OWAJ7AA7HOSJPEHCOJIUHXONGP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OWAJ7AA7HOSJPEHCOJIUHXONGP","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":"c4f7a1eb13a8daffd7063b8029b31528d9f634de878f7f658288f016678e4382","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-26T17:58:39Z","title_canon_sha256":"2a182955cfad9eb609a13a43be70ec6e384c58665b35c12eff52e9989f3a97a0"},"schema_version":"1.0","source":{"id":"1809.10298","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10298","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10298v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10298","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"OWAJ7AA7HOSJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OWAJ7AA7HOSJPEHC","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OWAJ7AA7","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:9ccc6fd00bd6f7516b5996b8e1b5d1cda94b08b7e69dfe3dce0abd063a2c10cb","target":"graph","created_at":"2026-05-18T00:04:38Z","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":"Given a graph $G$ and a positive integer $k$, define the \\emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$-edge coloring of $K_n$ contains either a rainbow (all different colored) triangle or a monochromatic copy of $G$. In this paper, we consider two classes of unicyclic graphs, the star with an extra edge and the path with a triangle at one end. We provide the $2$-color Ramsey numbers for these two classes of graphs and use these to obtain general upper and lower bounds on the Gallai-Ramsey numbers.","authors_text":"Colton Magnant, Jinyu Zou, Yaping Mao, Zhao Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-26T17:58:39Z","title":"Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10298","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:7ea33ea8a777618da77b26e07b46a0690fe261a1620a9102a58817e5ca58b026","target":"record","created_at":"2026-05-18T00:04:38Z","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":"c4f7a1eb13a8daffd7063b8029b31528d9f634de878f7f658288f016678e4382","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-26T17:58:39Z","title_canon_sha256":"2a182955cfad9eb609a13a43be70ec6e384c58665b35c12eff52e9989f3a97a0"},"schema_version":"1.0","source":{"id":"1809.10298","kind":"arxiv","version":1}},"canonical_sha256":"75809f801f3ba49790e2725143ddcd33c22907de20e7fb09e28fbc28893d5acd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75809f801f3ba49790e2725143ddcd33c22907de20e7fb09e28fbc28893d5acd","first_computed_at":"2026-05-18T00:04:38.667709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:38.667709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"atJv/rSgGF26UdfCgGAZ44rOhiNRE3kz40F+jdiYjEcsKPPQMhzpgp7DELnQK+vnkaZC9psi5DFI1/412SKkDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:38.668272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10298","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ea33ea8a777618da77b26e07b46a0690fe261a1620a9102a58817e5ca58b026","sha256:9ccc6fd00bd6f7516b5996b8e1b5d1cda94b08b7e69dfe3dce0abd063a2c10cb"],"state_sha256":"c6194744f51f717dfdbd80e3238213f33478ef4afcf34575af5b0e5ef68edcc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vy+sB60KyZikAs7oBgGX1+exmoJPRHCBiSwtjLAX6IOIZ8iL/uX1J67JCoeC8rainbeCHZtmbUv64xiSvRD6Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:45:58.319932Z","bundle_sha256":"c7d017db6e0164d1b3f9ef4f6b9961b9b859b4ee407f6b5d00d01c2126ea5384"}}