{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZGFIGX7AFKFNDNDNMHBDJP2IK3","short_pith_number":"pith:ZGFIGX7A","schema_version":"1.0","canonical_sha256":"c98a835fe02a8ad1b46d61c234bf4856e89358685474ecfaf332733cc947721b","source":{"kind":"arxiv","id":"1902.01898","version":1},"attestation_state":"computed","paper":{"title":"Optimal Divisible Load Scheduling for Resource-Sharing Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fei Wu, Thomas Robertazzi, Yang Cao","submitted_at":"2019-02-05T20:27:06Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1902.01898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-05T20:27:06Z","cross_cats_sorted":[],"title_canon_sha256":"c6c7d0965c364b467010f802bfe8a651cb03378e8b03a9eeba922014dc97cba0","abstract_canon_sha256":"628d54fead0070e603671246b41b7962d1ebaa57e10ef0bb0153a989a44fc95e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:38.490345Z","signature_b64":"Aa7fNSqnjFYv66WNBfa0jhHFZjiB/eE176EW0kpLVTGSP190J3d9tH3/lCFn0RlF+aaz1YOT+4qMpvMY6oZLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c98a835fe02a8ad1b46d61c234bf4856e89358685474ecfaf332733cc947721b","last_reissued_at":"2026-05-17T23:54:38.489690Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:38.489690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Divisible Load Scheduling for Resource-Sharing Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fei Wu, Thomas Robertazzi, Yang Cao","submitted_at":"2019-02-05T20:27:06Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01898","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.01898","created_at":"2026-05-17T23:54:38.489767+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01898v1","created_at":"2026-05-17T23:54:38.489767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01898","created_at":"2026-05-17T23:54:38.489767+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGFIGX7AFKFN","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGFIGX7AFKFNDNDN","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGFIGX7A","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZGFIGX7AFKFNDNDNMHBDJP2IK3","json":"https://pith.science/pith/ZGFIGX7AFKFNDNDNMHBDJP2IK3.json","graph_json":"https://pith.science/api/pith-number/ZGFIGX7AFKFNDNDNMHBDJP2IK3/graph.json","events_json":"https://pith.science/api/pith-number/ZGFIGX7AFKFNDNDNMHBDJP2IK3/events.json","paper":"https://pith.science/paper/ZGFIGX7A"},"agent_actions":{"view_html":"https://pith.science/pith/ZGFIGX7AFKFNDNDNMHBDJP2IK3","download_json":"https://pith.science/pith/ZGFIGX7AFKFNDNDNMHBDJP2IK3.json","view_paper":"https://pith.science/paper/ZGFIGX7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01898&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGFIGX7AFKFNDNDNMHBDJP2IK3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGFIGX7AFKFNDNDNMHBDJP2IK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGFIGX7AFKFNDNDNMHBDJP2IK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGFIGX7AFKFNDNDNMHBDJP2IK3/action/storage_attestation","attest_author":"https://pith.science/pith/ZGFIGX7AFKFNDNDNMHBDJP2IK3/action/author_attestation","sign_citation":"https://pith.science/pith/ZGFIGX7AFKFNDNDNMHBDJP2IK3/action/citation_signature","submit_replication":"https://pith.science/pith/ZGFIGX7AFKFNDNDNMHBDJP2IK3/action/replication_record"}},"created_at":"2026-05-17T23:54:38.489767+00:00","updated_at":"2026-05-17T23:54:38.489767+00:00"}