{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5UBCVEGONISOZK6PSWLX4HR2K2","short_pith_number":"pith:5UBCVEGO","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"},"canonical_sha256":"ed022a90ce6a24ecabcf95977e1e3a56ab444f9051ae914fc938b2114467a0d0","source":{"kind":"arxiv","id":"1103.5531","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5531","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5531v1","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5531","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"pith_short_12","alias_value":"5UBCVEGONISO","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5UBCVEGONISOZK6P","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5UBCVEGO","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5UBCVEGONISOZK6PSWLX4HR2K2","target":"record","payload":{"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"},"canonical_sha256":"ed022a90ce6a24ecabcf95977e1e3a56ab444f9051ae914fc938b2114467a0d0","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"},"source_kind":"arxiv","source_id":"1103.5531","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:25:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1L645azqgY0cqkwBstq44Y38KlRcoYyATjqqJx3/4FFFJBManCszomnRduYJZRqvrfQ6w5V2hKOfddE3tGH3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T07:39:48.283089Z"},"content_sha256":"5977bbdc1445e9c54096f3d4985d6157143f0c7ae376dbc5a21a9ed5d5f2d4b6","schema_version":"1.0","event_id":"sha256:5977bbdc1445e9c54096f3d4985d6157143f0c7ae376dbc5a21a9ed5d5f2d4b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5UBCVEGONISOZK6PSWLX4HR2K2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:25:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2f4dHdnpe3VZrkUCgn/vnZ67FHYG6m4H66kc5NjAUYiSpY0ASSH9f2V2f3h6wTdHRi8sS3bnX1ZAiuwpyLNZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T07:39:48.283466Z"},"content_sha256":"b2b1bcbb2b450399abf1e21d76006e2bfd8f0e402a53bc2c5547e391844f24eb","schema_version":"1.0","event_id":"sha256:b2b1bcbb2b450399abf1e21d76006e2bfd8f0e402a53bc2c5547e391844f24eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UBCVEGONISOZK6PSWLX4HR2K2/bundle.json","state_url":"https://pith.science/pith/5UBCVEGONISOZK6PSWLX4HR2K2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UBCVEGONISOZK6PSWLX4HR2K2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T07:39:48Z","links":{"resolver":"https://pith.science/pith/5UBCVEGONISOZK6PSWLX4HR2K2","bundle":"https://pith.science/pith/5UBCVEGONISOZK6PSWLX4HR2K2/bundle.json","state":"https://pith.science/pith/5UBCVEGONISOZK6PSWLX4HR2K2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UBCVEGONISOZK6PSWLX4HR2K2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5UBCVEGONISOZK6PSWLX4HR2K2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a3f2a8642148dac216344f1ac61d0ec4d202550cfbcb3074972d3ef9362c9f1b","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-29T02:25:49Z","title_canon_sha256":"2eba03d34e7d30d717c5a0d7ce625d9c136ea85babea0d89fb1516125f2df73f"},"schema_version":"1.0","source":{"id":"1103.5531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5531","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5531v1","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5531","created_at":"2026-05-18T04:25:37Z"},{"alias_kind":"pith_short_12","alias_value":"5UBCVEGONISO","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5UBCVEGONISOZK6P","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5UBCVEGO","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:b2b1bcbb2b450399abf1e21d76006e2bfd8f0e402a53bc2c5547e391844f24eb","target":"graph","created_at":"2026-05-18T04:25:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andrew Lyons","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-29T02:25:49Z","title":"Acyclic and Star Colorings of Cographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5531","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5977bbdc1445e9c54096f3d4985d6157143f0c7ae376dbc5a21a9ed5d5f2d4b6","target":"record","created_at":"2026-05-18T04:25:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a3f2a8642148dac216344f1ac61d0ec4d202550cfbcb3074972d3ef9362c9f1b","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-29T02:25:49Z","title_canon_sha256":"2eba03d34e7d30d717c5a0d7ce625d9c136ea85babea0d89fb1516125f2df73f"},"schema_version":"1.0","source":{"id":"1103.5531","kind":"arxiv","version":1}},"canonical_sha256":"ed022a90ce6a24ecabcf95977e1e3a56ab444f9051ae914fc938b2114467a0d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed022a90ce6a24ecabcf95977e1e3a56ab444f9051ae914fc938b2114467a0d0","first_computed_at":"2026-05-18T04:25:37.391639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:37.391639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X56dZVzK7YtYGBHGCNkeif1lsm0nIG2f63lb1CYWEr0OQZJQx3EEPhGvyfRJmuQj0jNlNP/dSDjaVZ4yt5LvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:37.392139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5977bbdc1445e9c54096f3d4985d6157143f0c7ae376dbc5a21a9ed5d5f2d4b6","sha256:b2b1bcbb2b450399abf1e21d76006e2bfd8f0e402a53bc2c5547e391844f24eb"],"state_sha256":"5b8f53e06beb736851bba54061e20cf47ef4175855d0aba728a6454f8e2f9177"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"whlkC+rITZOXcAl6eI7C3ApZL5AmXG6aBRyUkSHM+cpMI5Hzk4HIWiQRxYS3Mo3+msMq5+lEiJUF75iZZRLFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T07:39:48.285467Z","bundle_sha256":"39b8df918cfc4e7df052186bf2a2bcbb3798210341daf7184f938bf6821a28ea"}}