{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ATWP77AW7W6ICURP72EVLOTFEG","short_pith_number":"pith:ATWP77AW","canonical_record":{"source":{"id":"1610.04513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-10-14T16:05:50Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b62f66469cd5749fbae477c80a4d2c46a645426700d118614c2ef26d0765511d","abstract_canon_sha256":"ca84cd4c0a3c1d8076f760696474684aa149bf48eaeb2156a148e4e9c65583d8"},"schema_version":"1.0"},"canonical_sha256":"04ecfffc16fdbc81522ffe8955ba6521b84c4c1de1f6b3be2c9a4ec79578fd38","source":{"kind":"arxiv","id":"1610.04513","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04513","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04513v1","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04513","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"ATWP77AW7W6I","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ATWP77AW7W6ICURP","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ATWP77AW","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ATWP77AW7W6ICURP72EVLOTFEG","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-10-14T16:05:50Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b62f66469cd5749fbae477c80a4d2c46a645426700d118614c2ef26d0765511d","abstract_canon_sha256":"ca84cd4c0a3c1d8076f760696474684aa149bf48eaeb2156a148e4e9c65583d8"},"schema_version":"1.0"},"canonical_sha256":"04ecfffc16fdbc81522ffe8955ba6521b84c4c1de1f6b3be2c9a4ec79578fd38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:14.886736Z","signature_b64":"zEM0thx6LCR4GdYHVD3MuW2vxz+kL5lNP4UQPY2i0d9Yz5oBJaTrbnLl7KQm8ZHDPyPKaEuEP2D53e8A1sILDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04ecfffc16fdbc81522ffe8955ba6521b84c4c1de1f6b3be2c9a4ec79578fd38","last_reissued_at":"2026-05-18T01:02:14.886054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:14.886054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04513","source_version":1,"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-18T01:02:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GW8yyxjzjo2KiPeyTvaXXTIjZbzTthhOtRCkKZ0X3f+lXgMIX1moTUNl++t5gw00dQHEISR6SDVGFOzlD6L+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:30:29.489720Z"},"content_sha256":"8e0986cd9e0381aac7914a5609c444227c9f2e07b890eca0c9feec8d5e3d5caa","schema_version":"1.0","event_id":"sha256:8e0986cd9e0381aac7914a5609c444227c9f2e07b890eca0c9feec8d5e3d5caa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ATWP77AW7W6ICURP72EVLOTFEG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Communication Cost vs. Load Balancing in Content Delivery Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Ali Pourmiri, Hamid Ghasemi, Mahdi Jafari Siavoshani, Seyed Pooya Shariatpanahi","submitted_at":"2016-10-14T16:05:50Z","abstract_excerpt":"It is well known that load balancing and low delivery communication cost are two critical issues in mapping requests to servers in Content Delivery Networks (CDNs). However, the trade-off between these two performance metrics has not been yet quantitatively investigated in designing efficient request mapping schemes. In this work, we formalize this trade-off through a stochastic optimization problem. While the solutions to the problem in the extreme cases of minimum communication cost and optimum load balancing can be derived in closed form, finding the general solution is hard to derive. Thus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04513","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"},"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-18T01:02:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qU6uf1qdi6OKvBkEPckPTENYtXHz2546a5XgzJzMwlg6QYhxnc2Ap0K4mz6KbsCcn7Up4XPdusUFEi1HPCJeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:30:29.490418Z"},"content_sha256":"17cddd77fca16bba6774018dccf2bb97fa18a961e8991b2c7026d479672d3e48","schema_version":"1.0","event_id":"sha256:17cddd77fca16bba6774018dccf2bb97fa18a961e8991b2c7026d479672d3e48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATWP77AW7W6ICURP72EVLOTFEG/bundle.json","state_url":"https://pith.science/pith/ATWP77AW7W6ICURP72EVLOTFEG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATWP77AW7W6ICURP72EVLOTFEG/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-07T17:30:29Z","links":{"resolver":"https://pith.science/pith/ATWP77AW7W6ICURP72EVLOTFEG","bundle":"https://pith.science/pith/ATWP77AW7W6ICURP72EVLOTFEG/bundle.json","state":"https://pith.science/pith/ATWP77AW7W6ICURP72EVLOTFEG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATWP77AW7W6ICURP72EVLOTFEG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ATWP77AW7W6ICURP72EVLOTFEG","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":"ca84cd4c0a3c1d8076f760696474684aa149bf48eaeb2156a148e4e9c65583d8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-10-14T16:05:50Z","title_canon_sha256":"b62f66469cd5749fbae477c80a4d2c46a645426700d118614c2ef26d0765511d"},"schema_version":"1.0","source":{"id":"1610.04513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04513","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04513v1","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04513","created_at":"2026-05-18T01:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"ATWP77AW7W6I","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ATWP77AW7W6ICURP","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ATWP77AW","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:17cddd77fca16bba6774018dccf2bb97fa18a961e8991b2c7026d479672d3e48","target":"graph","created_at":"2026-05-18T01:02:14Z","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":"It is well known that load balancing and low delivery communication cost are two critical issues in mapping requests to servers in Content Delivery Networks (CDNs). However, the trade-off between these two performance metrics has not been yet quantitatively investigated in designing efficient request mapping schemes. In this work, we formalize this trade-off through a stochastic optimization problem. While the solutions to the problem in the extreme cases of minimum communication cost and optimum load balancing can be derived in closed form, finding the general solution is hard to derive. Thus","authors_text":"Ali Pourmiri, Hamid Ghasemi, Mahdi Jafari Siavoshani, Seyed Pooya Shariatpanahi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-10-14T16:05:50Z","title":"On Communication Cost vs. Load Balancing in Content Delivery Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04513","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:8e0986cd9e0381aac7914a5609c444227c9f2e07b890eca0c9feec8d5e3d5caa","target":"record","created_at":"2026-05-18T01:02:14Z","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":"ca84cd4c0a3c1d8076f760696474684aa149bf48eaeb2156a148e4e9c65583d8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-10-14T16:05:50Z","title_canon_sha256":"b62f66469cd5749fbae477c80a4d2c46a645426700d118614c2ef26d0765511d"},"schema_version":"1.0","source":{"id":"1610.04513","kind":"arxiv","version":1}},"canonical_sha256":"04ecfffc16fdbc81522ffe8955ba6521b84c4c1de1f6b3be2c9a4ec79578fd38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04ecfffc16fdbc81522ffe8955ba6521b84c4c1de1f6b3be2c9a4ec79578fd38","first_computed_at":"2026-05-18T01:02:14.886054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:14.886054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zEM0thx6LCR4GdYHVD3MuW2vxz+kL5lNP4UQPY2i0d9Yz5oBJaTrbnLl7KQm8ZHDPyPKaEuEP2D53e8A1sILDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:14.886736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e0986cd9e0381aac7914a5609c444227c9f2e07b890eca0c9feec8d5e3d5caa","sha256:17cddd77fca16bba6774018dccf2bb97fa18a961e8991b2c7026d479672d3e48"],"state_sha256":"3926e53aba7a2889b2c1316a9059cb6838d1c33ac1ae361e6ee6a4dda6833612"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aW0aXwNrrjGUblhhvXwuhRb7Fpqp30vhbD/rc5OIvU3/yteZ+HKZonaAm47JxEbF+sAgsrgkYiS7CXxrHQS3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:30:29.493952Z","bundle_sha256":"007a576fb9482784ac64ea87610adf962bb1bb1974d86ee984b276f58830974a"}}