{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SUHELTLOP5MRYW4D35OMZ27CHG","short_pith_number":"pith:SUHELTLO","schema_version":"1.0","canonical_sha256":"950e45cd6e7f591c5b83df5cccebe239a9fcddef610bfd89e0dd9da796580f73","source":{"kind":"arxiv","id":"1908.06957","version":2},"attestation_state":"computed","paper":{"title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Syed A. Jafar, Zhuqing Jia","submitted_at":"2019-08-19T17:52:22Z","abstract_excerpt":"The problem of secure distributed batch matrix multiplication (SDBMM) studies the communication efficiency of retrieving a sequence of desired matrix products ${\\bf AB}$ $=$ $({\\bf A}_1{\\bf B}_1,$ ${\\bf A}_2{\\bf B}_2,$ $\\cdots,$ ${\\bf A}_S{\\bf B}_S)$ from $N$ distributed servers where the constituent matrices ${\\bf A}=({\\bf A}_1, {\\bf A}_2, \\cdots, {\\bf A}_S)$ and ${\\bf B}=({\\bf B}_1, {\\bf B}_2,\\cdots,{\\bf B}_S)$ are stored in $X$-secure coded form, i.e., any group of up to $X$ colluding servers learn nothing about ${\\bf A, B}$. It is assumed that ${\\bf A}_s\\in\\mathbb{F}_q^{L\\times K}, {\\bf B}"},"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":"1908.06957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-19T17:52:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3921976391c5a8d160f99f839a067afa056680f619cb98d7a4df36f7ebc5c823","abstract_canon_sha256":"c81bcddadcb4c06599b081c3b8a1f740505c94fea2fa07ab607e44b59ff4364f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:51:05.389024Z","signature_b64":"cJh/mkOIZsrhq5uM/tRqLYqIANsf4OwBIIgN92v6H/v8Ts2RXcFQPxppUtsx3ohDe0sSXf+dNiw5LSo2HcLqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"950e45cd6e7f591c5b83df5cccebe239a9fcddef610bfd89e0dd9da796580f73","last_reissued_at":"2026-07-05T02:51:05.388585Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:51:05.388585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Syed A. Jafar, Zhuqing Jia","submitted_at":"2019-08-19T17:52:22Z","abstract_excerpt":"The problem of secure distributed batch matrix multiplication (SDBMM) studies the communication efficiency of retrieving a sequence of desired matrix products ${\\bf AB}$ $=$ $({\\bf A}_1{\\bf B}_1,$ ${\\bf A}_2{\\bf B}_2,$ $\\cdots,$ ${\\bf A}_S{\\bf B}_S)$ from $N$ distributed servers where the constituent matrices ${\\bf A}=({\\bf A}_1, {\\bf A}_2, \\cdots, {\\bf A}_S)$ and ${\\bf B}=({\\bf B}_1, {\\bf B}_2,\\cdots,{\\bf B}_S)$ are stored in $X$-secure coded form, i.e., any group of up to $X$ colluding servers learn nothing about ${\\bf A, B}$. It is assumed that ${\\bf A}_s\\in\\mathbb{F}_q^{L\\times K}, {\\bf B}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06957","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/1908.06957/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":"1908.06957","created_at":"2026-07-05T02:51:05.388640+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06957v2","created_at":"2026-07-05T02:51:05.388640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06957","created_at":"2026-07-05T02:51:05.388640+00:00"},{"alias_kind":"pith_short_12","alias_value":"SUHELTLOP5MR","created_at":"2026-07-05T02:51:05.388640+00:00"},{"alias_kind":"pith_short_16","alias_value":"SUHELTLOP5MRYW4D","created_at":"2026-07-05T02:51:05.388640+00:00"},{"alias_kind":"pith_short_8","alias_value":"SUHELTLO","created_at":"2026-07-05T02:51:05.388640+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.00407","citing_title":"Private and Secure Distributed Matrix Multiplication with Flexible Communication Load","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SUHELTLOP5MRYW4D35OMZ27CHG","json":"https://pith.science/pith/SUHELTLOP5MRYW4D35OMZ27CHG.json","graph_json":"https://pith.science/api/pith-number/SUHELTLOP5MRYW4D35OMZ27CHG/graph.json","events_json":"https://pith.science/api/pith-number/SUHELTLOP5MRYW4D35OMZ27CHG/events.json","paper":"https://pith.science/paper/SUHELTLO"},"agent_actions":{"view_html":"https://pith.science/pith/SUHELTLOP5MRYW4D35OMZ27CHG","download_json":"https://pith.science/pith/SUHELTLOP5MRYW4D35OMZ27CHG.json","view_paper":"https://pith.science/paper/SUHELTLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06957&json=true","fetch_graph":"https://pith.science/api/pith-number/SUHELTLOP5MRYW4D35OMZ27CHG/graph.json","fetch_events":"https://pith.science/api/pith-number/SUHELTLOP5MRYW4D35OMZ27CHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SUHELTLOP5MRYW4D35OMZ27CHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SUHELTLOP5MRYW4D35OMZ27CHG/action/storage_attestation","attest_author":"https://pith.science/pith/SUHELTLOP5MRYW4D35OMZ27CHG/action/author_attestation","sign_citation":"https://pith.science/pith/SUHELTLOP5MRYW4D35OMZ27CHG/action/citation_signature","submit_replication":"https://pith.science/pith/SUHELTLOP5MRYW4D35OMZ27CHG/action/replication_record"}},"created_at":"2026-07-05T02:51:05.388640+00:00","updated_at":"2026-07-05T02:51:05.388640+00:00"}