{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XB4ZLJQRK7AXZWVCRBQILB2TG6","short_pith_number":"pith:XB4ZLJQR","schema_version":"1.0","canonical_sha256":"b87995a61157c17cdaa2886085875337ad2ce2f9a3d3f63d435db7c8b50e0c50","source":{"kind":"arxiv","id":"1902.10004","version":1},"attestation_state":"computed","paper":{"title":"Vertex-monochromatic connectivity of strong digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Diego Gonz\\'alez-Moreno, Juan Jos\\'e Montellano-Ballesteros, Mucuy-Kak Guevara","submitted_at":"2019-02-26T15:40:26Z","abstract_excerpt":"A vertex coloring of a strong digraph $D$ is a \\emph{strong vertex-monochromatic connection coloring (SVMC-coloring)} if for every pair $u, v$ of vertices in $D$ there exists an $(u,v)$-path having all its internal vertices of the same color. Let $smc_v(D)$ denote the maximum number of colors used in an SVMC-coloring of a digraph $D$. In this paper we determine the value of $smc_v(D)$, whenever $D$ is the line digraph of a digraph. Also, if $T$ is a tournament, we give conditions to find the exact value of $smc_v(T)$."},"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":"1902.10004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-26T15:40:26Z","cross_cats_sorted":[],"title_canon_sha256":"f6efdb8a7c6bb6fa86a8b8f2a74c7effc9c950affc37c4c51f6b958bb9f3a969","abstract_canon_sha256":"6230af75fb29631f33faf0480841d2eb92b8268556d1e33b99c958e45ee96e5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:34.873884Z","signature_b64":"O1or+QGlIxgYLR7owd54BHTHdu2Jv7PcKM6ZOgz/8a8GaAM1fcpInyK85N9TmeC3zuAMtdSOTBWpYKoe8B2wDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b87995a61157c17cdaa2886085875337ad2ce2f9a3d3f63d435db7c8b50e0c50","last_reissued_at":"2026-05-17T23:52:34.873477Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:34.873477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex-monochromatic connectivity of strong digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Diego Gonz\\'alez-Moreno, Juan Jos\\'e Montellano-Ballesteros, Mucuy-Kak Guevara","submitted_at":"2019-02-26T15:40:26Z","abstract_excerpt":"A vertex coloring of a strong digraph $D$ is a \\emph{strong vertex-monochromatic connection coloring (SVMC-coloring)} if for every pair $u, v$ of vertices in $D$ there exists an $(u,v)$-path having all its internal vertices of the same color. Let $smc_v(D)$ denote the maximum number of colors used in an SVMC-coloring of a digraph $D$. In this paper we determine the value of $smc_v(D)$, whenever $D$ is the line digraph of a digraph. Also, if $T$ is a tournament, we give conditions to find the exact value of $smc_v(T)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10004","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":"1902.10004","created_at":"2026-05-17T23:52:34.873540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10004v1","created_at":"2026-05-17T23:52:34.873540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10004","created_at":"2026-05-17T23:52:34.873540+00:00"},{"alias_kind":"pith_short_12","alias_value":"XB4ZLJQRK7AX","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XB4ZLJQRK7AXZWVC","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XB4ZLJQR","created_at":"2026-05-18T12:33:33.725879+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/XB4ZLJQRK7AXZWVCRBQILB2TG6","json":"https://pith.science/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6.json","graph_json":"https://pith.science/api/pith-number/XB4ZLJQRK7AXZWVCRBQILB2TG6/graph.json","events_json":"https://pith.science/api/pith-number/XB4ZLJQRK7AXZWVCRBQILB2TG6/events.json","paper":"https://pith.science/paper/XB4ZLJQR"},"agent_actions":{"view_html":"https://pith.science/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6","download_json":"https://pith.science/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6.json","view_paper":"https://pith.science/paper/XB4ZLJQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10004&json=true","fetch_graph":"https://pith.science/api/pith-number/XB4ZLJQRK7AXZWVCRBQILB2TG6/graph.json","fetch_events":"https://pith.science/api/pith-number/XB4ZLJQRK7AXZWVCRBQILB2TG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6/action/storage_attestation","attest_author":"https://pith.science/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6/action/author_attestation","sign_citation":"https://pith.science/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6/action/citation_signature","submit_replication":"https://pith.science/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6/action/replication_record"}},"created_at":"2026-05-17T23:52:34.873540+00:00","updated_at":"2026-05-17T23:52:34.873540+00:00"}