{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6FQYZYZ2NNOMTLEZPNRKPP7S3F","short_pith_number":"pith:6FQYZYZ2","canonical_record":{"source":{"id":"1503.08941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-31T07:44:46Z","cross_cats_sorted":[],"title_canon_sha256":"8d908a905a569a8048c507950aed5928d4520eccd8361ee56080e25a2dc5b15c","abstract_canon_sha256":"4bf14875c84598c4ff70980d16872e730067846201ac0ea0260421e7936c9e5a"},"schema_version":"1.0"},"canonical_sha256":"f1618ce33a6b5cc9ac997b62a7bff2d94e1bc0db668c7e27a60715726173a44c","source":{"kind":"arxiv","id":"1503.08941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08941","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08941v1","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08941","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"pith_short_12","alias_value":"6FQYZYZ2NNOM","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6FQYZYZ2NNOMTLEZ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6FQYZYZ2","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6FQYZYZ2NNOMTLEZPNRKPP7S3F","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-31T07:44:46Z","cross_cats_sorted":[],"title_canon_sha256":"8d908a905a569a8048c507950aed5928d4520eccd8361ee56080e25a2dc5b15c","abstract_canon_sha256":"4bf14875c84598c4ff70980d16872e730067846201ac0ea0260421e7936c9e5a"},"schema_version":"1.0"},"canonical_sha256":"f1618ce33a6b5cc9ac997b62a7bff2d94e1bc0db668c7e27a60715726173a44c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:51.795039Z","signature_b64":"qRgPGYzNb8oJrRfu6dIPa0/yotNvB5Vzkknq62EOdduKFNQ0xxkkFrPEZEvAuUEaAcSi8Bz/KwmJaQNJCwWaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1618ce33a6b5cc9ac997b62a7bff2d94e1bc0db668c7e27a60715726173a44c","last_reissued_at":"2026-05-18T02:19:51.794460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:51.794460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08941","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:19:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2DYHpeLrXN/Md5akSbaikMiwz5iDHmOU0oTuYrmh4ds9MRgKH6CA3kwlUE/Ottds8Dx3t7ksj/bBsNf+FNwBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:24:25.994511Z"},"content_sha256":"3be66901a1b6e864b4721499c44561c9f3ce5f19f51c41a0faf9efd795c45686","schema_version":"1.0","event_id":"sha256:3be66901a1b6e864b4721499c44561c9f3ce5f19f51c41a0faf9efd795c45686"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6FQYZYZ2NNOMTLEZPNRKPP7S3F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some extremal results on the colorful monochromatic vertex-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":"2015-03-31T07:44:46Z","abstract_excerpt":"A path in a vertex-colored graph is called a \\emph{vertex-monochromatic path} if its internal vertices have the same color. A vertex-coloring of a graph is a \\emph{monochromatic vertex-connection coloring} (\\emph{MVC-coloring} for short), if there is a vertex-monochromatic path joining any two vertices in the graph. For a connected graph $G$, the \\emph{monochromatic vertex-connection number}, denoted by $mvc(G)$, is defined to be the maximum number of colors used in an \\emph{MVC-coloring} of $G$. These concepts of vertex-version are natural generalizations of the colorful monochromatic connect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08941","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:19:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GgwmdzJ7Oa/5Tg+2/miYkqtRXI5ldZS8KU5slthxmIHZYorJhgSHgQy3lOeICHqHHvWCbsVPFWKGsseayRjeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:24:25.994860Z"},"content_sha256":"1d0d5af39fe0472d28ee60267a2eeaca7f8ec18841603a3d381fcd2211701ace","schema_version":"1.0","event_id":"sha256:1d0d5af39fe0472d28ee60267a2eeaca7f8ec18841603a3d381fcd2211701ace"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F/bundle.json","state_url":"https://pith.science/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F/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-01T15:24:25Z","links":{"resolver":"https://pith.science/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F","bundle":"https://pith.science/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F/bundle.json","state":"https://pith.science/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6FQYZYZ2NNOMTLEZPNRKPP7S3F","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":"4bf14875c84598c4ff70980d16872e730067846201ac0ea0260421e7936c9e5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-31T07:44:46Z","title_canon_sha256":"8d908a905a569a8048c507950aed5928d4520eccd8361ee56080e25a2dc5b15c"},"schema_version":"1.0","source":{"id":"1503.08941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08941","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08941v1","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08941","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"pith_short_12","alias_value":"6FQYZYZ2NNOM","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6FQYZYZ2NNOMTLEZ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6FQYZYZ2","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:1d0d5af39fe0472d28ee60267a2eeaca7f8ec18841603a3d381fcd2211701ace","target":"graph","created_at":"2026-05-18T02:19:51Z","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 a vertex-colored graph is called a \\emph{vertex-monochromatic path} if its internal vertices have the same color. A vertex-coloring of a graph is a \\emph{monochromatic vertex-connection coloring} (\\emph{MVC-coloring} for short), if there is a vertex-monochromatic path joining any two vertices in the graph. For a connected graph $G$, the \\emph{monochromatic vertex-connection number}, denoted by $mvc(G)$, is defined to be the maximum number of colors used in an \\emph{MVC-coloring} of $G$. These concepts of vertex-version are natural generalizations of the colorful monochromatic connect","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":"2015-03-31T07:44:46Z","title":"Some extremal results on the colorful monochromatic vertex-connectivity of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08941","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:3be66901a1b6e864b4721499c44561c9f3ce5f19f51c41a0faf9efd795c45686","target":"record","created_at":"2026-05-18T02:19:51Z","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":"4bf14875c84598c4ff70980d16872e730067846201ac0ea0260421e7936c9e5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-31T07:44:46Z","title_canon_sha256":"8d908a905a569a8048c507950aed5928d4520eccd8361ee56080e25a2dc5b15c"},"schema_version":"1.0","source":{"id":"1503.08941","kind":"arxiv","version":1}},"canonical_sha256":"f1618ce33a6b5cc9ac997b62a7bff2d94e1bc0db668c7e27a60715726173a44c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1618ce33a6b5cc9ac997b62a7bff2d94e1bc0db668c7e27a60715726173a44c","first_computed_at":"2026-05-18T02:19:51.794460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:51.794460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qRgPGYzNb8oJrRfu6dIPa0/yotNvB5Vzkknq62EOdduKFNQ0xxkkFrPEZEvAuUEaAcSi8Bz/KwmJaQNJCwWaAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:51.795039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3be66901a1b6e864b4721499c44561c9f3ce5f19f51c41a0faf9efd795c45686","sha256:1d0d5af39fe0472d28ee60267a2eeaca7f8ec18841603a3d381fcd2211701ace"],"state_sha256":"9272accc20aa44d5fb6f23bcac4ac7630071cf78a304692b19ef1d2979c10ca6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jEzdAazVtHADi1a9AErttoDr/VBrGGMAuHg34O3MFXgllsuXiQtKxM/rRFf1I5C/iRXm/keVOj1LMb11dX3jAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:24:25.996811Z","bundle_sha256":"cf6bc816e606ef76ed90d73530433993a0d8d73fbc4f3d4ad203a0de4cbccc2b"}}