{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TRDVDHLVYQINGSNIE6SMQQL2DH","short_pith_number":"pith:TRDVDHLV","schema_version":"1.0","canonical_sha256":"9c47519d75c410d349a827a4c8417a19da421610cd5977e6921fea5120803586","source":{"kind":"arxiv","id":"1906.10684","version":1},"attestation_state":"computed","paper":{"title":"On the Upload versus Download Cost for Secure and Private Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Ravi Tandon, Wei-Ting Chang","submitted_at":"2019-06-25T17:59:10Z","abstract_excerpt":"In this paper, we study the problem of secure and private distributed matrix multiplication. Specifically, we focus on a scenario where a user wants to compute the product of a confidential matrix $A$, with a matrix $B_\\theta$, where $\\theta\\in\\{1,\\dots,M\\}$. The set of candidate matrices $\\{B_1,\\dots,B_M\\}$ are public, and available at all the $N$ servers. The goal of the user is to distributedly compute $AB_{\\theta}$, such that $(a)$ no information is leaked about the matrix $A$ to any server; and $(b)$ the index $\\theta$ is kept private from each server. Our goal is to understand the fundam"},"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":"1906.10684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-25T17:59:10Z","cross_cats_sorted":["cs.CR","cs.DC","math.IT"],"title_canon_sha256":"8a4a1bb158cfccf14ede7a9e9149afffa53bba5732657fe98b5669e446b8e1ad","abstract_canon_sha256":"8842940e8fa002082a3c501be5097238e29c24c7669106bc372c28f466886d18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:15.604610Z","signature_b64":"jrJOyrnaduBm+w/9SdLRjmsg+6cJHZLCCeu1Qt4oRcdUOtqrf48PUKbyPfB68KWDWL2u5sSTS3qooICy1gAIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c47519d75c410d349a827a4c8417a19da421610cd5977e6921fea5120803586","last_reissued_at":"2026-05-17T23:42:15.604015Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:15.604015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Upload versus Download Cost for Secure and Private Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Ravi Tandon, Wei-Ting Chang","submitted_at":"2019-06-25T17:59:10Z","abstract_excerpt":"In this paper, we study the problem of secure and private distributed matrix multiplication. Specifically, we focus on a scenario where a user wants to compute the product of a confidential matrix $A$, with a matrix $B_\\theta$, where $\\theta\\in\\{1,\\dots,M\\}$. The set of candidate matrices $\\{B_1,\\dots,B_M\\}$ are public, and available at all the $N$ servers. The goal of the user is to distributedly compute $AB_{\\theta}$, such that $(a)$ no information is leaked about the matrix $A$ to any server; and $(b)$ the index $\\theta$ is kept private from each server. Our goal is to understand the fundam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10684","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":"1906.10684","created_at":"2026-05-17T23:42:15.604095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10684v1","created_at":"2026-05-17T23:42:15.604095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10684","created_at":"2026-05-17T23:42:15.604095+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRDVDHLVYQIN","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRDVDHLVYQINGSNI","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRDVDHLV","created_at":"2026-05-18T12:33:30.264802+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/TRDVDHLVYQINGSNIE6SMQQL2DH","json":"https://pith.science/pith/TRDVDHLVYQINGSNIE6SMQQL2DH.json","graph_json":"https://pith.science/api/pith-number/TRDVDHLVYQINGSNIE6SMQQL2DH/graph.json","events_json":"https://pith.science/api/pith-number/TRDVDHLVYQINGSNIE6SMQQL2DH/events.json","paper":"https://pith.science/paper/TRDVDHLV"},"agent_actions":{"view_html":"https://pith.science/pith/TRDVDHLVYQINGSNIE6SMQQL2DH","download_json":"https://pith.science/pith/TRDVDHLVYQINGSNIE6SMQQL2DH.json","view_paper":"https://pith.science/paper/TRDVDHLV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10684&json=true","fetch_graph":"https://pith.science/api/pith-number/TRDVDHLVYQINGSNIE6SMQQL2DH/graph.json","fetch_events":"https://pith.science/api/pith-number/TRDVDHLVYQINGSNIE6SMQQL2DH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRDVDHLVYQINGSNIE6SMQQL2DH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRDVDHLVYQINGSNIE6SMQQL2DH/action/storage_attestation","attest_author":"https://pith.science/pith/TRDVDHLVYQINGSNIE6SMQQL2DH/action/author_attestation","sign_citation":"https://pith.science/pith/TRDVDHLVYQINGSNIE6SMQQL2DH/action/citation_signature","submit_replication":"https://pith.science/pith/TRDVDHLVYQINGSNIE6SMQQL2DH/action/replication_record"}},"created_at":"2026-05-17T23:42:15.604095+00:00","updated_at":"2026-05-17T23:42:15.604095+00:00"}