{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2B4HM4CZU6VJG5GUIJYYPUMFW3","short_pith_number":"pith:2B4HM4CZ","canonical_record":{"source":{"id":"1801.04723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-15T10:28:09Z","cross_cats_sorted":[],"title_canon_sha256":"012af1a2eebfe22d8cca435295f2bbba803b25e404fdbf262ff449a06f4e18f2","abstract_canon_sha256":"c1c6d18ab87d74f5dfd1b52dd3098e95c67df6adf050d470db326e364479a796"},"schema_version":"1.0"},"canonical_sha256":"d078767059a7aa9374d4427187d185b6fe5b409e0d58e3de26f056ee3d1fb77e","source":{"kind":"arxiv","id":"1801.04723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04723","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04723v1","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04723","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"2B4HM4CZU6VJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2B4HM4CZU6VJG5GU","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2B4HM4CZ","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2B4HM4CZU6VJG5GUIJYYPUMFW3","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-15T10:28:09Z","cross_cats_sorted":[],"title_canon_sha256":"012af1a2eebfe22d8cca435295f2bbba803b25e404fdbf262ff449a06f4e18f2","abstract_canon_sha256":"c1c6d18ab87d74f5dfd1b52dd3098e95c67df6adf050d470db326e364479a796"},"schema_version":"1.0"},"canonical_sha256":"d078767059a7aa9374d4427187d185b6fe5b409e0d58e3de26f056ee3d1fb77e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:03.464494Z","signature_b64":"eqF0oJbAeAk+VsBeRuLOKyW0KPCvmPDkqgO73n2f1JcPzNjCe2DbogeVVm6z0WCdlfd9t7vbA610ym9DZmnqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d078767059a7aa9374d4427187d185b6fe5b409e0d58e3de26f056ee3d1fb77e","last_reissued_at":"2026-05-18T00:26:03.463618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:03.463618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04723","source_version":1,"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:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5qs9yHHLgPPSbGxr64cFzbJfDB4749T8eezyLOrUsd+XrewAgLwYsd4G7ANv480APt2ZqBR2rBWLMv5aK7XnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:38:56.965675Z"},"content_sha256":"1686438f67ebc71fcdc275ae7a75174918ffcffa0f1168ac21c9cbe44c77d36e","schema_version":"1.0","event_id":"sha256:1686438f67ebc71fcdc275ae7a75174918ffcffa0f1168ac21c9cbe44c77d36e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2B4HM4CZU6VJG5GUIJYYPUMFW3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SPIN: A Fast and Scalable Matrix Inversion Method in 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-01-15T10:28:09Z","abstract_excerpt":"The growth of big data in domains such as Earth Sciences, Social Networks, Physical Sciences, etc. has lead to an immense need for efficient and scalable linear algebra operations, e.g. Matrix inversion. Existing methods for efficient and distributed matrix inversion using big data platforms rely on LU decomposition based block-recursive algorithms. However, these algorithms are complex and require a lot of side calculations, e.g. matrix multiplication, at various levels of recursion. In this paper, we propose a different scheme based on Strassen's matrix inversion algorithm (mentioned in Stra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04723","kind":"arxiv","version":1},"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:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ROsEUTuyj94xdUHgRysTjpr/PrZJGU3VdiZfkkyNAtxxfqybP6gpMFGBsWoUrkTsN+SWX0k6bdp9IK7g0iraCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:38:56.966016Z"},"content_sha256":"ffe3574b2089588e521649e11a5b4006a6d5e3df1fc478b8d38e86b20abae8be","schema_version":"1.0","event_id":"sha256:ffe3574b2089588e521649e11a5b4006a6d5e3df1fc478b8d38e86b20abae8be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2B4HM4CZU6VJG5GUIJYYPUMFW3/bundle.json","state_url":"https://pith.science/pith/2B4HM4CZU6VJG5GUIJYYPUMFW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2B4HM4CZU6VJG5GUIJYYPUMFW3/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-01T19:38:56Z","links":{"resolver":"https://pith.science/pith/2B4HM4CZU6VJG5GUIJYYPUMFW3","bundle":"https://pith.science/pith/2B4HM4CZU6VJG5GUIJYYPUMFW3/bundle.json","state":"https://pith.science/pith/2B4HM4CZU6VJG5GUIJYYPUMFW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2B4HM4CZU6VJG5GUIJYYPUMFW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2B4HM4CZU6VJG5GUIJYYPUMFW3","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":"c1c6d18ab87d74f5dfd1b52dd3098e95c67df6adf050d470db326e364479a796","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-15T10:28:09Z","title_canon_sha256":"012af1a2eebfe22d8cca435295f2bbba803b25e404fdbf262ff449a06f4e18f2"},"schema_version":"1.0","source":{"id":"1801.04723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04723","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04723v1","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04723","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"2B4HM4CZU6VJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"2B4HM4CZU6VJG5GU","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"2B4HM4CZ","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:ffe3574b2089588e521649e11a5b4006a6d5e3df1fc478b8d38e86b20abae8be","target":"graph","created_at":"2026-05-18T00:26:03Z","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":"The growth of big data in domains such as Earth Sciences, Social Networks, Physical Sciences, etc. has lead to an immense need for efficient and scalable linear algebra operations, e.g. Matrix inversion. Existing methods for efficient and distributed matrix inversion using big data platforms rely on LU decomposition based block-recursive algorithms. However, these algorithms are complex and require a lot of side calculations, e.g. matrix multiplication, at various levels of recursion. In this paper, we propose a different scheme based on Strassen's matrix inversion algorithm (mentioned in Stra","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-01-15T10:28:09Z","title":"SPIN: A Fast and Scalable Matrix Inversion Method in Apache Spark"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04723","kind":"arxiv","version":1},"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:1686438f67ebc71fcdc275ae7a75174918ffcffa0f1168ac21c9cbe44c77d36e","target":"record","created_at":"2026-05-18T00:26:03Z","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":"c1c6d18ab87d74f5dfd1b52dd3098e95c67df6adf050d470db326e364479a796","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-15T10:28:09Z","title_canon_sha256":"012af1a2eebfe22d8cca435295f2bbba803b25e404fdbf262ff449a06f4e18f2"},"schema_version":"1.0","source":{"id":"1801.04723","kind":"arxiv","version":1}},"canonical_sha256":"d078767059a7aa9374d4427187d185b6fe5b409e0d58e3de26f056ee3d1fb77e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d078767059a7aa9374d4427187d185b6fe5b409e0d58e3de26f056ee3d1fb77e","first_computed_at":"2026-05-18T00:26:03.463618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:03.463618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eqF0oJbAeAk+VsBeRuLOKyW0KPCvmPDkqgO73n2f1JcPzNjCe2DbogeVVm6z0WCdlfd9t7vbA610ym9DZmnqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:03.464494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1686438f67ebc71fcdc275ae7a75174918ffcffa0f1168ac21c9cbe44c77d36e","sha256:ffe3574b2089588e521649e11a5b4006a6d5e3df1fc478b8d38e86b20abae8be"],"state_sha256":"5fc2635a44e95508cea1eb89b3c20555f206c8d6fb391bcbb7393922ee9712e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9bqwJEksNiBSWL7PO9BKUq6KUbWAkahxD1ikxsKsegL8l2+hoX/f9TaikmOGMPBDEqxD/l6oXIFQ5tVn+6FGDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:38:56.968190Z","bundle_sha256":"553111b3095d97177813e5d41588c562e045d3caac917adc075011acbddd8dc0"}}