{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KIXLUCZX7NO5GECBZM6LRE34R3","short_pith_number":"pith:KIXLUCZX","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"},"canonical_sha256":"522eba0b37fb5dd31041cb3cb8937c8ed37518722f1830ad35255ad05a8aee66","source":{"kind":"arxiv","id":"1603.05338","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05338","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05338v2","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05338","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"KIXLUCZX7NO5","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KIXLUCZX7NO5GECB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KIXLUCZX","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KIXLUCZX7NO5GECBZM6LRE34R3","target":"record","payload":{"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"},"canonical_sha256":"522eba0b37fb5dd31041cb3cb8937c8ed37518722f1830ad35255ad05a8aee66","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"},"source_kind":"arxiv","source_id":"1603.05338","source_version":2,"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-18T01:18:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g9ZwQ9+tnV2wP4mMNryfgU9vrwTO0/IZipDToNtw/9NnBBpGP3RPevXahQvGoSilBgSd6DN3GJhSFIC+As81CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:55:11.874412Z"},"content_sha256":"f038a0eb5856eaf92ff5b07062e72cb2e0768e475eb8bfa02a240215361425c6","schema_version":"1.0","event_id":"sha256:f038a0eb5856eaf92ff5b07062e72cb2e0768e475eb8bfa02a240215361425c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KIXLUCZX7NO5GECBZM6LRE34R3","target":"graph","payload":{"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"},"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-18T01:18:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3mSDPOO2RKWPBalD3LDS8o9DEywFMtFq8oTcPaNESVnxi7e7sXRE8pUgtsROfcgUw260v8eVH0XMnTP2MjvLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:55:11.874768Z"},"content_sha256":"5b149af72168dcc6989cfde29b3a5c82b1ed027a5ffdf46e11f4504cefa20aa2","schema_version":"1.0","event_id":"sha256:5b149af72168dcc6989cfde29b3a5c82b1ed027a5ffdf46e11f4504cefa20aa2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KIXLUCZX7NO5GECBZM6LRE34R3/bundle.json","state_url":"https://pith.science/pith/KIXLUCZX7NO5GECBZM6LRE34R3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KIXLUCZX7NO5GECBZM6LRE34R3/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-01T17:55:11Z","links":{"resolver":"https://pith.science/pith/KIXLUCZX7NO5GECBZM6LRE34R3","bundle":"https://pith.science/pith/KIXLUCZX7NO5GECBZM6LRE34R3/bundle.json","state":"https://pith.science/pith/KIXLUCZX7NO5GECBZM6LRE34R3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KIXLUCZX7NO5GECBZM6LRE34R3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KIXLUCZX7NO5GECBZM6LRE34R3","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":"92659672573c8a3f6f95e299614abdec1df24abf978fe70a27f50047fa635472","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-17T02:31:54Z","title_canon_sha256":"3a328fbd94982ab03e8499233a6291b4298ea95f169c1d440c66fa36d021c210"},"schema_version":"1.0","source":{"id":"1603.05338","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05338","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05338v2","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05338","created_at":"2026-05-18T01:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"KIXLUCZX7NO5","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KIXLUCZX7NO5GECB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KIXLUCZX","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:5b149af72168dcc6989cfde29b3a5c82b1ed027a5ffdf46e11f4504cefa20aa2","target":"graph","created_at":"2026-05-18T01:18:52Z","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 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$ ","authors_text":"Di Wu, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-17T02:31:54Z","title":"The (vertex-)monochromatic index of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05338","kind":"arxiv","version":2},"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:f038a0eb5856eaf92ff5b07062e72cb2e0768e475eb8bfa02a240215361425c6","target":"record","created_at":"2026-05-18T01:18:52Z","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":"92659672573c8a3f6f95e299614abdec1df24abf978fe70a27f50047fa635472","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-17T02:31:54Z","title_canon_sha256":"3a328fbd94982ab03e8499233a6291b4298ea95f169c1d440c66fa36d021c210"},"schema_version":"1.0","source":{"id":"1603.05338","kind":"arxiv","version":2}},"canonical_sha256":"522eba0b37fb5dd31041cb3cb8937c8ed37518722f1830ad35255ad05a8aee66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"522eba0b37fb5dd31041cb3cb8937c8ed37518722f1830ad35255ad05a8aee66","first_computed_at":"2026-05-18T01:18:52.082124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:52.082124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dhv1dzQZYg1ePsx8C/9Vf1HaMQZ/+LqzA4QmRoqFK4GzJ1OQIJ9JUe5zE3pkf9LeIm2aAYZ/+66cbnpxICnZAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:52.082676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05338","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f038a0eb5856eaf92ff5b07062e72cb2e0768e475eb8bfa02a240215361425c6","sha256:5b149af72168dcc6989cfde29b3a5c82b1ed027a5ffdf46e11f4504cefa20aa2"],"state_sha256":"f38b533263178ca15ed82d1cc628a31b72e8e25fab6c1e2c877a48aaee7608e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9qepn1TmDeE2odCuerB0aT6q9fZBpLvpqkvePzhV9XxZmKcsnmCIW9x4CX4K2/7KupO6mu7K2pimWXMBmOV+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:55:11.876755Z","bundle_sha256":"77b15b9e49c4bcb8d23401de240685776db58a7b1aff1bca26982d472fec1e79"}}