{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:5BORYY6LBAUGWMTOX7MEOR2CJX","short_pith_number":"pith:5BORYY6L","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"},"canonical_sha256":"e85d1c63cb08286b326ebfd84747424dc3a72780cbe3905f6a6b2f3879948753","source":{"kind":"arxiv","id":"2110.14003","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.14003","created_at":"2026-07-05T08:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"2110.14003v5","created_at":"2026-07-05T08:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.14003","created_at":"2026-07-05T08:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"5BORYY6LBAUG","created_at":"2026-07-05T08:03:24Z"},{"alias_kind":"pith_short_16","alias_value":"5BORYY6LBAUGWMTO","created_at":"2026-07-05T08:03:24Z"},{"alias_kind":"pith_short_8","alias_value":"5BORYY6L","created_at":"2026-07-05T08:03:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:5BORYY6LBAUGWMTOX7MEOR2CJX","target":"record","payload":{"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"},"canonical_sha256":"e85d1c63cb08286b326ebfd84747424dc3a72780cbe3905f6a6b2f3879948753","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"},"source_kind":"arxiv","source_id":"2110.14003","source_version":5,"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-07-05T08:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KwBM8vpiYATUzDETJxAcs1Da8Q3TnVezarlxsD59G5jquwlYSEZn7J/ycPRfdoWgDnhbfX33Hl1IzK1QLKmoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:29:53.321576Z"},"content_sha256":"984b98cf6ba8063d2e46451d11bab48307414735a98dcddd76c04a168224d4d5","schema_version":"1.0","event_id":"sha256:984b98cf6ba8063d2e46451d11bab48307414735a98dcddd76c04a168224d4d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:5BORYY6LBAUGWMTOX7MEOR2CJX","target":"graph","payload":{"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"},"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-07-05T08:03:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKvdt/ihRYveSnG3jCS4LRRM1Ki0LHWAYeMkCT/4OjDS559u5tF+R2vtgcwNh52OCRVcQjYXpMNx8nrFv45IAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:29:53.321953Z"},"content_sha256":"3186f2d9b88e3c63e8945d96f5729e2f278ccec877bc6aee89090e2202d3e393","schema_version":"1.0","event_id":"sha256:3186f2d9b88e3c63e8945d96f5729e2f278ccec877bc6aee89090e2202d3e393"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BORYY6LBAUGWMTOX7MEOR2CJX/bundle.json","state_url":"https://pith.science/pith/5BORYY6LBAUGWMTOX7MEOR2CJX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BORYY6LBAUGWMTOX7MEOR2CJX/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-08T22:29:53Z","links":{"resolver":"https://pith.science/pith/5BORYY6LBAUGWMTOX7MEOR2CJX","bundle":"https://pith.science/pith/5BORYY6LBAUGWMTOX7MEOR2CJX/bundle.json","state":"https://pith.science/pith/5BORYY6LBAUGWMTOX7MEOR2CJX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BORYY6LBAUGWMTOX7MEOR2CJX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:5BORYY6LBAUGWMTOX7MEOR2CJX","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":"41f291405cc3b198ffd22c449988cda322068a1a84ec82ab35b733143430fb04","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2021-10-26T20:14:31Z","title_canon_sha256":"6ff1eebfcb7702f39579982c985f4d7e3d45df3c21e2ba6ff18f7dc634018716"},"schema_version":"1.0","source":{"id":"2110.14003","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.14003","created_at":"2026-07-05T08:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"2110.14003v5","created_at":"2026-07-05T08:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.14003","created_at":"2026-07-05T08:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"5BORYY6LBAUG","created_at":"2026-07-05T08:03:24Z"},{"alias_kind":"pith_short_16","alias_value":"5BORYY6LBAUGWMTO","created_at":"2026-07-05T08:03:24Z"},{"alias_kind":"pith_short_8","alias_value":"5BORYY6L","created_at":"2026-07-05T08:03:24Z"}],"graph_snapshots":[{"event_id":"sha256:3186f2d9b88e3c63e8945d96f5729e2f278ccec877bc6aee89090e2202d3e393","target":"graph","created_at":"2026-07-05T08:03:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.14003/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aur\\'elie Lagoutte, Caroline Brosse, Florent Foucaud, Laurent Beaudou, Lucas Pastor, Oscar Defrain, Vincent Limouzy","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2021-10-26T20:14:31Z","title":"Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.14003","kind":"arxiv","version":5},"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:984b98cf6ba8063d2e46451d11bab48307414735a98dcddd76c04a168224d4d5","target":"record","created_at":"2026-07-05T08:03:24Z","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":"41f291405cc3b198ffd22c449988cda322068a1a84ec82ab35b733143430fb04","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2021-10-26T20:14:31Z","title_canon_sha256":"6ff1eebfcb7702f39579982c985f4d7e3d45df3c21e2ba6ff18f7dc634018716"},"schema_version":"1.0","source":{"id":"2110.14003","kind":"arxiv","version":5}},"canonical_sha256":"e85d1c63cb08286b326ebfd84747424dc3a72780cbe3905f6a6b2f3879948753","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e85d1c63cb08286b326ebfd84747424dc3a72780cbe3905f6a6b2f3879948753","first_computed_at":"2026-07-05T08:03:24.352917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:03:24.352917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P83wK68RUklmMbWCAD6B5aD4CnOCq3J2yc6ODlomSaMGWWk8NP45JKuO/xwPdCG5p/HPiEATNfa5Y+hC2ZNMDg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:03:24.353528Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.14003","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:984b98cf6ba8063d2e46451d11bab48307414735a98dcddd76c04a168224d4d5","sha256:3186f2d9b88e3c63e8945d96f5729e2f278ccec877bc6aee89090e2202d3e393"],"state_sha256":"ad767f621e1231d8c186d97ffc5041b19af709cd5600ce1c7b763a336b83a59e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fn96T3h92jiUUHEkAM42hBahYatJi0xYYURcZXO4ETScsP1bLIjjgJPF5vKqIdmZQrqdkGwKMNNufZtdQYT2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T22:29:53.323916Z","bundle_sha256":"95aa4010ca177e4d20c7bae81bfa8b2a2570d7293c732139d05f65a9949ac508"}}