{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MMSOG2ZAAJHY677RQDDJZ3XZ6F","short_pith_number":"pith:MMSOG2ZA","schema_version":"1.0","canonical_sha256":"6324e36b20024f8f7ff180c69ceef9f165bc086263ac958ed125d3ab51cd04c4","source":{"kind":"arxiv","id":"1812.11254","version":2},"attestation_state":"computed","paper":{"title":"A Dynamically Turbo-Charged Greedy Heuristic for Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Bachir M. Chahine, Faisal N. Abu-Khzam","submitted_at":"2018-12-29T00:47:50Z","abstract_excerpt":"We introduce a dynamic version of the graph coloring problem and prove its fixed-parameter tractability with respect to the edit-parameter. This is used to present a {\\em turbo-charged} heuristic for the problem that works by combining the turbo-charging technique with other standard heuristic tools, including greedy coloring. The recently introduced turbo-charging idea is further enhanced in this paper by introducing a dynamic version of the so called {\\em moment of regret} and {\\em rollback points}. Experiments comparing our turbo-charging algorithm to other heuristics demonstrate its effect"},"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":"1812.11254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-29T00:47:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1bee487966c06f50c618fdb5c80539754ac1f810cc7b3c471ef1c9027332498c","abstract_canon_sha256":"dba87e786d4aa3844d598652b84e4268955847349828a6252e024390d6856289"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:51.146427Z","signature_b64":"PjBXckl7V3GMzWsOkUcP9SAk3K4KfKUFwc+S/ge3WQ0ULv8pSJrVehFsSCzXl3FdYYHkw1bQ8n1oRtqExWYkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6324e36b20024f8f7ff180c69ceef9f165bc086263ac958ed125d3ab51cd04c4","last_reissued_at":"2026-05-17T23:52:51.145685Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:51.145685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dynamically Turbo-Charged Greedy Heuristic for Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Bachir M. Chahine, Faisal N. Abu-Khzam","submitted_at":"2018-12-29T00:47:50Z","abstract_excerpt":"We introduce a dynamic version of the graph coloring problem and prove its fixed-parameter tractability with respect to the edit-parameter. This is used to present a {\\em turbo-charged} heuristic for the problem that works by combining the turbo-charging technique with other standard heuristic tools, including greedy coloring. The recently introduced turbo-charging idea is further enhanced in this paper by introducing a dynamic version of the so called {\\em moment of regret} and {\\em rollback points}. Experiments comparing our turbo-charging algorithm to other heuristics demonstrate its effect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11254","kind":"arxiv","version":2},"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":"1812.11254","created_at":"2026-05-17T23:52:51.145815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.11254v2","created_at":"2026-05-17T23:52:51.145815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11254","created_at":"2026-05-17T23:52:51.145815+00:00"},{"alias_kind":"pith_short_12","alias_value":"MMSOG2ZAAJHY","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MMSOG2ZAAJHY677R","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MMSOG2ZA","created_at":"2026-05-18T12:32:37.024351+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/MMSOG2ZAAJHY677RQDDJZ3XZ6F","json":"https://pith.science/pith/MMSOG2ZAAJHY677RQDDJZ3XZ6F.json","graph_json":"https://pith.science/api/pith-number/MMSOG2ZAAJHY677RQDDJZ3XZ6F/graph.json","events_json":"https://pith.science/api/pith-number/MMSOG2ZAAJHY677RQDDJZ3XZ6F/events.json","paper":"https://pith.science/paper/MMSOG2ZA"},"agent_actions":{"view_html":"https://pith.science/pith/MMSOG2ZAAJHY677RQDDJZ3XZ6F","download_json":"https://pith.science/pith/MMSOG2ZAAJHY677RQDDJZ3XZ6F.json","view_paper":"https://pith.science/paper/MMSOG2ZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.11254&json=true","fetch_graph":"https://pith.science/api/pith-number/MMSOG2ZAAJHY677RQDDJZ3XZ6F/graph.json","fetch_events":"https://pith.science/api/pith-number/MMSOG2ZAAJHY677RQDDJZ3XZ6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MMSOG2ZAAJHY677RQDDJZ3XZ6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MMSOG2ZAAJHY677RQDDJZ3XZ6F/action/storage_attestation","attest_author":"https://pith.science/pith/MMSOG2ZAAJHY677RQDDJZ3XZ6F/action/author_attestation","sign_citation":"https://pith.science/pith/MMSOG2ZAAJHY677RQDDJZ3XZ6F/action/citation_signature","submit_replication":"https://pith.science/pith/MMSOG2ZAAJHY677RQDDJZ3XZ6F/action/replication_record"}},"created_at":"2026-05-17T23:52:51.145815+00:00","updated_at":"2026-05-17T23:52:51.145815+00:00"}