{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:MLSXVLLWPV6UIGLOYV2ES2ZKSA","short_pith_number":"pith:MLSXVLLW","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"},"canonical_sha256":"62e57aad767d7d44196ec574496b2a903bf8903267d54a5fa0ea878ee16edc3e","source":{"kind":"arxiv","id":"2301.00074","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.00074","created_at":"2026-07-05T05:29:42Z"},{"alias_kind":"arxiv_version","alias_value":"2301.00074v1","created_at":"2026-07-05T05:29:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.00074","created_at":"2026-07-05T05:29:42Z"},{"alias_kind":"pith_short_12","alias_value":"MLSXVLLWPV6U","created_at":"2026-07-05T05:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"MLSXVLLWPV6UIGLO","created_at":"2026-07-05T05:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"MLSXVLLW","created_at":"2026-07-05T05:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:MLSXVLLWPV6UIGLOYV2ES2ZKSA","target":"record","payload":{"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"},"canonical_sha256":"62e57aad767d7d44196ec574496b2a903bf8903267d54a5fa0ea878ee16edc3e","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"},"source_kind":"arxiv","source_id":"2301.00074","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-07-05T05:29:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZryiXGCadn1JI7mXu/Qd8ZS5pCSsxByqOXinOEUTSZWy+JAfDXr3Ecz8G0bZTzjKjXQp5guuBEIPeUx+ITUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T02:04:48.785674Z"},"content_sha256":"26effae562bee15c62d3cf7add5a48e20641688d110f7ad6d2ea51a7cbd149c7","schema_version":"1.0","event_id":"sha256:26effae562bee15c62d3cf7add5a48e20641688d110f7ad6d2ea51a7cbd149c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:MLSXVLLWPV6UIGLOYV2ES2ZKSA","target":"graph","payload":{"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"},"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-07-05T05:29:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EK2mshabM+8WiVFcu9z/fWV7IyXgnSfFCfyEGslOjBA2GG9M/sKKr3WcUIdKUuJPOSrxD5jZNJ7+XF+jvXF9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T02:04:48.786055Z"},"content_sha256":"f5f53a9c6e1f8f8cfce6f3f81a9957c380ed592a4b70bd2dfbebfc84f8a30f6f","schema_version":"1.0","event_id":"sha256:f5f53a9c6e1f8f8cfce6f3f81a9957c380ed592a4b70bd2dfbebfc84f8a30f6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA/bundle.json","state_url":"https://pith.science/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA/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-07-09T02:04:48Z","links":{"resolver":"https://pith.science/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA","bundle":"https://pith.science/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA/bundle.json","state":"https://pith.science/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLSXVLLWPV6UIGLOYV2ES2ZKSA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:MLSXVLLWPV6UIGLOYV2ES2ZKSA","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":"0042db0d0643c63baf6e3c3662f192188226e8367ff78fb269007a0e7d20e0ae","cross_cats_sorted":["cs.AI","cs.DS","cs.SC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-12-30T23:53:51Z","title_canon_sha256":"3cb5f50d993a078795f1ff1a4fbe8851cc47dbcba2eb9fb8bc0dd88e18764644"},"schema_version":"1.0","source":{"id":"2301.00074","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.00074","created_at":"2026-07-05T05:29:42Z"},{"alias_kind":"arxiv_version","alias_value":"2301.00074v1","created_at":"2026-07-05T05:29:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.00074","created_at":"2026-07-05T05:29:42Z"},{"alias_kind":"pith_short_12","alias_value":"MLSXVLLWPV6U","created_at":"2026-07-05T05:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"MLSXVLLWPV6UIGLO","created_at":"2026-07-05T05:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"MLSXVLLW","created_at":"2026-07-05T05:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:f5f53a9c6e1f8f8cfce6f3f81a9957c380ed592a4b70bd2dfbebfc84f8a30f6f","target":"graph","created_at":"2026-07-05T05:29:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.00074/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Anthony Yang Xu, Matthew Anderson, Zongliang Ji","cross_cats":["cs.AI","cs.DS","cs.SC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-12-30T23:53:51Z","title":"Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.00074","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:26effae562bee15c62d3cf7add5a48e20641688d110f7ad6d2ea51a7cbd149c7","target":"record","created_at":"2026-07-05T05:29:42Z","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":"0042db0d0643c63baf6e3c3662f192188226e8367ff78fb269007a0e7d20e0ae","cross_cats_sorted":["cs.AI","cs.DS","cs.SC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-12-30T23:53:51Z","title_canon_sha256":"3cb5f50d993a078795f1ff1a4fbe8851cc47dbcba2eb9fb8bc0dd88e18764644"},"schema_version":"1.0","source":{"id":"2301.00074","kind":"arxiv","version":1}},"canonical_sha256":"62e57aad767d7d44196ec574496b2a903bf8903267d54a5fa0ea878ee16edc3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62e57aad767d7d44196ec574496b2a903bf8903267d54a5fa0ea878ee16edc3e","first_computed_at":"2026-07-05T05:29:42.338159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:29:42.338159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qtrVI1SpZYnXZ28zafVinm18Op58buWs6neOeJIQlpw9TlKR3jMaBDe+wMj15tg+XNB+JtBXtBAJPZgGegcJBw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:29:42.338592Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.00074","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26effae562bee15c62d3cf7add5a48e20641688d110f7ad6d2ea51a7cbd149c7","sha256:f5f53a9c6e1f8f8cfce6f3f81a9957c380ed592a4b70bd2dfbebfc84f8a30f6f"],"state_sha256":"b0ee7db0e4e3db4febd541a3872a063e7e7726786116ac12bed47ffa70ade88b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l1wRDx+b01bP2Mc8K9+h9ajbV+WBPIrndGy/gv+ihr6rswxYgk7VOE082MXbQTQqmHdHK/1cPt6u/phZ+2WIBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T02:04:48.788085Z","bundle_sha256":"99828f7557b110f65ea27dd5fd7a9e9e6ad3cf80fccb7f807b5798bc4e56ce78"}}