{"paper":{"title":"The List Distinguishing Number Equals the Distinguishing Number for Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Paul S. Wenger, Poppy Immel","submitted_at":"2015-09-14T21:05:23Z","abstract_excerpt":"A \\textit{distinguishing coloring} of a graph $G$ is a coloring of the vertices so that every nontrivial automorphism of $G$ maps some vertex to a vertex with a different color. The \\textit{distinguishing number} of $G$ is the minimum $k$ such that $G$ has a distinguishing coloring where each vertex is assigned a color from $\\{1,\\ldots,k\\}$. A \\textit{list assignment} to $G$ is an assignment $L=\\{L(v)\\}_{v\\in V(G)}$ of lists of colors to the vertices of $G$. A \\textit{distinguishing $L$-coloring} of $G$ is a distinguishing coloring of $G$ where the color of each vertex $v$ comes from $L(v)$. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04327","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"}