{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IJ32XJNAPPAXXIA34MJUUAFHXJ","short_pith_number":"pith:IJ32XJNA","schema_version":"1.0","canonical_sha256":"4277aba5a07bc17ba01be3134a00a7ba509d94ecf4b0ab1415c84f6ec03be648","source":{"kind":"arxiv","id":"1511.07539","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Multiple-Groupcast Coded Multicasting Scheme for Finite Fractional Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia M. Tulino, Giuseppe Caire, Giuseppe Vettigli, Jaime Llorca, Karthikeyan Shanmugam, Mingyue Ji","submitted_at":"2015-11-24T02:10:21Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1511.07539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-24T02:10:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2a71172c5b7c51ca0f1889caa45ba40ca071c80391fbef2b9c4b49d8085528c1","abstract_canon_sha256":"9abfea72548d354e728b39d528e7ad9fae985b6e74663213e6e44af8bf21f6fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:04.468760Z","signature_b64":"to0uenzORMKjTb34ezfc5/qaHVeQINPEnUMA0G2rL67OpCeEisou/N0QpioRXvpBXkMCWXwPAU2FDNJWB+DlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4277aba5a07bc17ba01be3134a00a7ba509d94ecf4b0ab1415c84f6ec03be648","last_reissued_at":"2026-05-18T01:26:04.468263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:04.468263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Multiple-Groupcast Coded Multicasting Scheme for Finite Fractional Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia M. Tulino, Giuseppe Caire, Giuseppe Vettigli, Jaime Llorca, Karthikeyan Shanmugam, Mingyue Ji","submitted_at":"2015-11-24T02:10:21Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07539","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.07539","created_at":"2026-05-18T01:26:04.468352+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07539v1","created_at":"2026-05-18T01:26:04.468352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07539","created_at":"2026-05-18T01:26:04.468352+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJ32XJNAPPAX","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJ32XJNAPPAXXIA3","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJ32XJNA","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.15236","citing_title":"Learning Selective Merge Policies for Deadline-Constrained Coded Caching via Deep Reinforcement Learning","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IJ32XJNAPPAXXIA34MJUUAFHXJ","json":"https://pith.science/pith/IJ32XJNAPPAXXIA34MJUUAFHXJ.json","graph_json":"https://pith.science/api/pith-number/IJ32XJNAPPAXXIA34MJUUAFHXJ/graph.json","events_json":"https://pith.science/api/pith-number/IJ32XJNAPPAXXIA34MJUUAFHXJ/events.json","paper":"https://pith.science/paper/IJ32XJNA"},"agent_actions":{"view_html":"https://pith.science/pith/IJ32XJNAPPAXXIA34MJUUAFHXJ","download_json":"https://pith.science/pith/IJ32XJNAPPAXXIA34MJUUAFHXJ.json","view_paper":"https://pith.science/paper/IJ32XJNA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07539&json=true","fetch_graph":"https://pith.science/api/pith-number/IJ32XJNAPPAXXIA34MJUUAFHXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/IJ32XJNAPPAXXIA34MJUUAFHXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJ32XJNAPPAXXIA34MJUUAFHXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJ32XJNAPPAXXIA34MJUUAFHXJ/action/storage_attestation","attest_author":"https://pith.science/pith/IJ32XJNAPPAXXIA34MJUUAFHXJ/action/author_attestation","sign_citation":"https://pith.science/pith/IJ32XJNAPPAXXIA34MJUUAFHXJ/action/citation_signature","submit_replication":"https://pith.science/pith/IJ32XJNAPPAXXIA34MJUUAFHXJ/action/replication_record"}},"created_at":"2026-05-18T01:26:04.468352+00:00","updated_at":"2026-05-18T01:26:04.468352+00:00"}