{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SITBVL5X4Z6HUYJFB4XCCP5SZP","short_pith_number":"pith:SITBVL5X","schema_version":"1.0","canonical_sha256":"92261aafb7e67c7a61250f2e213fb2cbe7937652f7e1cf6c756c780911fa85e0","source":{"kind":"arxiv","id":"1904.05213","version":1},"attestation_state":"computed","paper":{"title":"Cache-Aided Interference Management with Subexponential Subpacketization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Hari Hara Suthan Chittoor, K V Sushena Sree, Prasad Krishnan","submitted_at":"2019-04-10T14:31:01Z","abstract_excerpt":"Consider an interference channel consisting of $K_T$ transmitters and $K_R$ receivers with AWGN noise and complex channel gains, and with $N$ files in the system. The one-shot $\\mathsf{DoF}$ for this channel is the maximum number of receivers which can be served simultaneously with vanishing probability of error as the $\\mathsf{SNR}$ grows large, under a class of schemes known as \\textit{one-shot} schemes. Consider that there exists transmitter and receiver side caches which can store fractions $\\frac{M_T}{N}$ and $\\frac{M_R}{N}$ of the library respectively. Recent work for this cache-aided in"},"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":"1904.05213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-10T14:31:01Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"d6ba6ef9bd733587b99c122687a747391730067c204353c0d4331004902b98a0","abstract_canon_sha256":"4a6e1be01bce1636c40f7ae7ac367944a7c50d820bf9e7ba46a12e215d72bb96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:53.823308Z","signature_b64":"oFeP4jS1YW9Qf+ld0mUG8ozPuiU7ZLLVyjWwWMKb1i+RoftChiFNGL2VrfktsXqhb8l60TiNikca8Wm/gfAHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92261aafb7e67c7a61250f2e213fb2cbe7937652f7e1cf6c756c780911fa85e0","last_reissued_at":"2026-05-17T23:48:53.822665Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:53.822665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cache-Aided Interference Management with Subexponential Subpacketization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Hari Hara Suthan Chittoor, K V Sushena Sree, Prasad Krishnan","submitted_at":"2019-04-10T14:31:01Z","abstract_excerpt":"Consider an interference channel consisting of $K_T$ transmitters and $K_R$ receivers with AWGN noise and complex channel gains, and with $N$ files in the system. The one-shot $\\mathsf{DoF}$ for this channel is the maximum number of receivers which can be served simultaneously with vanishing probability of error as the $\\mathsf{SNR}$ grows large, under a class of schemes known as \\textit{one-shot} schemes. Consider that there exists transmitter and receiver side caches which can store fractions $\\frac{M_T}{N}$ and $\\frac{M_R}{N}$ of the library respectively. Recent work for this cache-aided in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05213","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":"1904.05213","created_at":"2026-05-17T23:48:53.822757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.05213v1","created_at":"2026-05-17T23:48:53.822757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05213","created_at":"2026-05-17T23:48:53.822757+00:00"},{"alias_kind":"pith_short_12","alias_value":"SITBVL5X4Z6H","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SITBVL5X4Z6HUYJF","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SITBVL5X","created_at":"2026-05-18T12:33:27.125529+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/SITBVL5X4Z6HUYJFB4XCCP5SZP","json":"https://pith.science/pith/SITBVL5X4Z6HUYJFB4XCCP5SZP.json","graph_json":"https://pith.science/api/pith-number/SITBVL5X4Z6HUYJFB4XCCP5SZP/graph.json","events_json":"https://pith.science/api/pith-number/SITBVL5X4Z6HUYJFB4XCCP5SZP/events.json","paper":"https://pith.science/paper/SITBVL5X"},"agent_actions":{"view_html":"https://pith.science/pith/SITBVL5X4Z6HUYJFB4XCCP5SZP","download_json":"https://pith.science/pith/SITBVL5X4Z6HUYJFB4XCCP5SZP.json","view_paper":"https://pith.science/paper/SITBVL5X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.05213&json=true","fetch_graph":"https://pith.science/api/pith-number/SITBVL5X4Z6HUYJFB4XCCP5SZP/graph.json","fetch_events":"https://pith.science/api/pith-number/SITBVL5X4Z6HUYJFB4XCCP5SZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SITBVL5X4Z6HUYJFB4XCCP5SZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SITBVL5X4Z6HUYJFB4XCCP5SZP/action/storage_attestation","attest_author":"https://pith.science/pith/SITBVL5X4Z6HUYJFB4XCCP5SZP/action/author_attestation","sign_citation":"https://pith.science/pith/SITBVL5X4Z6HUYJFB4XCCP5SZP/action/citation_signature","submit_replication":"https://pith.science/pith/SITBVL5X4Z6HUYJFB4XCCP5SZP/action/replication_record"}},"created_at":"2026-05-17T23:48:53.822757+00:00","updated_at":"2026-05-17T23:48:53.822757+00:00"}