{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZFB63HBBG3MDMD7QYF3X6BQB7O","short_pith_number":"pith:ZFB63HBB","canonical_record":{"source":{"id":"1412.7798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-25T06:57:21Z","cross_cats_sorted":[],"title_canon_sha256":"2a115a7b8d369a28ee4d170cd06d345d341b28ceb7bd92b0e80675b6d9ae48b6","abstract_canon_sha256":"af9a91095936509530f07f198997dc2adb9381a08bc34b3f495af76a1aa416e0"},"schema_version":"1.0"},"canonical_sha256":"c943ed9c2136d8360ff0c1777f0601fbaadbd52510b7c35c4329b7cd45cc799b","source":{"kind":"arxiv","id":"1412.7798","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7798","created_at":"2026-05-18T02:30:25Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7798v1","created_at":"2026-05-18T02:30:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7798","created_at":"2026-05-18T02:30:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZFB63HBBG3MD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZFB63HBBG3MDMD7Q","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZFB63HBB","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZFB63HBBG3MDMD7QYF3X6BQB7O","target":"record","payload":{"canonical_record":{"source":{"id":"1412.7798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-25T06:57:21Z","cross_cats_sorted":[],"title_canon_sha256":"2a115a7b8d369a28ee4d170cd06d345d341b28ceb7bd92b0e80675b6d9ae48b6","abstract_canon_sha256":"af9a91095936509530f07f198997dc2adb9381a08bc34b3f495af76a1aa416e0"},"schema_version":"1.0"},"canonical_sha256":"c943ed9c2136d8360ff0c1777f0601fbaadbd52510b7c35c4329b7cd45cc799b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:25.121587Z","signature_b64":"DDZbvxS/6khvFNXL2uRCsHLpwWCjkd1kbeu1Z88R2Dz6ZROgoknDGRmhI4OVFkSFIWMF+eAeR5TP8bh3C/GGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c943ed9c2136d8360ff0c1777f0601fbaadbd52510b7c35c4329b7cd45cc799b","last_reissued_at":"2026-05-18T02:30:25.121198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:25.121198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.7798","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-18T02:30:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pa1hoAyqY48X7D2bvdv5I+HsddFYxAnZgNZ6eSqHl+/mKMqC8n9CIRDqBvfytSQG5D0kmhzIVe0jXbnq/tY8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:33:24.766463Z"},"content_sha256":"d9b5a2c5c51868e76addb1519221e8c5983326209ea776bfb84a3e616978cfe8","schema_version":"1.0","event_id":"sha256:d9b5a2c5c51868e76addb1519221e8c5983326209ea776bfb84a3e616978cfe8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZFB63HBBG3MDMD7QYF3X6BQB7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Erd\\H{o}s-Gallai-type results for colorful monochromatic connectivity of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Di Wu, Qingqiong Cai, Xueliang Li","submitted_at":"2014-12-25T06:57:21Z","abstract_excerpt":"A path in an edge-colored graph is called a \\emph{monochromatic path} if all the edges on the path are colored the same. An edge-coloring of $G$ is a \\emph{monochromatic connection coloring} (MC-coloring, for short) if there is a monochromatic path joining any two vertices in $G$. The \\emph{monochromatic connection number}, denoted by $mc(G)$, is defined to be the maximum number of colors used in an MC-coloring of a graph $G$. These concepts were introduced by Caro and Yuster, and they got some nice results. In this paper, we will study two kinds of Erd\\H{o}s-Gallai-type problems for $mc(G)$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7798","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-18T02:30:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W94BtIUsn2K7Xmt6qkZGB30rfUc8jQZml8ovv9P5FBoFVA8wupyjcffuI3c0YWxRQAVFNbKpgMpg4awBNiIMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:33:24.766816Z"},"content_sha256":"ec54b118e2806f34020b60137b02e600eea62fd793e699f19b993fc13348af73","schema_version":"1.0","event_id":"sha256:ec54b118e2806f34020b60137b02e600eea62fd793e699f19b993fc13348af73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O/bundle.json","state_url":"https://pith.science/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O/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-01T16:33:24Z","links":{"resolver":"https://pith.science/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O","bundle":"https://pith.science/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O/bundle.json","state":"https://pith.science/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFB63HBBG3MDMD7QYF3X6BQB7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZFB63HBBG3MDMD7QYF3X6BQB7O","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":"af9a91095936509530f07f198997dc2adb9381a08bc34b3f495af76a1aa416e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-25T06:57:21Z","title_canon_sha256":"2a115a7b8d369a28ee4d170cd06d345d341b28ceb7bd92b0e80675b6d9ae48b6"},"schema_version":"1.0","source":{"id":"1412.7798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7798","created_at":"2026-05-18T02:30:25Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7798v1","created_at":"2026-05-18T02:30:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7798","created_at":"2026-05-18T02:30:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZFB63HBBG3MD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZFB63HBBG3MDMD7Q","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZFB63HBB","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:ec54b118e2806f34020b60137b02e600eea62fd793e699f19b993fc13348af73","target":"graph","created_at":"2026-05-18T02:30:25Z","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 path in an edge-colored graph is called a \\emph{monochromatic path} if all the edges on the path are colored the same. An edge-coloring of $G$ is a \\emph{monochromatic connection coloring} (MC-coloring, for short) if there is a monochromatic path joining any two vertices in $G$. The \\emph{monochromatic connection number}, denoted by $mc(G)$, is defined to be the maximum number of colors used in an MC-coloring of a graph $G$. These concepts were introduced by Caro and Yuster, and they got some nice results. In this paper, we will study two kinds of Erd\\H{o}s-Gallai-type problems for $mc(G)$, ","authors_text":"Di Wu, Qingqiong Cai, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-25T06:57:21Z","title":"Erd\\H{o}s-Gallai-type results for colorful monochromatic connectivity of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7798","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:d9b5a2c5c51868e76addb1519221e8c5983326209ea776bfb84a3e616978cfe8","target":"record","created_at":"2026-05-18T02:30:25Z","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":"af9a91095936509530f07f198997dc2adb9381a08bc34b3f495af76a1aa416e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-25T06:57:21Z","title_canon_sha256":"2a115a7b8d369a28ee4d170cd06d345d341b28ceb7bd92b0e80675b6d9ae48b6"},"schema_version":"1.0","source":{"id":"1412.7798","kind":"arxiv","version":1}},"canonical_sha256":"c943ed9c2136d8360ff0c1777f0601fbaadbd52510b7c35c4329b7cd45cc799b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c943ed9c2136d8360ff0c1777f0601fbaadbd52510b7c35c4329b7cd45cc799b","first_computed_at":"2026-05-18T02:30:25.121198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:25.121198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DDZbvxS/6khvFNXL2uRCsHLpwWCjkd1kbeu1Z88R2Dz6ZROgoknDGRmhI4OVFkSFIWMF+eAeR5TP8bh3C/GGCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:25.121587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.7798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9b5a2c5c51868e76addb1519221e8c5983326209ea776bfb84a3e616978cfe8","sha256:ec54b118e2806f34020b60137b02e600eea62fd793e699f19b993fc13348af73"],"state_sha256":"5b37d5e46d5dfbf3e708955b1f5344797df5785fa47f618d9a0c6e8f80c3ffed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nYDm/qh1tEYLl8YKPhZSI0OlG4wNebaLesc4hPcp0GQmPVHOCMl/f7GLDO1ZlhoGS+4OUtJ33ad94a/UsdC6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:33:24.768758Z","bundle_sha256":"bb1695b690ac8e86a03b61c0ba5bac63df7facef726a4cac62d7494c8e6de3bf"}}