{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NFVBK3SY7QOC6SGHXCAIBWPZEQ","short_pith_number":"pith:NFVBK3SY","schema_version":"1.0","canonical_sha256":"696a156e58fc1c2f48c7b88080d9f92404de3051fcefd0537dda668e2dd276ed","source":{"kind":"arxiv","id":"2004.06340","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical and Modularly-Minimal Vertex Colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","q-bio.PE"],"primary_cat":"math.CO","authors_text":"Dulce I. Valdivia, Manuela Gei{\\ss}, Marc Hellmuth, Maribel Hern\\'andez Rosales, Peter F. Stadler","submitted_at":"2020-04-14T07:52:53Z","abstract_excerpt":"Cographs are exactly the hereditarily well-colored graphs, i.e., the graphs for which a greedy vertex coloring of every induced subgraph uses only the minimally necessary number of colors $\\chi(G)$. We show that greedy colorings are a special case of the more general hierarchical vertex colorings, which recently were introduced in phylogenetic combinatorics. Replacing cotrees by modular decomposition trees generalizes the concept of hierarchical colorings to arbitrary graphs. We show that every graph has a modularly-minimal coloring $\\sigma$ satisfying $|\\sigma(M)|=\\chi(M)$ for every strong mo"},"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":"2004.06340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-14T07:52:53Z","cross_cats_sorted":["cs.DM","cs.DS","q-bio.PE"],"title_canon_sha256":"30f5c9b3a80bac3887289fce4ab6527bf3817959d1a2172d328de60284affea7","abstract_canon_sha256":"1f96687116c78de15cff6b3a0d9067776e5791965a98d0e0b8da2471abd8cecf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:51.089469Z","signature_b64":"LBK4daybSXayp/Jjx4sVe6u88BN9sgQtCCVJhnVxu8qcbzhzcKE0PLgwb2SlR5CbFJxw9tHi3g2nbCSFIBc4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"696a156e58fc1c2f48c7b88080d9f92404de3051fcefd0537dda668e2dd276ed","last_reissued_at":"2026-07-05T00:54:51.088993Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:51.088993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical and Modularly-Minimal Vertex Colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","q-bio.PE"],"primary_cat":"math.CO","authors_text":"Dulce I. Valdivia, Manuela Gei{\\ss}, Marc Hellmuth, Maribel Hern\\'andez Rosales, Peter F. Stadler","submitted_at":"2020-04-14T07:52:53Z","abstract_excerpt":"Cographs are exactly the hereditarily well-colored graphs, i.e., the graphs for which a greedy vertex coloring of every induced subgraph uses only the minimally necessary number of colors $\\chi(G)$. We show that greedy colorings are a special case of the more general hierarchical vertex colorings, which recently were introduced in phylogenetic combinatorics. Replacing cotrees by modular decomposition trees generalizes the concept of hierarchical colorings to arbitrary graphs. We show that every graph has a modularly-minimal coloring $\\sigma$ satisfying $|\\sigma(M)|=\\chi(M)$ for every strong mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.06340","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.06340/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2004.06340","created_at":"2026-07-05T00:54:51.089058+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.06340v1","created_at":"2026-07-05T00:54:51.089058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.06340","created_at":"2026-07-05T00:54:51.089058+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFVBK3SY7QOC","created_at":"2026-07-05T00:54:51.089058+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFVBK3SY7QOC6SGH","created_at":"2026-07-05T00:54:51.089058+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFVBK3SY","created_at":"2026-07-05T00:54:51.089058+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/NFVBK3SY7QOC6SGHXCAIBWPZEQ","json":"https://pith.science/pith/NFVBK3SY7QOC6SGHXCAIBWPZEQ.json","graph_json":"https://pith.science/api/pith-number/NFVBK3SY7QOC6SGHXCAIBWPZEQ/graph.json","events_json":"https://pith.science/api/pith-number/NFVBK3SY7QOC6SGHXCAIBWPZEQ/events.json","paper":"https://pith.science/paper/NFVBK3SY"},"agent_actions":{"view_html":"https://pith.science/pith/NFVBK3SY7QOC6SGHXCAIBWPZEQ","download_json":"https://pith.science/pith/NFVBK3SY7QOC6SGHXCAIBWPZEQ.json","view_paper":"https://pith.science/paper/NFVBK3SY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.06340&json=true","fetch_graph":"https://pith.science/api/pith-number/NFVBK3SY7QOC6SGHXCAIBWPZEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NFVBK3SY7QOC6SGHXCAIBWPZEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFVBK3SY7QOC6SGHXCAIBWPZEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFVBK3SY7QOC6SGHXCAIBWPZEQ/action/storage_attestation","attest_author":"https://pith.science/pith/NFVBK3SY7QOC6SGHXCAIBWPZEQ/action/author_attestation","sign_citation":"https://pith.science/pith/NFVBK3SY7QOC6SGHXCAIBWPZEQ/action/citation_signature","submit_replication":"https://pith.science/pith/NFVBK3SY7QOC6SGHXCAIBWPZEQ/action/replication_record"}},"created_at":"2026-07-05T00:54:51.089058+00:00","updated_at":"2026-07-05T00:54:51.089058+00:00"}