{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OZ6HLAGE5IEU4HSKV5QOFOANWB","short_pith_number":"pith:OZ6HLAGE","schema_version":"1.0","canonical_sha256":"767c7580c4ea094e1e4aaf60e2b80db07984eac91dbc486a77abede7d00ef120","source":{"kind":"arxiv","id":"1802.10199","version":3},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.10199","created_at":"2026-05-17T23:58:54.508276+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10199v3","created_at":"2026-05-17T23:58:54.508276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10199","created_at":"2026-05-17T23:58:54.508276+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZ6HLAGE5IEU","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZ6HLAGE5IEU4HSK","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZ6HLAGE","created_at":"2026-05-18T12:32:43.782077+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/OZ6HLAGE5IEU4HSKV5QOFOANWB","json":"https://pith.science/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB.json","graph_json":"https://pith.science/api/pith-number/OZ6HLAGE5IEU4HSKV5QOFOANWB/graph.json","events_json":"https://pith.science/api/pith-number/OZ6HLAGE5IEU4HSKV5QOFOANWB/events.json","paper":"https://pith.science/paper/OZ6HLAGE"},"agent_actions":{"view_html":"https://pith.science/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB","download_json":"https://pith.science/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB.json","view_paper":"https://pith.science/paper/OZ6HLAGE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10199&json=true","fetch_graph":"https://pith.science/api/pith-number/OZ6HLAGE5IEU4HSKV5QOFOANWB/graph.json","fetch_events":"https://pith.science/api/pith-number/OZ6HLAGE5IEU4HSKV5QOFOANWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB/action/storage_attestation","attest_author":"https://pith.science/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB/action/author_attestation","sign_citation":"https://pith.science/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB/action/citation_signature","submit_replication":"https://pith.science/pith/OZ6HLAGE5IEU4HSKV5QOFOANWB/action/replication_record"}},"created_at":"2026-05-17T23:58:54.508276+00:00","updated_at":"2026-05-17T23:58:54.508276+00:00"}