{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MTSVA66RXEATAMIZJSP6SF3UDP","short_pith_number":"pith:MTSVA66R","schema_version":"1.0","canonical_sha256":"64e5507bd1b9013031194c9fe917741bfc6e0cc8126d517b9380da716b787640","source":{"kind":"arxiv","id":"1810.03932","version":1},"attestation_state":"computed","paper":{"title":"Distinguishing infinite graphs with bounded degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florian Lehner, Marcin Stawiski, Monika Pil\\'sniak","submitted_at":"2018-10-09T12:15:12Z","abstract_excerpt":"Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph $G$ moves infinitely many vertices, then there is a distinguishing $2$-colouring. We confirm this conjecture for graphs with maximum degree $\\Delta \\leq 5$. Furthermore, using similar techniques we show that if an infinite graph has maximum degree $\\Delta \\geq 3$, then it admits a distinguishing colouring with $\\Delta - 1$ colours. This bound is sharp."},"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":"1810.03932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-09T12:15:12Z","cross_cats_sorted":[],"title_canon_sha256":"34c0816d5a2c20b98da75bbdac3725839ce3dd7dd7245d390a54573efca0cf1e","abstract_canon_sha256":"409fcd37c17d3e779b25b742e52529152ba781917e356b635ff7ef7e70f6a564"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:44.249538Z","signature_b64":"YO3nyjLYa/GH7qknNtZodz9fvGPENNlg2VZ37PcvO0nd9HeFUXCEzER+NEiMH5ZPToQXkZH28QPxa9Y2ZAgXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64e5507bd1b9013031194c9fe917741bfc6e0cc8126d517b9380da716b787640","last_reissued_at":"2026-05-18T00:03:44.249105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:44.249105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distinguishing infinite graphs with bounded degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florian Lehner, Marcin Stawiski, Monika Pil\\'sniak","submitted_at":"2018-10-09T12:15:12Z","abstract_excerpt":"Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph $G$ moves infinitely many vertices, then there is a distinguishing $2$-colouring. We confirm this conjecture for graphs with maximum degree $\\Delta \\leq 5$. Furthermore, using similar techniques we show that if an infinite graph has maximum degree $\\Delta \\geq 3$, then it admits a distinguishing colouring with $\\Delta - 1$ colours. This bound is sharp."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03932","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":"1810.03932","created_at":"2026-05-18T00:03:44.249166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.03932v1","created_at":"2026-05-18T00:03:44.249166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03932","created_at":"2026-05-18T00:03:44.249166+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTSVA66RXEAT","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTSVA66RXEATAMIZ","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTSVA66R","created_at":"2026-05-18T12:32:40.477152+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/MTSVA66RXEATAMIZJSP6SF3UDP","json":"https://pith.science/pith/MTSVA66RXEATAMIZJSP6SF3UDP.json","graph_json":"https://pith.science/api/pith-number/MTSVA66RXEATAMIZJSP6SF3UDP/graph.json","events_json":"https://pith.science/api/pith-number/MTSVA66RXEATAMIZJSP6SF3UDP/events.json","paper":"https://pith.science/paper/MTSVA66R"},"agent_actions":{"view_html":"https://pith.science/pith/MTSVA66RXEATAMIZJSP6SF3UDP","download_json":"https://pith.science/pith/MTSVA66RXEATAMIZJSP6SF3UDP.json","view_paper":"https://pith.science/paper/MTSVA66R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.03932&json=true","fetch_graph":"https://pith.science/api/pith-number/MTSVA66RXEATAMIZJSP6SF3UDP/graph.json","fetch_events":"https://pith.science/api/pith-number/MTSVA66RXEATAMIZJSP6SF3UDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTSVA66RXEATAMIZJSP6SF3UDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTSVA66RXEATAMIZJSP6SF3UDP/action/storage_attestation","attest_author":"https://pith.science/pith/MTSVA66RXEATAMIZJSP6SF3UDP/action/author_attestation","sign_citation":"https://pith.science/pith/MTSVA66RXEATAMIZJSP6SF3UDP/action/citation_signature","submit_replication":"https://pith.science/pith/MTSVA66RXEATAMIZJSP6SF3UDP/action/replication_record"}},"created_at":"2026-05-18T00:03:44.249166+00:00","updated_at":"2026-05-18T00:03:44.249166+00:00"}