{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JA7ETPBAEY2SWBEXMWZZJ2YRIB","short_pith_number":"pith:JA7ETPBA","schema_version":"1.0","canonical_sha256":"483e49bc2026352b049765b394eb11407ca561f1a8349af55217fbc8f51b98ed","source":{"kind":"arxiv","id":"1612.05381","version":1},"attestation_state":"computed","paper":{"title":"Erd\\H{o}s-Gallai-type results for 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-12-16T06:44:33Z","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 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$. In this paper, we study two kinds of Erd\\H{o}s-Gallai-type problems for $tmc(G)$ and completely solv"},"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":"1612.05381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-16T06:44:33Z","cross_cats_sorted":[],"title_canon_sha256":"3c32fde34742b5f4c24882f1d1876f3828cf96536b5595f3622a2ff0b0f94182","abstract_canon_sha256":"6878a802b4c42d18576b8b3bfb478bf758031ae0b3bdc7d70d57b3c96b3e8e68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:51.905924Z","signature_b64":"CAw9XFdsl+dc0Yqhh5zEArkzgWSgYIPtK8oBD3/FBMXJzP9S96buwfsLhCKwOcnqzLRhr/CPW0DDY4/MVi6YCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"483e49bc2026352b049765b394eb11407ca561f1a8349af55217fbc8f51b98ed","last_reissued_at":"2026-05-18T00:54:51.905372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:51.905372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Erd\\H{o}s-Gallai-type results for 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-12-16T06:44:33Z","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 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$. In this paper, we study two kinds of Erd\\H{o}s-Gallai-type problems for $tmc(G)$ and completely solv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05381","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":"1612.05381","created_at":"2026-05-18T00:54:51.905470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.05381v1","created_at":"2026-05-18T00:54:51.905470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05381","created_at":"2026-05-18T00:54:51.905470+00:00"},{"alias_kind":"pith_short_12","alias_value":"JA7ETPBAEY2S","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"JA7ETPBAEY2SWBEX","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"JA7ETPBA","created_at":"2026-05-18T12:30:22.444734+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/JA7ETPBAEY2SWBEXMWZZJ2YRIB","json":"https://pith.science/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB.json","graph_json":"https://pith.science/api/pith-number/JA7ETPBAEY2SWBEXMWZZJ2YRIB/graph.json","events_json":"https://pith.science/api/pith-number/JA7ETPBAEY2SWBEXMWZZJ2YRIB/events.json","paper":"https://pith.science/paper/JA7ETPBA"},"agent_actions":{"view_html":"https://pith.science/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB","download_json":"https://pith.science/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB.json","view_paper":"https://pith.science/paper/JA7ETPBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.05381&json=true","fetch_graph":"https://pith.science/api/pith-number/JA7ETPBAEY2SWBEXMWZZJ2YRIB/graph.json","fetch_events":"https://pith.science/api/pith-number/JA7ETPBAEY2SWBEXMWZZJ2YRIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB/action/storage_attestation","attest_author":"https://pith.science/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB/action/author_attestation","sign_citation":"https://pith.science/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB/action/citation_signature","submit_replication":"https://pith.science/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB/action/replication_record"}},"created_at":"2026-05-18T00:54:51.905470+00:00","updated_at":"2026-05-18T00:54:51.905470+00:00"}