{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:GKVMFWJFIUHFKX6INLQJDIE4F2","short_pith_number":"pith:GKVMFWJF","schema_version":"1.0","canonical_sha256":"32aac2d925450e555fc86ae091a09c2e96fb4fc888b8ddba6b4aa848a58599d9","source":{"kind":"arxiv","id":"1002.3449","version":2},"attestation_state":"computed","paper":{"title":"Minimizing weighted sum download time for one-to-many file transfer in peer-to-peer networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Bike Xie, Mihaela van der Schaar, Richard D. Wesel","submitted_at":"2010-02-18T08:08:50Z","abstract_excerpt":"This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weighted sum download time (WSDT) for the one-to-many file transfer. Previous work has shown that, given an order at which the receivers finish downloading, the minimum WSD can be solved in polynomial time by convex optimization, and can be achieved by linear network coding, assuming that node uplinks are the only bottleneck in the network. This paper, however, considers heterogeneous peers with both uplink and downlink bandwidth c"},"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":"1002.3449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-18T08:08:50Z","cross_cats_sorted":["cs.NI","math.IT","math.OC"],"title_canon_sha256":"8aa00217e5cc04b712e2ac0cdeccc0059f60c0130f67fd55d3b623421b3f0440","abstract_canon_sha256":"41e82fa3d823a7f1d5dc33fe5b84ab90bae2e77578cb2877a1d3cd0b461a709b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:46.293750Z","signature_b64":"ZwoTW3WOVaGpx96EIDAH7vmk2md7iIF5PDqrCuM/DjQMqC38NMabwZjzBjh64BoRL1DdPWxzm4NpiZFMjqscCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32aac2d925450e555fc86ae091a09c2e96fb4fc888b8ddba6b4aa848a58599d9","last_reissued_at":"2026-05-18T04:18:46.293270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:46.293270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing weighted sum download time for one-to-many file transfer in peer-to-peer networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Bike Xie, Mihaela van der Schaar, Richard D. Wesel","submitted_at":"2010-02-18T08:08:50Z","abstract_excerpt":"This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weighted sum download time (WSDT) for the one-to-many file transfer. Previous work has shown that, given an order at which the receivers finish downloading, the minimum WSD can be solved in polynomial time by convex optimization, and can be achieved by linear network coding, assuming that node uplinks are the only bottleneck in the network. This paper, however, considers heterogeneous peers with both uplink and downlink bandwidth c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.3449","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1002.3449","created_at":"2026-05-18T04:18:46.293347+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.3449v2","created_at":"2026-05-18T04:18:46.293347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.3449","created_at":"2026-05-18T04:18:46.293347+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKVMFWJFIUHF","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKVMFWJFIUHFKX6I","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKVMFWJF","created_at":"2026-05-18T12:26:07.630475+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/GKVMFWJFIUHFKX6INLQJDIE4F2","json":"https://pith.science/pith/GKVMFWJFIUHFKX6INLQJDIE4F2.json","graph_json":"https://pith.science/api/pith-number/GKVMFWJFIUHFKX6INLQJDIE4F2/graph.json","events_json":"https://pith.science/api/pith-number/GKVMFWJFIUHFKX6INLQJDIE4F2/events.json","paper":"https://pith.science/paper/GKVMFWJF"},"agent_actions":{"view_html":"https://pith.science/pith/GKVMFWJFIUHFKX6INLQJDIE4F2","download_json":"https://pith.science/pith/GKVMFWJFIUHFKX6INLQJDIE4F2.json","view_paper":"https://pith.science/paper/GKVMFWJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.3449&json=true","fetch_graph":"https://pith.science/api/pith-number/GKVMFWJFIUHFKX6INLQJDIE4F2/graph.json","fetch_events":"https://pith.science/api/pith-number/GKVMFWJFIUHFKX6INLQJDIE4F2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKVMFWJFIUHFKX6INLQJDIE4F2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKVMFWJFIUHFKX6INLQJDIE4F2/action/storage_attestation","attest_author":"https://pith.science/pith/GKVMFWJFIUHFKX6INLQJDIE4F2/action/author_attestation","sign_citation":"https://pith.science/pith/GKVMFWJFIUHFKX6INLQJDIE4F2/action/citation_signature","submit_replication":"https://pith.science/pith/GKVMFWJFIUHFKX6INLQJDIE4F2/action/replication_record"}},"created_at":"2026-05-18T04:18:46.293347+00:00","updated_at":"2026-05-18T04:18:46.293347+00:00"}