{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XTZFH2EPZ4EFGNLGFJCUJLSVDH","short_pith_number":"pith:XTZFH2EP","schema_version":"1.0","canonical_sha256":"bcf253e88fcf085335662a4544ae5519e7056f5529d0466f2fceb15ed81cd121","source":{"kind":"arxiv","id":"1802.10180","version":1},"attestation_state":"computed","paper":{"title":"Role colouring graphs in hereditary classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Christopher Purcell, Puck Rombach","submitted_at":"2018-02-27T21:58:18Z","abstract_excerpt":"We study the computational complexity of computing role colourings of graphs in hereditary classes. We are interested in describing the family of hereditary classes on which a role colouring with k colours can be computed in polynomial time. In particular, we wish to describe the boundary between the \"hard\" and \"easy\" classes. The notion of a boundary class has been introduced by Alekseev in order to study such boundaries. Our main results are a boundary class for the k-role colouring problem and the related k-coupon colouring problem which has recently received a lot of attention in the liter"},"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":"1802.10180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-27T21:58:18Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4b2a310b1c575023068bb7962efb8437ef4f63ebf417055d946463f9f812b42b","abstract_canon_sha256":"00dfc39a2386e73a7505e7d8844ca68b0207027ea3c67ab3fd5c62775b8bf829"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:17.899169Z","signature_b64":"inksZjKcOdDpri3ZJVGbb/LuUrq619o1RNx2dCnT0K+r2cCdEqOiYjOGIvOsR2wkLYegG1Nc5WhcHOPuPL7qCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcf253e88fcf085335662a4544ae5519e7056f5529d0466f2fceb15ed81cd121","last_reissued_at":"2026-05-18T00:22:17.898574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:17.898574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Role colouring graphs in hereditary classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Christopher Purcell, Puck Rombach","submitted_at":"2018-02-27T21:58:18Z","abstract_excerpt":"We study the computational complexity of computing role colourings of graphs in hereditary classes. We are interested in describing the family of hereditary classes on which a role colouring with k colours can be computed in polynomial time. In particular, we wish to describe the boundary between the \"hard\" and \"easy\" classes. The notion of a boundary class has been introduced by Alekseev in order to study such boundaries. Our main results are a boundary class for the k-role colouring problem and the related k-coupon colouring problem which has recently received a lot of attention in the liter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10180","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":"1802.10180","created_at":"2026-05-18T00:22:17.898686+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10180v1","created_at":"2026-05-18T00:22:17.898686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10180","created_at":"2026-05-18T00:22:17.898686+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTZFH2EPZ4EF","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTZFH2EPZ4EFGNLG","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTZFH2EP","created_at":"2026-05-18T12:33:01.666342+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/XTZFH2EPZ4EFGNLGFJCUJLSVDH","json":"https://pith.science/pith/XTZFH2EPZ4EFGNLGFJCUJLSVDH.json","graph_json":"https://pith.science/api/pith-number/XTZFH2EPZ4EFGNLGFJCUJLSVDH/graph.json","events_json":"https://pith.science/api/pith-number/XTZFH2EPZ4EFGNLGFJCUJLSVDH/events.json","paper":"https://pith.science/paper/XTZFH2EP"},"agent_actions":{"view_html":"https://pith.science/pith/XTZFH2EPZ4EFGNLGFJCUJLSVDH","download_json":"https://pith.science/pith/XTZFH2EPZ4EFGNLGFJCUJLSVDH.json","view_paper":"https://pith.science/paper/XTZFH2EP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10180&json=true","fetch_graph":"https://pith.science/api/pith-number/XTZFH2EPZ4EFGNLGFJCUJLSVDH/graph.json","fetch_events":"https://pith.science/api/pith-number/XTZFH2EPZ4EFGNLGFJCUJLSVDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTZFH2EPZ4EFGNLGFJCUJLSVDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTZFH2EPZ4EFGNLGFJCUJLSVDH/action/storage_attestation","attest_author":"https://pith.science/pith/XTZFH2EPZ4EFGNLGFJCUJLSVDH/action/author_attestation","sign_citation":"https://pith.science/pith/XTZFH2EPZ4EFGNLGFJCUJLSVDH/action/citation_signature","submit_replication":"https://pith.science/pith/XTZFH2EPZ4EFGNLGFJCUJLSVDH/action/replication_record"}},"created_at":"2026-05-18T00:22:17.898686+00:00","updated_at":"2026-05-18T00:22:17.898686+00:00"}