{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:W265AVRTVLZ2GCZLOTGMZXL2GY","short_pith_number":"pith:W265AVRT","canonical_record":{"source":{"id":"1308.0148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-01T10:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"da10217ddd0e3eedbee0f20c22cbb46eb32b56392cf223e4a07d064dd75ebfb9","abstract_canon_sha256":"28203cee8b812c7da78ba89d16f2a25637b4dc2b49fef9d5842ecab8c2f9c6a0"},"schema_version":"1.0"},"canonical_sha256":"b6bdd05633aaf3a30b2b74ccccdd7a361c1ec3362932ec2a990387802e220df9","source":{"kind":"arxiv","id":"1308.0148","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0148","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0148v1","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0148","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"W265AVRTVLZ2","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"W265AVRTVLZ2GCZL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"W265AVRT","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:W265AVRTVLZ2GCZLOTGMZXL2GY","target":"record","payload":{"canonical_record":{"source":{"id":"1308.0148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-01T10:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"da10217ddd0e3eedbee0f20c22cbb46eb32b56392cf223e4a07d064dd75ebfb9","abstract_canon_sha256":"28203cee8b812c7da78ba89d16f2a25637b4dc2b49fef9d5842ecab8c2f9c6a0"},"schema_version":"1.0"},"canonical_sha256":"b6bdd05633aaf3a30b2b74ccccdd7a361c1ec3362932ec2a990387802e220df9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:59.689887Z","signature_b64":"4xOSxH+u1ciCnCOZx6eG5l67zfZB/olqh5F1t5JyJKOuYf9Tsr1bjx7CDY0BXIEbxRtdAPuOpn8Dm+NjZN5rDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6bdd05633aaf3a30b2b74ccccdd7a361c1ec3362932ec2a990387802e220df9","last_reissued_at":"2026-05-18T03:16:59.689391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:59.689391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.0148","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-18T03:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"STcPprhMAomCH5elUD0eUMim6axldwbaxWaghrShD42bPZedFJXB6z84ici5N6htzrzKGuEcp/pxlW3AwU7tDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:31:56.734414Z"},"content_sha256":"8ea120a97153f9f4fb48f15362b72cea4b52397766b409b6fb5f2c72509896db","schema_version":"1.0","event_id":"sha256:8ea120a97153f9f4fb48f15362b72cea4b52397766b409b6fb5f2c72509896db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:W265AVRTVLZ2GCZLOTGMZXL2GY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Balancing indivisible real-valued loads in arbitrary networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ivo F. Sbalzarini, Omer Demirel","submitted_at":"2013-08-01T10:32:33Z","abstract_excerpt":"In parallel computing, a problem is divided into a set of smaller tasks that are distributed across multiple processing elements. Balancing the load of the processing elements is key to achieving good performance and scalability. If the computational costs of the individual tasks vary over time in an unpredictable way, dynamic load balancing aims at migrating them between processing elements so as to maintain load balance. During dynamic load balancing, the tasks amount to indivisible work packets with a real-valued cost. For this case of indivisible, real- valued loads, we analyze the balanci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0148","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-18T03:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vzveXLSizP3sYTIhbxLQhxWxry6p5bg3A3aaFTsvr7vkdbXT9mAaPwktYo7NxLFD1FIj2vf8iJt3+IANbcS1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:31:56.735181Z"},"content_sha256":"4896aea8d1631d27b16cefbe64446789db590ad2da365a5679ba74a8f0180db9","schema_version":"1.0","event_id":"sha256:4896aea8d1631d27b16cefbe64446789db590ad2da365a5679ba74a8f0180db9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W265AVRTVLZ2GCZLOTGMZXL2GY/bundle.json","state_url":"https://pith.science/pith/W265AVRTVLZ2GCZLOTGMZXL2GY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W265AVRTVLZ2GCZLOTGMZXL2GY/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-23T21:31:56Z","links":{"resolver":"https://pith.science/pith/W265AVRTVLZ2GCZLOTGMZXL2GY","bundle":"https://pith.science/pith/W265AVRTVLZ2GCZLOTGMZXL2GY/bundle.json","state":"https://pith.science/pith/W265AVRTVLZ2GCZLOTGMZXL2GY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W265AVRTVLZ2GCZLOTGMZXL2GY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:W265AVRTVLZ2GCZLOTGMZXL2GY","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":"28203cee8b812c7da78ba89d16f2a25637b4dc2b49fef9d5842ecab8c2f9c6a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-01T10:32:33Z","title_canon_sha256":"da10217ddd0e3eedbee0f20c22cbb46eb32b56392cf223e4a07d064dd75ebfb9"},"schema_version":"1.0","source":{"id":"1308.0148","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0148","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0148v1","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0148","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"W265AVRTVLZ2","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"W265AVRTVLZ2GCZL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"W265AVRT","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:4896aea8d1631d27b16cefbe64446789db590ad2da365a5679ba74a8f0180db9","target":"graph","created_at":"2026-05-18T03:16:59Z","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 parallel computing, a problem is divided into a set of smaller tasks that are distributed across multiple processing elements. Balancing the load of the processing elements is key to achieving good performance and scalability. If the computational costs of the individual tasks vary over time in an unpredictable way, dynamic load balancing aims at migrating them between processing elements so as to maintain load balance. During dynamic load balancing, the tasks amount to indivisible work packets with a real-valued cost. For this case of indivisible, real- valued loads, we analyze the balanci","authors_text":"Ivo F. Sbalzarini, Omer Demirel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-01T10:32:33Z","title":"Balancing indivisible real-valued loads in arbitrary networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0148","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:8ea120a97153f9f4fb48f15362b72cea4b52397766b409b6fb5f2c72509896db","target":"record","created_at":"2026-05-18T03:16:59Z","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":"28203cee8b812c7da78ba89d16f2a25637b4dc2b49fef9d5842ecab8c2f9c6a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-01T10:32:33Z","title_canon_sha256":"da10217ddd0e3eedbee0f20c22cbb46eb32b56392cf223e4a07d064dd75ebfb9"},"schema_version":"1.0","source":{"id":"1308.0148","kind":"arxiv","version":1}},"canonical_sha256":"b6bdd05633aaf3a30b2b74ccccdd7a361c1ec3362932ec2a990387802e220df9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6bdd05633aaf3a30b2b74ccccdd7a361c1ec3362932ec2a990387802e220df9","first_computed_at":"2026-05-18T03:16:59.689391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:59.689391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4xOSxH+u1ciCnCOZx6eG5l67zfZB/olqh5F1t5JyJKOuYf9Tsr1bjx7CDY0BXIEbxRtdAPuOpn8Dm+NjZN5rDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:59.689887Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.0148","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ea120a97153f9f4fb48f15362b72cea4b52397766b409b6fb5f2c72509896db","sha256:4896aea8d1631d27b16cefbe64446789db590ad2da365a5679ba74a8f0180db9"],"state_sha256":"12291957107e3b74e54705e6c8e27317675539420e4def47aa0d5586a9fbfaf8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R++jsqu+Xqi99edokxFjPQ9Z0PM6nDJc4cYIiuVMUim9J0q1rtd7lSJWiqy6qwvzv3d1hX6EDn7PQ0vy+RGnBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T21:31:56.739409Z","bundle_sha256":"a73f61f6bdb9aa003d12a21c9a8eab8e21b618a32a15746c22ad98f9d9ec1305"}}