{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RZOOSZ6GLQZ6QQXPMYR7GSLHY5","short_pith_number":"pith:RZOOSZ6G","schema_version":"1.0","canonical_sha256":"8e5ce967c65c33e842ef6623f34967c745155b9ee78fc130e87c62e0f8e1fe19","source":{"kind":"arxiv","id":"1505.03396","version":1},"attestation_state":"computed","paper":{"title":"$\\chi_D(G)$, $|Aut(G)|$, and a variant of the Motion Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Niranjan Balachandran, Sajith Padinhatteeri","submitted_at":"2015-05-13T14:17:21Z","abstract_excerpt":"The \\textit{Distinguishing Chromatic Number} of a graph $G$, denoted $\\chi_D(G)$, was first defined in \\cite{collins} as the minimum number of colors needed to properly color $G$ such that no non-trivial automorphism $\\phi$ of the graph $G$ fixes each color class of $G$. In this paper, 1. We prove a lemma that may be considered a variant of the Motion lemma of \\cite{RS} and use this to give examples of several families of graphs which satisfy $\\chi_D(G)=\\chi(G)+1$. 2.We give an example of families of graphs that admit large automorphism groups in which every proper coloring is distinguishing. "},"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":"1505.03396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-13T14:17:21Z","cross_cats_sorted":[],"title_canon_sha256":"1162bd2b4b9914f81ff94e6318409228b1673fea31e7c6bca2424305954a2243","abstract_canon_sha256":"e9673520b463d808d811e3ee38a8a285400572c23e1743e780d4dda0874fc067"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:09.290387Z","signature_b64":"4aRA87myFrj0jqlDcn5/mkTAiazfx7HFvqMNHXirKtWDzzyH7x8V+0vcCIT41sq9eVaoH53qKLuedLzphHYgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e5ce967c65c33e842ef6623f34967c745155b9ee78fc130e87c62e0f8e1fe19","last_reissued_at":"2026-05-18T02:12:09.289647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:09.289647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\chi_D(G)$, $|Aut(G)|$, and a variant of the Motion Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Niranjan Balachandran, Sajith Padinhatteeri","submitted_at":"2015-05-13T14:17:21Z","abstract_excerpt":"The \\textit{Distinguishing Chromatic Number} of a graph $G$, denoted $\\chi_D(G)$, was first defined in \\cite{collins} as the minimum number of colors needed to properly color $G$ such that no non-trivial automorphism $\\phi$ of the graph $G$ fixes each color class of $G$. In this paper, 1. We prove a lemma that may be considered a variant of the Motion lemma of \\cite{RS} and use this to give examples of several families of graphs which satisfy $\\chi_D(G)=\\chi(G)+1$. 2.We give an example of families of graphs that admit large automorphism groups in which every proper coloring is distinguishing. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03396","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":"1505.03396","created_at":"2026-05-18T02:12:09.289761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.03396v1","created_at":"2026-05-18T02:12:09.289761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03396","created_at":"2026-05-18T02:12:09.289761+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZOOSZ6GLQZ6","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZOOSZ6GLQZ6QQXP","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZOOSZ6G","created_at":"2026-05-18T12:29:39.896362+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/RZOOSZ6GLQZ6QQXPMYR7GSLHY5","json":"https://pith.science/pith/RZOOSZ6GLQZ6QQXPMYR7GSLHY5.json","graph_json":"https://pith.science/api/pith-number/RZOOSZ6GLQZ6QQXPMYR7GSLHY5/graph.json","events_json":"https://pith.science/api/pith-number/RZOOSZ6GLQZ6QQXPMYR7GSLHY5/events.json","paper":"https://pith.science/paper/RZOOSZ6G"},"agent_actions":{"view_html":"https://pith.science/pith/RZOOSZ6GLQZ6QQXPMYR7GSLHY5","download_json":"https://pith.science/pith/RZOOSZ6GLQZ6QQXPMYR7GSLHY5.json","view_paper":"https://pith.science/paper/RZOOSZ6G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.03396&json=true","fetch_graph":"https://pith.science/api/pith-number/RZOOSZ6GLQZ6QQXPMYR7GSLHY5/graph.json","fetch_events":"https://pith.science/api/pith-number/RZOOSZ6GLQZ6QQXPMYR7GSLHY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZOOSZ6GLQZ6QQXPMYR7GSLHY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZOOSZ6GLQZ6QQXPMYR7GSLHY5/action/storage_attestation","attest_author":"https://pith.science/pith/RZOOSZ6GLQZ6QQXPMYR7GSLHY5/action/author_attestation","sign_citation":"https://pith.science/pith/RZOOSZ6GLQZ6QQXPMYR7GSLHY5/action/citation_signature","submit_replication":"https://pith.science/pith/RZOOSZ6GLQZ6QQXPMYR7GSLHY5/action/replication_record"}},"created_at":"2026-05-18T02:12:09.289761+00:00","updated_at":"2026-05-18T02:12:09.289761+00:00"}