{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2CJZONJZZQHZDLZDM35C6QHKL3","short_pith_number":"pith:2CJZONJZ","schema_version":"1.0","canonical_sha256":"d093973539cc0f91af2366fa2f40ea5eede6c1ba801262b9eaaab169ea72a29b","source":{"kind":"arxiv","id":"1707.00164","version":1},"attestation_state":"computed","paper":{"title":"Geometry-Oblivious FMM for Compressing Dense SPD Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.NA","authors_text":"Chenhan D. Yu, George Biros, James Levitt, Severin Reiz","submitted_at":"2017-07-01T14:57:20Z","abstract_excerpt":"We present GOFMM (geometry-oblivious FMM), a novel method that creates a hierarchical low-rank approximation, \"compression,\" of an arbitrary dense symmetric positive definite (SPD) matrix. For many applications, GOFMM enables an approximate matrix-vector multiplication in $N \\log N$ or even $N$ time, where $N$ is the matrix size. Compression requires $N \\log N$ storage and work. In general, our scheme belongs to the family of hierarchical matrix approximation methods. In particular, it generalizes the fast multipole method (FMM) to a purely algebraic setting by only requiring the ability to sa"},"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":"1707.00164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-07-01T14:57:20Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"db09d9a3a35e4ebdcefbae9a1578420d5246687b83f2681fb2bbf72e4eaf8862","abstract_canon_sha256":"6ce724eb315fc3e1e508fdb84c3f5c3173c2e121e7121576d2217e0aa5bf9bd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:04.270953Z","signature_b64":"pN0Mt7M+5GLfnZomb01wCeiFyc+jvOEi6ByhBzIG4UfudmUacHpNLAN17EoYmG2wy7v253eUnmCRiaGpHGRkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d093973539cc0f91af2366fa2f40ea5eede6c1ba801262b9eaaab169ea72a29b","last_reissued_at":"2026-05-18T00:41:04.270406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:04.270406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometry-Oblivious FMM for Compressing Dense SPD Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.NA","authors_text":"Chenhan D. Yu, George Biros, James Levitt, Severin Reiz","submitted_at":"2017-07-01T14:57:20Z","abstract_excerpt":"We present GOFMM (geometry-oblivious FMM), a novel method that creates a hierarchical low-rank approximation, \"compression,\" of an arbitrary dense symmetric positive definite (SPD) matrix. For many applications, GOFMM enables an approximate matrix-vector multiplication in $N \\log N$ or even $N$ time, where $N$ is the matrix size. Compression requires $N \\log N$ storage and work. In general, our scheme belongs to the family of hierarchical matrix approximation methods. In particular, it generalizes the fast multipole method (FMM) to a purely algebraic setting by only requiring the ability to sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00164","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":"1707.00164","created_at":"2026-05-18T00:41:04.270502+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00164v1","created_at":"2026-05-18T00:41:04.270502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00164","created_at":"2026-05-18T00:41:04.270502+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CJZONJZZQHZ","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CJZONJZZQHZDLZD","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CJZONJZ","created_at":"2026-05-18T12:30:55.937587+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/2CJZONJZZQHZDLZDM35C6QHKL3","json":"https://pith.science/pith/2CJZONJZZQHZDLZDM35C6QHKL3.json","graph_json":"https://pith.science/api/pith-number/2CJZONJZZQHZDLZDM35C6QHKL3/graph.json","events_json":"https://pith.science/api/pith-number/2CJZONJZZQHZDLZDM35C6QHKL3/events.json","paper":"https://pith.science/paper/2CJZONJZ"},"agent_actions":{"view_html":"https://pith.science/pith/2CJZONJZZQHZDLZDM35C6QHKL3","download_json":"https://pith.science/pith/2CJZONJZZQHZDLZDM35C6QHKL3.json","view_paper":"https://pith.science/paper/2CJZONJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00164&json=true","fetch_graph":"https://pith.science/api/pith-number/2CJZONJZZQHZDLZDM35C6QHKL3/graph.json","fetch_events":"https://pith.science/api/pith-number/2CJZONJZZQHZDLZDM35C6QHKL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CJZONJZZQHZDLZDM35C6QHKL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CJZONJZZQHZDLZDM35C6QHKL3/action/storage_attestation","attest_author":"https://pith.science/pith/2CJZONJZZQHZDLZDM35C6QHKL3/action/author_attestation","sign_citation":"https://pith.science/pith/2CJZONJZZQHZDLZDM35C6QHKL3/action/citation_signature","submit_replication":"https://pith.science/pith/2CJZONJZZQHZDLZDM35C6QHKL3/action/replication_record"}},"created_at":"2026-05-18T00:41:04.270502+00:00","updated_at":"2026-05-18T00:41:04.270502+00:00"}