{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CRSGINJW7DZ3CGQHKYTHD65VGH","short_pith_number":"pith:CRSGINJW","schema_version":"1.0","canonical_sha256":"1464643536f8f3b11a07562671fbb531ee4696bacd9be3805efc67b28eb440c1","source":{"kind":"arxiv","id":"2505.17193","version":1},"attestation_state":"computed","paper":{"title":"On the distinguishing chromatic number in hereditary graph classes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christoph Brause, Ingo Schiemeyer, Monika Pil\\'sniak, Rafa{\\l} Kalinowski","submitted_at":"2025-05-22T18:03:55Z","abstract_excerpt":"The distinguishing chromatic number of a graph $G$, denoted $\\chi_D(G)$, is the minimum number of colours in a proper vertex colouring of $G$ that is preserved by the identity automorphism only. Collins and Trenk proved that $\\chi_D(G)\\le 2\\Delta(G)$ for any connected graph $G$, and the equality holds for complete balanced bipartite graphs $K_{p,p}$ and for $C_6$. In this paper, we show that the upper bound on $\\chi_D(G)$ can be substantially reduced if we forbid some small graphs as induced subgraphs of $G$, that is, we study the distinguishing chromatic number in some hereditary graph classe"},"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":"2505.17193","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-22T18:03:55Z","cross_cats_sorted":[],"title_canon_sha256":"a69f9970c575789f9e1c8ed27a6057b60ca04cfe8d408b9a54116f23d68ffa8a","abstract_canon_sha256":"6582dbe9c305d38dccbce465d1aefe75f0c1228ece27dc435970b8250c95ea62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:48.473134Z","signature_b64":"kh/WjmDx8C8kCKm9LiYrEsFCm1gSYSEWB0cDhNyVHKme6VDPYzM7Hhg9AGlLOzp15PLS18QrymHfllO+12CgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1464643536f8f3b11a07562671fbb531ee4696bacd9be3805efc67b28eb440c1","last_reissued_at":"2026-07-05T11:07:48.472617Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:48.472617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the distinguishing chromatic number in hereditary graph classes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christoph Brause, Ingo Schiemeyer, Monika Pil\\'sniak, Rafa{\\l} Kalinowski","submitted_at":"2025-05-22T18:03:55Z","abstract_excerpt":"The distinguishing chromatic number of a graph $G$, denoted $\\chi_D(G)$, is the minimum number of colours in a proper vertex colouring of $G$ that is preserved by the identity automorphism only. Collins and Trenk proved that $\\chi_D(G)\\le 2\\Delta(G)$ for any connected graph $G$, and the equality holds for complete balanced bipartite graphs $K_{p,p}$ and for $C_6$. In this paper, we show that the upper bound on $\\chi_D(G)$ can be substantially reduced if we forbid some small graphs as induced subgraphs of $G$, that is, we study the distinguishing chromatic number in some hereditary graph classe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17193","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.17193/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.17193","created_at":"2026-07-05T11:07:48.472688+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.17193v1","created_at":"2026-07-05T11:07:48.472688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17193","created_at":"2026-07-05T11:07:48.472688+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRSGINJW7DZ3","created_at":"2026-07-05T11:07:48.472688+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRSGINJW7DZ3CGQH","created_at":"2026-07-05T11:07:48.472688+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRSGINJW","created_at":"2026-07-05T11:07:48.472688+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.01698","citing_title":"On $k$-colorability of $(bull, H)$-free graphs","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CRSGINJW7DZ3CGQHKYTHD65VGH","json":"https://pith.science/pith/CRSGINJW7DZ3CGQHKYTHD65VGH.json","graph_json":"https://pith.science/api/pith-number/CRSGINJW7DZ3CGQHKYTHD65VGH/graph.json","events_json":"https://pith.science/api/pith-number/CRSGINJW7DZ3CGQHKYTHD65VGH/events.json","paper":"https://pith.science/paper/CRSGINJW"},"agent_actions":{"view_html":"https://pith.science/pith/CRSGINJW7DZ3CGQHKYTHD65VGH","download_json":"https://pith.science/pith/CRSGINJW7DZ3CGQHKYTHD65VGH.json","view_paper":"https://pith.science/paper/CRSGINJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.17193&json=true","fetch_graph":"https://pith.science/api/pith-number/CRSGINJW7DZ3CGQHKYTHD65VGH/graph.json","fetch_events":"https://pith.science/api/pith-number/CRSGINJW7DZ3CGQHKYTHD65VGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRSGINJW7DZ3CGQHKYTHD65VGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRSGINJW7DZ3CGQHKYTHD65VGH/action/storage_attestation","attest_author":"https://pith.science/pith/CRSGINJW7DZ3CGQHKYTHD65VGH/action/author_attestation","sign_citation":"https://pith.science/pith/CRSGINJW7DZ3CGQHKYTHD65VGH/action/citation_signature","submit_replication":"https://pith.science/pith/CRSGINJW7DZ3CGQHKYTHD65VGH/action/replication_record"}},"created_at":"2026-07-05T11:07:48.472688+00:00","updated_at":"2026-07-05T11:07:48.472688+00:00"}