{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HGMVMJIKQJKBEAI25GOX564HF4","short_pith_number":"pith:HGMVMJIK","canonical_record":{"source":{"id":"1902.04463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-12T16:06:52Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a587997cbe6a0028d703de4769b7a9de7ce2292f605f623978fa2530a38e573d","abstract_canon_sha256":"6a7cbd039141507304ff87838f3521a14b78c6a25976fc83b0dde3cb16c41593"},"schema_version":"1.0"},"canonical_sha256":"399956250a825412011ae99d7efb872f2192577a4c46bf99eacbe6a84d748df7","source":{"kind":"arxiv","id":"1902.04463","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04463","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04463v1","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04463","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"pith_short_12","alias_value":"HGMVMJIKQJKB","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGMVMJIKQJKBEAI2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGMVMJIK","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HGMVMJIKQJKBEAI25GOX564HF4","target":"record","payload":{"canonical_record":{"source":{"id":"1902.04463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-12T16:06:52Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a587997cbe6a0028d703de4769b7a9de7ce2292f605f623978fa2530a38e573d","abstract_canon_sha256":"6a7cbd039141507304ff87838f3521a14b78c6a25976fc83b0dde3cb16c41593"},"schema_version":"1.0"},"canonical_sha256":"399956250a825412011ae99d7efb872f2192577a4c46bf99eacbe6a84d748df7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:12.205066Z","signature_b64":"L2YX43tAzzjCPeqZ5vhCv5tQkdOX/h9BKMVce+YNAqjVIfIcS6Kl+R3x6Y8N6QiuiyW7z/V7rnIM+t0Aqsg6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"399956250a825412011ae99d7efb872f2192577a4c46bf99eacbe6a84d748df7","last_reissued_at":"2026-05-17T23:54:12.204594Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:12.204594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.04463","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-17T23:54:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/pDN94Y8XXfYY/pBY/7CXeim2xa+P3Ya360UBuZ4LvGB06ruwldHfFKsUp2AyitA43MmAvMvrBXuAua2eO9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:52:35.120224Z"},"content_sha256":"0b8e33797f5baa29418660c3c282ab41987497050e05630c8611e0fcef9b156d","schema_version":"1.0","event_id":"sha256:0b8e33797f5baa29418660c3c282ab41987497050e05630c8611e0fcef9b156d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HGMVMJIKQJKBEAI25GOX564HF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Communication Cost Aware Load Balancing in Content Delivery Networks using Honeybee Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Hamid Ghasemi, Mahdi Jafari Siavoshani, Saeed Hadadan","submitted_at":"2019-02-12T16:06:52Z","abstract_excerpt":"Modern web services rely on Content Delivery Networks (CDNs) to efficiently deliver contents to end users. In order to minimize the experienced communication cost, it is necessary to send the end user's requests to the nearest servers. However, it is shown that this naive method causes some servers to get overloaded. Similarly, when distributing the requests to avoid overloading, the communication cost increases. This is a well-known trade-off between communication cost and load balancing in CDNs.\n  In this work, by introducing a new meta-heuristic algorithm, we try to optimize this trade-off,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04463","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-17T23:54:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oSBXvrPOixeyGNlc3+4B/fLs+kLk1ljdhmbrRjI9gy4BWXF6Xv8LhPota1+gkywVyNJ4FnYt8DeoqUNEmXqbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:52:35.120909Z"},"content_sha256":"d1295471a04ce5cb230ffc928bec0fb76556ae8d6b4c6c5c1aa5494736d8d521","schema_version":"1.0","event_id":"sha256:d1295471a04ce5cb230ffc928bec0fb76556ae8d6b4c6c5c1aa5494736d8d521"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGMVMJIKQJKBEAI25GOX564HF4/bundle.json","state_url":"https://pith.science/pith/HGMVMJIKQJKBEAI25GOX564HF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGMVMJIKQJKBEAI25GOX564HF4/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-07T02:52:35Z","links":{"resolver":"https://pith.science/pith/HGMVMJIKQJKBEAI25GOX564HF4","bundle":"https://pith.science/pith/HGMVMJIKQJKBEAI25GOX564HF4/bundle.json","state":"https://pith.science/pith/HGMVMJIKQJKBEAI25GOX564HF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGMVMJIKQJKBEAI25GOX564HF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HGMVMJIKQJKBEAI25GOX564HF4","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":"6a7cbd039141507304ff87838f3521a14b78c6a25976fc83b0dde3cb16c41593","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-12T16:06:52Z","title_canon_sha256":"a587997cbe6a0028d703de4769b7a9de7ce2292f605f623978fa2530a38e573d"},"schema_version":"1.0","source":{"id":"1902.04463","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04463","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04463v1","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04463","created_at":"2026-05-17T23:54:12Z"},{"alias_kind":"pith_short_12","alias_value":"HGMVMJIKQJKB","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGMVMJIKQJKBEAI2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGMVMJIK","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:d1295471a04ce5cb230ffc928bec0fb76556ae8d6b4c6c5c1aa5494736d8d521","target":"graph","created_at":"2026-05-17T23:54:12Z","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":"Modern web services rely on Content Delivery Networks (CDNs) to efficiently deliver contents to end users. In order to minimize the experienced communication cost, it is necessary to send the end user's requests to the nearest servers. However, it is shown that this naive method causes some servers to get overloaded. Similarly, when distributing the requests to avoid overloading, the communication cost increases. This is a well-known trade-off between communication cost and load balancing in CDNs.\n  In this work, by introducing a new meta-heuristic algorithm, we try to optimize this trade-off,","authors_text":"Hamid Ghasemi, Mahdi Jafari Siavoshani, Saeed Hadadan","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-12T16:06:52Z","title":"A Novel Communication Cost Aware Load Balancing in Content Delivery Networks using Honeybee Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04463","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:0b8e33797f5baa29418660c3c282ab41987497050e05630c8611e0fcef9b156d","target":"record","created_at":"2026-05-17T23:54:12Z","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":"6a7cbd039141507304ff87838f3521a14b78c6a25976fc83b0dde3cb16c41593","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-12T16:06:52Z","title_canon_sha256":"a587997cbe6a0028d703de4769b7a9de7ce2292f605f623978fa2530a38e573d"},"schema_version":"1.0","source":{"id":"1902.04463","kind":"arxiv","version":1}},"canonical_sha256":"399956250a825412011ae99d7efb872f2192577a4c46bf99eacbe6a84d748df7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"399956250a825412011ae99d7efb872f2192577a4c46bf99eacbe6a84d748df7","first_computed_at":"2026-05-17T23:54:12.204594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:12.204594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L2YX43tAzzjCPeqZ5vhCv5tQkdOX/h9BKMVce+YNAqjVIfIcS6Kl+R3x6Y8N6QiuiyW7z/V7rnIM+t0Aqsg6Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:12.205066Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.04463","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b8e33797f5baa29418660c3c282ab41987497050e05630c8611e0fcef9b156d","sha256:d1295471a04ce5cb230ffc928bec0fb76556ae8d6b4c6c5c1aa5494736d8d521"],"state_sha256":"94ebc868e556eb4f72c4a447badf82b8ca7957eb9d5c7da0a216b3e4c08d25d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPcdeVG1LWvQVFpq5LlnWdFO7aPd01xsRMTFztxZORkqZ5S7z5QyxP5t54B1Hr6+fc4HtZYXFE9JH+sCV7IACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T02:52:35.125040Z","bundle_sha256":"e7463cab3a0ad69e8f8a58f54387e3cd01f2a851b478b99939d2f37df07c70fe"}}