{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:O2VESDMD525PE4UN3ZP7KR3T74","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5db015a7de28f1569d80012c9405ff17bf097364b302cff22e0f06fd9804d44e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-31T23:51:34Z","title_canon_sha256":"bc8069dbb99c44ebfb1550be7a3020a87c84e93c4b0e03f97f8b6dcc66660ec8"},"schema_version":"1.0","source":{"id":"1902.00135","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00135","created_at":"2026-07-05T01:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00135v3","created_at":"2026-07-05T01:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00135","created_at":"2026-07-05T01:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"O2VESDMD525P","created_at":"2026-07-05T01:27:17Z"},{"alias_kind":"pith_short_16","alias_value":"O2VESDMD525PE4UN","created_at":"2026-07-05T01:27:17Z"},{"alias_kind":"pith_short_8","alias_value":"O2VESDMD","created_at":"2026-07-05T01:27:17Z"}],"graph_snapshots":[{"event_id":"sha256:4db42ee16b2444622da0db28da634a89616b7540cbc403cac3b03aea67f63d0d","target":"graph","created_at":"2026-07-05T01:27:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1902.00135/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Mingyue Ji, Nicholas Woolsey, Xiang Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-31T23:51:34Z","title":"Cache-aided Interference Management Using Hypercube Combinatorial Cache Designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00135","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aa4258c4a9959fc2e0db27ad20f60b92407285538d553ab1045b1bf18eaccfb5","target":"record","created_at":"2026-07-05T01:27:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5db015a7de28f1569d80012c9405ff17bf097364b302cff22e0f06fd9804d44e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-31T23:51:34Z","title_canon_sha256":"bc8069dbb99c44ebfb1550be7a3020a87c84e93c4b0e03f97f8b6dcc66660ec8"},"schema_version":"1.0","source":{"id":"1902.00135","kind":"arxiv","version":3}},"canonical_sha256":"76aa490d83eebaf2728dde5ff54773ff1acdb4c39c1e38c845c1cc516057fc98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76aa490d83eebaf2728dde5ff54773ff1acdb4c39c1e38c845c1cc516057fc98","first_computed_at":"2026-07-05T01:27:17.298161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:27:17.298161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u1q1659r3/PpeY7ysNBm5n44aearGUdQWSHFIcaGYDxZjQdXRA94UeqiPzV8szxdgudfqUrUZsPHC8JbypEVDg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:27:17.298596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00135","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa4258c4a9959fc2e0db27ad20f60b92407285538d553ab1045b1bf18eaccfb5","sha256:4db42ee16b2444622da0db28da634a89616b7540cbc403cac3b03aea67f63d0d"],"state_sha256":"625cc458cac039548f4e1c75ba1a6be659b39202d76c134b5b31175f1b234862"}