{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EDVB55XOIVZ2Y5NF7KAZD4XLGG","short_pith_number":"pith:EDVB55XO","schema_version":"1.0","canonical_sha256":"20ea1ef6ee4573ac75a5fa8191f2eb319211c7bc1706461768d1635fb9a868b9","source":{"kind":"arxiv","id":"1307.2984","version":1},"attestation_state":"computed","paper":{"title":"Content Distribution by Multiple Multicast Trees and Intersession Cooperation: Optimal Algorithms and Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chunglae Cho, Xiaoying Zheng, Ye Xia","submitted_at":"2013-07-11T06:00:20Z","abstract_excerpt":"In traditional massive content distribution with multiple sessions, the sessions form separate overlay networks and operate independently, where some sessions may suffer from insufficient resources even though other sessions have excessive resources. To cope with this problem, we consider the universal swarming approach, which allows multiple sessions to cooperate with each other. We formulate the problem of finding the optimal resource allocation to maximize the sum of the session utilities and present a subgradient algorithm which converges to the optimal solution in the time-average sense. "},"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":"1307.2984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-11T06:00:20Z","cross_cats_sorted":[],"title_canon_sha256":"070975ecf229b16be2b3d4de8fcae69426cbb5bf02151175e0f312d0ce0b7791","abstract_canon_sha256":"4d45047b5d37682e58e13ed6ffd6ba813393bb6b6cf15af1fb604c2ea6a5a9c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:41.698749Z","signature_b64":"yuAEJOo//4vYbQpaktYG1cBfPDoceznAJNCsaQZPGXY2LuAlB56QIwrGSeRlCtYSgUs6wyBdMNGR5bjHKLzSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20ea1ef6ee4573ac75a5fa8191f2eb319211c7bc1706461768d1635fb9a868b9","last_reissued_at":"2026-05-18T03:18:41.697876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:41.697876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Content Distribution by Multiple Multicast Trees and Intersession Cooperation: Optimal Algorithms and Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chunglae Cho, Xiaoying Zheng, Ye Xia","submitted_at":"2013-07-11T06:00:20Z","abstract_excerpt":"In traditional massive content distribution with multiple sessions, the sessions form separate overlay networks and operate independently, where some sessions may suffer from insufficient resources even though other sessions have excessive resources. To cope with this problem, we consider the universal swarming approach, which allows multiple sessions to cooperate with each other. We formulate the problem of finding the optimal resource allocation to maximize the sum of the session utilities and present a subgradient algorithm which converges to the optimal solution in the time-average sense. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2984","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":"1307.2984","created_at":"2026-05-18T03:18:41.698025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2984v1","created_at":"2026-05-18T03:18:41.698025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2984","created_at":"2026-05-18T03:18:41.698025+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDVB55XOIVZ2","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDVB55XOIVZ2Y5NF","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDVB55XO","created_at":"2026-05-18T12:27:43.054852+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/EDVB55XOIVZ2Y5NF7KAZD4XLGG","json":"https://pith.science/pith/EDVB55XOIVZ2Y5NF7KAZD4XLGG.json","graph_json":"https://pith.science/api/pith-number/EDVB55XOIVZ2Y5NF7KAZD4XLGG/graph.json","events_json":"https://pith.science/api/pith-number/EDVB55XOIVZ2Y5NF7KAZD4XLGG/events.json","paper":"https://pith.science/paper/EDVB55XO"},"agent_actions":{"view_html":"https://pith.science/pith/EDVB55XOIVZ2Y5NF7KAZD4XLGG","download_json":"https://pith.science/pith/EDVB55XOIVZ2Y5NF7KAZD4XLGG.json","view_paper":"https://pith.science/paper/EDVB55XO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2984&json=true","fetch_graph":"https://pith.science/api/pith-number/EDVB55XOIVZ2Y5NF7KAZD4XLGG/graph.json","fetch_events":"https://pith.science/api/pith-number/EDVB55XOIVZ2Y5NF7KAZD4XLGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDVB55XOIVZ2Y5NF7KAZD4XLGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDVB55XOIVZ2Y5NF7KAZD4XLGG/action/storage_attestation","attest_author":"https://pith.science/pith/EDVB55XOIVZ2Y5NF7KAZD4XLGG/action/author_attestation","sign_citation":"https://pith.science/pith/EDVB55XOIVZ2Y5NF7KAZD4XLGG/action/citation_signature","submit_replication":"https://pith.science/pith/EDVB55XOIVZ2Y5NF7KAZD4XLGG/action/replication_record"}},"created_at":"2026-05-18T03:18:41.698025+00:00","updated_at":"2026-05-18T03:18:41.698025+00:00"}