{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2K3NYY4HS7FJDO4JGV2JT7IYEH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a4210c2b43a5718b32ac639e3dd9cbe0d43ce1c64c940d661b4f223808ee2115","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-30T06:09:27Z","title_canon_sha256":"baae9e08a8f25f01ab3d322c78ae4b251b1a858fd708616b07c250beb5ab6739"},"schema_version":"1.0","source":{"id":"1705.10465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10465","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10465v1","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10465","created_at":"2026-05-18T00:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"2K3NYY4HS7FJ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2K3NYY4HS7FJDO4J","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2K3NYY4H","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:4858ec791ca31d4d539d66fa0aa3d7be310287cb5643ad87a42386a62fa3c904","target":"graph","created_at":"2026-05-18T00:43:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Niranjan Balachandran, Pablo Spiga, Sajith Padinhatteeri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-30T06:09:27Z","title":"Vertex transitive graphs $G$ with $\\chi_D(G) > \\chi(G)$ and small automorphism group"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10465","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:505fb7768575487086182de664cd0d1c0803e84e0ca75fdae74bd3e25d6902f2","target":"record","created_at":"2026-05-18T00:43:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a4210c2b43a5718b32ac639e3dd9cbe0d43ce1c64c940d661b4f223808ee2115","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-30T06:09:27Z","title_canon_sha256":"baae9e08a8f25f01ab3d322c78ae4b251b1a858fd708616b07c250beb5ab6739"},"schema_version":"1.0","source":{"id":"1705.10465","kind":"arxiv","version":1}},"canonical_sha256":"d2b6dc638797ca91bb89357499fd1821c1ad82bea9f5f55beba4d0a6bd9ff744","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2b6dc638797ca91bb89357499fd1821c1ad82bea9f5f55beba4d0a6bd9ff744","first_computed_at":"2026-05-18T00:43:24.491966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:24.491966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r8cLOtN8fZaqSCG1/PWD5hmBAPxccmM9RqGElE2nmFyVl/TsfyuZACN5c6qkGWA4ZPZ13KsvBjgql++Apf30BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:24.492505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:505fb7768575487086182de664cd0d1c0803e84e0ca75fdae74bd3e25d6902f2","sha256:4858ec791ca31d4d539d66fa0aa3d7be310287cb5643ad87a42386a62fa3c904"],"state_sha256":"a69353e4341e47a113cc6fe2a460086edd336b7c3694510b0370b5b9ca46fa3b"}