{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:U4CBRHWYO4STD76PQVEZU7DLUU","short_pith_number":"pith:U4CBRHWY","schema_version":"1.0","canonical_sha256":"a704189ed8772531ffcf85499a7c6ba50d4d180342e962c3115d7375c0ad3de9","source":{"kind":"arxiv","id":"1509.04327","version":1},"attestation_state":"computed","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"},"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":"1509.04327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-14T21:05:23Z","cross_cats_sorted":[],"title_canon_sha256":"46d50387b9b147472dc7c38507bf16fe2f01e7204208dd9add0bd28121f7f051","abstract_canon_sha256":"2d329b33e90ef5584bf0141d74072f2fbf540e22f91b2fd8b6cc78a92d75eb67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:07.470672Z","signature_b64":"Hlja0saLunMimQUQ9ZR+Z8z5A4Slu5paIlZPcKrFcRtt22s4njZarOMEJYtPhoQXxnMjBxtASt/e7UozbnXPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a704189ed8772531ffcf85499a7c6ba50d4d180342e962c3115d7375c0ad3de9","last_reissued_at":"2026-05-18T01:33:07.470249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:07.470249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.04327","created_at":"2026-05-18T01:33:07.470311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04327v1","created_at":"2026-05-18T01:33:07.470311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04327","created_at":"2026-05-18T01:33:07.470311+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4CBRHWYO4ST","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4CBRHWYO4STD76P","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4CBRHWY","created_at":"2026-05-18T12:29:44.643036+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/U4CBRHWYO4STD76PQVEZU7DLUU","json":"https://pith.science/pith/U4CBRHWYO4STD76PQVEZU7DLUU.json","graph_json":"https://pith.science/api/pith-number/U4CBRHWYO4STD76PQVEZU7DLUU/graph.json","events_json":"https://pith.science/api/pith-number/U4CBRHWYO4STD76PQVEZU7DLUU/events.json","paper":"https://pith.science/paper/U4CBRHWY"},"agent_actions":{"view_html":"https://pith.science/pith/U4CBRHWYO4STD76PQVEZU7DLUU","download_json":"https://pith.science/pith/U4CBRHWYO4STD76PQVEZU7DLUU.json","view_paper":"https://pith.science/paper/U4CBRHWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04327&json=true","fetch_graph":"https://pith.science/api/pith-number/U4CBRHWYO4STD76PQVEZU7DLUU/graph.json","fetch_events":"https://pith.science/api/pith-number/U4CBRHWYO4STD76PQVEZU7DLUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4CBRHWYO4STD76PQVEZU7DLUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4CBRHWYO4STD76PQVEZU7DLUU/action/storage_attestation","attest_author":"https://pith.science/pith/U4CBRHWYO4STD76PQVEZU7DLUU/action/author_attestation","sign_citation":"https://pith.science/pith/U4CBRHWYO4STD76PQVEZU7DLUU/action/citation_signature","submit_replication":"https://pith.science/pith/U4CBRHWYO4STD76PQVEZU7DLUU/action/replication_record"}},"created_at":"2026-05-18T01:33:07.470311+00:00","updated_at":"2026-05-18T01:33:07.470311+00:00"}