{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4SWT2EG2MRJWIP7JY7QCEO2QHP","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":"31d5d391896d5656750055124bb4fc2ccbdae6bd3508ec8ec386a83df5d1addf","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-10T18:24:00Z","title_canon_sha256":"99f86d063ad39a8b37c35c336299bfc93d15d9291b6c9c3f0c7fadd2f66e0767"},"schema_version":"1.0","source":{"id":"1806.03701","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03701","created_at":"2026-05-17T23:55:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03701v4","created_at":"2026-05-17T23:55:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03701","created_at":"2026-05-17T23:55:20Z"},{"alias_kind":"pith_short_12","alias_value":"4SWT2EG2MRJW","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4SWT2EG2MRJWIP7J","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4SWT2EG2","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:bf5e43449514f25fa98313a5f378f04be2c1fca409393f2de0a7f201daf82cf3","target":"graph","created_at":"2026-05-17T23:55:20Z","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":"There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of work has been done to reduce the steps used in the recursive version. Some group-theoretic and computer algebraic estimations also conjecture the existence of an $O(n^2)$ algorithm. This article discusses a quadratic-time number-theoretic approach that converts large vectors in the operands to a single large entity and combines them to make the dot-product.","authors_text":"Shrohan Mohapatra","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-10T18:24:00Z","title":"A new quadratic-time number-theoretic algorithm to solve matrix multiplication problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03701","kind":"arxiv","version":4},"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:f4546208a6b6c4e457d08a83211975cfb00b81e47b0df462a823cd498b63455f","target":"record","created_at":"2026-05-17T23:55:20Z","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":"31d5d391896d5656750055124bb4fc2ccbdae6bd3508ec8ec386a83df5d1addf","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-10T18:24:00Z","title_canon_sha256":"99f86d063ad39a8b37c35c336299bfc93d15d9291b6c9c3f0c7fadd2f66e0767"},"schema_version":"1.0","source":{"id":"1806.03701","kind":"arxiv","version":4}},"canonical_sha256":"e4ad3d10da6453643fe9c7e0223b503bf3de80aeb4abe3ce72241454ee15bd6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4ad3d10da6453643fe9c7e0223b503bf3de80aeb4abe3ce72241454ee15bd6f","first_computed_at":"2026-05-17T23:55:20.577116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:20.577116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nrt12IHVaeeXWBJGBJ2EQenJiW3AswxUtb751e8GQXRaco+VQiktLCdrFNxTWGaOi807+2FT+5bJTTejLuJuDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:20.577553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03701","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4546208a6b6c4e457d08a83211975cfb00b81e47b0df462a823cd498b63455f","sha256:bf5e43449514f25fa98313a5f378f04be2c1fca409393f2de0a7f201daf82cf3"],"state_sha256":"de04eb1f5338590c878f9d4ff97ab0dfebbf8c664d7a61325000f3272d416fd5"}