{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BJCXRKHSK2CQENMDG5JWEQDB6J","short_pith_number":"pith:BJCXRKHS","schema_version":"1.0","canonical_sha256":"0a4578a8f256850235833753624061f262d3411ba9d891566a324ba0cf726827","source":{"kind":"arxiv","id":"1509.07925","version":1},"attestation_state":"computed","paper":{"title":"Multidimensional Butterfly Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Haizhao Yang, Lexing Ying, Yingzhou Li","submitted_at":"2015-09-25T23:50:54Z","abstract_excerpt":"This paper introduces the multidimensional butterfly factorization as a data-sparse representation of multidimensional kernel matrices that satisfy the complementary low-rank property. This factorization approximates such a kernel matrix of size $N\\times N$ with a product of $\\O(\\log N)$ sparse matrices, each of which contains $\\O(N)$ nonzero entries. We also propose efficient algorithms for constructing this factorization when either (i) a fast algorithm for applying the kernel matrix and its adjoint is available or (ii) every entry of the kernel matrix can be evaluated in $\\O(1)$ operations."},"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":"1509.07925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-09-25T23:50:54Z","cross_cats_sorted":[],"title_canon_sha256":"a2e6e3e751c4669270578818a8e74693dfb2f6f66b9828bb116e4cf91ba4d514","abstract_canon_sha256":"0291a1d4003263ab775e29efb28a7930864fe6d9c2724e10f116e1d5274e7313"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:44.553207Z","signature_b64":"CrODUtUcoKxE3z96COExUaOkkCyhdkbwhVmFXNTFMfa9aR9/FwNE782LLm52Oaz5Yfdjn3Eet6+77gfOvlx1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a4578a8f256850235833753624061f262d3411ba9d891566a324ba0cf726827","last_reissued_at":"2026-05-18T00:42:44.552638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:44.552638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multidimensional Butterfly Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Haizhao Yang, Lexing Ying, Yingzhou Li","submitted_at":"2015-09-25T23:50:54Z","abstract_excerpt":"This paper introduces the multidimensional butterfly factorization as a data-sparse representation of multidimensional kernel matrices that satisfy the complementary low-rank property. This factorization approximates such a kernel matrix of size $N\\times N$ with a product of $\\O(\\log N)$ sparse matrices, each of which contains $\\O(N)$ nonzero entries. We also propose efficient algorithms for constructing this factorization when either (i) a fast algorithm for applying the kernel matrix and its adjoint is available or (ii) every entry of the kernel matrix can be evaluated in $\\O(1)$ operations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07925","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":""},"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":"1509.07925","created_at":"2026-05-18T00:42:44.552725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07925v1","created_at":"2026-05-18T00:42:44.552725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07925","created_at":"2026-05-18T00:42:44.552725+00:00"},{"alias_kind":"pith_short_12","alias_value":"BJCXRKHSK2CQ","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BJCXRKHSK2CQENMD","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BJCXRKHS","created_at":"2026-05-18T12:29:14.074870+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/BJCXRKHSK2CQENMDG5JWEQDB6J","json":"https://pith.science/pith/BJCXRKHSK2CQENMDG5JWEQDB6J.json","graph_json":"https://pith.science/api/pith-number/BJCXRKHSK2CQENMDG5JWEQDB6J/graph.json","events_json":"https://pith.science/api/pith-number/BJCXRKHSK2CQENMDG5JWEQDB6J/events.json","paper":"https://pith.science/paper/BJCXRKHS"},"agent_actions":{"view_html":"https://pith.science/pith/BJCXRKHSK2CQENMDG5JWEQDB6J","download_json":"https://pith.science/pith/BJCXRKHSK2CQENMDG5JWEQDB6J.json","view_paper":"https://pith.science/paper/BJCXRKHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07925&json=true","fetch_graph":"https://pith.science/api/pith-number/BJCXRKHSK2CQENMDG5JWEQDB6J/graph.json","fetch_events":"https://pith.science/api/pith-number/BJCXRKHSK2CQENMDG5JWEQDB6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BJCXRKHSK2CQENMDG5JWEQDB6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BJCXRKHSK2CQENMDG5JWEQDB6J/action/storage_attestation","attest_author":"https://pith.science/pith/BJCXRKHSK2CQENMDG5JWEQDB6J/action/author_attestation","sign_citation":"https://pith.science/pith/BJCXRKHSK2CQENMDG5JWEQDB6J/action/citation_signature","submit_replication":"https://pith.science/pith/BJCXRKHSK2CQENMDG5JWEQDB6J/action/replication_record"}},"created_at":"2026-05-18T00:42:44.552725+00:00","updated_at":"2026-05-18T00:42:44.552725+00:00"}