{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MLSXVLLWPV6UIGLOYV2ES2ZKSA","short_pith_number":"pith:MLSXVLLW","schema_version":"1.0","canonical_sha256":"62e57aad767d7d44196ec574496b2a903bf8903267d54a5fa0ea878ee16edc3e","source":{"kind":"arxiv","id":"2301.00074","version":1},"attestation_state":"computed","paper":{"title":"Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.SC"],"primary_cat":"cs.CC","authors_text":"Anthony Yang Xu, Matthew Anderson, Zongliang Ji","submitted_at":"2022-12-30T23:53:51Z","abstract_excerpt":"Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras. In subsequent work with Kleinberg and Szegedy, they connected this to the search for combinatorial objects called strong uniquely solvable puzzles (strong USPs). We begin a systematic computer-aided search for these objects. We develop and implement constraint-based algorithms build on reductions to $\\mathrm{SAT}$ and $\\mathrm{IP}$ to verify that puzzles are strong USPs, and to search for large strong USPs. We produce tight bounds on the maximu"},"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":"2301.00074","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-12-30T23:53:51Z","cross_cats_sorted":["cs.AI","cs.DS","cs.SC"],"title_canon_sha256":"3cb5f50d993a078795f1ff1a4fbe8851cc47dbcba2eb9fb8bc0dd88e18764644","abstract_canon_sha256":"0042db0d0643c63baf6e3c3662f192188226e8367ff78fb269007a0e7d20e0ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:29:42.338592Z","signature_b64":"qtrVI1SpZYnXZ28zafVinm18Op58buWs6neOeJIQlpw9TlKR3jMaBDe+wMj15tg+XNB+JtBXtBAJPZgGegcJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62e57aad767d7d44196ec574496b2a903bf8903267d54a5fa0ea878ee16edc3e","last_reissued_at":"2026-07-05T05:29:42.338159Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:29:42.338159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.SC"],"primary_cat":"cs.CC","authors_text":"Anthony Yang Xu, Matthew Anderson, Zongliang Ji","submitted_at":"2022-12-30T23:53:51Z","abstract_excerpt":"Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras. In subsequent work with Kleinberg and Szegedy, they connected this to the search for combinatorial objects called strong uniquely solvable puzzles (strong USPs). We begin a systematic computer-aided search for these objects. We develop and implement constraint-based algorithms build on reductions to $\\mathrm{SAT}$ and $\\mathrm{IP}$ to verify that puzzles are strong USPs, and to search for large strong USPs. We produce tight bounds on the maximu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.00074","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/2301.00074/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":"2301.00074","created_at":"2026-07-05T05:29:42.338237+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.00074v1","created_at":"2026-07-05T05:29:42.338237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.00074","created_at":"2026-07-05T05:29:42.338237+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLSXVLLWPV6U","created_at":"2026-07-05T05:29:42.338237+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLSXVLLWPV6UIGLO","created_at":"2026-07-05T05:29:42.338237+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLSXVLLW","created_at":"2026-07-05T05:29:42.338237+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/MLSXVLLWPV6UIGLOYV2ES2ZKSA","json":"https://pith.science/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA.json","graph_json":"https://pith.science/api/pith-number/MLSXVLLWPV6UIGLOYV2ES2ZKSA/graph.json","events_json":"https://pith.science/api/pith-number/MLSXVLLWPV6UIGLOYV2ES2ZKSA/events.json","paper":"https://pith.science/paper/MLSXVLLW"},"agent_actions":{"view_html":"https://pith.science/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA","download_json":"https://pith.science/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA.json","view_paper":"https://pith.science/paper/MLSXVLLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.00074&json=true","fetch_graph":"https://pith.science/api/pith-number/MLSXVLLWPV6UIGLOYV2ES2ZKSA/graph.json","fetch_events":"https://pith.science/api/pith-number/MLSXVLLWPV6UIGLOYV2ES2ZKSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA/action/storage_attestation","attest_author":"https://pith.science/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA/action/author_attestation","sign_citation":"https://pith.science/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA/action/citation_signature","submit_replication":"https://pith.science/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA/action/replication_record"}},"created_at":"2026-07-05T05:29:42.338237+00:00","updated_at":"2026-07-05T05:29:42.338237+00:00"}