{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HTOVCBPGIEPZJ5EMSA4NL5KDID","short_pith_number":"pith:HTOVCBPG","schema_version":"1.0","canonical_sha256":"3cdd5105e6411f94f48c9038d5f54340ebe6c45bb35d5c83bf34a7482e821f31","source":{"kind":"arxiv","id":"1803.06123","version":1},"attestation_state":"computed","paper":{"title":"On Combination Networks with Cache-aided Relays and Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Kai Wan, Mingyue Ji, Pablo Piantanida","submitted_at":"2018-03-16T09:37:25Z","abstract_excerpt":"Caching is an efficient way to reduce peak hour network traffic congestion by storing some contents at the user's cache without knowledge of later demands. Coded caching strategy was originally proposed by Maddah-Ali and Niesen to give an additional coded caching gain compared the conventional uncoded scheme. Under practical consideration, the caching model was recently considered in relay network, in particular the combination network, where the central server communicates with $K=\\binom{H}{r}$ users (each is with a cache of $M$ files) through $H$ immediate relays, and each user is connected "},"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":"1803.06123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-16T09:37:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"154ff42515e7b4be4be0e5ecba2049cfbf26b20e008046a7ccc83edac05d080f","abstract_canon_sha256":"9b15176a45206effc285c91982b9a6cb166d45eae4e7ae09faa427e9fc158a1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:50.535238Z","signature_b64":"6wZORyM3Y5dLmv4Ug48Z2ShOaEd1gxs9mnrXDYMPF8Oqw1i3wKi0eTmBCrJ6J2uH/0NVhW6kompvqqcoEfcIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cdd5105e6411f94f48c9038d5f54340ebe6c45bb35d5c83bf34a7482e821f31","last_reissued_at":"2026-05-18T00:20:50.534724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:50.534724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Combination Networks with Cache-aided Relays and Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Kai Wan, Mingyue Ji, Pablo Piantanida","submitted_at":"2018-03-16T09:37:25Z","abstract_excerpt":"Caching is an efficient way to reduce peak hour network traffic congestion by storing some contents at the user's cache without knowledge of later demands. Coded caching strategy was originally proposed by Maddah-Ali and Niesen to give an additional coded caching gain compared the conventional uncoded scheme. Under practical consideration, the caching model was recently considered in relay network, in particular the combination network, where the central server communicates with $K=\\binom{H}{r}$ users (each is with a cache of $M$ files) through $H$ immediate relays, and each user is connected "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06123","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":"1803.06123","created_at":"2026-05-18T00:20:50.534810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06123v1","created_at":"2026-05-18T00:20:50.534810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06123","created_at":"2026-05-18T00:20:50.534810+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTOVCBPGIEPZ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTOVCBPGIEPZJ5EM","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTOVCBPG","created_at":"2026-05-18T12:32:28.185984+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/HTOVCBPGIEPZJ5EMSA4NL5KDID","json":"https://pith.science/pith/HTOVCBPGIEPZJ5EMSA4NL5KDID.json","graph_json":"https://pith.science/api/pith-number/HTOVCBPGIEPZJ5EMSA4NL5KDID/graph.json","events_json":"https://pith.science/api/pith-number/HTOVCBPGIEPZJ5EMSA4NL5KDID/events.json","paper":"https://pith.science/paper/HTOVCBPG"},"agent_actions":{"view_html":"https://pith.science/pith/HTOVCBPGIEPZJ5EMSA4NL5KDID","download_json":"https://pith.science/pith/HTOVCBPGIEPZJ5EMSA4NL5KDID.json","view_paper":"https://pith.science/paper/HTOVCBPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06123&json=true","fetch_graph":"https://pith.science/api/pith-number/HTOVCBPGIEPZJ5EMSA4NL5KDID/graph.json","fetch_events":"https://pith.science/api/pith-number/HTOVCBPGIEPZJ5EMSA4NL5KDID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTOVCBPGIEPZJ5EMSA4NL5KDID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTOVCBPGIEPZJ5EMSA4NL5KDID/action/storage_attestation","attest_author":"https://pith.science/pith/HTOVCBPGIEPZJ5EMSA4NL5KDID/action/author_attestation","sign_citation":"https://pith.science/pith/HTOVCBPGIEPZJ5EMSA4NL5KDID/action/citation_signature","submit_replication":"https://pith.science/pith/HTOVCBPGIEPZJ5EMSA4NL5KDID/action/replication_record"}},"created_at":"2026-05-18T00:20:50.534810+00:00","updated_at":"2026-05-18T00:20:50.534810+00:00"}