{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6FQYZYZ2NNOMTLEZPNRKPP7S3F","short_pith_number":"pith:6FQYZYZ2","schema_version":"1.0","canonical_sha256":"f1618ce33a6b5cc9ac997b62a7bff2d94e1bc0db668c7e27a60715726173a44c","source":{"kind":"arxiv","id":"1503.08941","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.08941","created_at":"2026-05-18T02:19:51.794565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08941v1","created_at":"2026-05-18T02:19:51.794565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08941","created_at":"2026-05-18T02:19:51.794565+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FQYZYZ2NNOM","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FQYZYZ2NNOMTLEZ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FQYZYZ2","created_at":"2026-05-18T12:29:07.941421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F","json":"https://pith.science/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F.json","graph_json":"https://pith.science/api/pith-number/6FQYZYZ2NNOMTLEZPNRKPP7S3F/graph.json","events_json":"https://pith.science/api/pith-number/6FQYZYZ2NNOMTLEZPNRKPP7S3F/events.json","paper":"https://pith.science/paper/6FQYZYZ2"},"agent_actions":{"view_html":"https://pith.science/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F","download_json":"https://pith.science/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F.json","view_paper":"https://pith.science/paper/6FQYZYZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08941&json=true","fetch_graph":"https://pith.science/api/pith-number/6FQYZYZ2NNOMTLEZPNRKPP7S3F/graph.json","fetch_events":"https://pith.science/api/pith-number/6FQYZYZ2NNOMTLEZPNRKPP7S3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F/action/storage_attestation","attest_author":"https://pith.science/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F/action/author_attestation","sign_citation":"https://pith.science/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F/action/citation_signature","submit_replication":"https://pith.science/pith/6FQYZYZ2NNOMTLEZPNRKPP7S3F/action/replication_record"}},"created_at":"2026-05-18T02:19:51.794565+00:00","updated_at":"2026-05-18T02:19:51.794565+00:00"}