{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:W5PASWT2UX4YTOFWBKKEEEEKZM","short_pith_number":"pith:W5PASWT2","canonical_record":{"source":{"id":"1811.07325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-18T13:08:19Z","cross_cats_sorted":[],"title_canon_sha256":"d58d051c7f0feeacb068eb28b2f904be4b5c2d0f07c54a0f678b9ae21f561aa1","abstract_canon_sha256":"d29f19bc9b7e19d7e3b80418f5566420719d54bb8927d2093321eacc8091b5de"},"schema_version":"1.0"},"canonical_sha256":"b75e095a7aa5f989b8b60a9442108acb05733b72d46a3c86cfc7b11c18d61ca5","source":{"kind":"arxiv","id":"1811.07325","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07325","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07325v2","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07325","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"pith_short_12","alias_value":"W5PASWT2UX4Y","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W5PASWT2UX4YTOFW","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W5PASWT2","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:W5PASWT2UX4YTOFWBKKEEEEKZM","target":"record","payload":{"canonical_record":{"source":{"id":"1811.07325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-18T13:08:19Z","cross_cats_sorted":[],"title_canon_sha256":"d58d051c7f0feeacb068eb28b2f904be4b5c2d0f07c54a0f678b9ae21f561aa1","abstract_canon_sha256":"d29f19bc9b7e19d7e3b80418f5566420719d54bb8927d2093321eacc8091b5de"},"schema_version":"1.0"},"canonical_sha256":"b75e095a7aa5f989b8b60a9442108acb05733b72d46a3c86cfc7b11c18d61ca5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:07.774469Z","signature_b64":"rMiVG2RI5SovlBSqf6/H0QY9RBwz59KMvfecpQ9KwdW+5tjz2QbIegAid8Z7G9K12ukVjBQj6OKIq/kS1nEDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b75e095a7aa5f989b8b60a9442108acb05733b72d46a3c86cfc7b11c18d61ca5","last_reissued_at":"2026-05-18T00:00:07.773846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:07.773846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.07325","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-05-18T00:00:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RuD+i1KghVL4wPu4LptlRrP55B6GeQ6kwUa6Irt67B99CetDtagl5VMXq5rozdOEPVHQLcg4VV+NCmTLjoBFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:39:27.503892Z"},"content_sha256":"80fbb6a983e9110499d7b28bd29e87279d46e1cc9231bba8f0735ccd3426155e","schema_version":"1.0","event_id":"sha256:80fbb6a983e9110499d7b28bd29e87279d46e1cc9231bba8f0735ccd3426155e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:W5PASWT2UX4YTOFWBKKEEEEKZM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stark: Fast and Scalable Strassen's Matrix Multiplication using Apache Spark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chandan Misra, Soumya K. Ghosh, Sourangshu Bhattacharya","submitted_at":"2018-11-18T13:08:19Z","abstract_excerpt":"This paper presents a new fast, highly scalable distributed matrix multiplication algorithm on Apache Spark, called Stark, based on Strassen's matrix multiplication algorithm. Stark preserves Strassen's 7 multiplications scheme in a distributed environment and thus achieves faster execution. It is based on two new ideas; it creates a recursion tree of computation where each level of such tree corresponds to division and combination of distributed matrix blocks in the form of Resilient Distributed Datasets(RDDs); It processes each divide and combine step in parallel and memorize the sub-matrice"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07325","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":""},"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:00:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aq42+zn0x0RTtXDiF8XojaA9C2eQ/5ZR1/71AYLLRiHp98ShvC7zaAN32c9JMpfYxs+wIKpl5O8HWxcgJyE9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:39:27.504229Z"},"content_sha256":"b3fb3c2e7519fe99ffd5dcf3edef68d1b47b3445d4ef1b932982a816b0a9f34d","schema_version":"1.0","event_id":"sha256:b3fb3c2e7519fe99ffd5dcf3edef68d1b47b3445d4ef1b932982a816b0a9f34d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5PASWT2UX4YTOFWBKKEEEEKZM/bundle.json","state_url":"https://pith.science/pith/W5PASWT2UX4YTOFWBKKEEEEKZM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5PASWT2UX4YTOFWBKKEEEEKZM/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-06-01T13:39:27Z","links":{"resolver":"https://pith.science/pith/W5PASWT2UX4YTOFWBKKEEEEKZM","bundle":"https://pith.science/pith/W5PASWT2UX4YTOFWBKKEEEEKZM/bundle.json","state":"https://pith.science/pith/W5PASWT2UX4YTOFWBKKEEEEKZM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5PASWT2UX4YTOFWBKKEEEEKZM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:W5PASWT2UX4YTOFWBKKEEEEKZM","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":"d29f19bc9b7e19d7e3b80418f5566420719d54bb8927d2093321eacc8091b5de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-18T13:08:19Z","title_canon_sha256":"d58d051c7f0feeacb068eb28b2f904be4b5c2d0f07c54a0f678b9ae21f561aa1"},"schema_version":"1.0","source":{"id":"1811.07325","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07325","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07325v2","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07325","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"pith_short_12","alias_value":"W5PASWT2UX4Y","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W5PASWT2UX4YTOFW","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W5PASWT2","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:b3fb3c2e7519fe99ffd5dcf3edef68d1b47b3445d4ef1b932982a816b0a9f34d","target":"graph","created_at":"2026-05-18T00:00:07Z","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":"This paper presents a new fast, highly scalable distributed matrix multiplication algorithm on Apache Spark, called Stark, based on Strassen's matrix multiplication algorithm. Stark preserves Strassen's 7 multiplications scheme in a distributed environment and thus achieves faster execution. It is based on two new ideas; it creates a recursion tree of computation where each level of such tree corresponds to division and combination of distributed matrix blocks in the form of Resilient Distributed Datasets(RDDs); It processes each divide and combine step in parallel and memorize the sub-matrice","authors_text":"Chandan Misra, Soumya K. Ghosh, Sourangshu Bhattacharya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-18T13:08:19Z","title":"Stark: Fast and Scalable Strassen's Matrix Multiplication using Apache Spark"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07325","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:80fbb6a983e9110499d7b28bd29e87279d46e1cc9231bba8f0735ccd3426155e","target":"record","created_at":"2026-05-18T00:00:07Z","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":"d29f19bc9b7e19d7e3b80418f5566420719d54bb8927d2093321eacc8091b5de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-18T13:08:19Z","title_canon_sha256":"d58d051c7f0feeacb068eb28b2f904be4b5c2d0f07c54a0f678b9ae21f561aa1"},"schema_version":"1.0","source":{"id":"1811.07325","kind":"arxiv","version":2}},"canonical_sha256":"b75e095a7aa5f989b8b60a9442108acb05733b72d46a3c86cfc7b11c18d61ca5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b75e095a7aa5f989b8b60a9442108acb05733b72d46a3c86cfc7b11c18d61ca5","first_computed_at":"2026-05-18T00:00:07.773846Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:07.773846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rMiVG2RI5SovlBSqf6/H0QY9RBwz59KMvfecpQ9KwdW+5tjz2QbIegAid8Z7G9K12ukVjBQj6OKIq/kS1nEDCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:07.774469Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07325","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80fbb6a983e9110499d7b28bd29e87279d46e1cc9231bba8f0735ccd3426155e","sha256:b3fb3c2e7519fe99ffd5dcf3edef68d1b47b3445d4ef1b932982a816b0a9f34d"],"state_sha256":"42d775b7812a319df8e30e17274185580701f52939bb1101a1e47869ad55fa70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K2lmFSRLIIY5qRbc/37wcD392b2clClUjIl1wyal8QmM5o8amVNAyJ1/DI23ai6KSaCvsjc/1DsgczDRbv4xCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:39:27.506087Z","bundle_sha256":"4dac0572023517cbe7ad4c0caafdca0a91e349eb85f358bc54cbfe178d4e977c"}}