{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TRDVDHLVYQINGSNIE6SMQQL2DH","short_pith_number":"pith:TRDVDHLV","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"},"canonical_sha256":"9c47519d75c410d349a827a4c8417a19da421610cd5977e6921fea5120803586","source":{"kind":"arxiv","id":"1906.10684","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10684","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10684v1","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10684","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"TRDVDHLVYQIN","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TRDVDHLVYQINGSNI","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TRDVDHLV","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TRDVDHLVYQINGSNIE6SMQQL2DH","target":"record","payload":{"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"},"canonical_sha256":"9c47519d75c410d349a827a4c8417a19da421610cd5977e6921fea5120803586","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"},"source_kind":"arxiv","source_id":"1906.10684","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6GWz7OoMAfhbUwsoOF1/+BLzPIpopjsywU2EqoxUfOs9szVKQ+iSiT7j7CsQsC4Ne31ShcHNvd46r6kk46PDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:17:05.906870Z"},"content_sha256":"c5fc0f1bbdadb30db44bc1c229ae34f18b2a0c1b82dab1945450a6c5a577e0e0","schema_version":"1.0","event_id":"sha256:c5fc0f1bbdadb30db44bc1c229ae34f18b2a0c1b82dab1945450a6c5a577e0e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TRDVDHLVYQINGSNIE6SMQQL2DH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0fIUHmEyhSM7R8qmdp+0TSKA0Fm+zj+li/tBZmp+N09D3SHmARURz+jSpaUVdbakSDqdvptUoJdoglYfg8L9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:17:05.907229Z"},"content_sha256":"a00cc51c94d96f9a1e5f66f0a5ad6e74d12e39df45d6663829d2f3a6c7506c92","schema_version":"1.0","event_id":"sha256:a00cc51c94d96f9a1e5f66f0a5ad6e74d12e39df45d6663829d2f3a6c7506c92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TRDVDHLVYQINGSNIE6SMQQL2DH/bundle.json","state_url":"https://pith.science/pith/TRDVDHLVYQINGSNIE6SMQQL2DH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TRDVDHLVYQINGSNIE6SMQQL2DH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T12:17:05Z","links":{"resolver":"https://pith.science/pith/TRDVDHLVYQINGSNIE6SMQQL2DH","bundle":"https://pith.science/pith/TRDVDHLVYQINGSNIE6SMQQL2DH/bundle.json","state":"https://pith.science/pith/TRDVDHLVYQINGSNIE6SMQQL2DH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TRDVDHLVYQINGSNIE6SMQQL2DH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TRDVDHLVYQINGSNIE6SMQQL2DH","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":"8842940e8fa002082a3c501be5097238e29c24c7669106bc372c28f466886d18","cross_cats_sorted":["cs.CR","cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-25T17:59:10Z","title_canon_sha256":"8a4a1bb158cfccf14ede7a9e9149afffa53bba5732657fe98b5669e446b8e1ad"},"schema_version":"1.0","source":{"id":"1906.10684","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10684","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10684v1","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10684","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"TRDVDHLVYQIN","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TRDVDHLVYQINGSNI","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TRDVDHLV","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:a00cc51c94d96f9a1e5f66f0a5ad6e74d12e39df45d6663829d2f3a6c7506c92","target":"graph","created_at":"2026-05-17T23:42:15Z","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"},"paper":{"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","authors_text":"Ravi Tandon, Wei-Ting Chang","cross_cats":["cs.CR","cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-25T17:59:10Z","title":"On the Upload versus Download Cost for Secure and Private Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10684","kind":"arxiv","version":1},"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:c5fc0f1bbdadb30db44bc1c229ae34f18b2a0c1b82dab1945450a6c5a577e0e0","target":"record","created_at":"2026-05-17T23:42:15Z","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":"8842940e8fa002082a3c501be5097238e29c24c7669106bc372c28f466886d18","cross_cats_sorted":["cs.CR","cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-25T17:59:10Z","title_canon_sha256":"8a4a1bb158cfccf14ede7a9e9149afffa53bba5732657fe98b5669e446b8e1ad"},"schema_version":"1.0","source":{"id":"1906.10684","kind":"arxiv","version":1}},"canonical_sha256":"9c47519d75c410d349a827a4c8417a19da421610cd5977e6921fea5120803586","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c47519d75c410d349a827a4c8417a19da421610cd5977e6921fea5120803586","first_computed_at":"2026-05-17T23:42:15.604015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:15.604015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jrJOyrnaduBm+w/9SdLRjmsg+6cJHZLCCeu1Qt4oRcdUOtqrf48PUKbyPfB68KWDWL2u5sSTS3qooICy1gAIBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:15.604610Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10684","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5fc0f1bbdadb30db44bc1c229ae34f18b2a0c1b82dab1945450a6c5a577e0e0","sha256:a00cc51c94d96f9a1e5f66f0a5ad6e74d12e39df45d6663829d2f3a6c7506c92"],"state_sha256":"f3fde57798d7436ee8d13079afab378dcf7cb66771f620057d21ceb0ea8a5e4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bqbigqGyA6vqt1X4Z7k4AwW3SXZxisf2061AWvtiiO1jyfZU4/0WV2hjCYn4x1rxds63wiMkArOTZkNOyNOABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:17:05.909536Z","bundle_sha256":"133c4d45057a38073c2d7c136bc2e92cec41bd6ee07b09fddc024a4fd15075e4"}}