{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XK5TBAVU5B7HCPGSQVBX5XPTET","short_pith_number":"pith:XK5TBAVU","schema_version":"1.0","canonical_sha256":"babb3082b4e87e713cd285437eddf324c437a7d184c0716df1158cf43c452f89","source":{"kind":"arxiv","id":"1802.10474","version":1},"attestation_state":"computed","paper":{"title":"On the Benefits of Asymmetric Coded Cache Placement in Combination Networks with End-User Caches","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-02-28T15:22:44Z","abstract_excerpt":"This paper investigates the fundamental tradeoff between cache size and download time in the (H;r;M;N) combination network, where a server with N files is connected to H relays (without caches) and each of the K:=\\binom{H}{r} users (with caches of size M files) is connected to a different subset of r relays. Existing schemes fall within two categories: either use the uncoded symmetric cache placement originally proposed for the shared-link model and design delivery phase dependent on the network topology, or effectively divide the combination network into H independent shared-link networks eac"},"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":"1802.10474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-28T15:22:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"614c2507d5ab852f0e4025a1e0eecbb9e0fbe961b0c0aa16ed621be6da2c2ccc","abstract_canon_sha256":"4f057e36c96f564da26e03c4586475ef54357614ad522485107a22835ad11409"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:17.055000Z","signature_b64":"9OylCWTv0LQRnEZ3AI0MfCfWIU+vlkctqRELSaNKnR8/il2hADnRYbhrKOOzn74JX4/6mxiBVcnGVE74MHxiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"babb3082b4e87e713cd285437eddf324c437a7d184c0716df1158cf43c452f89","last_reissued_at":"2026-05-18T00:22:17.054367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:17.054367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Benefits of Asymmetric Coded Cache Placement in Combination Networks with End-User Caches","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-02-28T15:22:44Z","abstract_excerpt":"This paper investigates the fundamental tradeoff between cache size and download time in the (H;r;M;N) combination network, where a server with N files is connected to H relays (without caches) and each of the K:=\\binom{H}{r} users (with caches of size M files) is connected to a different subset of r relays. Existing schemes fall within two categories: either use the uncoded symmetric cache placement originally proposed for the shared-link model and design delivery phase dependent on the network topology, or effectively divide the combination network into H independent shared-link networks eac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10474","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":"1802.10474","created_at":"2026-05-18T00:22:17.054459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10474v1","created_at":"2026-05-18T00:22:17.054459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10474","created_at":"2026-05-18T00:22:17.054459+00:00"},{"alias_kind":"pith_short_12","alias_value":"XK5TBAVU5B7H","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XK5TBAVU5B7HCPGS","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XK5TBAVU","created_at":"2026-05-18T12:33:01.666342+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/XK5TBAVU5B7HCPGSQVBX5XPTET","json":"https://pith.science/pith/XK5TBAVU5B7HCPGSQVBX5XPTET.json","graph_json":"https://pith.science/api/pith-number/XK5TBAVU5B7HCPGSQVBX5XPTET/graph.json","events_json":"https://pith.science/api/pith-number/XK5TBAVU5B7HCPGSQVBX5XPTET/events.json","paper":"https://pith.science/paper/XK5TBAVU"},"agent_actions":{"view_html":"https://pith.science/pith/XK5TBAVU5B7HCPGSQVBX5XPTET","download_json":"https://pith.science/pith/XK5TBAVU5B7HCPGSQVBX5XPTET.json","view_paper":"https://pith.science/paper/XK5TBAVU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10474&json=true","fetch_graph":"https://pith.science/api/pith-number/XK5TBAVU5B7HCPGSQVBX5XPTET/graph.json","fetch_events":"https://pith.science/api/pith-number/XK5TBAVU5B7HCPGSQVBX5XPTET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XK5TBAVU5B7HCPGSQVBX5XPTET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XK5TBAVU5B7HCPGSQVBX5XPTET/action/storage_attestation","attest_author":"https://pith.science/pith/XK5TBAVU5B7HCPGSQVBX5XPTET/action/author_attestation","sign_citation":"https://pith.science/pith/XK5TBAVU5B7HCPGSQVBX5XPTET/action/citation_signature","submit_replication":"https://pith.science/pith/XK5TBAVU5B7HCPGSQVBX5XPTET/action/replication_record"}},"created_at":"2026-05-18T00:22:17.054459+00:00","updated_at":"2026-05-18T00:22:17.054459+00:00"}