{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:WCYCGHRFYMTYOOZEJBEQYCJM6S","short_pith_number":"pith:WCYCGHRF","schema_version":"1.0","canonical_sha256":"b0b0231e25c327873b2448490c092cf4a7f440fb93171ca10fa6aa1cb303ca77","source":{"kind":"arxiv","id":"0812.1345","version":4},"attestation_state":"computed","paper":{"title":"A Unified Approach to Distance-Two Colouring of Graphs on Surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jan van den Heuvel, Louis Esperet, Omid Amini","submitted_at":"2008-12-07T13:38:29Z","abstract_excerpt":"In this paper we introduce the notion of $\\Sigma$-colouring of a graph $G$: For given subsets $\\Sigma(v)$ of neighbours of $v$, for every $v\\in V(G)$, this is a proper colouring of the vertices of $G$ such that, in addition, vertices that appear together in some $\\Sigma(v)$ receive different colours. This concept generalises the notion of colouring the square of graphs and of cyclic colouring of graphs embedded in a surface. We prove a general result for graphs embeddable in a fixed surface, which implies asymptotic versions of Wegner's and Borodin's Conjecture on the planar version of these t"},"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":"0812.1345","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-12-07T13:38:29Z","cross_cats_sorted":[],"title_canon_sha256":"378a3b6977fa7d441cb3aab298d47618c6d45999ef70c1380184f811aabb82e0","abstract_canon_sha256":"2fbba220185418b33d24dc12fc69c1c8161c008403e583c044b22676c697c913"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:08.766708Z","signature_b64":"ERj4CHduy43PMHqiMbgCZDBWkDSzUZfkV+uQowkibhuyjUhF5chf0Rmcu4Rc5M0G1ODZ2s4voUEsDsSXSa2GAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0b0231e25c327873b2448490c092cf4a7f440fb93171ca10fa6aa1cb303ca77","last_reissued_at":"2026-05-18T01:32:08.766008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:08.766008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Approach to Distance-Two Colouring of Graphs on Surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jan van den Heuvel, Louis Esperet, Omid Amini","submitted_at":"2008-12-07T13:38:29Z","abstract_excerpt":"In this paper we introduce the notion of $\\Sigma$-colouring of a graph $G$: For given subsets $\\Sigma(v)$ of neighbours of $v$, for every $v\\in V(G)$, this is a proper colouring of the vertices of $G$ such that, in addition, vertices that appear together in some $\\Sigma(v)$ receive different colours. This concept generalises the notion of colouring the square of graphs and of cyclic colouring of graphs embedded in a surface. We prove a general result for graphs embeddable in a fixed surface, which implies asymptotic versions of Wegner's and Borodin's Conjecture on the planar version of these t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.1345","kind":"arxiv","version":4},"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":"0812.1345","created_at":"2026-05-18T01:32:08.766106+00:00"},{"alias_kind":"arxiv_version","alias_value":"0812.1345v4","created_at":"2026-05-18T01:32:08.766106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.1345","created_at":"2026-05-18T01:32:08.766106+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCYCGHRFYMTY","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCYCGHRFYMTYOOZE","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCYCGHRF","created_at":"2026-05-18T12:25:58.018023+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2210.05915","citing_title":"Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WCYCGHRFYMTYOOZEJBEQYCJM6S","json":"https://pith.science/pith/WCYCGHRFYMTYOOZEJBEQYCJM6S.json","graph_json":"https://pith.science/api/pith-number/WCYCGHRFYMTYOOZEJBEQYCJM6S/graph.json","events_json":"https://pith.science/api/pith-number/WCYCGHRFYMTYOOZEJBEQYCJM6S/events.json","paper":"https://pith.science/paper/WCYCGHRF"},"agent_actions":{"view_html":"https://pith.science/pith/WCYCGHRFYMTYOOZEJBEQYCJM6S","download_json":"https://pith.science/pith/WCYCGHRFYMTYOOZEJBEQYCJM6S.json","view_paper":"https://pith.science/paper/WCYCGHRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0812.1345&json=true","fetch_graph":"https://pith.science/api/pith-number/WCYCGHRFYMTYOOZEJBEQYCJM6S/graph.json","fetch_events":"https://pith.science/api/pith-number/WCYCGHRFYMTYOOZEJBEQYCJM6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCYCGHRFYMTYOOZEJBEQYCJM6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCYCGHRFYMTYOOZEJBEQYCJM6S/action/storage_attestation","attest_author":"https://pith.science/pith/WCYCGHRFYMTYOOZEJBEQYCJM6S/action/author_attestation","sign_citation":"https://pith.science/pith/WCYCGHRFYMTYOOZEJBEQYCJM6S/action/citation_signature","submit_replication":"https://pith.science/pith/WCYCGHRFYMTYOOZEJBEQYCJM6S/action/replication_record"}},"created_at":"2026-05-18T01:32:08.766106+00:00","updated_at":"2026-05-18T01:32:08.766106+00:00"}