{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PZXV5WD7JWZKEDU2QZSMDZNO4P","short_pith_number":"pith:PZXV5WD7","schema_version":"1.0","canonical_sha256":"7e6f5ed87f4db2a20e9a8664c1e5aee3d9ee466423ee50d0244b2861ff5bbf74","source":{"kind":"arxiv","id":"1010.5421","version":1},"attestation_state":"computed","paper":{"title":"On the Mesh Array for Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Subhash Kak","submitted_at":"2010-10-26T15:10:37Z","abstract_excerpt":"This article presents new properties of the mesh array for matrix multiplication. In contrast to the standard array that requires 3n-2 steps to complete its computation, the mesh array requires only 2n-1 steps. Symmetries of the mesh array computed values are presented which enhance the efficiency of the array for specific applications. In multiplying symmetric matrices, the results are obtained in 3n/2+1 steps. The mesh array is examined for its application as a scrambling system."},"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":"1010.5421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-10-26T15:10:37Z","cross_cats_sorted":[],"title_canon_sha256":"33b44d190f0ee0930d684596fea36b28a4b37f5960e51f60f5c4016ab66d8078","abstract_canon_sha256":"75e9364a652b70d76fc615d29419008e3c0bc4d402cfd1128c45f3548f619348"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:38.592959Z","signature_b64":"YQGHflpNt6ktBWufy7k2BNq4sVeaDhqoxaNpSDxzkbuOX60fUICYEERDaZ74L82lZTPZthjEf8OZFM0Mm1XpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e6f5ed87f4db2a20e9a8664c1e5aee3d9ee466423ee50d0244b2861ff5bbf74","last_reissued_at":"2026-05-18T02:23:38.592447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:38.592447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Mesh Array for Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Subhash Kak","submitted_at":"2010-10-26T15:10:37Z","abstract_excerpt":"This article presents new properties of the mesh array for matrix multiplication. In contrast to the standard array that requires 3n-2 steps to complete its computation, the mesh array requires only 2n-1 steps. Symmetries of the mesh array computed values are presented which enhance the efficiency of the array for specific applications. In multiplying symmetric matrices, the results are obtained in 3n/2+1 steps. The mesh array is examined for its application as a scrambling system."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5421","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.5421","created_at":"2026-05-18T02:23:38.592510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5421v1","created_at":"2026-05-18T02:23:38.592510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5421","created_at":"2026-05-18T02:23:38.592510+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZXV5WD7JWZK","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZXV5WD7JWZKEDU2","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZXV5WD7","created_at":"2026-05-18T12:26:12.377268+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/PZXV5WD7JWZKEDU2QZSMDZNO4P","json":"https://pith.science/pith/PZXV5WD7JWZKEDU2QZSMDZNO4P.json","graph_json":"https://pith.science/api/pith-number/PZXV5WD7JWZKEDU2QZSMDZNO4P/graph.json","events_json":"https://pith.science/api/pith-number/PZXV5WD7JWZKEDU2QZSMDZNO4P/events.json","paper":"https://pith.science/paper/PZXV5WD7"},"agent_actions":{"view_html":"https://pith.science/pith/PZXV5WD7JWZKEDU2QZSMDZNO4P","download_json":"https://pith.science/pith/PZXV5WD7JWZKEDU2QZSMDZNO4P.json","view_paper":"https://pith.science/paper/PZXV5WD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5421&json=true","fetch_graph":"https://pith.science/api/pith-number/PZXV5WD7JWZKEDU2QZSMDZNO4P/graph.json","fetch_events":"https://pith.science/api/pith-number/PZXV5WD7JWZKEDU2QZSMDZNO4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZXV5WD7JWZKEDU2QZSMDZNO4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZXV5WD7JWZKEDU2QZSMDZNO4P/action/storage_attestation","attest_author":"https://pith.science/pith/PZXV5WD7JWZKEDU2QZSMDZNO4P/action/author_attestation","sign_citation":"https://pith.science/pith/PZXV5WD7JWZKEDU2QZSMDZNO4P/action/citation_signature","submit_replication":"https://pith.science/pith/PZXV5WD7JWZKEDU2QZSMDZNO4P/action/replication_record"}},"created_at":"2026-05-18T02:23:38.592510+00:00","updated_at":"2026-05-18T02:23:38.592510+00:00"}