{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZGFIGX7AFKFNDNDNMHBDJP2IK3","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":"628d54fead0070e603671246b41b7962d1ebaa57e10ef0bb0153a989a44fc95e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-05T20:27:06Z","title_canon_sha256":"c6c7d0965c364b467010f802bfe8a651cb03378e8b03a9eeba922014dc97cba0"},"schema_version":"1.0","source":{"id":"1902.01898","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01898","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01898v1","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01898","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZGFIGX7AFKFN","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZGFIGX7AFKFNDNDN","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZGFIGX7A","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:9f7197ac4006ac4eccc7a38c5840c0c7293876d21f4c25b3ae502f3ff56f919b","target":"graph","created_at":"2026-05-17T23:54:38Z","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":"Scheduling is an important task allowing parallel systems to perform efficiently and reliably. For modern computation systems, divisible load is a special type of data which can be divided into arbitrary sizes and independently processed in parallel. Such loads are commonly encountered in applications which are processing a great amount of similar data units. For a multi-task processor, the processor's speed may be time-varying due to the arrival and departure of other background jobs. This paper studies an optimal divisible loads scheduling problem on a single level tree network, whose proces","authors_text":"Fei Wu, Thomas Robertazzi, Yang Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-05T20:27:06Z","title":"Optimal Divisible Load Scheduling for Resource-Sharing Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01898","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:764b26b1e68decf94897e54c2db5219ee5d3053de72120eaefb46fbee6abeb90","target":"record","created_at":"2026-05-17T23:54:38Z","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":"628d54fead0070e603671246b41b7962d1ebaa57e10ef0bb0153a989a44fc95e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-05T20:27:06Z","title_canon_sha256":"c6c7d0965c364b467010f802bfe8a651cb03378e8b03a9eeba922014dc97cba0"},"schema_version":"1.0","source":{"id":"1902.01898","kind":"arxiv","version":1}},"canonical_sha256":"c98a835fe02a8ad1b46d61c234bf4856e89358685474ecfaf332733cc947721b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c98a835fe02a8ad1b46d61c234bf4856e89358685474ecfaf332733cc947721b","first_computed_at":"2026-05-17T23:54:38.489690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:38.489690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Aa7fNSqnjFYv66WNBfa0jhHFZjiB/eE176EW0kpLVTGSP190J3d9tH3/lCFn0RlF+aaz1YOT+4qMpvMY6oZLCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:38.490345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01898","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:764b26b1e68decf94897e54c2db5219ee5d3053de72120eaefb46fbee6abeb90","sha256:9f7197ac4006ac4eccc7a38c5840c0c7293876d21f4c25b3ae502f3ff56f919b"],"state_sha256":"44c7981a97131ad676a72ee05101a5b3a6aca984dc9fbfe416e6858da52041fe"}