Stanley introduced the chromatic symmetric function of a simple graph, which is a generalization of a chromatic polynomial. This is expressed in terms of the integer points of the complements of the corresponding graphic arrangement. Stanley proved a combinatorial reciprocity theorem for chromatic functions. This is considered as an Ehrhart-type reciprocity theorem for the graphic arrangement. We introduce the chromatic signed-symmetric function of a signed graph, an analogue of the chromatic symmetric function, by the integer points of the complements of the corresponding signed-graphic arrangement and prove a generalization of Stanley's reciprocity theorem. Stanley has conjectured that the chromatic symmetric function distinguishes trees. This conjecture is also generalized for signed trees. We verify the conjecture for certain classes of signed paths.