{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BKE7YIOFYFO6TYDFNQBIUFVIPW","short_pith_number":"pith:BKE7YIOF","schema_version":"1.0","canonical_sha256":"0a89fc21c5c15de9e0656c028a16a87da2bc1b81c071138235712c6875ef2007","source":{"kind":"arxiv","id":"1804.03552","version":2},"attestation_state":"computed","paper":{"title":"Perfect colourings of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dirk Frettl\\\"oh, Joseph R.C. Damasco","submitted_at":"2018-04-10T14:16:25Z","abstract_excerpt":"A vertex colouring of some graph is called perfect if each vertex of colour $i$ has exactly $a_{ij}$ neighbours of colour $j$. Being perfect imposes several restrictions on the colour incidence matrix $(a_{ij})$. We list several (old and new) necessary conditions for a matrix to be the colour incidence matrix of a perfect colouring. Moreover we show that a certain combination of these conditions is also sufficient. Using this we determine a list of all colour incidence matrices corresponding to perfect colourings of 3-regular, 4-regular and 5-regular graphs with two, three and four colours, re"},"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":"1804.03552","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-10T14:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"caced6b11470079f3b21671d73dac70f4e962a969ac1260301e0d12b784df399","abstract_canon_sha256":"a165253c1c0e3f8a77aa18601336c9d355ca20fa2031c9046d5a850c9b0b94df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:23.870746Z","signature_b64":"sPxaVvYVMWxP9Wd9HT0I5l3L1lPlPxR/vYN7hfJV16YZyDkdsjl0K3Z6m8ERJBOt5Za6OgjtuWFujJqKBUxFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a89fc21c5c15de9e0656c028a16a87da2bc1b81c071138235712c6875ef2007","last_reissued_at":"2026-05-17T23:43:23.870076Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:23.870076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect colourings of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dirk Frettl\\\"oh, Joseph R.C. Damasco","submitted_at":"2018-04-10T14:16:25Z","abstract_excerpt":"A vertex colouring of some graph is called perfect if each vertex of colour $i$ has exactly $a_{ij}$ neighbours of colour $j$. Being perfect imposes several restrictions on the colour incidence matrix $(a_{ij})$. We list several (old and new) necessary conditions for a matrix to be the colour incidence matrix of a perfect colouring. Moreover we show that a certain combination of these conditions is also sufficient. Using this we determine a list of all colour incidence matrices corresponding to perfect colourings of 3-regular, 4-regular and 5-regular graphs with two, three and four colours, re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03552","kind":"arxiv","version":2},"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":"1804.03552","created_at":"2026-05-17T23:43:23.870182+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03552v2","created_at":"2026-05-17T23:43:23.870182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03552","created_at":"2026-05-17T23:43:23.870182+00:00"},{"alias_kind":"pith_short_12","alias_value":"BKE7YIOFYFO6","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BKE7YIOFYFO6TYDF","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BKE7YIOF","created_at":"2026-05-18T12:32:16.446611+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/BKE7YIOFYFO6TYDFNQBIUFVIPW","json":"https://pith.science/pith/BKE7YIOFYFO6TYDFNQBIUFVIPW.json","graph_json":"https://pith.science/api/pith-number/BKE7YIOFYFO6TYDFNQBIUFVIPW/graph.json","events_json":"https://pith.science/api/pith-number/BKE7YIOFYFO6TYDFNQBIUFVIPW/events.json","paper":"https://pith.science/paper/BKE7YIOF"},"agent_actions":{"view_html":"https://pith.science/pith/BKE7YIOFYFO6TYDFNQBIUFVIPW","download_json":"https://pith.science/pith/BKE7YIOFYFO6TYDFNQBIUFVIPW.json","view_paper":"https://pith.science/paper/BKE7YIOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03552&json=true","fetch_graph":"https://pith.science/api/pith-number/BKE7YIOFYFO6TYDFNQBIUFVIPW/graph.json","fetch_events":"https://pith.science/api/pith-number/BKE7YIOFYFO6TYDFNQBIUFVIPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BKE7YIOFYFO6TYDFNQBIUFVIPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BKE7YIOFYFO6TYDFNQBIUFVIPW/action/storage_attestation","attest_author":"https://pith.science/pith/BKE7YIOFYFO6TYDFNQBIUFVIPW/action/author_attestation","sign_citation":"https://pith.science/pith/BKE7YIOFYFO6TYDFNQBIUFVIPW/action/citation_signature","submit_replication":"https://pith.science/pith/BKE7YIOFYFO6TYDFNQBIUFVIPW/action/replication_record"}},"created_at":"2026-05-17T23:43:23.870182+00:00","updated_at":"2026-05-17T23:43:23.870182+00:00"}