{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HGMFOSUBKA54EBNTXC7I3WIBVK","short_pith_number":"pith:HGMFOSUB","canonical_record":{"source":{"id":"1812.09962","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-24T18:28:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"db81ddff7792d2735a1368e52d3322131c82a2f5a72df4bbf090950d2b983980","abstract_canon_sha256":"833464483c58c91dfe001a26d650cfeef4d999f7253bd62dfa216cd66b4c3040"},"schema_version":"1.0"},"canonical_sha256":"3998574a81503bc205b3b8be8dd901aa8feb215e25778cc29ab3d513fb5ff8d8","source":{"kind":"arxiv","id":"1812.09962","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09962","created_at":"2026-07-05T00:40:12Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09962v3","created_at":"2026-07-05T00:40:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09962","created_at":"2026-07-05T00:40:12Z"},{"alias_kind":"pith_short_12","alias_value":"HGMFOSUBKA54","created_at":"2026-07-05T00:40:12Z"},{"alias_kind":"pith_short_16","alias_value":"HGMFOSUBKA54EBNT","created_at":"2026-07-05T00:40:12Z"},{"alias_kind":"pith_short_8","alias_value":"HGMFOSUB","created_at":"2026-07-05T00:40:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HGMFOSUBKA54EBNTXC7I3WIBVK","target":"record","payload":{"canonical_record":{"source":{"id":"1812.09962","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-24T18:28:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"db81ddff7792d2735a1368e52d3322131c82a2f5a72df4bbf090950d2b983980","abstract_canon_sha256":"833464483c58c91dfe001a26d650cfeef4d999f7253bd62dfa216cd66b4c3040"},"schema_version":"1.0"},"canonical_sha256":"3998574a81503bc205b3b8be8dd901aa8feb215e25778cc29ab3d513fb5ff8d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:12.145269Z","signature_b64":"+IbEw12QP/vKGt8XGIk7plloNpIcJVGYcQX0xf9y1hWf4im7b0DUKzDODrqwfy+jkDpYxzhHUWCUDE0Iqqt9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3998574a81503bc205b3b8be8dd901aa8feb215e25778cc29ab3d513fb5ff8d8","last_reissued_at":"2026-07-05T00:40:12.144819Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:12.144819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.09962","source_version":3,"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-07-05T00:40:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"elCRbIJ1NHym/WBwo4Dl2bBNf8PLDbt5iS0yVfKGfHVgM/LRH50AhkuPstALh8g0UV3o+EgGZO9pX8o8SMVpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:18:01.594019Z"},"content_sha256":"f5edeb8c68721ff823a6525b00e4c217c8ab108c26edc1461c7285d08f3be098","schema_version":"1.0","event_id":"sha256:f5edeb8c68721ff823a6525b00e4c217c8ab108c26edc1461c7285d08f3be098"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HGMFOSUBKA54EBNTXC7I3WIBVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GASP Codes for Secure Distributed Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Karpuk, Rafael G.L. D'Oliveira, Salim El Rouayheb","submitted_at":"2018-12-24T18:28:12Z","abstract_excerpt":"We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We construct polynomial codes for SDMM by studying a combinatorial problem on a special type of addition table, which we call the degree table. The codes are based on arithmetic progressions, and are thus named GASP (Gap Additive Secure Polynomial) Codes. GASP Codes are shown to outperform all previously known polynomial codes for secure distributed matrix multiplication in terms of download rate."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09962","kind":"arxiv","version":3},"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/1812.09962/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"},"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-07-05T00:40:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q5wV9pNFdcmlKrbVDKfsALYhvpIzfYXnsCmtCkGYFCb0gtbOMyNbmgw6C7ODOzdlvHueSkZ/ME2rdYbVmpChCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T14:18:01.594411Z"},"content_sha256":"329e93005372e52dfdf271784f3d776e2be8f228da9949fccf10eb1a4de8b409","schema_version":"1.0","event_id":"sha256:329e93005372e52dfdf271784f3d776e2be8f228da9949fccf10eb1a4de8b409"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGMFOSUBKA54EBNTXC7I3WIBVK/bundle.json","state_url":"https://pith.science/pith/HGMFOSUBKA54EBNTXC7I3WIBVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGMFOSUBKA54EBNTXC7I3WIBVK/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-07-07T14:18:01Z","links":{"resolver":"https://pith.science/pith/HGMFOSUBKA54EBNTXC7I3WIBVK","bundle":"https://pith.science/pith/HGMFOSUBKA54EBNTXC7I3WIBVK/bundle.json","state":"https://pith.science/pith/HGMFOSUBKA54EBNTXC7I3WIBVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGMFOSUBKA54EBNTXC7I3WIBVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HGMFOSUBKA54EBNTXC7I3WIBVK","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":"833464483c58c91dfe001a26d650cfeef4d999f7253bd62dfa216cd66b4c3040","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-24T18:28:12Z","title_canon_sha256":"db81ddff7792d2735a1368e52d3322131c82a2f5a72df4bbf090950d2b983980"},"schema_version":"1.0","source":{"id":"1812.09962","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09962","created_at":"2026-07-05T00:40:12Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09962v3","created_at":"2026-07-05T00:40:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09962","created_at":"2026-07-05T00:40:12Z"},{"alias_kind":"pith_short_12","alias_value":"HGMFOSUBKA54","created_at":"2026-07-05T00:40:12Z"},{"alias_kind":"pith_short_16","alias_value":"HGMFOSUBKA54EBNT","created_at":"2026-07-05T00:40:12Z"},{"alias_kind":"pith_short_8","alias_value":"HGMFOSUB","created_at":"2026-07-05T00:40:12Z"}],"graph_snapshots":[{"event_id":"sha256:329e93005372e52dfdf271784f3d776e2be8f228da9949fccf10eb1a4de8b409","target":"graph","created_at":"2026-07-05T00:40:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1812.09962/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We construct polynomial codes for SDMM by studying a combinatorial problem on a special type of addition table, which we call the degree table. The codes are based on arithmetic progressions, and are thus named GASP (Gap Additive Secure Polynomial) Codes. GASP Codes are shown to outperform all previously known polynomial codes for secure distributed matrix multiplication in terms of download rate.","authors_text":"David Karpuk, Rafael G.L. D'Oliveira, Salim El Rouayheb","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-24T18:28:12Z","title":"GASP Codes for Secure Distributed Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09962","kind":"arxiv","version":3},"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:f5edeb8c68721ff823a6525b00e4c217c8ab108c26edc1461c7285d08f3be098","target":"record","created_at":"2026-07-05T00:40:12Z","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":"833464483c58c91dfe001a26d650cfeef4d999f7253bd62dfa216cd66b4c3040","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-24T18:28:12Z","title_canon_sha256":"db81ddff7792d2735a1368e52d3322131c82a2f5a72df4bbf090950d2b983980"},"schema_version":"1.0","source":{"id":"1812.09962","kind":"arxiv","version":3}},"canonical_sha256":"3998574a81503bc205b3b8be8dd901aa8feb215e25778cc29ab3d513fb5ff8d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3998574a81503bc205b3b8be8dd901aa8feb215e25778cc29ab3d513fb5ff8d8","first_computed_at":"2026-07-05T00:40:12.144819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:40:12.144819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+IbEw12QP/vKGt8XGIk7plloNpIcJVGYcQX0xf9y1hWf4im7b0DUKzDODrqwfy+jkDpYxzhHUWCUDE0Iqqt9Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:40:12.145269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09962","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5edeb8c68721ff823a6525b00e4c217c8ab108c26edc1461c7285d08f3be098","sha256:329e93005372e52dfdf271784f3d776e2be8f228da9949fccf10eb1a4de8b409"],"state_sha256":"998f66b1fa4be6d6a0d6ad009c4c77b604ced2679f9720a8c36d30ba141bd08c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BSevjY6wx1Yvojn1T/faxkbbvMe6OGgx4YDTgfmrGto1feiNh/+6Vrpcf/PyV4BvPIXnFQj29WfvIVDdre3xCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T14:18:01.596438Z","bundle_sha256":"eccfc12d5592fc9e5e7187883e6d77aaf1794b59856e849e1ffc42ca89162bc2"}}