{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:K3B2W5LGJIWN6F24FDQPHFJX2K","short_pith_number":"pith:K3B2W5LG","schema_version":"1.0","canonical_sha256":"56c3ab75664a2cdf175c28e0f39537d2bcb5a59f06b190ff22168c6f9c234654","source":{"kind":"arxiv","id":"2007.00856","version":2},"attestation_state":"computed","paper":{"title":"Cache-Aided Matrix Multiplication Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Giuseppe Caire, Hua Sun, Kai Wan, Mingyue Ji","submitted_at":"2020-07-02T03:42:41Z","abstract_excerpt":"Coded caching is a promising technique to smooth out network traffic by storing part of the library content at the users' local caches. The seminal work on coded caching for single file retrieval by Maddah-Ali and Niesen (MAN) showed the existence of a global caching gain that scales with the total memory in the system, in addition to the known local caching gain in uncoded systems. This paper formulates a novel cache-aided matrix multiplication retrieval problem, relevant for data analytics and machine learning applications. In the considered problem, each cache-aided user requests the produc"},"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":"2007.00856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-02T03:42:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de6bacdfda860499778fa0c82e0839b81a18c183676223ed69cbce19ebd21d16","abstract_canon_sha256":"d67025704758cd490d92841866eb79c4d1ac7f08b0b540df4eeedd934008ac5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:43:42.795609Z","signature_b64":"ze9XUJBrHN/AzrcS1EXKo6d0UWu3eTZMi3GCpeOUGe+dCa7b1zzzW6aEFbVPeYOJcUepQlff16446UMS89ReBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56c3ab75664a2cdf175c28e0f39537d2bcb5a59f06b190ff22168c6f9c234654","last_reissued_at":"2026-07-05T02:43:42.795095Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:43:42.795095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cache-Aided Matrix Multiplication Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Giuseppe Caire, Hua Sun, Kai Wan, Mingyue Ji","submitted_at":"2020-07-02T03:42:41Z","abstract_excerpt":"Coded caching is a promising technique to smooth out network traffic by storing part of the library content at the users' local caches. The seminal work on coded caching for single file retrieval by Maddah-Ali and Niesen (MAN) showed the existence of a global caching gain that scales with the total memory in the system, in addition to the known local caching gain in uncoded systems. This paper formulates a novel cache-aided matrix multiplication retrieval problem, relevant for data analytics and machine learning applications. In the considered problem, each cache-aided user requests the produc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00856","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/2007.00856/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":"2007.00856","created_at":"2026-07-05T02:43:42.795148+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.00856v2","created_at":"2026-07-05T02:43:42.795148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00856","created_at":"2026-07-05T02:43:42.795148+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3B2W5LGJIWN","created_at":"2026-07-05T02:43:42.795148+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3B2W5LGJIWN6F24","created_at":"2026-07-05T02:43:42.795148+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3B2W5LG","created_at":"2026-07-05T02:43:42.795148+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/K3B2W5LGJIWN6F24FDQPHFJX2K","json":"https://pith.science/pith/K3B2W5LGJIWN6F24FDQPHFJX2K.json","graph_json":"https://pith.science/api/pith-number/K3B2W5LGJIWN6F24FDQPHFJX2K/graph.json","events_json":"https://pith.science/api/pith-number/K3B2W5LGJIWN6F24FDQPHFJX2K/events.json","paper":"https://pith.science/paper/K3B2W5LG"},"agent_actions":{"view_html":"https://pith.science/pith/K3B2W5LGJIWN6F24FDQPHFJX2K","download_json":"https://pith.science/pith/K3B2W5LGJIWN6F24FDQPHFJX2K.json","view_paper":"https://pith.science/paper/K3B2W5LG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.00856&json=true","fetch_graph":"https://pith.science/api/pith-number/K3B2W5LGJIWN6F24FDQPHFJX2K/graph.json","fetch_events":"https://pith.science/api/pith-number/K3B2W5LGJIWN6F24FDQPHFJX2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3B2W5LGJIWN6F24FDQPHFJX2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3B2W5LGJIWN6F24FDQPHFJX2K/action/storage_attestation","attest_author":"https://pith.science/pith/K3B2W5LGJIWN6F24FDQPHFJX2K/action/author_attestation","sign_citation":"https://pith.science/pith/K3B2W5LGJIWN6F24FDQPHFJX2K/action/citation_signature","submit_replication":"https://pith.science/pith/K3B2W5LGJIWN6F24FDQPHFJX2K/action/replication_record"}},"created_at":"2026-07-05T02:43:42.795148+00:00","updated_at":"2026-07-05T02:43:42.795148+00:00"}