{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2K3NYY4HS7FJDO4JGV2JT7IYEH","short_pith_number":"pith:2K3NYY4H","schema_version":"1.0","canonical_sha256":"d2b6dc638797ca91bb89357499fd1821c1ad82bea9f5f55beba4d0a6bd9ff744","source":{"kind":"arxiv","id":"1705.10465","version":1},"attestation_state":"computed","paper":{"title":"Vertex transitive graphs $G$ with $\\chi_D(G) > \\chi(G)$ and small automorphism group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Niranjan Balachandran, Pablo Spiga, Sajith Padinhatteeri","submitted_at":"2017-05-30T06:09:27Z","abstract_excerpt":"For a graph $G$ and a positive integer $k$, a vertex labelling $f:V(G)\\to\\{1,2\\ldots,k\\}$ is said to be $k$-distinguishing if no non-trivial automorphism of $G$ preserves the sets $f^{-1}(i)$ for each $i\\in\\{1,\\ldots,k\\}$. The distinguishing chromatic number of a graph $G$, denoted $\\chi_D(G)$, is defined as the minimum $k$ such that there is a $k$-distinguishing labelling of $V(G)$ which is also a proper coloring of the vertices of $G$. In this paper, we prove the following theorem: Given $k\\in\\mathbb{N}$, there exists an infinite sequence of vertex-transitive graphs $G_{i}=(V_i,E_i)$ such th"},"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":"1705.10465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-30T06:09:27Z","cross_cats_sorted":[],"title_canon_sha256":"baae9e08a8f25f01ab3d322c78ae4b251b1a858fd708616b07c250beb5ab6739","abstract_canon_sha256":"a4210c2b43a5718b32ac639e3dd9cbe0d43ce1c64c940d661b4f223808ee2115"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:24.492505Z","signature_b64":"r8cLOtN8fZaqSCG1/PWD5hmBAPxccmM9RqGElE2nmFyVl/TsfyuZACN5c6qkGWA4ZPZ13KsvBjgql++Apf30BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2b6dc638797ca91bb89357499fd1821c1ad82bea9f5f55beba4d0a6bd9ff744","last_reissued_at":"2026-05-18T00:43:24.491966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:24.491966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex transitive graphs $G$ with $\\chi_D(G) > \\chi(G)$ and small automorphism group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Niranjan Balachandran, Pablo Spiga, Sajith Padinhatteeri","submitted_at":"2017-05-30T06:09:27Z","abstract_excerpt":"For a graph $G$ and a positive integer $k$, a vertex labelling $f:V(G)\\to\\{1,2\\ldots,k\\}$ is said to be $k$-distinguishing if no non-trivial automorphism of $G$ preserves the sets $f^{-1}(i)$ for each $i\\in\\{1,\\ldots,k\\}$. The distinguishing chromatic number of a graph $G$, denoted $\\chi_D(G)$, is defined as the minimum $k$ such that there is a $k$-distinguishing labelling of $V(G)$ which is also a proper coloring of the vertices of $G$. In this paper, we prove the following theorem: Given $k\\in\\mathbb{N}$, there exists an infinite sequence of vertex-transitive graphs $G_{i}=(V_i,E_i)$ such th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10465","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":"1705.10465","created_at":"2026-05-18T00:43:24.492050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10465v1","created_at":"2026-05-18T00:43:24.492050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10465","created_at":"2026-05-18T00:43:24.492050+00:00"},{"alias_kind":"pith_short_12","alias_value":"2K3NYY4HS7FJ","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2K3NYY4HS7FJDO4J","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2K3NYY4H","created_at":"2026-05-18T12:30:55.937587+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/2K3NYY4HS7FJDO4JGV2JT7IYEH","json":"https://pith.science/pith/2K3NYY4HS7FJDO4JGV2JT7IYEH.json","graph_json":"https://pith.science/api/pith-number/2K3NYY4HS7FJDO4JGV2JT7IYEH/graph.json","events_json":"https://pith.science/api/pith-number/2K3NYY4HS7FJDO4JGV2JT7IYEH/events.json","paper":"https://pith.science/paper/2K3NYY4H"},"agent_actions":{"view_html":"https://pith.science/pith/2K3NYY4HS7FJDO4JGV2JT7IYEH","download_json":"https://pith.science/pith/2K3NYY4HS7FJDO4JGV2JT7IYEH.json","view_paper":"https://pith.science/paper/2K3NYY4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10465&json=true","fetch_graph":"https://pith.science/api/pith-number/2K3NYY4HS7FJDO4JGV2JT7IYEH/graph.json","fetch_events":"https://pith.science/api/pith-number/2K3NYY4HS7FJDO4JGV2JT7IYEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2K3NYY4HS7FJDO4JGV2JT7IYEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2K3NYY4HS7FJDO4JGV2JT7IYEH/action/storage_attestation","attest_author":"https://pith.science/pith/2K3NYY4HS7FJDO4JGV2JT7IYEH/action/author_attestation","sign_citation":"https://pith.science/pith/2K3NYY4HS7FJDO4JGV2JT7IYEH/action/citation_signature","submit_replication":"https://pith.science/pith/2K3NYY4HS7FJDO4JGV2JT7IYEH/action/replication_record"}},"created_at":"2026-05-18T00:43:24.492050+00:00","updated_at":"2026-05-18T00:43:24.492050+00:00"}