{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SMXLILV53XBV5O5RGHSXFCLJAR","short_pith_number":"pith:SMXLILV5","canonical_record":{"source":{"id":"1508.01835","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-07T23:22:43Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"c17aac2fa751d8bcb2770b621a145e114b1894d1558057d9050d4e41f66678fc","abstract_canon_sha256":"f43be9b82c0dfd65b01f87f4515f627587cdb20c3622683daffaa08a7f453bd3"},"schema_version":"1.0"},"canonical_sha256":"932eb42ebdddc35ebbb131e572896904586c74180b2b5cf782969747563372c0","source":{"kind":"arxiv","id":"1508.01835","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01835","created_at":"2026-05-18T01:21:19Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01835v2","created_at":"2026-05-18T01:21:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01835","created_at":"2026-05-18T01:21:19Z"},{"alias_kind":"pith_short_12","alias_value":"SMXLILV53XBV","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SMXLILV53XBV5O5R","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SMXLILV5","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SMXLILV53XBV5O5RGHSXFCLJAR","target":"record","payload":{"canonical_record":{"source":{"id":"1508.01835","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-07T23:22:43Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"c17aac2fa751d8bcb2770b621a145e114b1894d1558057d9050d4e41f66678fc","abstract_canon_sha256":"f43be9b82c0dfd65b01f87f4515f627587cdb20c3622683daffaa08a7f453bd3"},"schema_version":"1.0"},"canonical_sha256":"932eb42ebdddc35ebbb131e572896904586c74180b2b5cf782969747563372c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:19.482358Z","signature_b64":"sm5PmLIWgACYb8mrIaqOM1ODc+yZtNfwBGsipU77bBocQn1enrkOJatYztaEoEzLVdf+c5eXy4Qf0FDCxahxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"932eb42ebdddc35ebbb131e572896904586c74180b2b5cf782969747563372c0","last_reissued_at":"2026-05-18T01:21:19.481687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:19.481687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.01835","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:21:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F57pZTyaW91+gPSxCCWlgmAkPvEeLfXDF+f4LHl31klluqI+zX5ulSobVbPxyd4GzCeKc85b5CdrgjsEqMykBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:21:09.337680Z"},"content_sha256":"7d326a91388337080ac998848010d9caa0e7a2a9de2ddbe1ed03584167341772","schema_version":"1.0","event_id":"sha256:7d326a91388337080ac998848010d9caa0e7a2a9de2ddbe1ed03584167341772"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SMXLILV53XBV5O5RGHSXFCLJAR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The inverse fast multipole method: using a fast approximate direct solver as a preconditioner for dense linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Eric Darve, Hadi Pouransari, Pieter Coulier","submitted_at":"2015-08-07T23:22:43Z","abstract_excerpt":"Although some preconditioners are available for solving dense linear systems, there are still many matrices for which preconditioners are lacking, in particular in cases where the size of the matrix $N$ becomes very large. There remains hence a great need to develop general purpose preconditioners whose cost scales well with the matrix size $N$. In this paper, we propose a preconditioner with broad applicability and with cost $\\mathcal{O}(N)$ for dense matrices, when the matrix is given by a smooth kernel. Extending the method using the same framework to general $\\mathcal{H}^2$-matrices is rel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01835","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:21:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DLAEY3u0+iiFcD01MSHWm+Kw/v+JP9FPSHRoFF17Y+zBo6W5mR+ph3hFEopPWSjhbtdNdDTIduaEnTfrcwz7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:21:09.338064Z"},"content_sha256":"6b17cba50c70d64ce706e24461c689676112721593bdeae4d30a8bf33f6c634f","schema_version":"1.0","event_id":"sha256:6b17cba50c70d64ce706e24461c689676112721593bdeae4d30a8bf33f6c634f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMXLILV53XBV5O5RGHSXFCLJAR/bundle.json","state_url":"https://pith.science/pith/SMXLILV53XBV5O5RGHSXFCLJAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMXLILV53XBV5O5RGHSXFCLJAR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T13:21:09Z","links":{"resolver":"https://pith.science/pith/SMXLILV53XBV5O5RGHSXFCLJAR","bundle":"https://pith.science/pith/SMXLILV53XBV5O5RGHSXFCLJAR/bundle.json","state":"https://pith.science/pith/SMXLILV53XBV5O5RGHSXFCLJAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMXLILV53XBV5O5RGHSXFCLJAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SMXLILV53XBV5O5RGHSXFCLJAR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f43be9b82c0dfd65b01f87f4515f627587cdb20c3622683daffaa08a7f453bd3","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-07T23:22:43Z","title_canon_sha256":"c17aac2fa751d8bcb2770b621a145e114b1894d1558057d9050d4e41f66678fc"},"schema_version":"1.0","source":{"id":"1508.01835","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01835","created_at":"2026-05-18T01:21:19Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01835v2","created_at":"2026-05-18T01:21:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01835","created_at":"2026-05-18T01:21:19Z"},{"alias_kind":"pith_short_12","alias_value":"SMXLILV53XBV","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SMXLILV53XBV5O5R","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SMXLILV5","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:6b17cba50c70d64ce706e24461c689676112721593bdeae4d30a8bf33f6c634f","target":"graph","created_at":"2026-05-18T01:21:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Although some preconditioners are available for solving dense linear systems, there are still many matrices for which preconditioners are lacking, in particular in cases where the size of the matrix $N$ becomes very large. There remains hence a great need to develop general purpose preconditioners whose cost scales well with the matrix size $N$. In this paper, we propose a preconditioner with broad applicability and with cost $\\mathcal{O}(N)$ for dense matrices, when the matrix is given by a smooth kernel. Extending the method using the same framework to general $\\mathcal{H}^2$-matrices is rel","authors_text":"Eric Darve, Hadi Pouransari, Pieter Coulier","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-07T23:22:43Z","title":"The inverse fast multipole method: using a fast approximate direct solver as a preconditioner for dense linear systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01835","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7d326a91388337080ac998848010d9caa0e7a2a9de2ddbe1ed03584167341772","target":"record","created_at":"2026-05-18T01:21:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f43be9b82c0dfd65b01f87f4515f627587cdb20c3622683daffaa08a7f453bd3","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-07T23:22:43Z","title_canon_sha256":"c17aac2fa751d8bcb2770b621a145e114b1894d1558057d9050d4e41f66678fc"},"schema_version":"1.0","source":{"id":"1508.01835","kind":"arxiv","version":2}},"canonical_sha256":"932eb42ebdddc35ebbb131e572896904586c74180b2b5cf782969747563372c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"932eb42ebdddc35ebbb131e572896904586c74180b2b5cf782969747563372c0","first_computed_at":"2026-05-18T01:21:19.481687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:19.481687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sm5PmLIWgACYb8mrIaqOM1ODc+yZtNfwBGsipU77bBocQn1enrkOJatYztaEoEzLVdf+c5eXy4Qf0FDCxahxCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:19.482358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01835","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d326a91388337080ac998848010d9caa0e7a2a9de2ddbe1ed03584167341772","sha256:6b17cba50c70d64ce706e24461c689676112721593bdeae4d30a8bf33f6c634f"],"state_sha256":"167ac636522a418eb242264503b4fc54401a3ee9e6026abc9b6443789334aa32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KDWoYkNuZK/40Bl+KvJOOfWO3F2NaGjeOyw5noNyfKZQi0mvPb42++gwDwowTzEOebeJbr4e9KuSxNS31+WFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:21:09.340243Z","bundle_sha256":"44c80b1b8a982e06136d13488750b776892c86f78557ac23274d2bc9717eb288"}}