{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GRXAMT7G4B64VN6O4DVIR7J4IP","short_pith_number":"pith:GRXAMT7G","canonical_record":{"source":{"id":"1909.00407","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-01T14:09:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"20cb53abe14b6cf9425e27c2bf467b66b3605963a03862a64ea20b8c1d00e6c9","abstract_canon_sha256":"0ba1da7b9f9c0a311d290f0a7b2ab6fc67bca590b29271361d4441eec163765a"},"schema_version":"1.0"},"canonical_sha256":"346e064fe6e07dcab7cee0ea88fd3c43c8900bc738af6784c18821b8480fa7ef","source":{"kind":"arxiv","id":"1909.00407","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00407","created_at":"2026-07-05T00:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00407v2","created_at":"2026-07-05T00:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00407","created_at":"2026-07-05T00:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"GRXAMT7G4B64","created_at":"2026-07-05T00:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"GRXAMT7G4B64VN6O","created_at":"2026-07-05T00:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"GRXAMT7G","created_at":"2026-07-05T00:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GRXAMT7G4B64VN6O4DVIR7J4IP","target":"record","payload":{"canonical_record":{"source":{"id":"1909.00407","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-01T14:09:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"20cb53abe14b6cf9425e27c2bf467b66b3605963a03862a64ea20b8c1d00e6c9","abstract_canon_sha256":"0ba1da7b9f9c0a311d290f0a7b2ab6fc67bca590b29271361d4441eec163765a"},"schema_version":"1.0"},"canonical_sha256":"346e064fe6e07dcab7cee0ea88fd3c43c8900bc738af6784c18821b8480fa7ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:26:58.528747Z","signature_b64":"RjyRdDRxXqJFNErBNMmbfcleLgMWT2BvMgoL1QiUPvGVOfanCuCR+8KAgWhQ/i9rJ3Z6trZSBtlga9+p9ncAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"346e064fe6e07dcab7cee0ea88fd3c43c8900bc738af6784c18821b8480fa7ef","last_reissued_at":"2026-07-05T00:26:58.528250Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:26:58.528250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.00407","source_version":2,"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:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K23osyhYjGtXGhKvXZQbiGVyQ/L0fqm7F1vLFubdFtXDWT1+Olhrb+Qa0DT2PltTLJH+XAxmROQ3P4Lxn8pfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T00:16:36.924862Z"},"content_sha256":"0ce567c1dcffee6ebc2c34b9fe9f8eaf5f5b039bd6cd8515461d089cd9e56182","schema_version":"1.0","event_id":"sha256:0ce567c1dcffee6ebc2c34b9fe9f8eaf5f5b039bd6cd8515461d089cd9e56182"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GRXAMT7G4B64VN6O4DVIR7J4IP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Private and Secure Distributed Matrix Multiplication with Flexible Communication Load","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joerg Kliewer, Malihe Aliasgari, Osvaldo Simeone","submitted_at":"2019-09-01T14:09:01Z","abstract_excerpt":"Large matrix multiplications are central to large-scale machine learning applications. These operations are often carried out on a distributed computing platform with a master server and multiple workers in the cloud operating in parallel. For such distributed platforms, it has been recently shown that coding over the input data matrices can reduce the computational delay, yielding a trade-off between recovery threshold, i.e., the number of workers required to recover the matrix product, and communication load, i.e., the total amount of data to be downloaded from the workers. In this paper, in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00407","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/1909.00407/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:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDXLewI+gZSOxKLU+jmI7/gc6zs9WzRsMrLCs7ljKgDZ2/5f7OREcQGs7I7QfgxIsqbHqRwJwcYNLr0Kqn3IBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T00:16:36.925227Z"},"content_sha256":"55469dd73c6a4946b747819e5631012ad3f4009b9f0ea5644c1115cb54e366b9","schema_version":"1.0","event_id":"sha256:55469dd73c6a4946b747819e5631012ad3f4009b9f0ea5644c1115cb54e366b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRXAMT7G4B64VN6O4DVIR7J4IP/bundle.json","state_url":"https://pith.science/pith/GRXAMT7G4B64VN6O4DVIR7J4IP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRXAMT7G4B64VN6O4DVIR7J4IP/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-08-15T00:16:36Z","links":{"resolver":"https://pith.science/pith/GRXAMT7G4B64VN6O4DVIR7J4IP","bundle":"https://pith.science/pith/GRXAMT7G4B64VN6O4DVIR7J4IP/bundle.json","state":"https://pith.science/pith/GRXAMT7G4B64VN6O4DVIR7J4IP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRXAMT7G4B64VN6O4DVIR7J4IP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GRXAMT7G4B64VN6O4DVIR7J4IP","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":"0ba1da7b9f9c0a311d290f0a7b2ab6fc67bca590b29271361d4441eec163765a","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-01T14:09:01Z","title_canon_sha256":"20cb53abe14b6cf9425e27c2bf467b66b3605963a03862a64ea20b8c1d00e6c9"},"schema_version":"1.0","source":{"id":"1909.00407","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00407","created_at":"2026-07-05T00:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00407v2","created_at":"2026-07-05T00:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00407","created_at":"2026-07-05T00:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"GRXAMT7G4B64","created_at":"2026-07-05T00:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"GRXAMT7G4B64VN6O","created_at":"2026-07-05T00:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"GRXAMT7G","created_at":"2026-07-05T00:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:55469dd73c6a4946b747819e5631012ad3f4009b9f0ea5644c1115cb54e366b9","target":"graph","created_at":"2026-07-05T00:26:58Z","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/1909.00407/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large matrix multiplications are central to large-scale machine learning applications. These operations are often carried out on a distributed computing platform with a master server and multiple workers in the cloud operating in parallel. For such distributed platforms, it has been recently shown that coding over the input data matrices can reduce the computational delay, yielding a trade-off between recovery threshold, i.e., the number of workers required to recover the matrix product, and communication load, i.e., the total amount of data to be downloaded from the workers. In this paper, in","authors_text":"Joerg Kliewer, Malihe Aliasgari, Osvaldo Simeone","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-01T14:09:01Z","title":"Private and Secure Distributed Matrix Multiplication with Flexible Communication Load"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00407","kind":"arxiv","version":2},"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:0ce567c1dcffee6ebc2c34b9fe9f8eaf5f5b039bd6cd8515461d089cd9e56182","target":"record","created_at":"2026-07-05T00:26:58Z","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":"0ba1da7b9f9c0a311d290f0a7b2ab6fc67bca590b29271361d4441eec163765a","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2019-09-01T14:09:01Z","title_canon_sha256":"20cb53abe14b6cf9425e27c2bf467b66b3605963a03862a64ea20b8c1d00e6c9"},"schema_version":"1.0","source":{"id":"1909.00407","kind":"arxiv","version":2}},"canonical_sha256":"346e064fe6e07dcab7cee0ea88fd3c43c8900bc738af6784c18821b8480fa7ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"346e064fe6e07dcab7cee0ea88fd3c43c8900bc738af6784c18821b8480fa7ef","first_computed_at":"2026-07-05T00:26:58.528250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:26:58.528250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RjyRdDRxXqJFNErBNMmbfcleLgMWT2BvMgoL1QiUPvGVOfanCuCR+8KAgWhQ/i9rJ3Z6trZSBtlga9+p9ncAAA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:26:58.528747Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.00407","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ce567c1dcffee6ebc2c34b9fe9f8eaf5f5b039bd6cd8515461d089cd9e56182","sha256:55469dd73c6a4946b747819e5631012ad3f4009b9f0ea5644c1115cb54e366b9"],"state_sha256":"fd974d6f0366fdd756bd7abef0ddff1eb9abdfe05dcb58e25c88944e8a572150"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nOijA3tm6s8RsWVhTOIw1ZS075ogIMcO8kCtfnXnM2EUf7LTPGMM09lMvMd9TJeJBFOgpNgOPLUcBTbL9pJVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T00:16:36.927520Z","bundle_sha256":"563863c40e1b34dcecbec04a10aa5779ee28fdf4b1a8319f1c3f4effcfe4816d"}}