{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:5ULFPXCLITIQ7NN2Z3WP6UV2CK","short_pith_number":"pith:5ULFPXCL","schema_version":"1.0","canonical_sha256":"ed1657dc4b44d10fb5baceecff52ba12a45369eb4e5829504563e2cf067256e4","source":{"kind":"arxiv","id":"2008.08978","version":2},"attestation_state":"computed","paper":{"title":"Cache-aided Interference Management using Hypercube Combinatorial Cache Design with Reduced Subpacketizations and Order Optimal Sum-Degrees of Freedom","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mingyue Ji, Nicholas Woolsey, Xiang Zhang","submitted_at":"2020-08-19T16:08:32Z","abstract_excerpt":"We consider a cache-aided interference network which consists of a library of $N$ files, $K_T$ transmitters and $K_R$ receivers (users), each equipped with a local cache of size $M_T$ and $M_R$ files respectively, and connected via a discrete-time additive white Gaussian noise (AWGN) channel. Each receiver requests an arbitrary file from the library. The objective is to design a cache placement without knowing the receivers' requests and a communication scheme such that the sum Degrees of Freedom (sum-DoF) of the delivery is maximized. This network model with one-shot transmission was firstly "},"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":"2008.08978","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-08-19T16:08:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b75d37a16621f3817baf67a180fa3efec68581e3284ed632d8793f8eeab6f14","abstract_canon_sha256":"69f9096ef75a72f595c667be3283ca9238ffd2c8834fadd5273b2bd42e679b6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:10.874272Z","signature_b64":"9MLCUNrA130JJhiifcR2FjWX19oi+NeCeFtJijywuABTUM6sfIV3MBkHBjIYuwxyJ0K5EuGYO9BsFvXqY1V8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed1657dc4b44d10fb5baceecff52ba12a45369eb4e5829504563e2cf067256e4","last_reissued_at":"2026-07-05T02:04:10.873929Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:10.873929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cache-aided Interference Management using Hypercube Combinatorial Cache Design with Reduced Subpacketizations and Order Optimal Sum-Degrees of Freedom","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mingyue Ji, Nicholas Woolsey, Xiang Zhang","submitted_at":"2020-08-19T16:08:32Z","abstract_excerpt":"We consider a cache-aided interference network which consists of a library of $N$ files, $K_T$ transmitters and $K_R$ receivers (users), each equipped with a local cache of size $M_T$ and $M_R$ files respectively, and connected via a discrete-time additive white Gaussian noise (AWGN) channel. Each receiver requests an arbitrary file from the library. The objective is to design a cache placement without knowing the receivers' requests and a communication scheme such that the sum Degrees of Freedom (sum-DoF) of the delivery is maximized. This network model with one-shot transmission was firstly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.08978","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.08978/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.08978","created_at":"2026-07-05T02:04:10.873986+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.08978v2","created_at":"2026-07-05T02:04:10.873986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.08978","created_at":"2026-07-05T02:04:10.873986+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ULFPXCLITIQ","created_at":"2026-07-05T02:04:10.873986+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ULFPXCLITIQ7NN2","created_at":"2026-07-05T02:04:10.873986+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ULFPXCL","created_at":"2026-07-05T02:04:10.873986+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/5ULFPXCLITIQ7NN2Z3WP6UV2CK","json":"https://pith.science/pith/5ULFPXCLITIQ7NN2Z3WP6UV2CK.json","graph_json":"https://pith.science/api/pith-number/5ULFPXCLITIQ7NN2Z3WP6UV2CK/graph.json","events_json":"https://pith.science/api/pith-number/5ULFPXCLITIQ7NN2Z3WP6UV2CK/events.json","paper":"https://pith.science/paper/5ULFPXCL"},"agent_actions":{"view_html":"https://pith.science/pith/5ULFPXCLITIQ7NN2Z3WP6UV2CK","download_json":"https://pith.science/pith/5ULFPXCLITIQ7NN2Z3WP6UV2CK.json","view_paper":"https://pith.science/paper/5ULFPXCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.08978&json=true","fetch_graph":"https://pith.science/api/pith-number/5ULFPXCLITIQ7NN2Z3WP6UV2CK/graph.json","fetch_events":"https://pith.science/api/pith-number/5ULFPXCLITIQ7NN2Z3WP6UV2CK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ULFPXCLITIQ7NN2Z3WP6UV2CK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ULFPXCLITIQ7NN2Z3WP6UV2CK/action/storage_attestation","attest_author":"https://pith.science/pith/5ULFPXCLITIQ7NN2Z3WP6UV2CK/action/author_attestation","sign_citation":"https://pith.science/pith/5ULFPXCLITIQ7NN2Z3WP6UV2CK/action/citation_signature","submit_replication":"https://pith.science/pith/5ULFPXCLITIQ7NN2Z3WP6UV2CK/action/replication_record"}},"created_at":"2026-07-05T02:04:10.873986+00:00","updated_at":"2026-07-05T02:04:10.873986+00:00"}