{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IOPBDUZ3L4P573D4AFOFSM7EBA","short_pith_number":"pith:IOPBDUZ3","schema_version":"1.0","canonical_sha256":"439e11d33b5f1fdfec7c015c5933e40812364b01bad3090041c276e2d5012391","source":{"kind":"arxiv","id":"1708.09080","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e van Renssen, Jean Cardinal, Luis Barba, Marcel Roeloffzen, Matias Korman, Sander Verdonschot, Stefan Langerman","submitted_at":"2017-08-30T01:50:36Z","abstract_excerpt":"In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion and deletion of vertices and edges. We present two algorithms that achieve different trade-offs between the number of recolorings and the number of colors used. For any $d>0$, the first algorithm maintains a proper $O(\\mathcal{C} d N^{1/d})$-coloring while recoloring at most $O(d)$ vertices per update, where $\\mathcal{C}$ and $N$ are the maximum chromatic number and maximum number of vertices, respectively. The second algorithm reverses th"},"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":"1708.09080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-30T01:50:36Z","cross_cats_sorted":[],"title_canon_sha256":"792c187424261d3c342c5816489f9fa1f73c927bee2288f8390b9b3739130250","abstract_canon_sha256":"fbd996e2843f11c566f2dc2850f39e00cfe5c2524a0bc36a9dda00e48902fa57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:35.038344Z","signature_b64":"Rl6qggp1H303GDSZfKXw6E/88tpUO+CRz7QEuYIHCne1/Boq2jRqcrVMuD5SKGE0j6m0Zhjq++wSu/kPzmx3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"439e11d33b5f1fdfec7c015c5933e40812364b01bad3090041c276e2d5012391","last_reissued_at":"2026-05-18T00:12:35.037842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:35.037842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e van Renssen, Jean Cardinal, Luis Barba, Marcel Roeloffzen, Matias Korman, Sander Verdonschot, Stefan Langerman","submitted_at":"2017-08-30T01:50:36Z","abstract_excerpt":"In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion and deletion of vertices and edges. We present two algorithms that achieve different trade-offs between the number of recolorings and the number of colors used. For any $d>0$, the first algorithm maintains a proper $O(\\mathcal{C} d N^{1/d})$-coloring while recoloring at most $O(d)$ vertices per update, where $\\mathcal{C}$ and $N$ are the maximum chromatic number and maximum number of vertices, respectively. The second algorithm reverses th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09080","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":"1708.09080","created_at":"2026-05-18T00:12:35.037918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09080v2","created_at":"2026-05-18T00:12:35.037918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09080","created_at":"2026-05-18T00:12:35.037918+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOPBDUZ3L4P5","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOPBDUZ3L4P573D4","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOPBDUZ3","created_at":"2026-05-18T12:31:21.493067+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/IOPBDUZ3L4P573D4AFOFSM7EBA","json":"https://pith.science/pith/IOPBDUZ3L4P573D4AFOFSM7EBA.json","graph_json":"https://pith.science/api/pith-number/IOPBDUZ3L4P573D4AFOFSM7EBA/graph.json","events_json":"https://pith.science/api/pith-number/IOPBDUZ3L4P573D4AFOFSM7EBA/events.json","paper":"https://pith.science/paper/IOPBDUZ3"},"agent_actions":{"view_html":"https://pith.science/pith/IOPBDUZ3L4P573D4AFOFSM7EBA","download_json":"https://pith.science/pith/IOPBDUZ3L4P573D4AFOFSM7EBA.json","view_paper":"https://pith.science/paper/IOPBDUZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09080&json=true","fetch_graph":"https://pith.science/api/pith-number/IOPBDUZ3L4P573D4AFOFSM7EBA/graph.json","fetch_events":"https://pith.science/api/pith-number/IOPBDUZ3L4P573D4AFOFSM7EBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOPBDUZ3L4P573D4AFOFSM7EBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOPBDUZ3L4P573D4AFOFSM7EBA/action/storage_attestation","attest_author":"https://pith.science/pith/IOPBDUZ3L4P573D4AFOFSM7EBA/action/author_attestation","sign_citation":"https://pith.science/pith/IOPBDUZ3L4P573D4AFOFSM7EBA/action/citation_signature","submit_replication":"https://pith.science/pith/IOPBDUZ3L4P573D4AFOFSM7EBA/action/replication_record"}},"created_at":"2026-05-18T00:12:35.037918+00:00","updated_at":"2026-05-18T00:12:35.037918+00:00"}