{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5SJ327LHMUA6KS5XTSWFGKLR3N","short_pith_number":"pith:5SJ327LH","canonical_record":{"source":{"id":"1404.4344","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-16T18:50:10Z","cross_cats_sorted":[],"title_canon_sha256":"cb8560cb61589936bc58d21cdb0f1ad841328daccdf8b9ed9f2a4f51162e675d","abstract_canon_sha256":"e418f3ea70b1ad455bb91426bd793344b5df53d29ccca76ebe9e8b3a716d61f5"},"schema_version":"1.0"},"canonical_sha256":"ec93bd7d676501e54bb79cac532971db7214a076fe07a4b6163cf29b0ca54612","source":{"kind":"arxiv","id":"1404.4344","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4344","created_at":"2026-05-18T02:26:39Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4344v4","created_at":"2026-05-18T02:26:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4344","created_at":"2026-05-18T02:26:39Z"},{"alias_kind":"pith_short_12","alias_value":"5SJ327LHMUA6","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5SJ327LHMUA6KS5X","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5SJ327LH","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5SJ327LHMUA6KS5XTSWFGKLR3N","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4344","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-16T18:50:10Z","cross_cats_sorted":[],"title_canon_sha256":"cb8560cb61589936bc58d21cdb0f1ad841328daccdf8b9ed9f2a4f51162e675d","abstract_canon_sha256":"e418f3ea70b1ad455bb91426bd793344b5df53d29ccca76ebe9e8b3a716d61f5"},"schema_version":"1.0"},"canonical_sha256":"ec93bd7d676501e54bb79cac532971db7214a076fe07a4b6163cf29b0ca54612","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:39.166596Z","signature_b64":"2Uz4ArVLOpOiMhHuMF9qDHbRlA36bP/rqTEXd8OJSWzDVfu+eBh7CKtnKSyvsVPTufSuZuETNxQdpUQqRy2yDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec93bd7d676501e54bb79cac532971db7214a076fe07a4b6163cf29b0ca54612","last_reissued_at":"2026-05-18T02:26:39.166191Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:39.166191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4344","source_version":4,"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-18T02:26:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXR9zKSDqbjcWrMEy2DSVC9u/jYOXNVQAgH8BGlIN6dA+ceDE0MnTE9QzPWeKAnpK3HXHxKDUlXwEN04tFBrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:22:49.380058Z"},"content_sha256":"b10e47f915391a4eeb7210f2a8e6981541aa1ea1e652a69eb9c276a3013fd99c","schema_version":"1.0","event_id":"sha256:b10e47f915391a4eeb7210f2a8e6981541aa1ea1e652a69eb9c276a3013fd99c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5SJ327LHMUA6KS5XTSWFGKLR3N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Analysis of Deterministic Load-Balancing Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrian Kosowski (INRIA Paris-Rocquencourt, ENS Paris), Frederik Mallmann-Trenn (SFU.ca, LIAFA), Petra Berenbrink (SFU.ca), Przemyslaw Uznanski, Ralf Klasing (LaBRI)","submitted_at":"2014-04-16T18:50:10Z","abstract_excerpt":"We consider the problem of deterministic load balancing of tokens in the discrete model. A set of $n$ processors is connected into a $d$-regular undirected network. In every time step, each processor exchanges some of its tokens with each of its neighbors in the network. The goal is to minimize the discrepancy between the number of tokens on the most-loaded and the least-loaded processor as quickly as possible.\n\nRabani et al. (1998)  present a  general technique for the analysis of a wide class of discrete load balancing algorithms. Their approach is to characterize the deviation between the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4344","kind":"arxiv","version":4},"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-18T02:26:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5e6MPWp9Pwdi+vReSkeEaWPY752jeoznztE4wb9a2jgJTf9qK/L5FQO3xkX7qwyo6tyg670JeVgDO4efWnT5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:22:49.380727Z"},"content_sha256":"4ce426d8f47e4d8fc3e0c70d927cae9271532d23380a873e406929cd7040cfa0","schema_version":"1.0","event_id":"sha256:4ce426d8f47e4d8fc3e0c70d927cae9271532d23380a873e406929cd7040cfa0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SJ327LHMUA6KS5XTSWFGKLR3N/bundle.json","state_url":"https://pith.science/pith/5SJ327LHMUA6KS5XTSWFGKLR3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SJ327LHMUA6KS5XTSWFGKLR3N/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-27T19:22:49Z","links":{"resolver":"https://pith.science/pith/5SJ327LHMUA6KS5XTSWFGKLR3N","bundle":"https://pith.science/pith/5SJ327LHMUA6KS5XTSWFGKLR3N/bundle.json","state":"https://pith.science/pith/5SJ327LHMUA6KS5XTSWFGKLR3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SJ327LHMUA6KS5XTSWFGKLR3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5SJ327LHMUA6KS5XTSWFGKLR3N","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":"e418f3ea70b1ad455bb91426bd793344b5df53d29ccca76ebe9e8b3a716d61f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-16T18:50:10Z","title_canon_sha256":"cb8560cb61589936bc58d21cdb0f1ad841328daccdf8b9ed9f2a4f51162e675d"},"schema_version":"1.0","source":{"id":"1404.4344","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4344","created_at":"2026-05-18T02:26:39Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4344v4","created_at":"2026-05-18T02:26:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4344","created_at":"2026-05-18T02:26:39Z"},{"alias_kind":"pith_short_12","alias_value":"5SJ327LHMUA6","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5SJ327LHMUA6KS5X","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5SJ327LH","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:4ce426d8f47e4d8fc3e0c70d927cae9271532d23380a873e406929cd7040cfa0","target":"graph","created_at":"2026-05-18T02:26:39Z","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":"We consider the problem of deterministic load balancing of tokens in the discrete model. A set of $n$ processors is connected into a $d$-regular undirected network. In every time step, each processor exchanges some of its tokens with each of its neighbors in the network. The goal is to minimize the discrepancy between the number of tokens on the most-loaded and the least-loaded processor as quickly as possible.\n\nRabani et al. (1998)  present a  general technique for the analysis of a wide class of discrete load balancing algorithms. Their approach is to characterize the deviation between the a","authors_text":"Adrian Kosowski (INRIA Paris-Rocquencourt, ENS Paris), Frederik Mallmann-Trenn (SFU.ca, LIAFA), Petra Berenbrink (SFU.ca), Przemyslaw Uznanski, Ralf Klasing (LaBRI)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-16T18:50:10Z","title":"Improved Analysis of Deterministic Load-Balancing Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4344","kind":"arxiv","version":4},"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:b10e47f915391a4eeb7210f2a8e6981541aa1ea1e652a69eb9c276a3013fd99c","target":"record","created_at":"2026-05-18T02:26:39Z","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":"e418f3ea70b1ad455bb91426bd793344b5df53d29ccca76ebe9e8b3a716d61f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-16T18:50:10Z","title_canon_sha256":"cb8560cb61589936bc58d21cdb0f1ad841328daccdf8b9ed9f2a4f51162e675d"},"schema_version":"1.0","source":{"id":"1404.4344","kind":"arxiv","version":4}},"canonical_sha256":"ec93bd7d676501e54bb79cac532971db7214a076fe07a4b6163cf29b0ca54612","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec93bd7d676501e54bb79cac532971db7214a076fe07a4b6163cf29b0ca54612","first_computed_at":"2026-05-18T02:26:39.166191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:39.166191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Uz4ArVLOpOiMhHuMF9qDHbRlA36bP/rqTEXd8OJSWzDVfu+eBh7CKtnKSyvsVPTufSuZuETNxQdpUQqRy2yDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:39.166596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4344","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b10e47f915391a4eeb7210f2a8e6981541aa1ea1e652a69eb9c276a3013fd99c","sha256:4ce426d8f47e4d8fc3e0c70d927cae9271532d23380a873e406929cd7040cfa0"],"state_sha256":"2dec2eaad2d9fe9d9656a407b2aea50b0639917eaa563d9cc2d5201218b3810d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4AwzhipDjTtQ4ITVGeRy6NUxY49jtW6fjcmH8faXAxnQjt6YoYLcN9ps0j4ErKizop4s0hlFC6nc044LbigAAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:22:49.384117Z","bundle_sha256":"0eb645ad8a8feacde0826c9a0bae604979cb12e7f218e3c995d2e35c2025cdf9"}}