{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IOPBDUZ3L4P573D4AFOFSM7EBA","short_pith_number":"pith:IOPBDUZ3","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"},"canonical_sha256":"439e11d33b5f1fdfec7c015c5933e40812364b01bad3090041c276e2d5012391","source":{"kind":"arxiv","id":"1708.09080","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09080","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09080v2","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09080","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"pith_short_12","alias_value":"IOPBDUZ3L4P5","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IOPBDUZ3L4P573D4","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IOPBDUZ3","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IOPBDUZ3L4P573D4AFOFSM7EBA","target":"record","payload":{"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"},"canonical_sha256":"439e11d33b5f1fdfec7c015c5933e40812364b01bad3090041c276e2d5012391","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"},"source_kind":"arxiv","source_id":"1708.09080","source_version":2,"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-05-18T00:12:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W2hZcYS3kqXa8XhLWCzZqUMNPMGia/XAQh3xNGfHNaGrx/0f6anRhrYUL7pcEiv06hZujFMbaMTYtE51kK/gBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:02:06.558004Z"},"content_sha256":"0c958a413633adaf1df3d4d91f0c77c7db27ecdeb88144b4ea7ab95fcd70f175","schema_version":"1.0","event_id":"sha256:0c958a413633adaf1df3d4d91f0c77c7db27ecdeb88144b4ea7ab95fcd70f175"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IOPBDUZ3L4P573D4AFOFSM7EBA","target":"graph","payload":{"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"},"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-05-18T00:12:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VKQscjElV1pMQBV9HuoHKejP+XazZFgePfvW6rQntHg3IODatLaKXwOELnkidK5kHdxfZucuFgcQNyEMCqSCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:02:06.558734Z"},"content_sha256":"66fa7b19ad833baeabe10114cdefc904f619a739a65342853e052eda7f6569b4","schema_version":"1.0","event_id":"sha256:66fa7b19ad833baeabe10114cdefc904f619a739a65342853e052eda7f6569b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOPBDUZ3L4P573D4AFOFSM7EBA/bundle.json","state_url":"https://pith.science/pith/IOPBDUZ3L4P573D4AFOFSM7EBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOPBDUZ3L4P573D4AFOFSM7EBA/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-05-26T18:02:06Z","links":{"resolver":"https://pith.science/pith/IOPBDUZ3L4P573D4AFOFSM7EBA","bundle":"https://pith.science/pith/IOPBDUZ3L4P573D4AFOFSM7EBA/bundle.json","state":"https://pith.science/pith/IOPBDUZ3L4P573D4AFOFSM7EBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOPBDUZ3L4P573D4AFOFSM7EBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IOPBDUZ3L4P573D4AFOFSM7EBA","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":"fbd996e2843f11c566f2dc2850f39e00cfe5c2524a0bc36a9dda00e48902fa57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-30T01:50:36Z","title_canon_sha256":"792c187424261d3c342c5816489f9fa1f73c927bee2288f8390b9b3739130250"},"schema_version":"1.0","source":{"id":"1708.09080","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09080","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09080v2","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09080","created_at":"2026-05-18T00:12:35Z"},{"alias_kind":"pith_short_12","alias_value":"IOPBDUZ3L4P5","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IOPBDUZ3L4P573D4","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IOPBDUZ3","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:66fa7b19ad833baeabe10114cdefc904f619a739a65342853e052eda7f6569b4","target":"graph","created_at":"2026-05-18T00:12:35Z","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":"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","authors_text":"Andr\\'e van Renssen, Jean Cardinal, Luis Barba, Marcel Roeloffzen, Matias Korman, Sander Verdonschot, Stefan Langerman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-30T01:50:36Z","title":"Dynamic Graph Coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09080","kind":"arxiv","version":2},"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:0c958a413633adaf1df3d4d91f0c77c7db27ecdeb88144b4ea7ab95fcd70f175","target":"record","created_at":"2026-05-18T00:12:35Z","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":"fbd996e2843f11c566f2dc2850f39e00cfe5c2524a0bc36a9dda00e48902fa57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-30T01:50:36Z","title_canon_sha256":"792c187424261d3c342c5816489f9fa1f73c927bee2288f8390b9b3739130250"},"schema_version":"1.0","source":{"id":"1708.09080","kind":"arxiv","version":2}},"canonical_sha256":"439e11d33b5f1fdfec7c015c5933e40812364b01bad3090041c276e2d5012391","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"439e11d33b5f1fdfec7c015c5933e40812364b01bad3090041c276e2d5012391","first_computed_at":"2026-05-18T00:12:35.037842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:35.037842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rl6qggp1H303GDSZfKXw6E/88tpUO+CRz7QEuYIHCne1/Boq2jRqcrVMuD5SKGE0j6m0Zhjq++wSu/kPzmx3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:35.038344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09080","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c958a413633adaf1df3d4d91f0c77c7db27ecdeb88144b4ea7ab95fcd70f175","sha256:66fa7b19ad833baeabe10114cdefc904f619a739a65342853e052eda7f6569b4"],"state_sha256":"4b63f137bbde6782f8a49df81a00041b2a6c8050554e4a104ce77ac3d9fcadc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UcRNOpKJF2IdiVZYaj3Y1saU5DVXjFWhJlFhgDBklnoMlHe0T93SFC2KPZHVPTWKDCBC3u8EENmPMafPW7tlAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:02:06.562283Z","bundle_sha256":"fd9734bb8de42de745f06479f0b30ecb9355c311ddf0b935a5cf09fcbf8c52b7"}}