{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VMWNZ4TWBEE7QZWLPWNBZSLW4Z","short_pith_number":"pith:VMWNZ4TW","schema_version":"1.0","canonical_sha256":"ab2cdcf2760909f866cb7d9a1cc976e66dc196ddd63856f0ed36d482f85ce323","source":{"kind":"arxiv","id":"1406.5358","version":3},"attestation_state":"computed","paper":{"title":"Distinguishing Chromatic Number of Random Cayley graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Niranjan Balachandran, Sajith Padinhatteeri","submitted_at":"2014-06-20T11:53:15Z","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, we consider random Cayley graphs $\\Gamma(A,S)$ defined over certain abelian groups $A$ and show that with probability at least $1-n^{-\\Omega(\\log n)}$ we have, $\\chi_D(\\Gamma)\\le\\chi(\\Gamma) + 1$."},"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":"1406.5358","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-20T11:53:15Z","cross_cats_sorted":[],"title_canon_sha256":"299b5774669925695ca36da1a43e8ef0fea321f4817612e7112717195fb2e825","abstract_canon_sha256":"647c3fe4672b5eb8fa5678f914da2c474a0e5ba7785dbf60611fce4ad7d99d14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:26.049618Z","signature_b64":"/QpL4zBWge72BSz9GCWgvASUzJA63uUhbDjdgrgipncprfiBQdecdRbPLuE/gtAb5nJddfpnpfVB8Viu4csoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab2cdcf2760909f866cb7d9a1cc976e66dc196ddd63856f0ed36d482f85ce323","last_reissued_at":"2026-05-18T01:17:26.049158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:26.049158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distinguishing Chromatic Number of Random Cayley graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Niranjan Balachandran, Sajith Padinhatteeri","submitted_at":"2014-06-20T11:53:15Z","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, we consider random Cayley graphs $\\Gamma(A,S)$ defined over certain abelian groups $A$ and show that with probability at least $1-n^{-\\Omega(\\log n)}$ we have, $\\chi_D(\\Gamma)\\le\\chi(\\Gamma) + 1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5358","kind":"arxiv","version":3},"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":"1406.5358","created_at":"2026-05-18T01:17:26.049233+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5358v3","created_at":"2026-05-18T01:17:26.049233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5358","created_at":"2026-05-18T01:17:26.049233+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMWNZ4TWBEE7","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMWNZ4TWBEE7QZWL","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMWNZ4TW","created_at":"2026-05-18T12:28:54.890064+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/VMWNZ4TWBEE7QZWLPWNBZSLW4Z","json":"https://pith.science/pith/VMWNZ4TWBEE7QZWLPWNBZSLW4Z.json","graph_json":"https://pith.science/api/pith-number/VMWNZ4TWBEE7QZWLPWNBZSLW4Z/graph.json","events_json":"https://pith.science/api/pith-number/VMWNZ4TWBEE7QZWLPWNBZSLW4Z/events.json","paper":"https://pith.science/paper/VMWNZ4TW"},"agent_actions":{"view_html":"https://pith.science/pith/VMWNZ4TWBEE7QZWLPWNBZSLW4Z","download_json":"https://pith.science/pith/VMWNZ4TWBEE7QZWLPWNBZSLW4Z.json","view_paper":"https://pith.science/paper/VMWNZ4TW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5358&json=true","fetch_graph":"https://pith.science/api/pith-number/VMWNZ4TWBEE7QZWLPWNBZSLW4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/VMWNZ4TWBEE7QZWLPWNBZSLW4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMWNZ4TWBEE7QZWLPWNBZSLW4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMWNZ4TWBEE7QZWLPWNBZSLW4Z/action/storage_attestation","attest_author":"https://pith.science/pith/VMWNZ4TWBEE7QZWLPWNBZSLW4Z/action/author_attestation","sign_citation":"https://pith.science/pith/VMWNZ4TWBEE7QZWLPWNBZSLW4Z/action/citation_signature","submit_replication":"https://pith.science/pith/VMWNZ4TWBEE7QZWLPWNBZSLW4Z/action/replication_record"}},"created_at":"2026-05-18T01:17:26.049233+00:00","updated_at":"2026-05-18T01:17:26.049233+00:00"}