{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Y5W6SCMAQAFXFJQLWBXIJAEVL5","short_pith_number":"pith:Y5W6SCMA","schema_version":"1.0","canonical_sha256":"c76de90980800b72a60bb06e8480955f4914fef54e57557aabf57136c3d8c920","source":{"kind":"arxiv","id":"1906.10031","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Colorings of Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"D.I. Valdivia, M. Gei{\\ss}, M. Hellmuth, M. Hernandez Rosales, P.F. Stadler","submitted_at":"2019-06-24T15:43:26Z","abstract_excerpt":"Cographs are exactly hereditarily well-colored graphs, i.e., the graphs for which a greedy coloring of every induced subgraph uses only the minimally necessary number of colors $\\chi(G)$. In recent work on reciprocal best match graphs so-called hierarchically coloring play an important role. Here we show that greedy colorings are a special case of hierarchical coloring, which also require no more than $\\chi(G)$ colors."},"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":"1906.10031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-24T15:43:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"af98cf48443af7503c291d1d919b3b0d627ea413a7df18629ffcf811a510022a","abstract_canon_sha256":"16b10b90893ac1d2e90372a1f37709a568df443677e61ec7b61291f695deb74e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:35.670112Z","signature_b64":"6uvjx1Hxb1NPDnT/N27G2BICghWBX3VnNAaf9vKBpQ5F18Jqxz7RR3RF2t9L/ytm4TQ7oegP6FavKhX8d5T/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c76de90980800b72a60bb06e8480955f4914fef54e57557aabf57136c3d8c920","last_reissued_at":"2026-05-17T23:42:35.669417Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:35.669417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Colorings of Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"D.I. Valdivia, M. Gei{\\ss}, M. Hellmuth, M. Hernandez Rosales, P.F. Stadler","submitted_at":"2019-06-24T15:43:26Z","abstract_excerpt":"Cographs are exactly hereditarily well-colored graphs, i.e., the graphs for which a greedy coloring of every induced subgraph uses only the minimally necessary number of colors $\\chi(G)$. In recent work on reciprocal best match graphs so-called hierarchically coloring play an important role. Here we show that greedy colorings are a special case of hierarchical coloring, which also require no more than $\\chi(G)$ colors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10031","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":"1906.10031","created_at":"2026-05-17T23:42:35.669532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10031v1","created_at":"2026-05-17T23:42:35.669532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10031","created_at":"2026-05-17T23:42:35.669532+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5W6SCMAQAFX","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5W6SCMAQAFXFJQL","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5W6SCMA","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08865","citing_title":"Complexity of Modification Problems for Reciprocal Best Match Graphs","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y5W6SCMAQAFXFJQLWBXIJAEVL5","json":"https://pith.science/pith/Y5W6SCMAQAFXFJQLWBXIJAEVL5.json","graph_json":"https://pith.science/api/pith-number/Y5W6SCMAQAFXFJQLWBXIJAEVL5/graph.json","events_json":"https://pith.science/api/pith-number/Y5W6SCMAQAFXFJQLWBXIJAEVL5/events.json","paper":"https://pith.science/paper/Y5W6SCMA"},"agent_actions":{"view_html":"https://pith.science/pith/Y5W6SCMAQAFXFJQLWBXIJAEVL5","download_json":"https://pith.science/pith/Y5W6SCMAQAFXFJQLWBXIJAEVL5.json","view_paper":"https://pith.science/paper/Y5W6SCMA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10031&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5W6SCMAQAFXFJQLWBXIJAEVL5/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5W6SCMAQAFXFJQLWBXIJAEVL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5W6SCMAQAFXFJQLWBXIJAEVL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5W6SCMAQAFXFJQLWBXIJAEVL5/action/storage_attestation","attest_author":"https://pith.science/pith/Y5W6SCMAQAFXFJQLWBXIJAEVL5/action/author_attestation","sign_citation":"https://pith.science/pith/Y5W6SCMAQAFXFJQLWBXIJAEVL5/action/citation_signature","submit_replication":"https://pith.science/pith/Y5W6SCMAQAFXFJQLWBXIJAEVL5/action/replication_record"}},"created_at":"2026-05-17T23:42:35.669532+00:00","updated_at":"2026-05-17T23:42:35.669532+00:00"}