{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AJPFGAKKU6OONFCUUMMS3FO2BT","short_pith_number":"pith:AJPFGAKK","canonical_record":{"source":{"id":"2508.01748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-08-03T13:15:24Z","cross_cats_sorted":[],"title_canon_sha256":"2fb62b1c2623d70b1f6dd3202090b0cf0bde876ce53f2c09a8da6779d6ca2979","abstract_canon_sha256":"73c1dfa8dd05b75cdd4f513e250886946dc8df7a2db16f8de6c2fcc7ca99e39e"},"schema_version":"1.0"},"canonical_sha256":"025e53014aa79ce69454a3192d95da0cf26f7457455df429af09cf737ae7401a","source":{"kind":"arxiv","id":"2508.01748","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.01748","created_at":"2026-07-05T11:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"2508.01748v1","created_at":"2026-07-05T11:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.01748","created_at":"2026-07-05T11:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"AJPFGAKKU6OO","created_at":"2026-07-05T11:47:44Z"},{"alias_kind":"pith_short_16","alias_value":"AJPFGAKKU6OONFCU","created_at":"2026-07-05T11:47:44Z"},{"alias_kind":"pith_short_8","alias_value":"AJPFGAKK","created_at":"2026-07-05T11:47:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AJPFGAKKU6OONFCUUMMS3FO2BT","target":"record","payload":{"canonical_record":{"source":{"id":"2508.01748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-08-03T13:15:24Z","cross_cats_sorted":[],"title_canon_sha256":"2fb62b1c2623d70b1f6dd3202090b0cf0bde876ce53f2c09a8da6779d6ca2979","abstract_canon_sha256":"73c1dfa8dd05b75cdd4f513e250886946dc8df7a2db16f8de6c2fcc7ca99e39e"},"schema_version":"1.0"},"canonical_sha256":"025e53014aa79ce69454a3192d95da0cf26f7457455df429af09cf737ae7401a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:44.684415Z","signature_b64":"UUp45Fq7NUze5LVF65z+ixncLghrbsKtaGO3LU5VqQ1XjNGro7Iv8zNc7LLjYkiLw7zk4xwPqS6ZZvObvEd/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"025e53014aa79ce69454a3192d95da0cf26f7457455df429af09cf737ae7401a","last_reissued_at":"2026-07-05T11:47:44.683852Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:44.683852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.01748","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-05T11:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sXKWFVTZ5+eqKIirm2+Yn9rGWDVhCxzemwJXnhw0XxV1rP2Q5vUqOBqH24ZiIeOKWV3WBAI/oD6jLdsRD9cwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T22:01:23.845518Z"},"content_sha256":"f4a93b634b3c4133cf79737061fc30962841ca00983ecb1b02e5ab7d73549b64","schema_version":"1.0","event_id":"sha256:f4a93b634b3c4133cf79737061fc30962841ca00983ecb1b02e5ab7d73549b64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AJPFGAKKU6OONFCUUMMS3FO2BT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eyal Zwecher, Oded Schwartz","submitted_at":"2025-08-03T13:15:24Z","abstract_excerpt":"Matrix multiplication is a fundamental kernel in high performance computing. Many algorithms for fast matrix multiplication can only be applied to enormous matrices ($n>10^{100}$) and thus cannot be used in practice. Of all algorithms applicable to feasible input, Pan's $O(n^{2.773372})$ algorithm (1982) is asymptotically the fastest. We obtain an $O(n^{2.773203})$ algorithm applicable to the same input sizes as Pan's algorithm. This algorithm is the fastest matrix multiplication algorithm with base case smaller than $1000$. Further, our method obtains the best asymptotic complexity for many s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.01748","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/2508.01748/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-05T11:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ioxFLGFK8BBoc2qPYRiqDP1jiHSl1z9mGyvkBtVWzWvuEyX71FqhGigk3u5HVKWWZ8m/seA0mrE4oo9DeMc4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T22:01:23.846381Z"},"content_sha256":"231006815420edc1fbb0221bc758fccf9beb33c974a71b949407396eda7c9676","schema_version":"1.0","event_id":"sha256:231006815420edc1fbb0221bc758fccf9beb33c974a71b949407396eda7c9676"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJPFGAKKU6OONFCUUMMS3FO2BT/bundle.json","state_url":"https://pith.science/pith/AJPFGAKKU6OONFCUUMMS3FO2BT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJPFGAKKU6OONFCUUMMS3FO2BT/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-08-13T22:01:23Z","links":{"resolver":"https://pith.science/pith/AJPFGAKKU6OONFCUUMMS3FO2BT","bundle":"https://pith.science/pith/AJPFGAKKU6OONFCUUMMS3FO2BT/bundle.json","state":"https://pith.science/pith/AJPFGAKKU6OONFCUUMMS3FO2BT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJPFGAKKU6OONFCUUMMS3FO2BT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AJPFGAKKU6OONFCUUMMS3FO2BT","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":"73c1dfa8dd05b75cdd4f513e250886946dc8df7a2db16f8de6c2fcc7ca99e39e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-08-03T13:15:24Z","title_canon_sha256":"2fb62b1c2623d70b1f6dd3202090b0cf0bde876ce53f2c09a8da6779d6ca2979"},"schema_version":"1.0","source":{"id":"2508.01748","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.01748","created_at":"2026-07-05T11:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"2508.01748v1","created_at":"2026-07-05T11:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.01748","created_at":"2026-07-05T11:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"AJPFGAKKU6OO","created_at":"2026-07-05T11:47:44Z"},{"alias_kind":"pith_short_16","alias_value":"AJPFGAKKU6OONFCU","created_at":"2026-07-05T11:47:44Z"},{"alias_kind":"pith_short_8","alias_value":"AJPFGAKK","created_at":"2026-07-05T11:47:44Z"}],"graph_snapshots":[{"event_id":"sha256:231006815420edc1fbb0221bc758fccf9beb33c974a71b949407396eda7c9676","target":"graph","created_at":"2026-07-05T11:47:44Z","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/2508.01748/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Matrix multiplication is a fundamental kernel in high performance computing. Many algorithms for fast matrix multiplication can only be applied to enormous matrices ($n>10^{100}$) and thus cannot be used in practice. Of all algorithms applicable to feasible input, Pan's $O(n^{2.773372})$ algorithm (1982) is asymptotically the fastest. We obtain an $O(n^{2.773203})$ algorithm applicable to the same input sizes as Pan's algorithm. This algorithm is the fastest matrix multiplication algorithm with base case smaller than $1000$. Further, our method obtains the best asymptotic complexity for many s","authors_text":"Eyal Zwecher, Oded Schwartz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.01748","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:f4a93b634b3c4133cf79737061fc30962841ca00983ecb1b02e5ab7d73549b64","target":"record","created_at":"2026-07-05T11:47:44Z","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":"73c1dfa8dd05b75cdd4f513e250886946dc8df7a2db16f8de6c2fcc7ca99e39e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-08-03T13:15:24Z","title_canon_sha256":"2fb62b1c2623d70b1f6dd3202090b0cf0bde876ce53f2c09a8da6779d6ca2979"},"schema_version":"1.0","source":{"id":"2508.01748","kind":"arxiv","version":1}},"canonical_sha256":"025e53014aa79ce69454a3192d95da0cf26f7457455df429af09cf737ae7401a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"025e53014aa79ce69454a3192d95da0cf26f7457455df429af09cf737ae7401a","first_computed_at":"2026-07-05T11:47:44.683852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:47:44.683852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UUp45Fq7NUze5LVF65z+ixncLghrbsKtaGO3LU5VqQ1XjNGro7Iv8zNc7LLjYkiLw7zk4xwPqS6ZZvObvEd/DA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:47:44.684415Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.01748","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4a93b634b3c4133cf79737061fc30962841ca00983ecb1b02e5ab7d73549b64","sha256:231006815420edc1fbb0221bc758fccf9beb33c974a71b949407396eda7c9676"],"state_sha256":"bfe9906ef3ef9c87e7768af48dba8b845bc56cd558b6ad5d7ba1e50df34e65a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mBLLrsd4yevbwBsaENWBc5ATAIVG1lg3aL0anGoH7QLsT3b/h89bE1wxIAGHnSWptl8+J/oc53G990RewZQwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T22:01:23.852892Z","bundle_sha256":"f733ed969ed8fe7cb913d3d9e87df3375f76a5442012aa99bb26f1555825d761"}}