{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IJ32XJNAPPAXXIA34MJUUAFHXJ","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":"9abfea72548d354e728b39d528e7ad9fae985b6e74663213e6e44af8bf21f6fa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-24T02:10:21Z","title_canon_sha256":"2a71172c5b7c51ca0f1889caa45ba40ca071c80391fbef2b9c4b49d8085528c1"},"schema_version":"1.0","source":{"id":"1511.07539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07539","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07539v1","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07539","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"pith_short_12","alias_value":"IJ32XJNAPPAX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IJ32XJNAPPAXXIA3","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IJ32XJNA","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:abf63892ee7e411d1183b8aca9121a68f2e8aedc97e083b27bcca424e16e2a3a","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 improve the caching performance of content delivery networks with multiple caches downstream of a common multicast link. However, the schemes that have been shown to achieve order-optimal perfor- mance require content items to be partitioned into a number of packets that grows exponentially with the number of users [1]. In this paper, we first extend the analysis of the achievable scheme in [2] to the case of heterogeneous cache sizes and demand distribu- tions, providing an achievable scheme and an upper bound on the limiting average performance when the n","authors_text":"Antonia M. Tulino, Giuseppe Caire, Giuseppe Vettigli, Jaime Llorca, Karthikeyan Shanmugam, Mingyue Ji","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-24T02:10:21Z","title":"An Efficient Multiple-Groupcast Coded Multicasting Scheme for Finite Fractional Caching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07539","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:2c88313c46fc499442331ea9db41c7d555682e598c680e10775374e74d1725c1","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":"9abfea72548d354e728b39d528e7ad9fae985b6e74663213e6e44af8bf21f6fa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-24T02:10:21Z","title_canon_sha256":"2a71172c5b7c51ca0f1889caa45ba40ca071c80391fbef2b9c4b49d8085528c1"},"schema_version":"1.0","source":{"id":"1511.07539","kind":"arxiv","version":1}},"canonical_sha256":"4277aba5a07bc17ba01be3134a00a7ba509d94ecf4b0ab1415c84f6ec03be648","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4277aba5a07bc17ba01be3134a00a7ba509d94ecf4b0ab1415c84f6ec03be648","first_computed_at":"2026-05-18T01:26:04.468263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:04.468263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"to0uenzORMKjTb34ezfc5/qaHVeQINPEnUMA0G2rL67OpCeEisou/N0QpioRXvpBXkMCWXwPAU2FDNJWB+DlAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:04.468760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c88313c46fc499442331ea9db41c7d555682e598c680e10775374e74d1725c1","sha256:abf63892ee7e411d1183b8aca9121a68f2e8aedc97e083b27bcca424e16e2a3a"],"state_sha256":"0c03a07e6f54efc978687be70faae448e8d58c793cd13f039e08e2ec60f6f8bd"}