{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y53LA4SF6M5B7WC7CPUXBELOT2","short_pith_number":"pith:Y53LA4SF","canonical_record":{"source":{"id":"1810.13006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-30T21:03:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d8b1c814e7e91ea0f904a07dbb29e1c09ee6079689b74ad53f8d55c939717504","abstract_canon_sha256":"90cd44166fc8a4cdfb85a8bde107430d001402c39c1eb75f574afed6d5097ed1"},"schema_version":"1.0"},"canonical_sha256":"c776b07245f33a1fd85f13e970916e9ea84a9153c07b2bb8506e5bbd727f6c72","source":{"kind":"arxiv","id":"1810.13006","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13006","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13006v1","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13006","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"Y53LA4SF6M5B","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y53LA4SF6M5B7WC7","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y53LA4SF","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y53LA4SF6M5B7WC7CPUXBELOT2","target":"record","payload":{"canonical_record":{"source":{"id":"1810.13006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-30T21:03:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d8b1c814e7e91ea0f904a07dbb29e1c09ee6079689b74ad53f8d55c939717504","abstract_canon_sha256":"90cd44166fc8a4cdfb85a8bde107430d001402c39c1eb75f574afed6d5097ed1"},"schema_version":"1.0"},"canonical_sha256":"c776b07245f33a1fd85f13e970916e9ea84a9153c07b2bb8506e5bbd727f6c72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:52.486449Z","signature_b64":"7sSawoUhuZo9HkY/mZOWI+Zbvn6RXobB9vxAiQ0mD/ofM1fMoVT2XUTbD565IXiehLrmQXZJfwTvIt6eQsvuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c776b07245f33a1fd85f13e970916e9ea84a9153c07b2bb8506e5bbd727f6c72","last_reissued_at":"2026-05-18T00:01:52.486066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:52.486066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.13006","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-18T00:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a4dppYUJGa4lbY3Em3B+t4jx9FDFv2zrBycninPKF4VAGF+Vzb5y4sfiuH6zrBS3zYfTkT4D7vwRxXn1wiSACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:44:52.322581Z"},"content_sha256":"05227472fce86f3c3073c9468d8474c89072b400ed2557c47fb92a7d142b5ccb","schema_version":"1.0","event_id":"sha256:05227472fce86f3c3073c9468d8474c89072b400ed2557c47fb92a7d142b5ccb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y53LA4SF6M5B7WC7CPUXBELOT2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rate-Efficiency and Straggler-Robustness through Partition in Distributed Two-Sided Secure Matrix Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aydin Sezgin, Jaber Kakar, Seyedhamed Ebadifar","submitted_at":"2018-10-30T21:03:55Z","abstract_excerpt":"Computationally efficient matrix multiplication is a fundamental requirement in various fields, including and particularly in data analytics. To do so, the computation task of a large-scale matrix multiplication is typically outsourced to multiple servers. However, due to data misusage at the servers, security is typically of concern. In this paper, we study the two-sided secure matrix multiplication problem, where a user is interested in the matrix product $\\boldsymbol{AB}$ of two finite field private matrices $\\boldsymbol{A}$ and $\\boldsymbol{B}$ from an information-theoretic perspective. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13006","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-18T00:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dYJ45NYmuf2OrBfbDCD6NzLS1fHHuWMB3ms+GnWWwGR09dHn7MKG/oGhl+IsA4qSuKAGvkqCI57LBw98AtlTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:44:52.323193Z"},"content_sha256":"0793d94b46783314ecf1e29fb0130c11467736b9a794732b891c4028d143162e","schema_version":"1.0","event_id":"sha256:0793d94b46783314ecf1e29fb0130c11467736b9a794732b891c4028d143162e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y53LA4SF6M5B7WC7CPUXBELOT2/bundle.json","state_url":"https://pith.science/pith/Y53LA4SF6M5B7WC7CPUXBELOT2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y53LA4SF6M5B7WC7CPUXBELOT2/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-26T17:44:52Z","links":{"resolver":"https://pith.science/pith/Y53LA4SF6M5B7WC7CPUXBELOT2","bundle":"https://pith.science/pith/Y53LA4SF6M5B7WC7CPUXBELOT2/bundle.json","state":"https://pith.science/pith/Y53LA4SF6M5B7WC7CPUXBELOT2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y53LA4SF6M5B7WC7CPUXBELOT2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y53LA4SF6M5B7WC7CPUXBELOT2","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":"90cd44166fc8a4cdfb85a8bde107430d001402c39c1eb75f574afed6d5097ed1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-30T21:03:55Z","title_canon_sha256":"d8b1c814e7e91ea0f904a07dbb29e1c09ee6079689b74ad53f8d55c939717504"},"schema_version":"1.0","source":{"id":"1810.13006","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13006","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13006v1","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13006","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"Y53LA4SF6M5B","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y53LA4SF6M5B7WC7","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y53LA4SF","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:0793d94b46783314ecf1e29fb0130c11467736b9a794732b891c4028d143162e","target":"graph","created_at":"2026-05-18T00:01:52Z","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":"Computationally efficient matrix multiplication is a fundamental requirement in various fields, including and particularly in data analytics. To do so, the computation task of a large-scale matrix multiplication is typically outsourced to multiple servers. However, due to data misusage at the servers, security is typically of concern. In this paper, we study the two-sided secure matrix multiplication problem, where a user is interested in the matrix product $\\boldsymbol{AB}$ of two finite field private matrices $\\boldsymbol{A}$ and $\\boldsymbol{B}$ from an information-theoretic perspective. In","authors_text":"Aydin Sezgin, Jaber Kakar, Seyedhamed Ebadifar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-30T21:03:55Z","title":"Rate-Efficiency and Straggler-Robustness through Partition in Distributed Two-Sided Secure Matrix Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13006","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:05227472fce86f3c3073c9468d8474c89072b400ed2557c47fb92a7d142b5ccb","target":"record","created_at":"2026-05-18T00:01:52Z","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":"90cd44166fc8a4cdfb85a8bde107430d001402c39c1eb75f574afed6d5097ed1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-30T21:03:55Z","title_canon_sha256":"d8b1c814e7e91ea0f904a07dbb29e1c09ee6079689b74ad53f8d55c939717504"},"schema_version":"1.0","source":{"id":"1810.13006","kind":"arxiv","version":1}},"canonical_sha256":"c776b07245f33a1fd85f13e970916e9ea84a9153c07b2bb8506e5bbd727f6c72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c776b07245f33a1fd85f13e970916e9ea84a9153c07b2bb8506e5bbd727f6c72","first_computed_at":"2026-05-18T00:01:52.486066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:52.486066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7sSawoUhuZo9HkY/mZOWI+Zbvn6RXobB9vxAiQ0mD/ofM1fMoVT2XUTbD565IXiehLrmQXZJfwTvIt6eQsvuDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:52.486449Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.13006","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05227472fce86f3c3073c9468d8474c89072b400ed2557c47fb92a7d142b5ccb","sha256:0793d94b46783314ecf1e29fb0130c11467736b9a794732b891c4028d143162e"],"state_sha256":"9c0ac90b678084b3e0fd6b9da866eab22744bd5212c219ac773ebac8b7d62943"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lngc621Tq3CglAoYQLp1q/oDvdxh1f/Wq+T0ruNxclQfiaNB73t1hdLVW0Gq/BzLOLTWdp5nG3p4PmQ6liCQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:44:52.326661Z","bundle_sha256":"5f66fd5738455b766e5aef321eace088195fc03d62ae14dce5ff0ae87dd79e27"}}