{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CNIBQDDVF42IJPNMMU6JDDBG35","short_pith_number":"pith:CNIBQDDV","schema_version":"1.0","canonical_sha256":"1350180c752f3484bdac653c918c26df52506c39f18d7cf7ed7d16bfdfea28a0","source":{"kind":"arxiv","id":"1601.03241","version":1},"attestation_state":"computed","paper":{"title":"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-01-13T13:45:02Z","abstract_excerpt":"A graph is said to be {\\it total-colored} if all the edges and the vertices of the graph are colored. A path in a total-colored graph is a {\\it total monochromatic path} if all the edges and internal vertices on the path have the same color. 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 total monochromatic path of the graph. 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 TM"},"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":"1601.03241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-13T13:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"cbc39a7cbea547ab1163904d1ae4ed46102074985e03b52c4c5b5fbdcd5bde88","abstract_canon_sha256":"338db5373a60e5a3f0d4aac600012db2a4b925aed895f986fa4442e0500b0185"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:55.015042Z","signature_b64":"qDmjCSF2yxSuRW77iowYrJFheadbR/K5+o3V7M9KIG5yGtt2v8RvVwflpiOuXDuzr2bmz3XFElDrjGZISMaPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1350180c752f3484bdac653c918c26df52506c39f18d7cf7ed7d16bfdfea28a0","last_reissued_at":"2026-05-18T01:22:55.014576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:55.014576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"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-01-13T13:45:02Z","abstract_excerpt":"A graph is said to be {\\it total-colored} if all the edges and the vertices of the graph are colored. A path in a total-colored graph is a {\\it total monochromatic path} if all the edges and internal vertices on the path have the same color. 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 total monochromatic path of the graph. 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 TM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03241","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":"1601.03241","created_at":"2026-05-18T01:22:55.014648+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03241v1","created_at":"2026-05-18T01:22:55.014648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03241","created_at":"2026-05-18T01:22:55.014648+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNIBQDDVF42I","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNIBQDDVF42IJPNM","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNIBQDDV","created_at":"2026-05-18T12:30:09.641336+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/CNIBQDDVF42IJPNMMU6JDDBG35","json":"https://pith.science/pith/CNIBQDDVF42IJPNMMU6JDDBG35.json","graph_json":"https://pith.science/api/pith-number/CNIBQDDVF42IJPNMMU6JDDBG35/graph.json","events_json":"https://pith.science/api/pith-number/CNIBQDDVF42IJPNMMU6JDDBG35/events.json","paper":"https://pith.science/paper/CNIBQDDV"},"agent_actions":{"view_html":"https://pith.science/pith/CNIBQDDVF42IJPNMMU6JDDBG35","download_json":"https://pith.science/pith/CNIBQDDVF42IJPNMMU6JDDBG35.json","view_paper":"https://pith.science/paper/CNIBQDDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03241&json=true","fetch_graph":"https://pith.science/api/pith-number/CNIBQDDVF42IJPNMMU6JDDBG35/graph.json","fetch_events":"https://pith.science/api/pith-number/CNIBQDDVF42IJPNMMU6JDDBG35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNIBQDDVF42IJPNMMU6JDDBG35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNIBQDDVF42IJPNMMU6JDDBG35/action/storage_attestation","attest_author":"https://pith.science/pith/CNIBQDDVF42IJPNMMU6JDDBG35/action/author_attestation","sign_citation":"https://pith.science/pith/CNIBQDDVF42IJPNMMU6JDDBG35/action/citation_signature","submit_replication":"https://pith.science/pith/CNIBQDDVF42IJPNMMU6JDDBG35/action/replication_record"}},"created_at":"2026-05-18T01:22:55.014648+00:00","updated_at":"2026-05-18T01:22:55.014648+00:00"}