{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WDNTJVXGHCPH7POKIJUTFSESEE","short_pith_number":"pith:WDNTJVXG","canonical_record":{"source":{"id":"1801.04582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-14T16:47:52Z","cross_cats_sorted":["cs.MS","cs.PF"],"title_canon_sha256":"3d1c3445d2e994e1c5a41d6f43de933f336876d35194a435af7eb04ab0fabfdf","abstract_canon_sha256":"19fa6597e34e8179ea7cd21ed3157090a7ff089cda256cf6693fee0afad2f119"},"schema_version":"1.0"},"canonical_sha256":"b0db34d6e6389e7fbdca426932c892213bfcb17b8a2870b99357f6bf5a10cd0d","source":{"kind":"arxiv","id":"1801.04582","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04582","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04582v1","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04582","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"WDNTJVXGHCPH","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WDNTJVXGHCPH7POK","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WDNTJVXG","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WDNTJVXGHCPH7POKIJUTFSESEE","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-14T16:47:52Z","cross_cats_sorted":["cs.MS","cs.PF"],"title_canon_sha256":"3d1c3445d2e994e1c5a41d6f43de933f336876d35194a435af7eb04ab0fabfdf","abstract_canon_sha256":"19fa6597e34e8179ea7cd21ed3157090a7ff089cda256cf6693fee0afad2f119"},"schema_version":"1.0"},"canonical_sha256":"b0db34d6e6389e7fbdca426932c892213bfcb17b8a2870b99357f6bf5a10cd0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:03.942886Z","signature_b64":"DAF7BEZstGO4I5YE8ZN3vYRQuzBgDMW31QpCkTyGhIoRXFdTKPtA4OipSSl3E1tMEvRG9iqaiXplk2o8+obuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0db34d6e6389e7fbdca426932c892213bfcb17b8a2870b99357f6bf5a10cd0d","last_reissued_at":"2026-05-18T00:26:03.942358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:03.942358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04582","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-18T00:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GC1vtnpIyRQAlATcSWgmb+INrz6h4FYw9JGxM8onQj5C02TLeBUhorBsY7vUS+PPTa32QMRKOJIWh8ZPkAgSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T03:04:39.719481Z"},"content_sha256":"ae240da00c5b195a74fc95e58883748810be7580b45eb20c9b699395765fa128","schema_version":"1.0","event_id":"sha256:ae240da00c5b195a74fc95e58883748810be7580b45eb20c9b699395765fa128"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WDNTJVXGHCPH7POKIJUTFSESEE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed dynamic load balancing for task parallel programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.PF"],"primary_cat":"cs.DC","authors_text":"Afshin Zafari, Elisabeth Larsson","submitted_at":"2018-01-14T16:47:52Z","abstract_excerpt":"In this paper, we derive and investigate approaches to dynamically load balance a distributed task parallel application software. The load balancing strategy is based on task migration. Busy processes export parts of their ready task queue to idle processes. Idle--busy pairs of processes find each other through a random search process that succeeds within a few steps with high probability. We evaluate the load balancing approach for a block Cholesky factorization implementation and observe a reduction in execution time on the order of 5\\% in the selected test cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04582","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-18T00:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UIITlmZyQjPVsgSwyGpp6Mu713n8ZnZSOzDyYbY9LqG+Nnk0g9RRr+PQIxiEU4LYp1f4ORUwrwtiyWv//yT6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T03:04:39.720090Z"},"content_sha256":"87eab28de9157250b2f4f73411378827650362ed75b0bb83591372dd5d4af246","schema_version":"1.0","event_id":"sha256:87eab28de9157250b2f4f73411378827650362ed75b0bb83591372dd5d4af246"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDNTJVXGHCPH7POKIJUTFSESEE/bundle.json","state_url":"https://pith.science/pith/WDNTJVXGHCPH7POKIJUTFSESEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDNTJVXGHCPH7POKIJUTFSESEE/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-06-07T03:04:39Z","links":{"resolver":"https://pith.science/pith/WDNTJVXGHCPH7POKIJUTFSESEE","bundle":"https://pith.science/pith/WDNTJVXGHCPH7POKIJUTFSESEE/bundle.json","state":"https://pith.science/pith/WDNTJVXGHCPH7POKIJUTFSESEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDNTJVXGHCPH7POKIJUTFSESEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WDNTJVXGHCPH7POKIJUTFSESEE","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":"19fa6597e34e8179ea7cd21ed3157090a7ff089cda256cf6693fee0afad2f119","cross_cats_sorted":["cs.MS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-14T16:47:52Z","title_canon_sha256":"3d1c3445d2e994e1c5a41d6f43de933f336876d35194a435af7eb04ab0fabfdf"},"schema_version":"1.0","source":{"id":"1801.04582","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04582","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04582v1","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04582","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"WDNTJVXGHCPH","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WDNTJVXGHCPH7POK","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WDNTJVXG","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:87eab28de9157250b2f4f73411378827650362ed75b0bb83591372dd5d4af246","target":"graph","created_at":"2026-05-18T00:26:03Z","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":"In this paper, we derive and investigate approaches to dynamically load balance a distributed task parallel application software. The load balancing strategy is based on task migration. Busy processes export parts of their ready task queue to idle processes. Idle--busy pairs of processes find each other through a random search process that succeeds within a few steps with high probability. We evaluate the load balancing approach for a block Cholesky factorization implementation and observe a reduction in execution time on the order of 5\\% in the selected test cases.","authors_text":"Afshin Zafari, Elisabeth Larsson","cross_cats":["cs.MS","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-14T16:47:52Z","title":"Distributed dynamic load balancing for task parallel programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04582","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:ae240da00c5b195a74fc95e58883748810be7580b45eb20c9b699395765fa128","target":"record","created_at":"2026-05-18T00:26:03Z","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":"19fa6597e34e8179ea7cd21ed3157090a7ff089cda256cf6693fee0afad2f119","cross_cats_sorted":["cs.MS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-14T16:47:52Z","title_canon_sha256":"3d1c3445d2e994e1c5a41d6f43de933f336876d35194a435af7eb04ab0fabfdf"},"schema_version":"1.0","source":{"id":"1801.04582","kind":"arxiv","version":1}},"canonical_sha256":"b0db34d6e6389e7fbdca426932c892213bfcb17b8a2870b99357f6bf5a10cd0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0db34d6e6389e7fbdca426932c892213bfcb17b8a2870b99357f6bf5a10cd0d","first_computed_at":"2026-05-18T00:26:03.942358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:03.942358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DAF7BEZstGO4I5YE8ZN3vYRQuzBgDMW31QpCkTyGhIoRXFdTKPtA4OipSSl3E1tMEvRG9iqaiXplk2o8+obuDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:03.942886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04582","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae240da00c5b195a74fc95e58883748810be7580b45eb20c9b699395765fa128","sha256:87eab28de9157250b2f4f73411378827650362ed75b0bb83591372dd5d4af246"],"state_sha256":"5dded60102ced03221999e7c46bbb27840fc513439a028270e7cac8947d343f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fgCF6mNfl+muxJvvuA4PWG37d0NbNc/egraLJJIXgMyYeTnwPGk09tBPxz3QRt+ok0rQ8fIaJKTo6F1Jc4obAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T03:04:39.723436Z","bundle_sha256":"3f1ea2a1eadfb78fea52fbbe2238943d6133351758c8f436502388ba7bc14e26"}}