{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JQNTXFD3DOYJQJQMZMWO3SF2NS","short_pith_number":"pith:JQNTXFD3","schema_version":"1.0","canonical_sha256":"4c1b3b947b1bb098260ccb2cedc8ba6cb2088ad573eaddf3e9a9df2d3b3521b3","source":{"kind":"arxiv","id":"1402.4572","version":2},"attestation_state":"computed","paper":{"title":"Caching and Coded Multicasting: Multiple Groupcast Index Coding","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, Jaime Llorca, Mingyue Ji","submitted_at":"2014-02-19T07:31:41Z","abstract_excerpt":"The capacity of caching networks has received considerable attention in the past few years. A particularly studied setting is the case of a single server (e.g., a base station) and multiple users, each of which caches segments of files in a finite library. Each user requests one (whole) file in the library and the server sends a common coded multicast message to satisfy all users at once. The problem consists of finding the smallest possible codeword length to satisfy such requests. In this paper we consider the generalization to the case where each user places $L \\geq 1$ requests. The obvious"},"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":"1402.4572","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-19T07:31:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b52b6851d9ceec85a60b825be4553eee9737b0723f498f0fe5fc1552dd9934bc","abstract_canon_sha256":"7865f747ca015197b10e3e2c512cda09bb37ac3b84010d2d9e0b63a43029fd75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:08.893430Z","signature_b64":"qAcv/2hNcnp4gfVKGFbr2ymRjfiLRjG/H8F3B72EVt6GQhCin13KbuPZ3nL4s/xdbpPKnDzMQKvgWz3eEaGuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c1b3b947b1bb098260ccb2cedc8ba6cb2088ad573eaddf3e9a9df2d3b3521b3","last_reissued_at":"2026-05-18T02:39:08.892772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:08.892772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Caching and Coded Multicasting: Multiple Groupcast Index Coding","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, Jaime Llorca, Mingyue Ji","submitted_at":"2014-02-19T07:31:41Z","abstract_excerpt":"The capacity of caching networks has received considerable attention in the past few years. A particularly studied setting is the case of a single server (e.g., a base station) and multiple users, each of which caches segments of files in a finite library. Each user requests one (whole) file in the library and the server sends a common coded multicast message to satisfy all users at once. The problem consists of finding the smallest possible codeword length to satisfy such requests. In this paper we consider the generalization to the case where each user places $L \\geq 1$ requests. The obvious"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4572","kind":"arxiv","version":2},"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":"1402.4572","created_at":"2026-05-18T02:39:08.892877+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4572v2","created_at":"2026-05-18T02:39:08.892877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4572","created_at":"2026-05-18T02:39:08.892877+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQNTXFD3DOYJ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQNTXFD3DOYJQJQM","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQNTXFD3","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JQNTXFD3DOYJQJQMZMWO3SF2NS","json":"https://pith.science/pith/JQNTXFD3DOYJQJQMZMWO3SF2NS.json","graph_json":"https://pith.science/api/pith-number/JQNTXFD3DOYJQJQMZMWO3SF2NS/graph.json","events_json":"https://pith.science/api/pith-number/JQNTXFD3DOYJQJQMZMWO3SF2NS/events.json","paper":"https://pith.science/paper/JQNTXFD3"},"agent_actions":{"view_html":"https://pith.science/pith/JQNTXFD3DOYJQJQMZMWO3SF2NS","download_json":"https://pith.science/pith/JQNTXFD3DOYJQJQMZMWO3SF2NS.json","view_paper":"https://pith.science/paper/JQNTXFD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4572&json=true","fetch_graph":"https://pith.science/api/pith-number/JQNTXFD3DOYJQJQMZMWO3SF2NS/graph.json","fetch_events":"https://pith.science/api/pith-number/JQNTXFD3DOYJQJQMZMWO3SF2NS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQNTXFD3DOYJQJQMZMWO3SF2NS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQNTXFD3DOYJQJQMZMWO3SF2NS/action/storage_attestation","attest_author":"https://pith.science/pith/JQNTXFD3DOYJQJQMZMWO3SF2NS/action/author_attestation","sign_citation":"https://pith.science/pith/JQNTXFD3DOYJQJQMZMWO3SF2NS/action/citation_signature","submit_replication":"https://pith.science/pith/JQNTXFD3DOYJQJQMZMWO3SF2NS/action/replication_record"}},"created_at":"2026-05-18T02:39:08.892877+00:00","updated_at":"2026-05-18T02:39:08.892877+00:00"}