{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3LW7GI44ZD4F4S2AL4YTBT2DBM","short_pith_number":"pith:3LW7GI44","schema_version":"1.0","canonical_sha256":"daedf3239cc8f85e4b405f3130cf430b154e91e3f87ed96db9eb2a998b18e415","source":{"kind":"arxiv","id":"1703.04065","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.04065","created_at":"2026-05-18T00:47:37.820108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04065v3","created_at":"2026-05-18T00:47:37.820108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04065","created_at":"2026-05-18T00:47:37.820108+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LW7GI44ZD4F","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LW7GI44ZD4F4S2A","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LW7GI44","created_at":"2026-05-18T12:30:58.224056+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/3LW7GI44ZD4F4S2AL4YTBT2DBM","json":"https://pith.science/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM.json","graph_json":"https://pith.science/api/pith-number/3LW7GI44ZD4F4S2AL4YTBT2DBM/graph.json","events_json":"https://pith.science/api/pith-number/3LW7GI44ZD4F4S2AL4YTBT2DBM/events.json","paper":"https://pith.science/paper/3LW7GI44"},"agent_actions":{"view_html":"https://pith.science/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM","download_json":"https://pith.science/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM.json","view_paper":"https://pith.science/paper/3LW7GI44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04065&json=true","fetch_graph":"https://pith.science/api/pith-number/3LW7GI44ZD4F4S2AL4YTBT2DBM/graph.json","fetch_events":"https://pith.science/api/pith-number/3LW7GI44ZD4F4S2AL4YTBT2DBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM/action/storage_attestation","attest_author":"https://pith.science/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM/action/author_attestation","sign_citation":"https://pith.science/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM/action/citation_signature","submit_replication":"https://pith.science/pith/3LW7GI44ZD4F4S2AL4YTBT2DBM/action/replication_record"}},"created_at":"2026-05-18T00:47:37.820108+00:00","updated_at":"2026-05-18T00:47:37.820108+00:00"}