{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:T5X2MJEHF65GCMZPJKR4WCN6UC","short_pith_number":"pith:T5X2MJEH","canonical_record":{"source":{"id":"2002.10142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-24T10:18:44Z","cross_cats_sorted":[],"title_canon_sha256":"9c7b69a645b5850e0da58981bac6750fe0fb9716ba72d9293667ca6a5b16f15d","abstract_canon_sha256":"95d7004874d9a868b5ffcea12b32999641f747cb90f90f1284b386e0c733c0a2"},"schema_version":"1.0"},"canonical_sha256":"9f6fa624872fba61332f4aa3cb09bea0981a92047ecb27faea41d21ec99b5031","source":{"kind":"arxiv","id":"2002.10142","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.10142","created_at":"2026-07-05T00:43:14Z"},{"alias_kind":"arxiv_version","alias_value":"2002.10142v1","created_at":"2026-07-05T00:43:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.10142","created_at":"2026-07-05T00:43:14Z"},{"alias_kind":"pith_short_12","alias_value":"T5X2MJEHF65G","created_at":"2026-07-05T00:43:14Z"},{"alias_kind":"pith_short_16","alias_value":"T5X2MJEHF65GCMZP","created_at":"2026-07-05T00:43:14Z"},{"alias_kind":"pith_short_8","alias_value":"T5X2MJEH","created_at":"2026-07-05T00:43:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:T5X2MJEHF65GCMZPJKR4WCN6UC","target":"record","payload":{"canonical_record":{"source":{"id":"2002.10142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-24T10:18:44Z","cross_cats_sorted":[],"title_canon_sha256":"9c7b69a645b5850e0da58981bac6750fe0fb9716ba72d9293667ca6a5b16f15d","abstract_canon_sha256":"95d7004874d9a868b5ffcea12b32999641f747cb90f90f1284b386e0c733c0a2"},"schema_version":"1.0"},"canonical_sha256":"9f6fa624872fba61332f4aa3cb09bea0981a92047ecb27faea41d21ec99b5031","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:43:14.790750Z","signature_b64":"NZfbEWZcK2ajY2qF7jzrCSV5g8TYUglU1owyrbokEn76uSZ4gmzBlAOHMaHwJnwIaH2l5WcpZ/CxzfShKLUUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f6fa624872fba61332f4aa3cb09bea0981a92047ecb27faea41d21ec99b5031","last_reissued_at":"2026-07-05T00:43:14.790293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:43:14.790293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.10142","source_version":1,"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-05T00:43:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ba+C3SRfgCABNcAunFkLN9XHGEb//L8JjylW8IvA0RylOP0FeFxU2dDiucs4F1hwT4bvDuHYfUyDEunpoIVrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T18:40:02.414225Z"},"content_sha256":"2be793d22bd06980cdb52fc2cc7a08063db8afb2b6acb4c58a71137baebe8b7d","schema_version":"1.0","event_id":"sha256:2be793d22bd06980cdb52fc2cc7a08063db8afb2b6acb4c58a71137baebe8b7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:T5X2MJEHF65GCMZPJKR4WCN6UC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Monika Henzinger, Stefan Neumann","submitted_at":"2020-02-24T10:18:44Z","abstract_excerpt":"Graph coloring is a fundamental problem in computer science. We study the fully dynamic version of the problem in which the graph is undergoing edge insertions and deletions and we wish to maintain a vertex-coloring with small update time after each insertion and deletion.\n  We show how to maintain an $O(\\alpha \\lg n)$-coloring with polylogarithmic update time, where $n$ is the number of vertices in the graph and $\\alpha$ is the current arboricity of the graph. This improves upon a result by Solomon and Wein (ESA'18) who maintained an $O(\\alpha_{\\max}\\lg^2 n)$-coloring, where $\\alpha_{\\max}$ i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.10142","kind":"arxiv","version":1},"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/2002.10142/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-05T00:43:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHQIpcVnupy0pT9FA0Vk+hCANX7VEjxmqnsBS9t71NK1VomioSI11gqp/bKekK0rEOQbXbjsvtfd2+LCqJ2XBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T18:40:02.414712Z"},"content_sha256":"4d73b4f6bde9458150c6da17d705024575191b67c746092a163d945df6489fc5","schema_version":"1.0","event_id":"sha256:4d73b4f6bde9458150c6da17d705024575191b67c746092a163d945df6489fc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T5X2MJEHF65GCMZPJKR4WCN6UC/bundle.json","state_url":"https://pith.science/pith/T5X2MJEHF65GCMZPJKR4WCN6UC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T5X2MJEHF65GCMZPJKR4WCN6UC/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-08-08T18:40:02Z","links":{"resolver":"https://pith.science/pith/T5X2MJEHF65GCMZPJKR4WCN6UC","bundle":"https://pith.science/pith/T5X2MJEHF65GCMZPJKR4WCN6UC/bundle.json","state":"https://pith.science/pith/T5X2MJEHF65GCMZPJKR4WCN6UC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T5X2MJEHF65GCMZPJKR4WCN6UC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:T5X2MJEHF65GCMZPJKR4WCN6UC","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":"95d7004874d9a868b5ffcea12b32999641f747cb90f90f1284b386e0c733c0a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-24T10:18:44Z","title_canon_sha256":"9c7b69a645b5850e0da58981bac6750fe0fb9716ba72d9293667ca6a5b16f15d"},"schema_version":"1.0","source":{"id":"2002.10142","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.10142","created_at":"2026-07-05T00:43:14Z"},{"alias_kind":"arxiv_version","alias_value":"2002.10142v1","created_at":"2026-07-05T00:43:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.10142","created_at":"2026-07-05T00:43:14Z"},{"alias_kind":"pith_short_12","alias_value":"T5X2MJEHF65G","created_at":"2026-07-05T00:43:14Z"},{"alias_kind":"pith_short_16","alias_value":"T5X2MJEHF65GCMZP","created_at":"2026-07-05T00:43:14Z"},{"alias_kind":"pith_short_8","alias_value":"T5X2MJEH","created_at":"2026-07-05T00:43:14Z"}],"graph_snapshots":[{"event_id":"sha256:4d73b4f6bde9458150c6da17d705024575191b67c746092a163d945df6489fc5","target":"graph","created_at":"2026-07-05T00:43:14Z","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/2002.10142/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph coloring is a fundamental problem in computer science. We study the fully dynamic version of the problem in which the graph is undergoing edge insertions and deletions and we wish to maintain a vertex-coloring with small update time after each insertion and deletion.\n  We show how to maintain an $O(\\alpha \\lg n)$-coloring with polylogarithmic update time, where $n$ is the number of vertices in the graph and $\\alpha$ is the current arboricity of the graph. This improves upon a result by Solomon and Wein (ESA'18) who maintained an $O(\\alpha_{\\max}\\lg^2 n)$-coloring, where $\\alpha_{\\max}$ i","authors_text":"Andreas Wiese, Monika Henzinger, Stefan Neumann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-24T10:18:44Z","title":"Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.10142","kind":"arxiv","version":1},"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:2be793d22bd06980cdb52fc2cc7a08063db8afb2b6acb4c58a71137baebe8b7d","target":"record","created_at":"2026-07-05T00:43:14Z","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":"95d7004874d9a868b5ffcea12b32999641f747cb90f90f1284b386e0c733c0a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-24T10:18:44Z","title_canon_sha256":"9c7b69a645b5850e0da58981bac6750fe0fb9716ba72d9293667ca6a5b16f15d"},"schema_version":"1.0","source":{"id":"2002.10142","kind":"arxiv","version":1}},"canonical_sha256":"9f6fa624872fba61332f4aa3cb09bea0981a92047ecb27faea41d21ec99b5031","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f6fa624872fba61332f4aa3cb09bea0981a92047ecb27faea41d21ec99b5031","first_computed_at":"2026-07-05T00:43:14.790293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:43:14.790293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NZfbEWZcK2ajY2qF7jzrCSV5g8TYUglU1owyrbokEn76uSZ4gmzBlAOHMaHwJnwIaH2l5WcpZ/CxzfShKLUUBg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:43:14.790750Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.10142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2be793d22bd06980cdb52fc2cc7a08063db8afb2b6acb4c58a71137baebe8b7d","sha256:4d73b4f6bde9458150c6da17d705024575191b67c746092a163d945df6489fc5"],"state_sha256":"22144416ca05dad27862389d5a6ec5d5a86a0e14dbe5ad17fa7ae025918527fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ETrHLCgU5xuSKpD9F8SkLX4Q9AcxjEC+cyA1iuV+VnDuLzDE2HuLeXeEIQn7Vnz7B7laLaa3XU9AjJHffE6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T18:40:02.418065Z","bundle_sha256":"f25aa7f6d2c4b6c94b326d70bae1f08beef94ed647689c9a05cb677c8c93d998"}}