{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3UV6QROHDXPTPT64NABVSH743L","short_pith_number":"pith:3UV6QROH","canonical_record":{"source":{"id":"1604.02242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-08T06:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"0a668e03170595fb769bbcc067a54d4c0e40b73241c5b909893a2151732a7675","abstract_canon_sha256":"6688c0f15b97eb3afa9269a12ac06dfad1109e8eda289da4615396008f1b8de0"},"schema_version":"1.0"},"canonical_sha256":"dd2be845c71ddf37cfdc6803591ffcdaeba9263f0cf53a59a9c433ebdb32527e","source":{"kind":"arxiv","id":"1604.02242","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02242","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02242v1","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02242","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"pith_short_12","alias_value":"3UV6QROHDXPT","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3UV6QROHDXPTPT64","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3UV6QROH","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3UV6QROHDXPTPT64NABVSH743L","target":"record","payload":{"canonical_record":{"source":{"id":"1604.02242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-08T06:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"0a668e03170595fb769bbcc067a54d4c0e40b73241c5b909893a2151732a7675","abstract_canon_sha256":"6688c0f15b97eb3afa9269a12ac06dfad1109e8eda289da4615396008f1b8de0"},"schema_version":"1.0"},"canonical_sha256":"dd2be845c71ddf37cfdc6803591ffcdaeba9263f0cf53a59a9c433ebdb32527e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:28.129586Z","signature_b64":"KtGPSZSxzgoqiWuphdsdN5p7CzRaSboItSiFpN/KYf+zFfXbrXeX5FiDWSpfZ/KkZF3tTyjgCB5bKfE6XJU/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd2be845c71ddf37cfdc6803591ffcdaeba9263f0cf53a59a9c433ebdb32527e","last_reissued_at":"2026-05-18T01:17:28.129020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:28.129020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.02242","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-18T01:17:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QP8ZcBeXI8B4aNIbZJSlE84AkAiE2oo5vApN4Y/bU+MGHLD4EMTKM1fPNf40AGJF8tbkSjZMSCpa+7z+9FFtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:06:53.418616Z"},"content_sha256":"6adce35e5bb89718df8310518372e7ce3c8fd28da7b1e0358baa67255ea3264a","schema_version":"1.0","event_id":"sha256:6adce35e5bb89718df8310518372e7ce3c8fd28da7b1e0358baa67255ea3264a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3UV6QROHDXPTPT64NABVSH743L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"More on total monochromatic connection of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hui Jiang, Xueliang Li, Yingying Zhang","submitted_at":"2016-04-08T06:57:38Z","abstract_excerpt":"A graph is said to be {\\it total-colored} if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a {\\it total monochromatically-connecting coloring} ({\\it TMC-coloring}, for short) if any two vertices of the graph are connected by a path whose edges and internal vertices on the path have the same color. For a connected graph $G$, the {\\it total monochromatic connection number}, denoted by $tmc(G)$, is defined as the maximum number of colors used in a TMC-coloring of $G$. Note that a TMC-coloring does not exist if $G$ is not connected, in which case we simply"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02242","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-18T01:17:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPEOGro8RTWRQBNh8+UOojEIRocMQWrXp6CaIUZIIdIca6UGRrpG/50mdDUoPRaN+aQ8H9+cBGnNk1nKMrOzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:06:53.418966Z"},"content_sha256":"76d6d194e75a9d97a3ce4a7730fa7780c1f582d8f88f951f744ccf1188163aeb","schema_version":"1.0","event_id":"sha256:76d6d194e75a9d97a3ce4a7730fa7780c1f582d8f88f951f744ccf1188163aeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UV6QROHDXPTPT64NABVSH743L/bundle.json","state_url":"https://pith.science/pith/3UV6QROHDXPTPT64NABVSH743L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UV6QROHDXPTPT64NABVSH743L/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-03T22:06:53Z","links":{"resolver":"https://pith.science/pith/3UV6QROHDXPTPT64NABVSH743L","bundle":"https://pith.science/pith/3UV6QROHDXPTPT64NABVSH743L/bundle.json","state":"https://pith.science/pith/3UV6QROHDXPTPT64NABVSH743L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UV6QROHDXPTPT64NABVSH743L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3UV6QROHDXPTPT64NABVSH743L","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":"6688c0f15b97eb3afa9269a12ac06dfad1109e8eda289da4615396008f1b8de0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-08T06:57:38Z","title_canon_sha256":"0a668e03170595fb769bbcc067a54d4c0e40b73241c5b909893a2151732a7675"},"schema_version":"1.0","source":{"id":"1604.02242","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02242","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02242v1","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02242","created_at":"2026-05-18T01:17:28Z"},{"alias_kind":"pith_short_12","alias_value":"3UV6QROHDXPT","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3UV6QROHDXPTPT64","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3UV6QROH","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:76d6d194e75a9d97a3ce4a7730fa7780c1f582d8f88f951f744ccf1188163aeb","target":"graph","created_at":"2026-05-18T01:17:28Z","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 graph is said to be {\\it total-colored} if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a {\\it total monochromatically-connecting coloring} ({\\it TMC-coloring}, for short) if any two vertices of the graph are connected by a path whose edges and internal vertices on the path have the same color. For a connected graph $G$, the {\\it total monochromatic connection number}, denoted by $tmc(G)$, is defined as the maximum number of colors used in a TMC-coloring of $G$. Note that a TMC-coloring does not exist if $G$ is not connected, in which case we simply","authors_text":"Hui Jiang, Xueliang Li, Yingying Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-08T06:57:38Z","title":"More on total monochromatic connection of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02242","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:6adce35e5bb89718df8310518372e7ce3c8fd28da7b1e0358baa67255ea3264a","target":"record","created_at":"2026-05-18T01:17:28Z","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":"6688c0f15b97eb3afa9269a12ac06dfad1109e8eda289da4615396008f1b8de0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-08T06:57:38Z","title_canon_sha256":"0a668e03170595fb769bbcc067a54d4c0e40b73241c5b909893a2151732a7675"},"schema_version":"1.0","source":{"id":"1604.02242","kind":"arxiv","version":1}},"canonical_sha256":"dd2be845c71ddf37cfdc6803591ffcdaeba9263f0cf53a59a9c433ebdb32527e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd2be845c71ddf37cfdc6803591ffcdaeba9263f0cf53a59a9c433ebdb32527e","first_computed_at":"2026-05-18T01:17:28.129020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:28.129020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KtGPSZSxzgoqiWuphdsdN5p7CzRaSboItSiFpN/KYf+zFfXbrXeX5FiDWSpfZ/KkZF3tTyjgCB5bKfE6XJU/Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:28.129586Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02242","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6adce35e5bb89718df8310518372e7ce3c8fd28da7b1e0358baa67255ea3264a","sha256:76d6d194e75a9d97a3ce4a7730fa7780c1f582d8f88f951f744ccf1188163aeb"],"state_sha256":"f6e47cdba17aa21dcb32af20f67744fdb8b315d24ef40fd8466e6a888ee0ab31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iw9Va6wE8O51CenOk8FizmUtPbV/5Ad2qNLykBuvTwCuYe/djUz7STPhVXlkTC+1FxN7UPuKic0x4OCmJXKcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:06:53.420852Z","bundle_sha256":"631457ab9ab8b5fc01f88b90f9db348c5b5aaeb2c324380a7d6bda1522d468ec"}}