{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KIXLUCZX7NO5GECBZM6LRE34R3","short_pith_number":"pith:KIXLUCZX","schema_version":"1.0","canonical_sha256":"522eba0b37fb5dd31041cb3cb8937c8ed37518722f1830ad35255ad05a8aee66","source":{"kind":"arxiv","id":"1603.05338","version":2},"attestation_state":"computed","paper":{"title":"The (vertex-)monochromatic index of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Di Wu, Xueliang Li","submitted_at":"2016-03-17T02:31:54Z","abstract_excerpt":"A tree $T$ in an edge-colored graph $H$ is called a \\emph{monochromatic tree} if all the edges of $T$ have the same color. For $S\\subseteq V(H)$, a \\emph{monochromatic $S$-tree} in $H$ is a monochromatic tree of $H$ containing the vertices of $S$. For a connected graph $G$ and a given integer $k$ with $2\\leq k\\leq |V(G)|$, the \\emph{$k$-monochromatic index $mx_k(G)$} of $G$ is the maximum number of colors needed such that for each subset $S\\subseteq V(G)$ of $k$ vertices, there exists a monochromatic $S$-tree. In this paper, we prove that for any connected graph $G$, $mx_k(G)=|E(G)|-|V(G)|+2$ "},"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":"1603.05338","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-17T02:31:54Z","cross_cats_sorted":[],"title_canon_sha256":"3a328fbd94982ab03e8499233a6291b4298ea95f169c1d440c66fa36d021c210","abstract_canon_sha256":"92659672573c8a3f6f95e299614abdec1df24abf978fe70a27f50047fa635472"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:52.082676Z","signature_b64":"dhv1dzQZYg1ePsx8C/9Vf1HaMQZ/+LqzA4QmRoqFK4GzJ1OQIJ9JUe5zE3pkf9LeIm2aAYZ/+66cbnpxICnZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"522eba0b37fb5dd31041cb3cb8937c8ed37518722f1830ad35255ad05a8aee66","last_reissued_at":"2026-05-18T01:18:52.082124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:52.082124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The (vertex-)monochromatic index of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Di Wu, Xueliang Li","submitted_at":"2016-03-17T02:31:54Z","abstract_excerpt":"A tree $T$ in an edge-colored graph $H$ is called a \\emph{monochromatic tree} if all the edges of $T$ have the same color. For $S\\subseteq V(H)$, a \\emph{monochromatic $S$-tree} in $H$ is a monochromatic tree of $H$ containing the vertices of $S$. For a connected graph $G$ and a given integer $k$ with $2\\leq k\\leq |V(G)|$, the \\emph{$k$-monochromatic index $mx_k(G)$} of $G$ is the maximum number of colors needed such that for each subset $S\\subseteq V(G)$ of $k$ vertices, there exists a monochromatic $S$-tree. In this paper, we prove that for any connected graph $G$, $mx_k(G)=|E(G)|-|V(G)|+2$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05338","kind":"arxiv","version":2},"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":"1603.05338","created_at":"2026-05-18T01:18:52.082206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05338v2","created_at":"2026-05-18T01:18:52.082206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05338","created_at":"2026-05-18T01:18:52.082206+00:00"},{"alias_kind":"pith_short_12","alias_value":"KIXLUCZX7NO5","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KIXLUCZX7NO5GECB","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KIXLUCZX","created_at":"2026-05-18T12:30:25.849896+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/KIXLUCZX7NO5GECBZM6LRE34R3","json":"https://pith.science/pith/KIXLUCZX7NO5GECBZM6LRE34R3.json","graph_json":"https://pith.science/api/pith-number/KIXLUCZX7NO5GECBZM6LRE34R3/graph.json","events_json":"https://pith.science/api/pith-number/KIXLUCZX7NO5GECBZM6LRE34R3/events.json","paper":"https://pith.science/paper/KIXLUCZX"},"agent_actions":{"view_html":"https://pith.science/pith/KIXLUCZX7NO5GECBZM6LRE34R3","download_json":"https://pith.science/pith/KIXLUCZX7NO5GECBZM6LRE34R3.json","view_paper":"https://pith.science/paper/KIXLUCZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05338&json=true","fetch_graph":"https://pith.science/api/pith-number/KIXLUCZX7NO5GECBZM6LRE34R3/graph.json","fetch_events":"https://pith.science/api/pith-number/KIXLUCZX7NO5GECBZM6LRE34R3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KIXLUCZX7NO5GECBZM6LRE34R3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KIXLUCZX7NO5GECBZM6LRE34R3/action/storage_attestation","attest_author":"https://pith.science/pith/KIXLUCZX7NO5GECBZM6LRE34R3/action/author_attestation","sign_citation":"https://pith.science/pith/KIXLUCZX7NO5GECBZM6LRE34R3/action/citation_signature","submit_replication":"https://pith.science/pith/KIXLUCZX7NO5GECBZM6LRE34R3/action/replication_record"}},"created_at":"2026-05-18T01:18:52.082206+00:00","updated_at":"2026-05-18T01:18:52.082206+00:00"}