{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:X3MNQ7MXF7UV3NP5HAASB2A7EG","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":"d3c06cf686cba29546ecdc71821e1fb85cb263cecbbe76af2a13c003c60a9712","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-04T22:33:22Z","title_canon_sha256":"0ab7c013d5f71aa67ae4b1a75fdcf339b72e5f89ef7b1703dd22ceab424598b7"},"schema_version":"1.0","source":{"id":"1805.01953","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01953","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01953v1","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01953","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"pith_short_12","alias_value":"X3MNQ7MXF7UV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X3MNQ7MXF7UV3NP5","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X3MNQ7MX","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:f7e704cfba5b901607c652a5d559f5eb633f6039cf53d6ddeb3efb4f7f00bea5","target":"graph","created_at":"2026-05-18T00:13:59Z","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 ordering of the vertices of a graph is \\emph{connected} if every vertex (but the first) has a neighbor among its predecessors. The greedy colouring algorithm of a graph with a connected order consists in taking the vertices in order, and assigning to each vertex the smallest available colour. A graph is \\emph{good} if the greedy algorithm on every connected order gives every connected induced subgraph of it an optimal colouring. We give the characterization of good claw-free graphs in terms of minimal forbidden induced subgraphs.","authors_text":"Ngoc Khang Le, Nicolas Trotignon","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-04T22:33:22Z","title":"Connected greedy colouring in claw-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01953","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:9e29474d6779fb3c7c2a0f071e6a6a7c66223106381cf178608424a596fc84d2","target":"record","created_at":"2026-05-18T00:13:59Z","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":"d3c06cf686cba29546ecdc71821e1fb85cb263cecbbe76af2a13c003c60a9712","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-04T22:33:22Z","title_canon_sha256":"0ab7c013d5f71aa67ae4b1a75fdcf339b72e5f89ef7b1703dd22ceab424598b7"},"schema_version":"1.0","source":{"id":"1805.01953","kind":"arxiv","version":1}},"canonical_sha256":"bed8d87d972fe95db5fd380120e81f2183ae9ebfbae9ec5ee682c44a51869174","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bed8d87d972fe95db5fd380120e81f2183ae9ebfbae9ec5ee682c44a51869174","first_computed_at":"2026-05-18T00:13:59.829580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:59.829580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"21DBHMSTLAPX1Wu6JljNnWzt/wTKoR/o+iAVlUSLrrbJkot02h+0P1xQZ/znxnQ6+TyXrSr7xXnzdXo13qlnAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:59.830190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01953","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e29474d6779fb3c7c2a0f071e6a6a7c66223106381cf178608424a596fc84d2","sha256:f7e704cfba5b901607c652a5d559f5eb633f6039cf53d6ddeb3efb4f7f00bea5"],"state_sha256":"1b1ba33b705887fcfc45dd9d1a40f70341c41afaa0d409e990793090303cd491"}