{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W5PASWT2UX4YTOFWBKKEEEEKZM","short_pith_number":"pith:W5PASWT2","schema_version":"1.0","canonical_sha256":"b75e095a7aa5f989b8b60a9442108acb05733b72d46a3c86cfc7b11c18d61ca5","source":{"kind":"arxiv","id":"1811.07325","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.07325","created_at":"2026-05-18T00:00:07.773928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.07325v2","created_at":"2026-05-18T00:00:07.773928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07325","created_at":"2026-05-18T00:00:07.773928+00:00"},{"alias_kind":"pith_short_12","alias_value":"W5PASWT2UX4Y","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"W5PASWT2UX4YTOFW","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"W5PASWT2","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W5PASWT2UX4YTOFWBKKEEEEKZM","json":"https://pith.science/pith/W5PASWT2UX4YTOFWBKKEEEEKZM.json","graph_json":"https://pith.science/api/pith-number/W5PASWT2UX4YTOFWBKKEEEEKZM/graph.json","events_json":"https://pith.science/api/pith-number/W5PASWT2UX4YTOFWBKKEEEEKZM/events.json","paper":"https://pith.science/paper/W5PASWT2"},"agent_actions":{"view_html":"https://pith.science/pith/W5PASWT2UX4YTOFWBKKEEEEKZM","download_json":"https://pith.science/pith/W5PASWT2UX4YTOFWBKKEEEEKZM.json","view_paper":"https://pith.science/paper/W5PASWT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.07325&json=true","fetch_graph":"https://pith.science/api/pith-number/W5PASWT2UX4YTOFWBKKEEEEKZM/graph.json","fetch_events":"https://pith.science/api/pith-number/W5PASWT2UX4YTOFWBKKEEEEKZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W5PASWT2UX4YTOFWBKKEEEEKZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W5PASWT2UX4YTOFWBKKEEEEKZM/action/storage_attestation","attest_author":"https://pith.science/pith/W5PASWT2UX4YTOFWBKKEEEEKZM/action/author_attestation","sign_citation":"https://pith.science/pith/W5PASWT2UX4YTOFWBKKEEEEKZM/action/citation_signature","submit_replication":"https://pith.science/pith/W5PASWT2UX4YTOFWBKKEEEEKZM/action/replication_record"}},"created_at":"2026-05-18T00:00:07.773928+00:00","updated_at":"2026-05-18T00:00:07.773928+00:00"}