{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5BORYY6LBAUGWMTOX7MEOR2CJX","short_pith_number":"pith:5BORYY6L","schema_version":"1.0","canonical_sha256":"e85d1c63cb08286b326ebfd84747424dc3a72780cbe3905f6a6b2f3879948753","source":{"kind":"arxiv","id":"2110.14003","version":5},"attestation_state":"computed","paper":{"title":"Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aur\\'elie Lagoutte, Caroline Brosse, Florent Foucaud, Laurent Beaudou, Lucas Pastor, Oscar Defrain, Vincent Limouzy","submitted_at":"2021-10-26T20:14:31Z","abstract_excerpt":"The Grundy number of a graph is the maximum number of colours used by the \"First-Fit\" greedy colouring algorithm over all vertex orderings. Given a vertex ordering $\\sigma= v_1,\\dots,v_n$, the \"First-Fit\" greedy colouring algorithm colours the vertices in the order of $\\sigma$ by assigning to each vertex the smallest colour unused in its neighbourhood.\n  By restricting this procedure to vertex orderings that are connected, we obtain {\\em connected greedy colourings}. For some graphs, all connected greedy colourings use exactly $\\chi(G)$ colours; they are called {\\em good graphs}. On the opposi"},"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":"2110.14003","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2021-10-26T20:14:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6ff1eebfcb7702f39579982c985f4d7e3d45df3c21e2ba6ff18f7dc634018716","abstract_canon_sha256":"41f291405cc3b198ffd22c449988cda322068a1a84ec82ab35b733143430fb04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:03:24.353528Z","signature_b64":"P83wK68RUklmMbWCAD6B5aD4CnOCq3J2yc6ODlomSaMGWWk8NP45JKuO/xwPdCG5p/HPiEATNfa5Y+hC2ZNMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e85d1c63cb08286b326ebfd84747424dc3a72780cbe3905f6a6b2f3879948753","last_reissued_at":"2026-07-05T08:03:24.352917Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:03:24.352917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aur\\'elie Lagoutte, Caroline Brosse, Florent Foucaud, Laurent Beaudou, Lucas Pastor, Oscar Defrain, Vincent Limouzy","submitted_at":"2021-10-26T20:14:31Z","abstract_excerpt":"The Grundy number of a graph is the maximum number of colours used by the \"First-Fit\" greedy colouring algorithm over all vertex orderings. Given a vertex ordering $\\sigma= v_1,\\dots,v_n$, the \"First-Fit\" greedy colouring algorithm colours the vertices in the order of $\\sigma$ by assigning to each vertex the smallest colour unused in its neighbourhood.\n  By restricting this procedure to vertex orderings that are connected, we obtain {\\em connected greedy colourings}. For some graphs, all connected greedy colourings use exactly $\\chi(G)$ colours; they are called {\\em good graphs}. On the opposi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.14003","kind":"arxiv","version":5},"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/2110.14003/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":"2110.14003","created_at":"2026-07-05T08:03:24.352985+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.14003v5","created_at":"2026-07-05T08:03:24.352985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.14003","created_at":"2026-07-05T08:03:24.352985+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BORYY6LBAUG","created_at":"2026-07-05T08:03:24.352985+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BORYY6LBAUGWMTO","created_at":"2026-07-05T08:03:24.352985+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BORYY6L","created_at":"2026-07-05T08:03:24.352985+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/5BORYY6LBAUGWMTOX7MEOR2CJX","json":"https://pith.science/pith/5BORYY6LBAUGWMTOX7MEOR2CJX.json","graph_json":"https://pith.science/api/pith-number/5BORYY6LBAUGWMTOX7MEOR2CJX/graph.json","events_json":"https://pith.science/api/pith-number/5BORYY6LBAUGWMTOX7MEOR2CJX/events.json","paper":"https://pith.science/paper/5BORYY6L"},"agent_actions":{"view_html":"https://pith.science/pith/5BORYY6LBAUGWMTOX7MEOR2CJX","download_json":"https://pith.science/pith/5BORYY6LBAUGWMTOX7MEOR2CJX.json","view_paper":"https://pith.science/paper/5BORYY6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.14003&json=true","fetch_graph":"https://pith.science/api/pith-number/5BORYY6LBAUGWMTOX7MEOR2CJX/graph.json","fetch_events":"https://pith.science/api/pith-number/5BORYY6LBAUGWMTOX7MEOR2CJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BORYY6LBAUGWMTOX7MEOR2CJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BORYY6LBAUGWMTOX7MEOR2CJX/action/storage_attestation","attest_author":"https://pith.science/pith/5BORYY6LBAUGWMTOX7MEOR2CJX/action/author_attestation","sign_citation":"https://pith.science/pith/5BORYY6LBAUGWMTOX7MEOR2CJX/action/citation_signature","submit_replication":"https://pith.science/pith/5BORYY6LBAUGWMTOX7MEOR2CJX/action/replication_record"}},"created_at":"2026-07-05T08:03:24.352985+00:00","updated_at":"2026-07-05T08:03:24.352985+00:00"}