{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:5LISDYOKTK3C275JQJCXJLQN53","short_pith_number":"pith:5LISDYOK","canonical_record":{"source":{"id":"0806.3827","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-06-24T07:16:26Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"8670cbcd90ef4cf6a0ab1e6baf81c7f0080f67c9f59a4e6972639154bfe454a2","abstract_canon_sha256":"cc734cb40971d1244fbe2148ebc5a43e972bb38027f2d9e3c06d9635b57f2c2d"},"schema_version":"1.0"},"canonical_sha256":"ead121e1ca9ab62d7fa9824574ae0deed52cc4c0107fc0562c5b4b214bc365f1","source":{"kind":"arxiv","id":"0806.3827","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.3827","created_at":"2026-05-18T03:38:05Z"},{"alias_kind":"arxiv_version","alias_value":"0806.3827v2","created_at":"2026-05-18T03:38:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.3827","created_at":"2026-05-18T03:38:05Z"},{"alias_kind":"pith_short_12","alias_value":"5LISDYOKTK3C","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"5LISDYOKTK3C275J","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"5LISDYOK","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:5LISDYOKTK3C275JQJCXJLQN53","target":"record","payload":{"canonical_record":{"source":{"id":"0806.3827","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-06-24T07:16:26Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"8670cbcd90ef4cf6a0ab1e6baf81c7f0080f67c9f59a4e6972639154bfe454a2","abstract_canon_sha256":"cc734cb40971d1244fbe2148ebc5a43e972bb38027f2d9e3c06d9635b57f2c2d"},"schema_version":"1.0"},"canonical_sha256":"ead121e1ca9ab62d7fa9824574ae0deed52cc4c0107fc0562c5b4b214bc365f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:05.269762Z","signature_b64":"nV3qkT1OEgx5Qy52NtqvsRfGgQ77vvL9HBEMwxhc5RdmiBpxH6bZnzpjniZewkP0qTcxrl0cxqQnT9xZEY1NDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ead121e1ca9ab62d7fa9824574ae0deed52cc4c0107fc0562c5b4b214bc365f1","last_reissued_at":"2026-05-18T03:38:05.269288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:05.269288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0806.3827","source_version":2,"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:38:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bmI3y/7tV4x4nsNv+dv6g52AA2YD15BSh3PP9Qey51uTPSlMHG28F8iUoNlrIp8AigYpH9p1oRRtFGAsw7PpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:08:27.682693Z"},"content_sha256":"c18dd72c0c1401d638022faa6e5fdeb7bd363006985d5feebfad8d66c0681fab","schema_version":"1.0","event_id":"sha256:c18dd72c0c1401d638022faa6e5fdeb7bd363006985d5feebfad8d66c0681fab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:5LISDYOKTK3C275JQJCXJLQN53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Mugurel Ionut Andreica","submitted_at":"2008-06-24T07:16:26Z","abstract_excerpt":"In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, I present a novel, heuristic, algorithm for scheduling files with divisible sizes on multiple disjoint paths, in order to maximize the total profit (the problem is equivalent to the multiple knapsack problem with divisible item sizes). I then consider a cost optimization problem for transferring a sequence of identical files, subject to time constraints imposed by the data transfer providers. For the online case I pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.3827","kind":"arxiv","version":2},"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:38:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h4EtRVaNAdLjQnIgj8R2IlXFcIE4lnxY6tieyoySDAb1o28uMksnjIg5HlvUPNYh4oRiF0krISfEDOsuDLx1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:08:27.683381Z"},"content_sha256":"14456680c1daecd62bdc65d6535bfa25c95f6832f9167f599ea2ecab89753a44","schema_version":"1.0","event_id":"sha256:14456680c1daecd62bdc65d6535bfa25c95f6832f9167f599ea2ecab89753a44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LISDYOKTK3C275JQJCXJLQN53/bundle.json","state_url":"https://pith.science/pith/5LISDYOKTK3C275JQJCXJLQN53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LISDYOKTK3C275JQJCXJLQN53/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-07T23:08:27Z","links":{"resolver":"https://pith.science/pith/5LISDYOKTK3C275JQJCXJLQN53","bundle":"https://pith.science/pith/5LISDYOKTK3C275JQJCXJLQN53/bundle.json","state":"https://pith.science/pith/5LISDYOKTK3C275JQJCXJLQN53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LISDYOKTK3C275JQJCXJLQN53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:5LISDYOKTK3C275JQJCXJLQN53","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":"cc734cb40971d1244fbe2148ebc5a43e972bb38027f2d9e3c06d9635b57f2c2d","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-06-24T07:16:26Z","title_canon_sha256":"8670cbcd90ef4cf6a0ab1e6baf81c7f0080f67c9f59a4e6972639154bfe454a2"},"schema_version":"1.0","source":{"id":"0806.3827","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.3827","created_at":"2026-05-18T03:38:05Z"},{"alias_kind":"arxiv_version","alias_value":"0806.3827v2","created_at":"2026-05-18T03:38:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.3827","created_at":"2026-05-18T03:38:05Z"},{"alias_kind":"pith_short_12","alias_value":"5LISDYOKTK3C","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"5LISDYOKTK3C275J","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"5LISDYOK","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:14456680c1daecd62bdc65d6535bfa25c95f6832f9167f599ea2ecab89753a44","target":"graph","created_at":"2026-05-18T03:38:05Z","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 I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, I present a novel, heuristic, algorithm for scheduling files with divisible sizes on multiple disjoint paths, in order to maximize the total profit (the problem is equivalent to the multiple knapsack problem with divisible item sizes). I then consider a cost optimization problem for transferring a sequence of identical files, subject to time constraints imposed by the data transfer providers. For the online case I pro","authors_text":"Mugurel Ionut Andreica","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-06-24T07:16:26Z","title":"Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.3827","kind":"arxiv","version":2},"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:c18dd72c0c1401d638022faa6e5fdeb7bd363006985d5feebfad8d66c0681fab","target":"record","created_at":"2026-05-18T03:38:05Z","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":"cc734cb40971d1244fbe2148ebc5a43e972bb38027f2d9e3c06d9635b57f2c2d","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-06-24T07:16:26Z","title_canon_sha256":"8670cbcd90ef4cf6a0ab1e6baf81c7f0080f67c9f59a4e6972639154bfe454a2"},"schema_version":"1.0","source":{"id":"0806.3827","kind":"arxiv","version":2}},"canonical_sha256":"ead121e1ca9ab62d7fa9824574ae0deed52cc4c0107fc0562c5b4b214bc365f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ead121e1ca9ab62d7fa9824574ae0deed52cc4c0107fc0562c5b4b214bc365f1","first_computed_at":"2026-05-18T03:38:05.269288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:05.269288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nV3qkT1OEgx5Qy52NtqvsRfGgQ77vvL9HBEMwxhc5RdmiBpxH6bZnzpjniZewkP0qTcxrl0cxqQnT9xZEY1NDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:05.269762Z","signed_message":"canonical_sha256_bytes"},"source_id":"0806.3827","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c18dd72c0c1401d638022faa6e5fdeb7bd363006985d5feebfad8d66c0681fab","sha256:14456680c1daecd62bdc65d6535bfa25c95f6832f9167f599ea2ecab89753a44"],"state_sha256":"0a63210c1465ffb2cf45e7d4fedc4088ca7ece5dba22ac4562fc6279a6aacdb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ILglP+hilK+9CRjpHS2RiYtgNMs3UxDfDZX5M4u82HMWeEIn4ioIXQ1fixqs/LA+1yTf7Upf+8cfZqaK7uUMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:08:27.687211Z","bundle_sha256":"1345d86ca9ac211f5968828341b4f42210a7ad913130c71990ec67dc74c7c6c7"}}