{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CNIBQDDVF42IJPNMMU6JDDBG35","short_pith_number":"pith:CNIBQDDV","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"},"canonical_sha256":"1350180c752f3484bdac653c918c26df52506c39f18d7cf7ed7d16bfdfea28a0","source":{"kind":"arxiv","id":"1601.03241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03241","created_at":"2026-05-18T01:22:55Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03241v1","created_at":"2026-05-18T01:22:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03241","created_at":"2026-05-18T01:22:55Z"},{"alias_kind":"pith_short_12","alias_value":"CNIBQDDVF42I","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CNIBQDDVF42IJPNM","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CNIBQDDV","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CNIBQDDVF42IJPNMMU6JDDBG35","target":"record","payload":{"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"},"canonical_sha256":"1350180c752f3484bdac653c918c26df52506c39f18d7cf7ed7d16bfdfea28a0","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"},"source_kind":"arxiv","source_id":"1601.03241","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:22:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITKJ6iMPh60S7pqScBRdm5WfyJ5SaRv0xCE+1nAThwIM1yoBD7i7DCyNI4HVfRLO62Qc+i9zSJJcESUFmVu3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:52:55.538581Z"},"content_sha256":"b7e81e88e1a2307264231151d25c49fd46b1a3583e8827cd3265766d4faf64e4","schema_version":"1.0","event_id":"sha256:b7e81e88e1a2307264231151d25c49fd46b1a3583e8827cd3265766d4faf64e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CNIBQDDVF42IJPNMMU6JDDBG35","target":"graph","payload":{"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"},"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:22:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ospC8VBLXgRpX07SGsUAtGxx5abIxmIHhXHJmHnww/xFB2EwSE91fq37tSAD354xzFGxMZtoKJ0eQDUoUnEzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:52:55.538938Z"},"content_sha256":"80c2ec4593cacf1af2eacfb32d6e376666eac8bdc9e1208c0cf4bafd1a6c8b71","schema_version":"1.0","event_id":"sha256:80c2ec4593cacf1af2eacfb32d6e376666eac8bdc9e1208c0cf4bafd1a6c8b71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CNIBQDDVF42IJPNMMU6JDDBG35/bundle.json","state_url":"https://pith.science/pith/CNIBQDDVF42IJPNMMU6JDDBG35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CNIBQDDVF42IJPNMMU6JDDBG35/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-03T17:52:55Z","links":{"resolver":"https://pith.science/pith/CNIBQDDVF42IJPNMMU6JDDBG35","bundle":"https://pith.science/pith/CNIBQDDVF42IJPNMMU6JDDBG35/bundle.json","state":"https://pith.science/pith/CNIBQDDVF42IJPNMMU6JDDBG35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CNIBQDDVF42IJPNMMU6JDDBG35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CNIBQDDVF42IJPNMMU6JDDBG35","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":"338db5373a60e5a3f0d4aac600012db2a4b925aed895f986fa4442e0500b0185","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-13T13:45:02Z","title_canon_sha256":"cbc39a7cbea547ab1163904d1ae4ed46102074985e03b52c4c5b5fbdcd5bde88"},"schema_version":"1.0","source":{"id":"1601.03241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03241","created_at":"2026-05-18T01:22:55Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03241v1","created_at":"2026-05-18T01:22:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03241","created_at":"2026-05-18T01:22:55Z"},{"alias_kind":"pith_short_12","alias_value":"CNIBQDDVF42I","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CNIBQDDVF42IJPNM","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CNIBQDDV","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:80c2ec4593cacf1af2eacfb32d6e376666eac8bdc9e1208c0cf4bafd1a6c8b71","target":"graph","created_at":"2026-05-18T01:22:55Z","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 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","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-01-13T13:45:02Z","title":"Total monochromatic connection of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03241","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:b7e81e88e1a2307264231151d25c49fd46b1a3583e8827cd3265766d4faf64e4","target":"record","created_at":"2026-05-18T01:22:55Z","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":"338db5373a60e5a3f0d4aac600012db2a4b925aed895f986fa4442e0500b0185","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-13T13:45:02Z","title_canon_sha256":"cbc39a7cbea547ab1163904d1ae4ed46102074985e03b52c4c5b5fbdcd5bde88"},"schema_version":"1.0","source":{"id":"1601.03241","kind":"arxiv","version":1}},"canonical_sha256":"1350180c752f3484bdac653c918c26df52506c39f18d7cf7ed7d16bfdfea28a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1350180c752f3484bdac653c918c26df52506c39f18d7cf7ed7d16bfdfea28a0","first_computed_at":"2026-05-18T01:22:55.014576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:55.014576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qDmjCSF2yxSuRW77iowYrJFheadbR/K5+o3V7M9KIG5yGtt2v8RvVwflpiOuXDuzr2bmz3XFElDrjGZISMaPBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:55.015042Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7e81e88e1a2307264231151d25c49fd46b1a3583e8827cd3265766d4faf64e4","sha256:80c2ec4593cacf1af2eacfb32d6e376666eac8bdc9e1208c0cf4bafd1a6c8b71"],"state_sha256":"e9c0fce136cc661725c3f958169e2490ebfa5d9bb879e4613f05ccfa46bb1498"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VwPUClgtRl8hMePVh6dqyN7tkaH2+jBbiL4r00oJMn33J5cFPQoap1ptXkqBBQ3ZJsuDbQILnPHvZgQ5YhfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:52:55.540852Z","bundle_sha256":"578cd7a4fa0044dfe26b7f8b208976e4a2b246e9b24529c16e689ef6b2ce31ae"}}