{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZBVTWA64UTU6MS36HXPWMQ7FBJ","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":"8d2b75d8505339de025b1bf81469ae503d5e1c43a5a4c75092ace95a600ef67d","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-31T12:49:16Z","title_canon_sha256":"e58967374f97a337c7d9705b43d8b855d22517e44212f366275150fb1c589751"},"schema_version":"1.0","source":{"id":"2607.29361","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.29361","created_at":"2026-08-03T01:33:16Z"},{"alias_kind":"arxiv_version","alias_value":"2607.29361v1","created_at":"2026-08-03T01:33:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.29361","created_at":"2026-08-03T01:33:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZBVTWA64UTU6","created_at":"2026-08-03T01:33:16Z"},{"alias_kind":"pith_short_16","alias_value":"ZBVTWA64UTU6MS36","created_at":"2026-08-03T01:33:16Z"},{"alias_kind":"pith_short_8","alias_value":"ZBVTWA64","created_at":"2026-08-03T01:33:16Z"}],"graph_snapshots":[{"event_id":"sha256:66004f1fc1dec7f13fffeeb866d51b44fce401315e0ca34137c981fa40a5eac7","target":"graph","created_at":"2026-08-03T01:33:16Z","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/2607.29361/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We formalize a recursive format for representing a butterfly matrix. This new format naturally leads to a simple recursive algorithm for computing a quasi-optimal butterfly approximation to an arbitrary $N \\times N$ matrix $A$. When the entries of $A$ are explicitly available, we show that the algorithm computes a butterfly matrix $B$ in $O(N^2)$ operations with approximation error $\\|A - B\\|_F$ at most a $O(\\sqrt{\\log(N)})$ factor away from that of the best possible approximation by a butterfly matrix. We also develop a matrix-free variant of the method, which uses $\\widetilde{O}(\\sqrt{N})$ m","authors_text":"Christopher Musco, David Persson, Diana Halikias, Paul G. Beckman, Tyler Chen","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29361","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:20259060d3205effe2fa8daa11b1fe6bd709e8e4028f99bb6b2232d9eb53d331","target":"record","created_at":"2026-08-03T01:33:16Z","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":"8d2b75d8505339de025b1bf81469ae503d5e1c43a5a4c75092ace95a600ef67d","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-31T12:49:16Z","title_canon_sha256":"e58967374f97a337c7d9705b43d8b855d22517e44212f366275150fb1c589751"},"schema_version":"1.0","source":{"id":"2607.29361","kind":"arxiv","version":1}},"canonical_sha256":"c86b3b03dca4e9e64b7e3ddf6643e50a5cdbdf6c6bc19b31fc4deb2489554e11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c86b3b03dca4e9e64b7e3ddf6643e50a5cdbdf6c6bc19b31fc4deb2489554e11","first_computed_at":"2026-08-03T01:33:16.149211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-03T01:33:16.149211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LiU6ItIP65TAkwfJHp8hTkx4fs0F6pHhN3+jOeZv7fMh0UdYRgCb7HozGgrRKYTSSOGyAXtNxbjVCuhvK4SzDQ==","signature_status":"signed_v1","signed_at":"2026-08-03T01:33:16.150755Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.29361","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20259060d3205effe2fa8daa11b1fe6bd709e8e4028f99bb6b2232d9eb53d331","sha256:66004f1fc1dec7f13fffeeb866d51b44fce401315e0ca34137c981fa40a5eac7"],"state_sha256":"09989413bfe881d3fceaa172c368b9ccfb9bea955305c8bf20f0c125b909a3d4"}