{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EWSL4UGOG2TVK6PYQAPU3A2JEC","short_pith_number":"pith:EWSL4UGO","canonical_record":{"source":{"id":"1907.04745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T14:21:06Z","cross_cats_sorted":[],"title_canon_sha256":"76cce2558c3b522b1bb2b499bf0d3c90f6db20a354a5c53628de5ee35ee6fe8e","abstract_canon_sha256":"7520cd66ed20ce51b723f17f133cbaf682fb0a95f878197f54b09dd7518bb0cd"},"schema_version":"1.0"},"canonical_sha256":"25a4be50ce36a75579f8801f4d834920a337bc0447cb8a7aca7ea0d2d40008c7","source":{"kind":"arxiv","id":"1907.04745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04745","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04745v1","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04745","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"EWSL4UGOG2TV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EWSL4UGOG2TVK6PY","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EWSL4UGO","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EWSL4UGOG2TVK6PYQAPU3A2JEC","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T14:21:06Z","cross_cats_sorted":[],"title_canon_sha256":"76cce2558c3b522b1bb2b499bf0d3c90f6db20a354a5c53628de5ee35ee6fe8e","abstract_canon_sha256":"7520cd66ed20ce51b723f17f133cbaf682fb0a95f878197f54b09dd7518bb0cd"},"schema_version":"1.0"},"canonical_sha256":"25a4be50ce36a75579f8801f4d834920a337bc0447cb8a7aca7ea0d2d40008c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:56.891539Z","signature_b64":"27ChCqOaKXO+dEmZhakcIktHSYqhPZDv1+YozbGZkVHPdVQ0ayJJOGQMHvtzkjvaxmsJpCsWiCZU617IamwLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25a4be50ce36a75579f8801f4d834920a337bc0447cb8a7aca7ea0d2d40008c7","last_reissued_at":"2026-05-17T23:40:56.890760Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:56.890760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04745","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-05-17T23:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zRX571cFIVxXg+N0R24g6QLxhUtrSJe6VmYdZzUWwkO9urzvSzwiE9XVGuNJDOIKCnqisnA8/JI9cO0S5qFJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:59:01.532468Z"},"content_sha256":"e0596f2155d48af9fc6b1f45a0f9979ba704677f3932b6d20efa5391e3d67d3e","schema_version":"1.0","event_id":"sha256:e0596f2155d48af9fc6b1f45a0f9979ba704677f3932b6d20efa5391e3d67d3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EWSL4UGOG2TVK6PYQAPU3A2JEC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constant-Time Dynamic $(\\Delta+1)$-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Monika Henzinger, Pan Peng","submitted_at":"2019-07-10T14:21:06Z","abstract_excerpt":"With few exceptions (namely, algorithms for maximal matching, $2$-approximate vertex cover, and certain constant-stretch spanners), all known fully dynamic algorithms in general graphs require (amortized) $\\Omega(\\log n)$ update/query time. Showing for the first time that techniques from property testing can lead to constant-time fully dynamic graph algorithms we prove the following results:\n  (1) We give a fully dynamic (Las-Vegas style) algorithm with constant expected amortized time per update that maintains a proper $(\\Delta+1)$-vertex coloring of a graph with maximum degree at most $\\Delt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04745","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":""},"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-17T23:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ruHp55NRZOd2JLWVb2bKktijUUDLkChRMs1sHnBB/93wG0dX6ATxJSF0bRadLduk7YIKuX4GzXUMI8rg+9ZmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:59:01.533094Z"},"content_sha256":"838ddde4d2a13a3aaa1aa4412707d2d25cfeefe68c9364f27398ea784216ba30","schema_version":"1.0","event_id":"sha256:838ddde4d2a13a3aaa1aa4412707d2d25cfeefe68c9364f27398ea784216ba30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWSL4UGOG2TVK6PYQAPU3A2JEC/bundle.json","state_url":"https://pith.science/pith/EWSL4UGOG2TVK6PYQAPU3A2JEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWSL4UGOG2TVK6PYQAPU3A2JEC/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-25T11:59:01Z","links":{"resolver":"https://pith.science/pith/EWSL4UGOG2TVK6PYQAPU3A2JEC","bundle":"https://pith.science/pith/EWSL4UGOG2TVK6PYQAPU3A2JEC/bundle.json","state":"https://pith.science/pith/EWSL4UGOG2TVK6PYQAPU3A2JEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWSL4UGOG2TVK6PYQAPU3A2JEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EWSL4UGOG2TVK6PYQAPU3A2JEC","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":"7520cd66ed20ce51b723f17f133cbaf682fb0a95f878197f54b09dd7518bb0cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T14:21:06Z","title_canon_sha256":"76cce2558c3b522b1bb2b499bf0d3c90f6db20a354a5c53628de5ee35ee6fe8e"},"schema_version":"1.0","source":{"id":"1907.04745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04745","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04745v1","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04745","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"EWSL4UGOG2TV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EWSL4UGOG2TVK6PY","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EWSL4UGO","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:838ddde4d2a13a3aaa1aa4412707d2d25cfeefe68c9364f27398ea784216ba30","target":"graph","created_at":"2026-05-17T23:40:56Z","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":"With few exceptions (namely, algorithms for maximal matching, $2$-approximate vertex cover, and certain constant-stretch spanners), all known fully dynamic algorithms in general graphs require (amortized) $\\Omega(\\log n)$ update/query time. Showing for the first time that techniques from property testing can lead to constant-time fully dynamic graph algorithms we prove the following results:\n  (1) We give a fully dynamic (Las-Vegas style) algorithm with constant expected amortized time per update that maintains a proper $(\\Delta+1)$-vertex coloring of a graph with maximum degree at most $\\Delt","authors_text":"Monika Henzinger, Pan Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T14:21:06Z","title":"Constant-Time Dynamic $(\\Delta+1)$-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04745","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:e0596f2155d48af9fc6b1f45a0f9979ba704677f3932b6d20efa5391e3d67d3e","target":"record","created_at":"2026-05-17T23:40:56Z","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":"7520cd66ed20ce51b723f17f133cbaf682fb0a95f878197f54b09dd7518bb0cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T14:21:06Z","title_canon_sha256":"76cce2558c3b522b1bb2b499bf0d3c90f6db20a354a5c53628de5ee35ee6fe8e"},"schema_version":"1.0","source":{"id":"1907.04745","kind":"arxiv","version":1}},"canonical_sha256":"25a4be50ce36a75579f8801f4d834920a337bc0447cb8a7aca7ea0d2d40008c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25a4be50ce36a75579f8801f4d834920a337bc0447cb8a7aca7ea0d2d40008c7","first_computed_at":"2026-05-17T23:40:56.890760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:56.890760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"27ChCqOaKXO+dEmZhakcIktHSYqhPZDv1+YozbGZkVHPdVQ0ayJJOGQMHvtzkjvaxmsJpCsWiCZU617IamwLAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:56.891539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0596f2155d48af9fc6b1f45a0f9979ba704677f3932b6d20efa5391e3d67d3e","sha256:838ddde4d2a13a3aaa1aa4412707d2d25cfeefe68c9364f27398ea784216ba30"],"state_sha256":"7ab94c26348b6e8ba65434c92d31ce02500867abe0e0724aaa49b7f8e10daca9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LN0HPX0IlmTQ3WA5t397pd3gJKIIBvaT4LIQ5IkCJgbMDqM/LFRmRturKpHLhsA8LpiAqCwB+ynIZ1uQGUIoDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:59:01.536967Z","bundle_sha256":"eb5ff7f2e1955d4dc4da6850ece3afe490d2528e8121b661ee932d5d9e004d12"}}