{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LGC3QFACNCIKUQLZECB5XCSURR","short_pith_number":"pith:LGC3QFAC","schema_version":"1.0","canonical_sha256":"5985b814026890aa41792083db8a548c40122d7d9dc7abd5e3e59152ccf9f2de","source":{"kind":"arxiv","id":"1507.04396","version":1},"attestation_state":"computed","paper":{"title":"Parallel MMF: a Multiresolution Approach to Matrix Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NA","authors_text":"Nedelina Teneva, Pramod K. Mudrakarta, Risi Kondor","submitted_at":"2015-07-15T21:19:25Z","abstract_excerpt":"Multiresolution Matrix Factorization (MMF) was recently introduced as a method for finding multiscale structure and defining wavelets on graphs/matrices. In this paper we derive pMMF, a parallel algorithm for computing the MMF factorization. Empirically, the running time of pMMF scales linearly in the dimension for sparse matrices. We argue that this makes pMMF a valuable new computational primitive in its own right, and present experiments on using pMMF for two distinct purposes: compressing matrices and preconditioning large sparse linear systems."},"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":"1507.04396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-07-15T21:19:25Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b797706fbc4d79ab00cfb01b56dfc489aa9ecc95f4f1e9a02d67099dd8e30897","abstract_canon_sha256":"be5fe9facdc5f14f63a68052d6e6a65bcde18d934e26a3b1fe94f637c21fc59d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:47.530277Z","signature_b64":"SV5/DwSvzCsUXbVoNUxTMjYB/fyqHm/d5kqrcpCmGE6GePYFt+jkZr06r0H2zFJhvwdMZof6mSvtbk7jm4nNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5985b814026890aa41792083db8a548c40122d7d9dc7abd5e3e59152ccf9f2de","last_reissued_at":"2026-05-18T01:36:47.529632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:47.529632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel MMF: a Multiresolution Approach to Matrix Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NA","authors_text":"Nedelina Teneva, Pramod K. Mudrakarta, Risi Kondor","submitted_at":"2015-07-15T21:19:25Z","abstract_excerpt":"Multiresolution Matrix Factorization (MMF) was recently introduced as a method for finding multiscale structure and defining wavelets on graphs/matrices. In this paper we derive pMMF, a parallel algorithm for computing the MMF factorization. Empirically, the running time of pMMF scales linearly in the dimension for sparse matrices. We argue that this makes pMMF a valuable new computational primitive in its own right, and present experiments on using pMMF for two distinct purposes: compressing matrices and preconditioning large sparse linear systems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04396","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":"1507.04396","created_at":"2026-05-18T01:36:47.529730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04396v1","created_at":"2026-05-18T01:36:47.529730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04396","created_at":"2026-05-18T01:36:47.529730+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGC3QFACNCIK","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGC3QFACNCIKUQLZ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGC3QFAC","created_at":"2026-05-18T12:29:29.992203+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/LGC3QFACNCIKUQLZECB5XCSURR","json":"https://pith.science/pith/LGC3QFACNCIKUQLZECB5XCSURR.json","graph_json":"https://pith.science/api/pith-number/LGC3QFACNCIKUQLZECB5XCSURR/graph.json","events_json":"https://pith.science/api/pith-number/LGC3QFACNCIKUQLZECB5XCSURR/events.json","paper":"https://pith.science/paper/LGC3QFAC"},"agent_actions":{"view_html":"https://pith.science/pith/LGC3QFACNCIKUQLZECB5XCSURR","download_json":"https://pith.science/pith/LGC3QFACNCIKUQLZECB5XCSURR.json","view_paper":"https://pith.science/paper/LGC3QFAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04396&json=true","fetch_graph":"https://pith.science/api/pith-number/LGC3QFACNCIKUQLZECB5XCSURR/graph.json","fetch_events":"https://pith.science/api/pith-number/LGC3QFACNCIKUQLZECB5XCSURR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGC3QFACNCIKUQLZECB5XCSURR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGC3QFACNCIKUQLZECB5XCSURR/action/storage_attestation","attest_author":"https://pith.science/pith/LGC3QFACNCIKUQLZECB5XCSURR/action/author_attestation","sign_citation":"https://pith.science/pith/LGC3QFACNCIKUQLZECB5XCSURR/action/citation_signature","submit_replication":"https://pith.science/pith/LGC3QFACNCIKUQLZECB5XCSURR/action/replication_record"}},"created_at":"2026-05-18T01:36:47.529730+00:00","updated_at":"2026-05-18T01:36:47.529730+00:00"}