{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ROYBO2W5T26ARQKYANIH3R2AGF","short_pith_number":"pith:ROYBO2W5","canonical_record":{"source":{"id":"1503.00265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-01T12:37:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5b608d30f2e344c46dfbbd3788f467b00eae878e33cca9c15f2af670aba2678b","abstract_canon_sha256":"2d5aad20edd5deb3791f727acf72a2d6d6152317e6db3121404f2e8706b0557d"},"schema_version":"1.0"},"canonical_sha256":"8bb0176add9ebc08c15803507dc740315a770e316933520e95303acbf5ce189b","source":{"kind":"arxiv","id":"1503.00265","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00265","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00265v1","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00265","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"pith_short_12","alias_value":"ROYBO2W5T26A","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"ROYBO2W5T26ARQKY","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"ROYBO2W5","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ROYBO2W5T26ARQKYANIH3R2AGF","target":"record","payload":{"canonical_record":{"source":{"id":"1503.00265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-01T12:37:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5b608d30f2e344c46dfbbd3788f467b00eae878e33cca9c15f2af670aba2678b","abstract_canon_sha256":"2d5aad20edd5deb3791f727acf72a2d6d6152317e6db3121404f2e8706b0557d"},"schema_version":"1.0"},"canonical_sha256":"8bb0176add9ebc08c15803507dc740315a770e316933520e95303acbf5ce189b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:54.807529Z","signature_b64":"2ptQU1wEW4ZuiIvOMxILB9DgDO9Wwt1WhZ+5KJlqTUQN0UKqOApZq7sMthk58ly60GFky4qo2UVf2EPJJjcNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bb0176add9ebc08c15803507dc740315a770e316933520e95303acbf5ce189b","last_reissued_at":"2026-05-18T02:25:54.807157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:54.807157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.00265","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-18T02:25:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XwurB01QHVhCzaA+ZO35NohqsshVxVDiwYW+PrQ8mwoxD5feyGE2fvwkRxMxwRGJZMHTzSlwdY72cWzirow2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:47:51.077668Z"},"content_sha256":"412fbdfe961f351699afd91f5391adc6d6af6dc2192104f163ab5b44956552c5","schema_version":"1.0","event_id":"sha256:412fbdfe961f351699afd91f5391adc6d6af6dc2192104f163ab5b44956552c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ROYBO2W5T26ARQKYANIH3R2AGF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Server Coded Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Babak Hossein Khalaj, Seyed Abolfazl Motahari, Seyed Pooya Shariatpanahi","submitted_at":"2015-03-01T12:37:32Z","abstract_excerpt":"In this paper, we consider multiple cache-enabled clients connected to multiple servers through an intermediate network. We design several topology-aware coding strategies for such networks. Based on topology richness of the intermediate network, and types of coding operations at internal nodes, we define three classes of networks, namely, dedicated, flexible, and linear networks. For each class, we propose an achievable coding scheme, analyze its coding delay, and also, compare it with an information theoretic lower bound. For flexible networks, we show that our scheme is order-optimal in ter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00265","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-18T02:25:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OcWIhqavpZaEkL0xJammimxNAf0VqoOkpLWk3YnAGkcXdoRdupROFeGccSZwTcA+Rbh74tkH5ltoMJlwhg6OCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:47:51.078021Z"},"content_sha256":"2632a50485a88b9112e41a05ce6af37f5fc1e8cae21dbbd53f823fc2316a336e","schema_version":"1.0","event_id":"sha256:2632a50485a88b9112e41a05ce6af37f5fc1e8cae21dbbd53f823fc2316a336e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROYBO2W5T26ARQKYANIH3R2AGF/bundle.json","state_url":"https://pith.science/pith/ROYBO2W5T26ARQKYANIH3R2AGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROYBO2W5T26ARQKYANIH3R2AGF/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-05T12:47:51Z","links":{"resolver":"https://pith.science/pith/ROYBO2W5T26ARQKYANIH3R2AGF","bundle":"https://pith.science/pith/ROYBO2W5T26ARQKYANIH3R2AGF/bundle.json","state":"https://pith.science/pith/ROYBO2W5T26ARQKYANIH3R2AGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROYBO2W5T26ARQKYANIH3R2AGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ROYBO2W5T26ARQKYANIH3R2AGF","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":"2d5aad20edd5deb3791f727acf72a2d6d6152317e6db3121404f2e8706b0557d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-01T12:37:32Z","title_canon_sha256":"5b608d30f2e344c46dfbbd3788f467b00eae878e33cca9c15f2af670aba2678b"},"schema_version":"1.0","source":{"id":"1503.00265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00265","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00265v1","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00265","created_at":"2026-05-18T02:25:54Z"},{"alias_kind":"pith_short_12","alias_value":"ROYBO2W5T26A","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"ROYBO2W5T26ARQKY","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"ROYBO2W5","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:2632a50485a88b9112e41a05ce6af37f5fc1e8cae21dbbd53f823fc2316a336e","target":"graph","created_at":"2026-05-18T02:25:54Z","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, we consider multiple cache-enabled clients connected to multiple servers through an intermediate network. We design several topology-aware coding strategies for such networks. Based on topology richness of the intermediate network, and types of coding operations at internal nodes, we define three classes of networks, namely, dedicated, flexible, and linear networks. For each class, we propose an achievable coding scheme, analyze its coding delay, and also, compare it with an information theoretic lower bound. For flexible networks, we show that our scheme is order-optimal in ter","authors_text":"Babak Hossein Khalaj, Seyed Abolfazl Motahari, Seyed Pooya Shariatpanahi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-01T12:37:32Z","title":"Multi-Server Coded Caching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00265","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:412fbdfe961f351699afd91f5391adc6d6af6dc2192104f163ab5b44956552c5","target":"record","created_at":"2026-05-18T02:25:54Z","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":"2d5aad20edd5deb3791f727acf72a2d6d6152317e6db3121404f2e8706b0557d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-01T12:37:32Z","title_canon_sha256":"5b608d30f2e344c46dfbbd3788f467b00eae878e33cca9c15f2af670aba2678b"},"schema_version":"1.0","source":{"id":"1503.00265","kind":"arxiv","version":1}},"canonical_sha256":"8bb0176add9ebc08c15803507dc740315a770e316933520e95303acbf5ce189b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bb0176add9ebc08c15803507dc740315a770e316933520e95303acbf5ce189b","first_computed_at":"2026-05-18T02:25:54.807157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:54.807157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2ptQU1wEW4ZuiIvOMxILB9DgDO9Wwt1WhZ+5KJlqTUQN0UKqOApZq7sMthk58ly60GFky4qo2UVf2EPJJjcNAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:54.807529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:412fbdfe961f351699afd91f5391adc6d6af6dc2192104f163ab5b44956552c5","sha256:2632a50485a88b9112e41a05ce6af37f5fc1e8cae21dbbd53f823fc2316a336e"],"state_sha256":"1cbb0d9ab17219aa04b7e4b599cf932ed21567b0d1a8bf678c292f19b2a05c83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qoG2iUOPTYAWYVQ1W6V4Cz50uGxvI8kKVPyF4YzA87zd7dpKTZeuVM/iUMUEMV6MzVAhHHKa6LCQTdJEhnW0Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:47:51.080017Z","bundle_sha256":"5026a3bf7e1a2629e866bcda90f1dd4946e7368e3270b4c950e7f37afa4c9289"}}