{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OADQ2AAWC6C755HHZFG6HSFFL3","short_pith_number":"pith:OADQ2AAW","canonical_record":{"source":{"id":"1511.07531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-24T01:17:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13a02ee6bb5b95ee58409cfc7ff4d53061b1a762e952c2ceda57b25d43921d5e","abstract_canon_sha256":"be1bbb439e816a10d8e697954aba7ace7a014be3c95e5a3dc500e56c546358f9"},"schema_version":"1.0"},"canonical_sha256":"70070d00161785fef4e7c94de3c8a55ef65a6f3229796611c967883341e68ac1","source":{"kind":"arxiv","id":"1511.07531","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07531","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07531v1","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07531","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"pith_short_12","alias_value":"OADQ2AAWC6C7","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OADQ2AAWC6C755HH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OADQ2AAW","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OADQ2AAWC6C755HHZFG6HSFFL3","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-24T01:17:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13a02ee6bb5b95ee58409cfc7ff4d53061b1a762e952c2ceda57b25d43921d5e","abstract_canon_sha256":"be1bbb439e816a10d8e697954aba7ace7a014be3c95e5a3dc500e56c546358f9"},"schema_version":"1.0"},"canonical_sha256":"70070d00161785fef4e7c94de3c8a55ef65a6f3229796611c967883341e68ac1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:04.523386Z","signature_b64":"LQV3kZHxZnPxS189KxFJ06MxmWFBeDgoHc4VM2VAOL1wazMk+tcIoT8F/PrTGDQUKHRdZZYzRyKtoUtJlnPOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70070d00161785fef4e7c94de3c8a55ef65a6f3229796611c967883341e68ac1","last_reissued_at":"2026-05-18T01:26:04.522727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:04.522727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07531","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:26:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DrgBylmeBEnb6TZaKdu/pwWsX2gBsMMAJ+PuO99BHZIzDdlqkfdnqiD9fqxjJ6xAhFti9ZuHq0m9uubYNQNXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:35:49.493742Z"},"content_sha256":"c9e48567c8651456c49a610bb66a4b64d07e0b5126a513258b09bc5632988acf","schema_version":"1.0","event_id":"sha256:c9e48567c8651456c49a610bb66a4b64d07e0b5126a513258b09bc5632988acf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OADQ2AAWC6C755HHZFG6HSFFL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Coded Multicasting Scheme Preserving the Multiplicative Caching Gain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia M. Tulino, Giuseppe Vettigli, Jaime Llorca, Mingyue Ji, Paola Festa","submitted_at":"2015-11-24T01:17:12Z","abstract_excerpt":"Coded multicasting has been shown to be a promis- ing approach to significantly improve the caching performance of content delivery networks with multiple caches downstream of a common multicast link. However, achievable schemes proposed to date have been shown to achieve the proved order-optimal performance only in the asymptotic regime in which the number of packets per requested item goes to infinity. In this paper, we first extend the asymptotic analysis of the achievable scheme in [1], [2] to the case of heterogeneous cache sizes and demand distributions, providing the best known upper bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07531","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:26:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zAdHTPobWiTb0P9NFKK1ZflffixSKRRQ8ztGdkYBR4QmgShirS/pXEbvFL0BbuX1R2CSVoGD6jBbgMT+lMtEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:35:49.494096Z"},"content_sha256":"e75108c203be37f36685475c1dd860bb7c9efe548f83b7817728fbf7c6a9cff6","schema_version":"1.0","event_id":"sha256:e75108c203be37f36685475c1dd860bb7c9efe548f83b7817728fbf7c6a9cff6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OADQ2AAWC6C755HHZFG6HSFFL3/bundle.json","state_url":"https://pith.science/pith/OADQ2AAWC6C755HHZFG6HSFFL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OADQ2AAWC6C755HHZFG6HSFFL3/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-05-20T14:35:49Z","links":{"resolver":"https://pith.science/pith/OADQ2AAWC6C755HHZFG6HSFFL3","bundle":"https://pith.science/pith/OADQ2AAWC6C755HHZFG6HSFFL3/bundle.json","state":"https://pith.science/pith/OADQ2AAWC6C755HHZFG6HSFFL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OADQ2AAWC6C755HHZFG6HSFFL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OADQ2AAWC6C755HHZFG6HSFFL3","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":"be1bbb439e816a10d8e697954aba7ace7a014be3c95e5a3dc500e56c546358f9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-24T01:17:12Z","title_canon_sha256":"13a02ee6bb5b95ee58409cfc7ff4d53061b1a762e952c2ceda57b25d43921d5e"},"schema_version":"1.0","source":{"id":"1511.07531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07531","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07531v1","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07531","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"pith_short_12","alias_value":"OADQ2AAWC6C7","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OADQ2AAWC6C755HH","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OADQ2AAW","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:e75108c203be37f36685475c1dd860bb7c9efe548f83b7817728fbf7c6a9cff6","target":"graph","created_at":"2026-05-18T01:26:04Z","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":"Coded multicasting has been shown to be a promis- ing approach to significantly improve the caching performance of content delivery networks with multiple caches downstream of a common multicast link. However, achievable schemes proposed to date have been shown to achieve the proved order-optimal performance only in the asymptotic regime in which the number of packets per requested item goes to infinity. In this paper, we first extend the asymptotic analysis of the achievable scheme in [1], [2] to the case of heterogeneous cache sizes and demand distributions, providing the best known upper bo","authors_text":"Antonia M. Tulino, Giuseppe Vettigli, Jaime Llorca, Mingyue Ji, Paola Festa","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-24T01:17:12Z","title":"An Efficient Coded Multicasting Scheme Preserving the Multiplicative Caching Gain"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07531","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:c9e48567c8651456c49a610bb66a4b64d07e0b5126a513258b09bc5632988acf","target":"record","created_at":"2026-05-18T01:26:04Z","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":"be1bbb439e816a10d8e697954aba7ace7a014be3c95e5a3dc500e56c546358f9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-24T01:17:12Z","title_canon_sha256":"13a02ee6bb5b95ee58409cfc7ff4d53061b1a762e952c2ceda57b25d43921d5e"},"schema_version":"1.0","source":{"id":"1511.07531","kind":"arxiv","version":1}},"canonical_sha256":"70070d00161785fef4e7c94de3c8a55ef65a6f3229796611c967883341e68ac1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70070d00161785fef4e7c94de3c8a55ef65a6f3229796611c967883341e68ac1","first_computed_at":"2026-05-18T01:26:04.522727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:04.522727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LQV3kZHxZnPxS189KxFJ06MxmWFBeDgoHc4VM2VAOL1wazMk+tcIoT8F/PrTGDQUKHRdZZYzRyKtoUtJlnPOAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:04.523386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9e48567c8651456c49a610bb66a4b64d07e0b5126a513258b09bc5632988acf","sha256:e75108c203be37f36685475c1dd860bb7c9efe548f83b7817728fbf7c6a9cff6"],"state_sha256":"4e1ade0e6370e20e9608edde69198d78b6ab772dc4ff9cdd2ad4b748f3bf73d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cOwMdarVl3bsSPYt3zr5tMKfIiO85LWdChivMkQEs6tW6PBA82NoWG9sVsFhXhz4pFL8E07hA5l4GCc9kx1LBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T14:35:49.496654Z","bundle_sha256":"11404901c7f8603da59a9b6cb2d3b738dab44f72f3c44f987f7d4b64de31a91e"}}