{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:O2VESDMD525PE4UN3ZP7KR3T74","short_pith_number":"pith:O2VESDMD","schema_version":"1.0","canonical_sha256":"76aa490d83eebaf2728dde5ff54773ff1acdb4c39c1e38c845c1cc516057fc98","source":{"kind":"arxiv","id":"1902.00135","version":3},"attestation_state":"computed","paper":{"title":"Cache-aided Interference Management Using Hypercube Combinatorial Cache Designs","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":"2019-01-31T23:51:34Z","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 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 has been investigated by Naderializadeh {\\em e"},"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":"1902.00135","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-31T23:51:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bc8069dbb99c44ebfb1550be7a3020a87c84e93c4b0e03f97f8b6dcc66660ec8","abstract_canon_sha256":"5db015a7de28f1569d80012c9405ff17bf097364b302cff22e0f06fd9804d44e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:27:17.298596Z","signature_b64":"u1q1659r3/PpeY7ysNBm5n44aearGUdQWSHFIcaGYDxZjQdXRA94UeqiPzV8szxdgudfqUrUZsPHC8JbypEVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76aa490d83eebaf2728dde5ff54773ff1acdb4c39c1e38c845c1cc516057fc98","last_reissued_at":"2026-07-05T01:27:17.298161Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:27:17.298161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cache-aided Interference Management Using Hypercube Combinatorial Cache Designs","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":"2019-01-31T23:51:34Z","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 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 has been investigated by Naderializadeh {\\em e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00135","kind":"arxiv","version":3},"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/1902.00135/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":"1902.00135","created_at":"2026-07-05T01:27:17.298225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00135v3","created_at":"2026-07-05T01:27:17.298225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00135","created_at":"2026-07-05T01:27:17.298225+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2VESDMD525P","created_at":"2026-07-05T01:27:17.298225+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2VESDMD525PE4UN","created_at":"2026-07-05T01:27:17.298225+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2VESDMD","created_at":"2026-07-05T01:27:17.298225+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/O2VESDMD525PE4UN3ZP7KR3T74","json":"https://pith.science/pith/O2VESDMD525PE4UN3ZP7KR3T74.json","graph_json":"https://pith.science/api/pith-number/O2VESDMD525PE4UN3ZP7KR3T74/graph.json","events_json":"https://pith.science/api/pith-number/O2VESDMD525PE4UN3ZP7KR3T74/events.json","paper":"https://pith.science/paper/O2VESDMD"},"agent_actions":{"view_html":"https://pith.science/pith/O2VESDMD525PE4UN3ZP7KR3T74","download_json":"https://pith.science/pith/O2VESDMD525PE4UN3ZP7KR3T74.json","view_paper":"https://pith.science/paper/O2VESDMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00135&json=true","fetch_graph":"https://pith.science/api/pith-number/O2VESDMD525PE4UN3ZP7KR3T74/graph.json","fetch_events":"https://pith.science/api/pith-number/O2VESDMD525PE4UN3ZP7KR3T74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2VESDMD525PE4UN3ZP7KR3T74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2VESDMD525PE4UN3ZP7KR3T74/action/storage_attestation","attest_author":"https://pith.science/pith/O2VESDMD525PE4UN3ZP7KR3T74/action/author_attestation","sign_citation":"https://pith.science/pith/O2VESDMD525PE4UN3ZP7KR3T74/action/citation_signature","submit_replication":"https://pith.science/pith/O2VESDMD525PE4UN3ZP7KR3T74/action/replication_record"}},"created_at":"2026-07-05T01:27:17.298225+00:00","updated_at":"2026-07-05T01:27:17.298225+00:00"}