{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZBVTWA64UTU6MS36HXPWMQ7FBJ","short_pith_number":"pith:ZBVTWA64","schema_version":"1.0","canonical_sha256":"c86b3b03dca4e9e64b7e3ddf6643e50a5cdbdf6c6bc19b31fc4deb2489554e11","source":{"kind":"arxiv","id":"2607.29361","version":1},"attestation_state":"computed","paper":{"title":"A recursive butterfly factorization with optimality guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Christopher Musco, David Persson, Diana Halikias, Paul G. Beckman, Tyler Chen","submitted_at":"2026-07-31T12:49:16Z","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"},"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":"2607.29361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-31T12:49:16Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"e58967374f97a337c7d9705b43d8b855d22517e44212f366275150fb1c589751","abstract_canon_sha256":"8d2b75d8505339de025b1bf81469ae503d5e1c43a5a4c75092ace95a600ef67d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:33:16.150755Z","signature_b64":"LiU6ItIP65TAkwfJHp8hTkx4fs0F6pHhN3+jOeZv7fMh0UdYRgCb7HozGgrRKYTSSOGyAXtNxbjVCuhvK4SzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c86b3b03dca4e9e64b7e3ddf6643e50a5cdbdf6c6bc19b31fc4deb2489554e11","last_reissued_at":"2026-08-03T01:33:16.149211Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:33:16.149211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A recursive butterfly factorization with optimality guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Christopher Musco, David Persson, Diana Halikias, Paul G. Beckman, Tyler Chen","submitted_at":"2026-07-31T12:49:16Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29361","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/2607.29361/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":"2607.29361","created_at":"2026-08-03T01:33:16.150048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.29361v1","created_at":"2026-08-03T01:33:16.150048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.29361","created_at":"2026-08-03T01:33:16.150048+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBVTWA64UTU6","created_at":"2026-08-03T01:33:16.150048+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBVTWA64UTU6MS36","created_at":"2026-08-03T01:33:16.150048+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBVTWA64","created_at":"2026-08-03T01:33:16.150048+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/ZBVTWA64UTU6MS36HXPWMQ7FBJ","json":"https://pith.science/pith/ZBVTWA64UTU6MS36HXPWMQ7FBJ.json","graph_json":"https://pith.science/api/pith-number/ZBVTWA64UTU6MS36HXPWMQ7FBJ/graph.json","events_json":"https://pith.science/api/pith-number/ZBVTWA64UTU6MS36HXPWMQ7FBJ/events.json","paper":"https://pith.science/paper/ZBVTWA64"},"agent_actions":{"view_html":"https://pith.science/pith/ZBVTWA64UTU6MS36HXPWMQ7FBJ","download_json":"https://pith.science/pith/ZBVTWA64UTU6MS36HXPWMQ7FBJ.json","view_paper":"https://pith.science/paper/ZBVTWA64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.29361&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBVTWA64UTU6MS36HXPWMQ7FBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBVTWA64UTU6MS36HXPWMQ7FBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBVTWA64UTU6MS36HXPWMQ7FBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBVTWA64UTU6MS36HXPWMQ7FBJ/action/storage_attestation","attest_author":"https://pith.science/pith/ZBVTWA64UTU6MS36HXPWMQ7FBJ/action/author_attestation","sign_citation":"https://pith.science/pith/ZBVTWA64UTU6MS36HXPWMQ7FBJ/action/citation_signature","submit_replication":"https://pith.science/pith/ZBVTWA64UTU6MS36HXPWMQ7FBJ/action/replication_record"}},"created_at":"2026-08-03T01:33:16.150048+00:00","updated_at":"2026-08-03T01:33:16.150048+00:00"}