{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:F33NOMSX5BXTOBKRKBJC2WRNFJ","short_pith_number":"pith:F33NOMSX","schema_version":"1.0","canonical_sha256":"2ef6d73257e86f37055150522d5a2d2a45e48763c6f99e2b52e9762f46f9fd95","source":{"kind":"arxiv","id":"1809.10573","version":2},"attestation_state":"computed","paper":{"title":"Interpolative Decomposition Butterfly Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Haizhao Yang, Kenneth L. Ho, Qiyuan Pang","submitted_at":"2018-09-27T15:26:02Z","abstract_excerpt":"This paper introduces a \"kernel-independent\" interpolative decomposition butterfly factorization (IDBF) as a data-sparse approximation for matrices that satisfy a complementary low-rank property. The IDBF can be constructed in $O(N\\log N)$ operations for an $N\\times N$ matrix via hierarchical interpolative decompositions (IDs), if matrix entries can be sampled individually and each sample takes $O(1)$ operations. The resulting factorization is a product of $O(\\log N)$ sparse matrices, each with $O(N)$ non-zero entries. Hence, it can be applied to a vector rapidly in $O(N\\log N)$ operations. ID"},"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":"1809.10573","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-09-27T15:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"4eabb9704050ffa8db2ae0350958964e3eca4e84d101271d97874aee2ee4c299","abstract_canon_sha256":"dd0a4434625e80a7c86dbb515bf84704fd5939040a09332aa8cab32bda23dc0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:55.275185Z","signature_b64":"oIi7FljhplUqVtG7HvfKmLf+fHrLFqv7VoM52neKX6HW8QuyFf3ozAmMcTyBOqzcwbJ9NU5++oe5S3yTUndCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ef6d73257e86f37055150522d5a2d2a45e48763c6f99e2b52e9762f46f9fd95","last_reissued_at":"2026-05-18T00:03:55.274473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:55.274473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interpolative Decomposition Butterfly Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Haizhao Yang, Kenneth L. Ho, Qiyuan Pang","submitted_at":"2018-09-27T15:26:02Z","abstract_excerpt":"This paper introduces a \"kernel-independent\" interpolative decomposition butterfly factorization (IDBF) as a data-sparse approximation for matrices that satisfy a complementary low-rank property. The IDBF can be constructed in $O(N\\log N)$ operations for an $N\\times N$ matrix via hierarchical interpolative decompositions (IDs), if matrix entries can be sampled individually and each sample takes $O(1)$ operations. The resulting factorization is a product of $O(\\log N)$ sparse matrices, each with $O(N)$ non-zero entries. Hence, it can be applied to a vector rapidly in $O(N\\log N)$ operations. ID"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10573","kind":"arxiv","version":2},"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":"1809.10573","created_at":"2026-05-18T00:03:55.274564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10573v2","created_at":"2026-05-18T00:03:55.274564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10573","created_at":"2026-05-18T00:03:55.274564+00:00"},{"alias_kind":"pith_short_12","alias_value":"F33NOMSX5BXT","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"F33NOMSX5BXTOBKR","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"F33NOMSX","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.09376","citing_title":"Multidimensional Phase Recovery and Interpolative Decomposition Butterfly Factorization","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F33NOMSX5BXTOBKRKBJC2WRNFJ","json":"https://pith.science/pith/F33NOMSX5BXTOBKRKBJC2WRNFJ.json","graph_json":"https://pith.science/api/pith-number/F33NOMSX5BXTOBKRKBJC2WRNFJ/graph.json","events_json":"https://pith.science/api/pith-number/F33NOMSX5BXTOBKRKBJC2WRNFJ/events.json","paper":"https://pith.science/paper/F33NOMSX"},"agent_actions":{"view_html":"https://pith.science/pith/F33NOMSX5BXTOBKRKBJC2WRNFJ","download_json":"https://pith.science/pith/F33NOMSX5BXTOBKRKBJC2WRNFJ.json","view_paper":"https://pith.science/paper/F33NOMSX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10573&json=true","fetch_graph":"https://pith.science/api/pith-number/F33NOMSX5BXTOBKRKBJC2WRNFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/F33NOMSX5BXTOBKRKBJC2WRNFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F33NOMSX5BXTOBKRKBJC2WRNFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F33NOMSX5BXTOBKRKBJC2WRNFJ/action/storage_attestation","attest_author":"https://pith.science/pith/F33NOMSX5BXTOBKRKBJC2WRNFJ/action/author_attestation","sign_citation":"https://pith.science/pith/F33NOMSX5BXTOBKRKBJC2WRNFJ/action/citation_signature","submit_replication":"https://pith.science/pith/F33NOMSX5BXTOBKRKBJC2WRNFJ/action/replication_record"}},"created_at":"2026-05-18T00:03:55.274564+00:00","updated_at":"2026-05-18T00:03:55.274564+00:00"}