{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JA7ETPBAEY2SWBEXMWZZJ2YRIB","short_pith_number":"pith:JA7ETPBA","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"},"canonical_sha256":"483e49bc2026352b049765b394eb11407ca561f1a8349af55217fbc8f51b98ed","source":{"kind":"arxiv","id":"1612.05381","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05381","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05381v1","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05381","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"pith_short_12","alias_value":"JA7ETPBAEY2S","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"JA7ETPBAEY2SWBEX","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"JA7ETPBA","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JA7ETPBAEY2SWBEXMWZZJ2YRIB","target":"record","payload":{"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"},"canonical_sha256":"483e49bc2026352b049765b394eb11407ca561f1a8349af55217fbc8f51b98ed","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"},"source_kind":"arxiv","source_id":"1612.05381","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-18T00:54:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V521un9Gq7h6QCl1WdNXiLGcDN7Oh5ubDnNtrJ/cJ5MEkNB4UEMvXxibxBAFF2+x0j5zNNog6So0RF5xgoBNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:58:04.547532Z"},"content_sha256":"8192215ff012f8c8928489d41e8b6de4c3fb4a317912ab757e8657b7bc38eef3","schema_version":"1.0","event_id":"sha256:8192215ff012f8c8928489d41e8b6de4c3fb4a317912ab757e8657b7bc38eef3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JA7ETPBAEY2SWBEXMWZZJ2YRIB","target":"graph","payload":{"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"},"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-18T00:54:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D12CNHBatLBo2hEqX/PR3Bo7Cwnz50D/I0TsqWnztg/D1G4gI/N4UCnjty93a7Gz0WHstKDGTzY/yGuTmqoRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:58:04.547878Z"},"content_sha256":"8ea88cce8e170bf4989959ead496c0d9d39fe98a359bb90f30c9bf1284db83bd","schema_version":"1.0","event_id":"sha256:8ea88cce8e170bf4989959ead496c0d9d39fe98a359bb90f30c9bf1284db83bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB/bundle.json","state_url":"https://pith.science/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB/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-03T20:58:04Z","links":{"resolver":"https://pith.science/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB","bundle":"https://pith.science/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB/bundle.json","state":"https://pith.science/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JA7ETPBAEY2SWBEXMWZZJ2YRIB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JA7ETPBAEY2SWBEXMWZZJ2YRIB","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":"6878a802b4c42d18576b8b3bfb478bf758031ae0b3bdc7d70d57b3c96b3e8e68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-16T06:44:33Z","title_canon_sha256":"3c32fde34742b5f4c24882f1d1876f3828cf96536b5595f3622a2ff0b0f94182"},"schema_version":"1.0","source":{"id":"1612.05381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05381","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05381v1","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05381","created_at":"2026-05-18T00:54:51Z"},{"alias_kind":"pith_short_12","alias_value":"JA7ETPBAEY2S","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"JA7ETPBAEY2SWBEX","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"JA7ETPBA","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:8ea88cce8e170bf4989959ead496c0d9d39fe98a359bb90f30c9bf1284db83bd","target":"graph","created_at":"2026-05-18T00:54:51Z","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 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","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-12-16T06:44:33Z","title":"Erd\\H{o}s-Gallai-type results for total monochromatic connection of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05381","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:8192215ff012f8c8928489d41e8b6de4c3fb4a317912ab757e8657b7bc38eef3","target":"record","created_at":"2026-05-18T00:54:51Z","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":"6878a802b4c42d18576b8b3bfb478bf758031ae0b3bdc7d70d57b3c96b3e8e68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-16T06:44:33Z","title_canon_sha256":"3c32fde34742b5f4c24882f1d1876f3828cf96536b5595f3622a2ff0b0f94182"},"schema_version":"1.0","source":{"id":"1612.05381","kind":"arxiv","version":1}},"canonical_sha256":"483e49bc2026352b049765b394eb11407ca561f1a8349af55217fbc8f51b98ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"483e49bc2026352b049765b394eb11407ca561f1a8349af55217fbc8f51b98ed","first_computed_at":"2026-05-18T00:54:51.905372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:51.905372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CAw9XFdsl+dc0Yqhh5zEArkzgWSgYIPtK8oBD3/FBMXJzP9S96buwfsLhCKwOcnqzLRhr/CPW0DDY4/MVi6YCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:51.905924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.05381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8192215ff012f8c8928489d41e8b6de4c3fb4a317912ab757e8657b7bc38eef3","sha256:8ea88cce8e170bf4989959ead496c0d9d39fe98a359bb90f30c9bf1284db83bd"],"state_sha256":"ed22f465469d4076c88b2ae06b8843063283700aa5c72db59ecf824484e52d46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQWMRrMZi9FYAQOB8f9tmqMjnJVqEHXqtETCgATP8kcDy9Ta8Y/L3x/srCMIKzb4STl6QujHAKviNFlBY1N2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:58:04.549757Z","bundle_sha256":"f2c65f9e6bcd3ac1d180fd318278cddde0eaf34b09c9da6cfe070a297f8acd5b"}}