{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:MHXUCL2FWCFSNHEMMTQSGVQYCB","short_pith_number":"pith:MHXUCL2F","canonical_record":{"source":{"id":"2105.13194","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-05-27T14:42:56Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"98c1adb4764ce6671f515f46720c1cda633c7c4d540e54bf478a7d2baa6e9ecf","abstract_canon_sha256":"693ba5f27aec03dd52431373d373563380f76196378d3ac19e8562573d886a8d"},"schema_version":"1.0"},"canonical_sha256":"61ef412f45b08b269c8c64e12356181041ce23d4c8e7f2271d136da2fb6c62b7","source":{"kind":"arxiv","id":"2105.13194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.13194","created_at":"2026-07-05T02:43:58Z"},{"alias_kind":"arxiv_version","alias_value":"2105.13194v1","created_at":"2026-07-05T02:43:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.13194","created_at":"2026-07-05T02:43:58Z"},{"alias_kind":"pith_short_12","alias_value":"MHXUCL2FWCFS","created_at":"2026-07-05T02:43:58Z"},{"alias_kind":"pith_short_16","alias_value":"MHXUCL2FWCFSNHEM","created_at":"2026-07-05T02:43:58Z"},{"alias_kind":"pith_short_8","alias_value":"MHXUCL2F","created_at":"2026-07-05T02:43:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:MHXUCL2FWCFSNHEMMTQSGVQYCB","target":"record","payload":{"canonical_record":{"source":{"id":"2105.13194","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-05-27T14:42:56Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"98c1adb4764ce6671f515f46720c1cda633c7c4d540e54bf478a7d2baa6e9ecf","abstract_canon_sha256":"693ba5f27aec03dd52431373d373563380f76196378d3ac19e8562573d886a8d"},"schema_version":"1.0"},"canonical_sha256":"61ef412f45b08b269c8c64e12356181041ce23d4c8e7f2271d136da2fb6c62b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:43:58.500150Z","signature_b64":"1I/lrFb0mNj/saumGduLQz0jyWNkfmORvAQbliIf9f6rkhYPhv1iAUA9nOS+4AbaXByHf/e3GcGz810ZDY9RCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61ef412f45b08b269c8c64e12356181041ce23d4c8e7f2271d136da2fb6c62b7","last_reissued_at":"2026-07-05T02:43:58.499670Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:43:58.499670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.13194","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-05T02:43:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPzCK7mlUAmVOM3s6apw8WN1eMtmdwpW2OBalxVnSIbYpcVvvgn+jSP3mN0G5zLRXpOa+j4SGzwXT6gDgpVtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:05:34.379572Z"},"content_sha256":"c839ef22f7b27a263fe07a193920c7c0e6973c1e4a63bb9060c2e4ab4ce7590a","schema_version":"1.0","event_id":"sha256:c839ef22f7b27a263fe07a193920c7c0e6973c1e4a63bb9060c2e4ab4ce7590a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:MHXUCL2FWCFSNHEMMTQSGVQYCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Load Balancing in Dynamic Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Ami Paz, Gregory Schwartzman, Seth Gilbert, Uri Meir","submitted_at":"2021-05-27T14:42:56Z","abstract_excerpt":"In the load balancing problem, each node in a network is assigned a load, and the goal is to equally distribute the loads among the nodes, by preforming local load exchanges. While load balancing was extensively studied in static networks, only recently a load balancing algorithm for dynamic networks with a bounded convergence time was presented. In this paper, we further study the time complexity of load balancing in the context of dynamic networks.\n  First, we show that randomness is not necessary, and present a deterministic algorithm which slightly improves the running time of the previous"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.13194","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/2105.13194/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-05T02:43:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hw4BqvZn+RojURszMEtYKcqRFJju/RpPWxS03rPEyh21sAE95w9IYTC/XdQhZHQBChHjL4m/u5as3pxAbBKiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:05:34.379945Z"},"content_sha256":"8fb1f480b936363a9d2613c06d1ab1443b27dd853c0c67c85123d4d42e74501f","schema_version":"1.0","event_id":"sha256:8fb1f480b936363a9d2613c06d1ab1443b27dd853c0c67c85123d4d42e74501f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MHXUCL2FWCFSNHEMMTQSGVQYCB/bundle.json","state_url":"https://pith.science/pith/MHXUCL2FWCFSNHEMMTQSGVQYCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MHXUCL2FWCFSNHEMMTQSGVQYCB/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-07-06T10:05:34Z","links":{"resolver":"https://pith.science/pith/MHXUCL2FWCFSNHEMMTQSGVQYCB","bundle":"https://pith.science/pith/MHXUCL2FWCFSNHEMMTQSGVQYCB/bundle.json","state":"https://pith.science/pith/MHXUCL2FWCFSNHEMMTQSGVQYCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MHXUCL2FWCFSNHEMMTQSGVQYCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:MHXUCL2FWCFSNHEMMTQSGVQYCB","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":"693ba5f27aec03dd52431373d373563380f76196378d3ac19e8562573d886a8d","cross_cats_sorted":["cs.NI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-05-27T14:42:56Z","title_canon_sha256":"98c1adb4764ce6671f515f46720c1cda633c7c4d540e54bf478a7d2baa6e9ecf"},"schema_version":"1.0","source":{"id":"2105.13194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.13194","created_at":"2026-07-05T02:43:58Z"},{"alias_kind":"arxiv_version","alias_value":"2105.13194v1","created_at":"2026-07-05T02:43:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.13194","created_at":"2026-07-05T02:43:58Z"},{"alias_kind":"pith_short_12","alias_value":"MHXUCL2FWCFS","created_at":"2026-07-05T02:43:58Z"},{"alias_kind":"pith_short_16","alias_value":"MHXUCL2FWCFSNHEM","created_at":"2026-07-05T02:43:58Z"},{"alias_kind":"pith_short_8","alias_value":"MHXUCL2F","created_at":"2026-07-05T02:43:58Z"}],"graph_snapshots":[{"event_id":"sha256:8fb1f480b936363a9d2613c06d1ab1443b27dd853c0c67c85123d4d42e74501f","target":"graph","created_at":"2026-07-05T02:43:58Z","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/2105.13194/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the load balancing problem, each node in a network is assigned a load, and the goal is to equally distribute the loads among the nodes, by preforming local load exchanges. While load balancing was extensively studied in static networks, only recently a load balancing algorithm for dynamic networks with a bounded convergence time was presented. In this paper, we further study the time complexity of load balancing in the context of dynamic networks.\n  First, we show that randomness is not necessary, and present a deterministic algorithm which slightly improves the running time of the previous","authors_text":"Ami Paz, Gregory Schwartzman, Seth Gilbert, Uri Meir","cross_cats":["cs.NI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-05-27T14:42:56Z","title":"On the Complexity of Load Balancing in Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.13194","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:c839ef22f7b27a263fe07a193920c7c0e6973c1e4a63bb9060c2e4ab4ce7590a","target":"record","created_at":"2026-07-05T02:43:58Z","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":"693ba5f27aec03dd52431373d373563380f76196378d3ac19e8562573d886a8d","cross_cats_sorted":["cs.NI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-05-27T14:42:56Z","title_canon_sha256":"98c1adb4764ce6671f515f46720c1cda633c7c4d540e54bf478a7d2baa6e9ecf"},"schema_version":"1.0","source":{"id":"2105.13194","kind":"arxiv","version":1}},"canonical_sha256":"61ef412f45b08b269c8c64e12356181041ce23d4c8e7f2271d136da2fb6c62b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61ef412f45b08b269c8c64e12356181041ce23d4c8e7f2271d136da2fb6c62b7","first_computed_at":"2026-07-05T02:43:58.499670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:43:58.499670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1I/lrFb0mNj/saumGduLQz0jyWNkfmORvAQbliIf9f6rkhYPhv1iAUA9nOS+4AbaXByHf/e3GcGz810ZDY9RCg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:43:58.500150Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.13194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c839ef22f7b27a263fe07a193920c7c0e6973c1e4a63bb9060c2e4ab4ce7590a","sha256:8fb1f480b936363a9d2613c06d1ab1443b27dd853c0c67c85123d4d42e74501f"],"state_sha256":"998827db6ae41485a060460732677820fb1f1f6b3cc1cdceda3cdfe6f4331ea2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"chI93d8sDT4CmtUUb1ncj6NfvBZkz9dANhOJV+qSLNfIeVqanrW4HeMyfX59VwWKJsCykCPzyRuS2V50pairCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T10:05:34.382041Z","bundle_sha256":"dc52195acf0e7e2a0a3a800b35e85ec6c381fc817da441e0e31f8d56a5cfb952"}}