{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XB4ZLJQRK7AXZWVCRBQILB2TG6","short_pith_number":"pith:XB4ZLJQR","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"},"canonical_sha256":"b87995a61157c17cdaa2886085875337ad2ce2f9a3d3f63d435db7c8b50e0c50","source":{"kind":"arxiv","id":"1902.10004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10004","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10004v1","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10004","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"XB4ZLJQRK7AX","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XB4ZLJQRK7AXZWVC","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XB4ZLJQR","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XB4ZLJQRK7AXZWVCRBQILB2TG6","target":"record","payload":{"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"},"canonical_sha256":"b87995a61157c17cdaa2886085875337ad2ce2f9a3d3f63d435db7c8b50e0c50","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"},"source_kind":"arxiv","source_id":"1902.10004","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-17T23:52:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D6TiA45Vc3YB9lS6Jog9KMBmDDJZ03RuMaMriMwXJ67IAUXmgdjb4D+Zjv2sUiTnxWY/bAJrKf0LOCODeEz7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:20:21.268698Z"},"content_sha256":"9ac8020cd5eaa22a44295c702114b4742726d189260c103f902e1126880c9a56","schema_version":"1.0","event_id":"sha256:9ac8020cd5eaa22a44295c702114b4742726d189260c103f902e1126880c9a56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XB4ZLJQRK7AXZWVCRBQILB2TG6","target":"graph","payload":{"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"},"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-17T23:52:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qiOsPlDUiqeQq1rAg3WM+ntuXuEYaY6wcPMEMJlvKY7+SrSs65UR3dJfFLhD8L+RUCDJtGAgmh4O49Fh5txBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:20:21.269036Z"},"content_sha256":"a5faeebcead3d6a88ecffc5b8acaf4821e75b83b43fc08da9042b983495fc006","schema_version":"1.0","event_id":"sha256:a5faeebcead3d6a88ecffc5b8acaf4821e75b83b43fc08da9042b983495fc006"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6/bundle.json","state_url":"https://pith.science/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6/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-27T10:20:21Z","links":{"resolver":"https://pith.science/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6","bundle":"https://pith.science/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6/bundle.json","state":"https://pith.science/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XB4ZLJQRK7AXZWVCRBQILB2TG6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XB4ZLJQRK7AXZWVCRBQILB2TG6","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":"6230af75fb29631f33faf0480841d2eb92b8268556d1e33b99c958e45ee96e5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-26T15:40:26Z","title_canon_sha256":"f6efdb8a7c6bb6fa86a8b8f2a74c7effc9c950affc37c4c51f6b958bb9f3a969"},"schema_version":"1.0","source":{"id":"1902.10004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10004","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10004v1","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10004","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"XB4ZLJQRK7AX","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XB4ZLJQRK7AXZWVC","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XB4ZLJQR","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:a5faeebcead3d6a88ecffc5b8acaf4821e75b83b43fc08da9042b983495fc006","target":"graph","created_at":"2026-05-17T23:52:34Z","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 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)$.","authors_text":"Diego Gonz\\'alez-Moreno, Juan Jos\\'e Montellano-Ballesteros, Mucuy-Kak Guevara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-26T15:40:26Z","title":"Vertex-monochromatic connectivity of strong digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10004","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:9ac8020cd5eaa22a44295c702114b4742726d189260c103f902e1126880c9a56","target":"record","created_at":"2026-05-17T23:52:34Z","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":"6230af75fb29631f33faf0480841d2eb92b8268556d1e33b99c958e45ee96e5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-26T15:40:26Z","title_canon_sha256":"f6efdb8a7c6bb6fa86a8b8f2a74c7effc9c950affc37c4c51f6b958bb9f3a969"},"schema_version":"1.0","source":{"id":"1902.10004","kind":"arxiv","version":1}},"canonical_sha256":"b87995a61157c17cdaa2886085875337ad2ce2f9a3d3f63d435db7c8b50e0c50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b87995a61157c17cdaa2886085875337ad2ce2f9a3d3f63d435db7c8b50e0c50","first_computed_at":"2026-05-17T23:52:34.873477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:34.873477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O1or+QGlIxgYLR7owd54BHTHdu2Jv7PcKM6ZOgz/8a8GaAM1fcpInyK85N9TmeC3zuAMtdSOTBWpYKoe8B2wDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:34.873884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ac8020cd5eaa22a44295c702114b4742726d189260c103f902e1126880c9a56","sha256:a5faeebcead3d6a88ecffc5b8acaf4821e75b83b43fc08da9042b983495fc006"],"state_sha256":"e02c4ea3017e14b61ce7a25541ef9316a4f2a2f7e73fb781284a2e8e52dc92b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0U89hPK++0KZpYhbZKujT9vdhWpOWtuTJ/IjcQk22NB2Jtz40RoNuxxx+1rsk4DCXKgl7WJCE3J+VW86dYGhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T10:20:21.270961Z","bundle_sha256":"d81e5e920531c7ad3ff6e09df096af2bc4532d8f9aec128f55c6fff1e2eb0bb0"}}