{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3LW7GI44ZD4F4S2AL4YTBT2DBM","short_pith_number":"pith:3LW7GI44","canonical_record":{"source":{"id":"1703.04065","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-12T03:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"321faa059c000c39a0909b0eb671547b034e9320ce03235c14545ee4d95b4408","abstract_canon_sha256":"b825be44c51b62db8f9c28d2a66e9f918b960a5fb2d5b238bec1a7f8bace065f"},"schema_version":"1.0"},"canonical_sha256":"daedf3239cc8f85e4b405f3130cf430b154e91e3f87ed96db9eb2a998b18e415","source":{"kind":"arxiv","id":"1703.04065","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04065","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04065v3","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04065","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"pith_short_12","alias_value":"3LW7GI44ZD4F","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3LW7GI44ZD4F4S2A","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3LW7GI44","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3LW7GI44ZD4F4S2AL4YTBT2DBM","target":"record","payload":{"canonical_record":{"source":{"id":"1703.04065","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-12T03:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"321faa059c000c39a0909b0eb671547b034e9320ce03235c14545ee4d95b4408","abstract_canon_sha256":"b825be44c51b62db8f9c28d2a66e9f918b960a5fb2d5b238bec1a7f8bace065f"},"schema_version":"1.0"},"canonical_sha256":"daedf3239cc8f85e4b405f3130cf430b154e91e3f87ed96db9eb2a998b18e415","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:37.820602Z","signature_b64":"afgR+MbZI+y/QYwDa/fC2j8eelOmrQgpF9sQAcJpzMDyTxavfZ+S5V5CoqSQjPJMDuOHO1CDCWx6JpW6UPK+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daedf3239cc8f85e4b405f3130cf430b154e91e3f87ed96db9eb2a998b18e415","last_reissued_at":"2026-05-18T00:47:37.820013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:37.820013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.04065","source_version":3,"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:47:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RxwY1YFN640P6GWYOAwypfTuob4dTudlFtHkdJZIRF6VwGwQ8zO86KD6Wa4BoNPHKEg/RxBxhwns04k7hWuWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:13:05.346628Z"},"content_sha256":"91cdc8fa1d7f4f60635566ae347d1dba60b34c8f66f6d222714b2cc96ba28b3d","schema_version":"1.0","event_id":"sha256:91cdc8fa1d7f4f60635566ae347d1dba60b34c8f66f6d222714b2cc96ba28b3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3LW7GI44ZD4F4S2AL4YTBT2DBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colton Magnant, Jingshu Zhang, Wenjing Li, Xueliang Li","submitted_at":"2017-03-12T03:14:31Z","abstract_excerpt":"A graph is said to be \\emph{total-colored} if all the edges and the vertices of the graph are colored. A total-colored graph is \\emph{total-rainbow connected} if any two vertices of the graph are connected by a path whose edges and internal vertices have distinct colors. For a connected graph $G$, the \\emph{total-rainbow connection number} of $G$, denoted by $trc(G)$, is the minimum number of colors required in a total-coloring of $G$ to make $G$ total-rainbow connected. In this paper, we first characterize the graphs having large total-rainbow connection numbers. Based on this, we obtain a No"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04065","kind":"arxiv","version":3},"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:47:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFnG29UJSXeJb8Uk4w9LccR3hI1p3nAwoFR6VeqlX0UQ9CBmKcG2JuPU+OyHbU8TjYrG9WqJ/18oIAru7Sg1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:13:05.346981Z"},"content_sha256":"d5d0c70ac3f7b9438ab291f68785e447196e41ab3c87642183c14c8f55ac8922","schema_version":"1.0","event_id":"sha256:d5d0c70ac3f7b9438ab291f68785e447196e41ab3c87642183c14c8f55ac8922"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM/bundle.json","state_url":"https://pith.science/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM/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-05-26T06:13:05Z","links":{"resolver":"https://pith.science/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM","bundle":"https://pith.science/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM/bundle.json","state":"https://pith.science/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3LW7GI44ZD4F4S2AL4YTBT2DBM","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":"b825be44c51b62db8f9c28d2a66e9f918b960a5fb2d5b238bec1a7f8bace065f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-12T03:14:31Z","title_canon_sha256":"321faa059c000c39a0909b0eb671547b034e9320ce03235c14545ee4d95b4408"},"schema_version":"1.0","source":{"id":"1703.04065","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04065","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04065v3","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04065","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"pith_short_12","alias_value":"3LW7GI44ZD4F","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3LW7GI44ZD4F4S2A","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3LW7GI44","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:d5d0c70ac3f7b9438ab291f68785e447196e41ab3c87642183c14c8f55ac8922","target":"graph","created_at":"2026-05-18T00:47:37Z","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 \\emph{total-colored} if all the edges and the vertices of the graph are colored. A total-colored graph is \\emph{total-rainbow connected} if any two vertices of the graph are connected by a path whose edges and internal vertices have distinct colors. For a connected graph $G$, the \\emph{total-rainbow connection number} of $G$, denoted by $trc(G)$, is the minimum number of colors required in a total-coloring of $G$ to make $G$ total-rainbow connected. In this paper, we first characterize the graphs having large total-rainbow connection numbers. Based on this, we obtain a No","authors_text":"Colton Magnant, Jingshu Zhang, Wenjing Li, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-12T03:14:31Z","title":"Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04065","kind":"arxiv","version":3},"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:91cdc8fa1d7f4f60635566ae347d1dba60b34c8f66f6d222714b2cc96ba28b3d","target":"record","created_at":"2026-05-18T00:47:37Z","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":"b825be44c51b62db8f9c28d2a66e9f918b960a5fb2d5b238bec1a7f8bace065f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-12T03:14:31Z","title_canon_sha256":"321faa059c000c39a0909b0eb671547b034e9320ce03235c14545ee4d95b4408"},"schema_version":"1.0","source":{"id":"1703.04065","kind":"arxiv","version":3}},"canonical_sha256":"daedf3239cc8f85e4b405f3130cf430b154e91e3f87ed96db9eb2a998b18e415","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"daedf3239cc8f85e4b405f3130cf430b154e91e3f87ed96db9eb2a998b18e415","first_computed_at":"2026-05-18T00:47:37.820013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:37.820013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"afgR+MbZI+y/QYwDa/fC2j8eelOmrQgpF9sQAcJpzMDyTxavfZ+S5V5CoqSQjPJMDuOHO1CDCWx6JpW6UPK+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:37.820602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04065","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91cdc8fa1d7f4f60635566ae347d1dba60b34c8f66f6d222714b2cc96ba28b3d","sha256:d5d0c70ac3f7b9438ab291f68785e447196e41ab3c87642183c14c8f55ac8922"],"state_sha256":"dcfe2aa9371e3eedb178d89a6851a385fc7269f5531bc0bb426be6d8d45850bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XiyTAwWnjhD8lvEETN03m4VFe6qIIAWVLEvdPXx6KEfQKCaMZpooH4Gp6/3kVgK445gZi+9a677WLL5DfxiaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:13:05.350221Z","bundle_sha256":"7065e86719907ee61d6362b4eb0088a6b1d74deb308a0015e7961810101c387e"}}