{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VDRPZNH6HZC7BUWF7AUJAYIOBX","short_pith_number":"pith:VDRPZNH6","canonical_record":{"source":{"id":"1710.00122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-30T00:12:05Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"24aa1d31cbe32b8a1239188abdd461c64cd1f7a5a77e6b6f0d0c727ac215d5d6","abstract_canon_sha256":"faab9ae97310c1f3ed6d1c9617d74a3c2a6867a13235e520419e3f8f5279a3a9"},"schema_version":"1.0"},"canonical_sha256":"a8e2fcb4fe3e45f0d2c5f82890610e0dd9c5eb59be82d3e12028e72d9d8edef6","source":{"kind":"arxiv","id":"1710.00122","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00122","created_at":"2026-05-18T00:33:57Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00122v1","created_at":"2026-05-18T00:33:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00122","created_at":"2026-05-18T00:33:57Z"},{"alias_kind":"pith_short_12","alias_value":"VDRPZNH6HZC7","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VDRPZNH6HZC7BUWF","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VDRPZNH6","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VDRPZNH6HZC7BUWF7AUJAYIOBX","target":"record","payload":{"canonical_record":{"source":{"id":"1710.00122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-30T00:12:05Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"24aa1d31cbe32b8a1239188abdd461c64cd1f7a5a77e6b6f0d0c727ac215d5d6","abstract_canon_sha256":"faab9ae97310c1f3ed6d1c9617d74a3c2a6867a13235e520419e3f8f5279a3a9"},"schema_version":"1.0"},"canonical_sha256":"a8e2fcb4fe3e45f0d2c5f82890610e0dd9c5eb59be82d3e12028e72d9d8edef6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:57.801379Z","signature_b64":"a/TcAsuBtSDZxGdsANb5JLkqOT6c7nc5L8RKOgu9Y7THTWgZOBpbLxLTLrz8Y2v6LI9VIgCCbYYycGKtBnGuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8e2fcb4fe3e45f0d2c5f82890610e0dd9c5eb59be82d3e12028e72d9d8edef6","last_reissued_at":"2026-05-18T00:33:57.800650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:57.800650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.00122","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:33:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f8J4868oX+zLrMEiZtNe5e779kM44gI0cDTpgMg7weHf6TMry2kcnTiHkTKY4MWy9Wl31tEZLK4uXBBhEfn+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T06:23:33.925119Z"},"content_sha256":"625c88de7b2d8f91ccf2ea258807ce1ccf11fdc384ba65e8ccc800f0b348d39e","schema_version":"1.0","event_id":"sha256:625c88de7b2d8f91ccf2ea258807ce1ccf11fdc384ba65e8ccc800f0b348d39e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VDRPZNH6HZC7BUWF7AUJAYIOBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Load Balancing Method for Tree Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DC","authors_text":"Ahmed El-Mahdy, Osama Talaat Ibrahim","submitted_at":"2017-09-30T00:12:05Z","abstract_excerpt":"Nowadays, multiprocessing is mainstream with exponentially increasing number of processors. Load balancing is, therefore, a critical operation for the efficient execution of parallel algorithms. In this paper we consider the fundamental class of tree-based algorithms that are notoriously irregular, and hard to load-balance with existing static techniques. We propose a hybrid load balancing method using the utility of statistical random sampling in estimating the tree depth and node count distributions to uniformly partition an input tree. To conduct an initial performance study, we implemented"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00122","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:33:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZRZ4ZcOTfO5wtcmeevVEEedhgW736vF7ZgGvcwbq19sylPFU6KwFH5qQG8hwf/q+l0eNmKpaFyYoLa3V9cIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T06:23:33.925737Z"},"content_sha256":"a1ce7a7c136bfc5b668673cc0e45b2c0d9c54f04156cfc5da04b6362aaa4763a","schema_version":"1.0","event_id":"sha256:a1ce7a7c136bfc5b668673cc0e45b2c0d9c54f04156cfc5da04b6362aaa4763a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDRPZNH6HZC7BUWF7AUJAYIOBX/bundle.json","state_url":"https://pith.science/pith/VDRPZNH6HZC7BUWF7AUJAYIOBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDRPZNH6HZC7BUWF7AUJAYIOBX/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-01T06:23:33Z","links":{"resolver":"https://pith.science/pith/VDRPZNH6HZC7BUWF7AUJAYIOBX","bundle":"https://pith.science/pith/VDRPZNH6HZC7BUWF7AUJAYIOBX/bundle.json","state":"https://pith.science/pith/VDRPZNH6HZC7BUWF7AUJAYIOBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDRPZNH6HZC7BUWF7AUJAYIOBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VDRPZNH6HZC7BUWF7AUJAYIOBX","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":"faab9ae97310c1f3ed6d1c9617d74a3c2a6867a13235e520419e3f8f5279a3a9","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-30T00:12:05Z","title_canon_sha256":"24aa1d31cbe32b8a1239188abdd461c64cd1f7a5a77e6b6f0d0c727ac215d5d6"},"schema_version":"1.0","source":{"id":"1710.00122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00122","created_at":"2026-05-18T00:33:57Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00122v1","created_at":"2026-05-18T00:33:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00122","created_at":"2026-05-18T00:33:57Z"},{"alias_kind":"pith_short_12","alias_value":"VDRPZNH6HZC7","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VDRPZNH6HZC7BUWF","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VDRPZNH6","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:a1ce7a7c136bfc5b668673cc0e45b2c0d9c54f04156cfc5da04b6362aaa4763a","target":"graph","created_at":"2026-05-18T00:33:57Z","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":"Nowadays, multiprocessing is mainstream with exponentially increasing number of processors. Load balancing is, therefore, a critical operation for the efficient execution of parallel algorithms. In this paper we consider the fundamental class of tree-based algorithms that are notoriously irregular, and hard to load-balance with existing static techniques. We propose a hybrid load balancing method using the utility of statistical random sampling in estimating the tree depth and node count distributions to uniformly partition an input tree. To conduct an initial performance study, we implemented","authors_text":"Ahmed El-Mahdy, Osama Talaat Ibrahim","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-30T00:12:05Z","title":"An Efficient Load Balancing Method for Tree Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00122","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:625c88de7b2d8f91ccf2ea258807ce1ccf11fdc384ba65e8ccc800f0b348d39e","target":"record","created_at":"2026-05-18T00:33:57Z","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":"faab9ae97310c1f3ed6d1c9617d74a3c2a6867a13235e520419e3f8f5279a3a9","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-30T00:12:05Z","title_canon_sha256":"24aa1d31cbe32b8a1239188abdd461c64cd1f7a5a77e6b6f0d0c727ac215d5d6"},"schema_version":"1.0","source":{"id":"1710.00122","kind":"arxiv","version":1}},"canonical_sha256":"a8e2fcb4fe3e45f0d2c5f82890610e0dd9c5eb59be82d3e12028e72d9d8edef6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8e2fcb4fe3e45f0d2c5f82890610e0dd9c5eb59be82d3e12028e72d9d8edef6","first_computed_at":"2026-05-18T00:33:57.800650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:57.800650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a/TcAsuBtSDZxGdsANb5JLkqOT6c7nc5L8RKOgu9Y7THTWgZOBpbLxLTLrz8Y2v6LI9VIgCCbYYycGKtBnGuAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:57.801379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:625c88de7b2d8f91ccf2ea258807ce1ccf11fdc384ba65e8ccc800f0b348d39e","sha256:a1ce7a7c136bfc5b668673cc0e45b2c0d9c54f04156cfc5da04b6362aaa4763a"],"state_sha256":"19d061a1f02dd3df083685bfeb9acd79e684492d41b194175008636f995b0a82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5GiJRaQu8GYWUW58Ywiu8wbvBM9VHhp85AxiYuemXhRIGccbTnaV8/6fIKVwRZ0O9/b4JB5Q4WT0PcKmzqBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T06:23:33.929083Z","bundle_sha256":"cab39caee6b2e240e84d0df6436c98f06b6c66a108d230034f8ac7db003f2766"}}