{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SOCVMQINDPETNX6WW6QPQEHCQD","short_pith_number":"pith:SOCVMQIN","schema_version":"1.0","canonical_sha256":"938556410d1bc936dfd6b7a0f810e280e3c0369a95f3120bd1a9c1ef8c6e8611","source":{"kind":"arxiv","id":"2506.22113","version":1},"attestation_state":"computed","paper":{"title":"Exploring Commutative Matrix Multiplication Schemes via Flip Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Isaac Wood","submitted_at":"2025-06-27T10:47:04Z","abstract_excerpt":"We explore new approaches for finding matrix multiplication algorithms in the commutative setting by adapting the flip graph technique: a method previously shown to be effective for discovering fast algorithms in the non-commutative case. While an earlier attempt to apply flip graphs to commutative algorithms saw limited success, we overcome both theoretical and practical obstacles using two strategies: one inspired by Marakov's algorithm to multiply 3x3 matrices, in which we construct a commutative tensor and approximate its rank using the standard flip graph; and a second that introduces a f"},"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":"2506.22113","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2025-06-27T10:47:04Z","cross_cats_sorted":[],"title_canon_sha256":"3a08eace07048409de0de74e20358efebf40a1f943abf61604b8d6f5fca79355","abstract_canon_sha256":"fd24719c4b87a23705b4259ccbfb157428fc383c5e6795e11cbc2294dda03b89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:22.183339Z","signature_b64":"X+eFR9aj4URNIRv+2fbKWq6Kw/eI1qXa1IOp5+8yrH7cM2XPRHoLLp6d6fL4ZlUW4fnWRbX7PirTU+kOw0wRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"938556410d1bc936dfd6b7a0f810e280e3c0369a95f3120bd1a9c1ef8c6e8611","last_reissued_at":"2026-07-05T11:28:22.182942Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:22.182942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Commutative Matrix Multiplication Schemes via Flip Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Isaac Wood","submitted_at":"2025-06-27T10:47:04Z","abstract_excerpt":"We explore new approaches for finding matrix multiplication algorithms in the commutative setting by adapting the flip graph technique: a method previously shown to be effective for discovering fast algorithms in the non-commutative case. While an earlier attempt to apply flip graphs to commutative algorithms saw limited success, we overcome both theoretical and practical obstacles using two strategies: one inspired by Marakov's algorithm to multiply 3x3 matrices, in which we construct a commutative tensor and approximate its rank using the standard flip graph; and a second that introduces a f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22113","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.22113/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.22113","created_at":"2026-07-05T11:28:22.183006+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.22113v1","created_at":"2026-07-05T11:28:22.183006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22113","created_at":"2026-07-05T11:28:22.183006+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOCVMQINDPET","created_at":"2026-07-05T11:28:22.183006+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOCVMQINDPETNX6W","created_at":"2026-07-05T11:28:22.183006+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOCVMQIN","created_at":"2026-07-05T11:28:22.183006+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/SOCVMQINDPETNX6WW6QPQEHCQD","json":"https://pith.science/pith/SOCVMQINDPETNX6WW6QPQEHCQD.json","graph_json":"https://pith.science/api/pith-number/SOCVMQINDPETNX6WW6QPQEHCQD/graph.json","events_json":"https://pith.science/api/pith-number/SOCVMQINDPETNX6WW6QPQEHCQD/events.json","paper":"https://pith.science/paper/SOCVMQIN"},"agent_actions":{"view_html":"https://pith.science/pith/SOCVMQINDPETNX6WW6QPQEHCQD","download_json":"https://pith.science/pith/SOCVMQINDPETNX6WW6QPQEHCQD.json","view_paper":"https://pith.science/paper/SOCVMQIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.22113&json=true","fetch_graph":"https://pith.science/api/pith-number/SOCVMQINDPETNX6WW6QPQEHCQD/graph.json","fetch_events":"https://pith.science/api/pith-number/SOCVMQINDPETNX6WW6QPQEHCQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOCVMQINDPETNX6WW6QPQEHCQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOCVMQINDPETNX6WW6QPQEHCQD/action/storage_attestation","attest_author":"https://pith.science/pith/SOCVMQINDPETNX6WW6QPQEHCQD/action/author_attestation","sign_citation":"https://pith.science/pith/SOCVMQINDPETNX6WW6QPQEHCQD/action/citation_signature","submit_replication":"https://pith.science/pith/SOCVMQINDPETNX6WW6QPQEHCQD/action/replication_record"}},"created_at":"2026-07-05T11:28:22.183006+00:00","updated_at":"2026-07-05T11:28:22.183006+00:00"}