{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3UV6QROHDXPTPT64NABVSH743L","short_pith_number":"pith:3UV6QROH","schema_version":"1.0","canonical_sha256":"dd2be845c71ddf37cfdc6803591ffcdaeba9263f0cf53a59a9c433ebdb32527e","source":{"kind":"arxiv","id":"1604.02242","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.02242","created_at":"2026-05-18T01:17:28.129105+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02242v1","created_at":"2026-05-18T01:17:28.129105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02242","created_at":"2026-05-18T01:17:28.129105+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UV6QROHDXPT","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UV6QROHDXPTPT64","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UV6QROH","created_at":"2026-05-18T12:29:58.707656+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/3UV6QROHDXPTPT64NABVSH743L","json":"https://pith.science/pith/3UV6QROHDXPTPT64NABVSH743L.json","graph_json":"https://pith.science/api/pith-number/3UV6QROHDXPTPT64NABVSH743L/graph.json","events_json":"https://pith.science/api/pith-number/3UV6QROHDXPTPT64NABVSH743L/events.json","paper":"https://pith.science/paper/3UV6QROH"},"agent_actions":{"view_html":"https://pith.science/pith/3UV6QROHDXPTPT64NABVSH743L","download_json":"https://pith.science/pith/3UV6QROHDXPTPT64NABVSH743L.json","view_paper":"https://pith.science/paper/3UV6QROH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02242&json=true","fetch_graph":"https://pith.science/api/pith-number/3UV6QROHDXPTPT64NABVSH743L/graph.json","fetch_events":"https://pith.science/api/pith-number/3UV6QROHDXPTPT64NABVSH743L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UV6QROHDXPTPT64NABVSH743L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UV6QROHDXPTPT64NABVSH743L/action/storage_attestation","attest_author":"https://pith.science/pith/3UV6QROHDXPTPT64NABVSH743L/action/author_attestation","sign_citation":"https://pith.science/pith/3UV6QROHDXPTPT64NABVSH743L/action/citation_signature","submit_replication":"https://pith.science/pith/3UV6QROHDXPTPT64NABVSH743L/action/replication_record"}},"created_at":"2026-05-18T01:17:28.129105+00:00","updated_at":"2026-05-18T01:17:28.129105+00:00"}