{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OZ6HLAGE5IEU4HSKV5QOFOANWB","short_pith_number":"pith:OZ6HLAGE","canonical_record":{"source":{"id":"1802.10199","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T22:54:56Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"da122f671813775909e243784d929bac6a90a00a47f375652051dc1f3e8f4ee4","abstract_canon_sha256":"64e178027b13d69d044c517cbc6b1ef0272c1dbf435e926416e73d2dc0317749"},"schema_version":"1.0"},"canonical_sha256":"767c7580c4ea094e1e4aaf60e2b80db07984eac91dbc486a77abede7d00ef120","source":{"kind":"arxiv","id":"1802.10199","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10199","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10199v3","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10199","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"pith_short_12","alias_value":"OZ6HLAGE5IEU","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZ6HLAGE5IEU4HSK","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZ6HLAGE","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OZ6HLAGE5IEU4HSKV5QOFOANWB","target":"record","payload":{"canonical_record":{"source":{"id":"1802.10199","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T22:54:56Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"da122f671813775909e243784d929bac6a90a00a47f375652051dc1f3e8f4ee4","abstract_canon_sha256":"64e178027b13d69d044c517cbc6b1ef0272c1dbf435e926416e73d2dc0317749"},"schema_version":"1.0"},"canonical_sha256":"767c7580c4ea094e1e4aaf60e2b80db07984eac91dbc486a77abede7d00ef120","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:54.508666Z","signature_b64":"4tLfxPqxSoUExlTJAG0nrjlv+D+rO4RY5AVgMWd01DJ8gkoPFpCQgs1lfJUmN1s38pOXr0bxQEDZf26yDDLfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"767c7580c4ea094e1e4aaf60e2b80db07984eac91dbc486a77abede7d00ef120","last_reissued_at":"2026-05-17T23:58:54.508201Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:54.508201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.10199","source_version":3,"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:58:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"baIigCxIbOWgDgBnswFt9/RsL7UieYCVZOItBA7oTXWSgXm+xX2eQyMNYvJPOHkfN+XSBroN7yzXNYa3i0CdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:33:32.745842Z"},"content_sha256":"f90b172ed5eddae24cee1389e79222bd53c0d60e49014edd9895d1f3361ac962","schema_version":"1.0","event_id":"sha256:f90b172ed5eddae24cee1389e79222bd53c0d60e49014edd9895d1f3361ac962"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OZ6HLAGE5IEU4HSKV5QOFOANWB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Distributed Algorithms in Highly Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Philipp Bamberger, Yannic Maus","submitted_at":"2018-02-27T22:54:56Z","abstract_excerpt":"The present paper studies local distributed graph problems in highly dynamic networks. Communication and changes of the graph happen in synchronous rounds and our algorithms always, i.e., in every round, satisfy non-trivial guarantees, no matter how dynamic the network is.\n  We define a (in our view) natural generalization of static graph problems to the dynamic graph setting. Throughout the execution of an algorithm we consider a sliding window over the last $T$, e.g., polylogarithmic, rounds. Then, in some round, the feasibility of an output only depends on the topology of the graphs in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10199","kind":"arxiv","version":3},"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:58:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iloagFzi/awEqCbVuNNYK5zilggXw7OeLWj/Ke2Hug+KxMTTFxsWclUtSS2dVAYlwZEuFilcLdinGbORvXPqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:33:32.746255Z"},"content_sha256":"9d19eb510b90c3b6dcda72fef240a666ff0ea61f6941d57ad9881637466b72c1","schema_version":"1.0","event_id":"sha256:9d19eb510b90c3b6dcda72fef240a666ff0ea61f6941d57ad9881637466b72c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB/bundle.json","state_url":"https://pith.science/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB/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-26T19:33:32Z","links":{"resolver":"https://pith.science/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB","bundle":"https://pith.science/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB/bundle.json","state":"https://pith.science/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OZ6HLAGE5IEU4HSKV5QOFOANWB","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":"64e178027b13d69d044c517cbc6b1ef0272c1dbf435e926416e73d2dc0317749","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T22:54:56Z","title_canon_sha256":"da122f671813775909e243784d929bac6a90a00a47f375652051dc1f3e8f4ee4"},"schema_version":"1.0","source":{"id":"1802.10199","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10199","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10199v3","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10199","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"pith_short_12","alias_value":"OZ6HLAGE5IEU","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZ6HLAGE5IEU4HSK","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZ6HLAGE","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:9d19eb510b90c3b6dcda72fef240a666ff0ea61f6941d57ad9881637466b72c1","target":"graph","created_at":"2026-05-17T23:58:54Z","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":"The present paper studies local distributed graph problems in highly dynamic networks. Communication and changes of the graph happen in synchronous rounds and our algorithms always, i.e., in every round, satisfy non-trivial guarantees, no matter how dynamic the network is.\n  We define a (in our view) natural generalization of static graph problems to the dynamic graph setting. Throughout the execution of an algorithm we consider a sliding window over the last $T$, e.g., polylogarithmic, rounds. Then, in some round, the feasibility of an output only depends on the topology of the graphs in the ","authors_text":"Fabian Kuhn, Philipp Bamberger, Yannic Maus","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T22:54:56Z","title":"Local Distributed Algorithms in Highly Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10199","kind":"arxiv","version":3},"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:f90b172ed5eddae24cee1389e79222bd53c0d60e49014edd9895d1f3361ac962","target":"record","created_at":"2026-05-17T23:58:54Z","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":"64e178027b13d69d044c517cbc6b1ef0272c1dbf435e926416e73d2dc0317749","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T22:54:56Z","title_canon_sha256":"da122f671813775909e243784d929bac6a90a00a47f375652051dc1f3e8f4ee4"},"schema_version":"1.0","source":{"id":"1802.10199","kind":"arxiv","version":3}},"canonical_sha256":"767c7580c4ea094e1e4aaf60e2b80db07984eac91dbc486a77abede7d00ef120","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"767c7580c4ea094e1e4aaf60e2b80db07984eac91dbc486a77abede7d00ef120","first_computed_at":"2026-05-17T23:58:54.508201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:54.508201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4tLfxPqxSoUExlTJAG0nrjlv+D+rO4RY5AVgMWd01DJ8gkoPFpCQgs1lfJUmN1s38pOXr0bxQEDZf26yDDLfCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:54.508666Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.10199","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f90b172ed5eddae24cee1389e79222bd53c0d60e49014edd9895d1f3361ac962","sha256:9d19eb510b90c3b6dcda72fef240a666ff0ea61f6941d57ad9881637466b72c1"],"state_sha256":"baa392c1f937148751879ed02ddf8442ce37a96d60b592090ece935697715478"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D1cyvbWQ/OoJihAhCGxaB+aCBx01GPa+92oErDYKhvw4fn79wXv9fPKGQHhHrqzLJgdiYZfnTcJLxtw32+RSBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:33:32.749671Z","bundle_sha256":"aca4fd2f267ea8ef8024fa4c9b58a5c5104c6d94f089fc95d3d87eebb439c50e"}}