{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5UBCVEGONISOZK6PSWLX4HR2K2","short_pith_number":"pith:5UBCVEGO","schema_version":"1.0","canonical_sha256":"ed022a90ce6a24ecabcf95977e1e3a56ab444f9051ae914fc938b2114467a0d0","source":{"kind":"arxiv","id":"1103.5531","version":1},"attestation_state":"computed","paper":{"title":"Acyclic and Star Colorings of Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andrew Lyons","submitted_at":"2011-03-29T02:25:49Z","abstract_excerpt":"An \\emph{acyclic coloring} of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of \\emph{star coloring} requires that the union of any two color classes induces a disjoint collection of stars. We prove that every acyclic coloring of a cograph is also a star coloring and give a linear-time algorithm for finding an optimal acyclic and star coloring of a cograph. If the graph is given in the form of a cotree, the algorithm runs in O(n) time. We also show that the acyclic chromatic number, the star ch"},"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":"1103.5531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-29T02:25:49Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"2eba03d34e7d30d717c5a0d7ce625d9c136ea85babea0d89fb1516125f2df73f","abstract_canon_sha256":"a3f2a8642148dac216344f1ac61d0ec4d202550cfbcb3074972d3ef9362c9f1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:37.392139Z","signature_b64":"X56dZVzK7YtYGBHGCNkeif1lsm0nIG2f63lb1CYWEr0OQZJQx3EEPhGvyfRJmuQj0jNlNP/dSDjaVZ4yt5LvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed022a90ce6a24ecabcf95977e1e3a56ab444f9051ae914fc938b2114467a0d0","last_reissued_at":"2026-05-18T04:25:37.391639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:37.391639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Acyclic and Star Colorings of Cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andrew Lyons","submitted_at":"2011-03-29T02:25:49Z","abstract_excerpt":"An \\emph{acyclic coloring} of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of \\emph{star coloring} requires that the union of any two color classes induces a disjoint collection of stars. We prove that every acyclic coloring of a cograph is also a star coloring and give a linear-time algorithm for finding an optimal acyclic and star coloring of a cograph. If the graph is given in the form of a cotree, the algorithm runs in O(n) time. We also show that the acyclic chromatic number, the star ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5531","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":"1103.5531","created_at":"2026-05-18T04:25:37.391722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5531v1","created_at":"2026-05-18T04:25:37.391722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5531","created_at":"2026-05-18T04:25:37.391722+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UBCVEGONISO","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UBCVEGONISOZK6P","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UBCVEGO","created_at":"2026-05-18T12:26:20.644004+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/5UBCVEGONISOZK6PSWLX4HR2K2","json":"https://pith.science/pith/5UBCVEGONISOZK6PSWLX4HR2K2.json","graph_json":"https://pith.science/api/pith-number/5UBCVEGONISOZK6PSWLX4HR2K2/graph.json","events_json":"https://pith.science/api/pith-number/5UBCVEGONISOZK6PSWLX4HR2K2/events.json","paper":"https://pith.science/paper/5UBCVEGO"},"agent_actions":{"view_html":"https://pith.science/pith/5UBCVEGONISOZK6PSWLX4HR2K2","download_json":"https://pith.science/pith/5UBCVEGONISOZK6PSWLX4HR2K2.json","view_paper":"https://pith.science/paper/5UBCVEGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5531&json=true","fetch_graph":"https://pith.science/api/pith-number/5UBCVEGONISOZK6PSWLX4HR2K2/graph.json","fetch_events":"https://pith.science/api/pith-number/5UBCVEGONISOZK6PSWLX4HR2K2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UBCVEGONISOZK6PSWLX4HR2K2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UBCVEGONISOZK6PSWLX4HR2K2/action/storage_attestation","attest_author":"https://pith.science/pith/5UBCVEGONISOZK6PSWLX4HR2K2/action/author_attestation","sign_citation":"https://pith.science/pith/5UBCVEGONISOZK6PSWLX4HR2K2/action/citation_signature","submit_replication":"https://pith.science/pith/5UBCVEGONISOZK6PSWLX4HR2K2/action/replication_record"}},"created_at":"2026-05-18T04:25:37.391722+00:00","updated_at":"2026-05-18T04:25:37.391722+00:00"}