{"as_of":"2026-08-05T17:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7599f5d9bd6c7f1dfea34c519f996257390253dff8f1dfd10304a6471506330a","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T17:06:14.009425Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T07:04:23.292976Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-25T07:05:26.544428Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"cited_work":{"arxiv_id":"2509.11152","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.11152","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2509.11152 (2025)","venue":null,"work_id":"d6804e46-97a6-4234-9e74-647e0defb6dc","year":2025},"citing_paper":{"arxiv_id":"2602.14289","last_updated":"2026-05-22T15:57:25Z","snapshot_observed_at":"2026-08-01T15:58:11.840765Z","submitted_at":"2026-02-15T19:40:14Z","title":"Parallel Sparse and Data-Sparse Factorization-based Linear Solvers","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-25T07:04:23.292976Z"},"links":{"cited_paper":"/paper/2509.11152","citing_paper":"/paper/2602.14289"},"observation_digest":"sha256:406e95fa8cc7669ad494f5232436c12a13213f12230126bf3a3bbdb3f13b3f6c","observation_id":"8a2c0f8e-f9b6-4375-8f4f-49b81d7dc50b","resolution":{"observed_at":"2026-05-25T07:05:26.546704Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.11152/citation-record","integrity":"/paper/2509.11152/integrity","json":"/paper/2509.11152/citation-record.json","paper":"/paper/2509.11152"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.946371Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.946371Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:f1c5d1b530781b61be8cd8430135dda5594a06eb29a7256b11252c2012e9e511","observation_id":"701e559f-bec6-4e55-b586-5a54288bf24b","resolution":{"observed_at":"2026-08-04T17:06:13.946371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.949839Z","title":"Fast direct methods for Gaussian processes.IEEE Transactions on Pattern Analysis and Machine Intelligence, 38(2):252–265, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.949839Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:cf1860c805a6dc1cf3f0ad52a8a93945af55a1fd4f5a47507451312cc5aa0487","observation_id":"847d64b7-f58e-49e4-942d-df0e5e96957f","resolution":{"observed_at":"2026-08-04T17:06:13.949839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.952489Z","title":"Existence ofH-matrix approximants to the inverse FE-matrix of elliptic operators withL ∞-coefficients.Numerische Mathematik, 95:1–28, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.952489Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:125ae1c92e83fe922ff7de1ed1eacf65f90d66cfb7354767b43762ba2bbd685f","observation_id":"2239a5ef-e81d-428a-89ad-5861ac0b790f","resolution":{"observed_at":"2026-08-04T17:06:13.952489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.955178Z","title":"Approximating Gaussian processes withH 2-matrices","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.955178Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:18ffbd1f3128b5433635fc8f58b0049632d8c496359f4011916079f8edd24138","observation_id":"2e4ab3c0-43c9-4e65-a038-04ca1706c9b9","resolution":{"observed_at":"2026-08-04T17:06:13.955178Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.957829Z","title":"Introduction to hierarchical matrices with applications.Engineering analysis with boundary elements, 27(5):405–422, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.957829Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:56dfa765979ae3832db14dcd653d92ecc6ca6eb364cd71095f3524e19a196dc5","observation_id":"e0bb6681-a321-4b22-a469-b008803a3147","resolution":{"observed_at":"2026-08-04T17:06:13.957829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.960640Z","title":"Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates.Computing and Visualization in Science, 16:247–258, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.960640Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:1a865578ea96fc4a479a8fb18c6d936bfa7c6307c30e734a0479483d8daa7b9f","observation_id":"e7b3d312-dc07-4692-89e5-2e93e8389d9b","resolution":{"observed_at":"2026-08-04T17:06:13.960640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.963411Z","title":"Adaptive Sketching Based Construction of H2 Matrices on GPUs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.963411Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:a1cebc3c4db152ef8655bf9b02a59ae1653179ff482cc9faecd51a2f794c32ed","observation_id":"4428774e-c057-4fdd-96fc-e844e154fd3d","resolution":{"observed_at":"2026-08-04T17:06:13.963411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.965619Z","title":"Hierarchical matrix operations on GPUs: Matrix-vector multiplication and compression.ACM Transactions on Mathematical Software, 45(1):1–28, February 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.965619Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:3a6c23dc7d3d4c7baa1d9af24e80f2b4392821596fbffcbb6dac45608caf13f8","observation_id":"3a2a52fe-39f6-4896-9d6a-9f8c9be31791","resolution":{"observed_at":"2026-08-04T17:06:13.965619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.967868Z","title":"A fast solver for HSS representations via sparse matrices.SIAM Journal on Matrix Analysis and Applications, 29(1):67–81, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.967868Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:e5ba726d402e3acab24d0eeb786abd4d2dc78aaaa672a551a6690321020571fd","observation_id":"da54afaa-3700-44ff-87c6-95a7b172d9c2","resolution":{"observed_at":"2026-08-04T17:06:13.967868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.970201Z","title":"A superfast algorithm for Toeplitz systems of linear equations.SIAM Journal on Matrix Analysis and Applications, 29(4):1247–1266, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.970201Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:1664d4a08a4ba874ea66ea1c030159a75ffa23c507f6e608f376f8e54038098f","observation_id":"72fceacb-95d3-4502-9574-c118b81bc102","resolution":{"observed_at":"2026-08-04T17:06:13.970201Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.972493Z","title":"Scalable and memory- efficient kernel ridge regression","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.972493Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:11aa7b5caff4360df68e09a8c35a9d4f979df5f0528c91e192eef0616a2a32a8","observation_id":"3fc1a00b-f2ac-4745-abbe-04ec490ca844","resolution":{"observed_at":"2026-08-04T17:06:13.972493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.974738Z","title":"The inverse fast multipole method: using a fast approximate direct solver as a preconditioner for dense linear systems.SIAM Journal on Scientific Computing, 39(3):A761– A796, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.974738Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:79f3336dfffcb80ce6914baa5f755f40e7557846e1e2e4c1a33acae00f0811a7","observation_id":"99bfb7af-4267-4089-8162-579e6029b4ee","resolution":{"observed_at":"2026-08-04T17:06:13.974738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.977092Z","title":"A robust parallel preconditioner for indefinite systems using hierarchical matrices and randomized sampling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.977092Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:e18f5c118bb44e4389ddab2b2266db2b89bbba35424c1f5bda943cbe5d9a1da6","observation_id":"ab49000a-bedb-4fe1-9aa9-8f48adfc65fd","resolution":{"observed_at":"2026-08-04T17:06:13.977092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.979459Z","title":"A direct solver withO(N)complexity for integral equations on one-dimensional domains.Frontiers of Mathematics in China, 7:217–247, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.979459Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:669e29567430b7b672daa39ba6a352efadc637e3691363c384c8db37fd8662a5","observation_id":"9c13352b-4702-4675-a940-a8100198b561","resolution":{"observed_at":"2026-08-04T17:06:13.979459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.981640Z","title":"A sparse matrix arithmetic based onH-matrices","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.981640Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:e24bc54203f889c1c26cd578062366162d4f8e2092c3dd5a248e41810ffa7c3b","observation_id":"b7fd9f07-30d4-41ff-81f4-dd22b4fa2d36","resolution":{"observed_at":"2026-08-04T17:06:13.981640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.983976Z","title":"Hierarchical algorithms on hierarchical architectures","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.983976Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:5793f60b2770ccf7c7f8f421b8fd69f278b429c6af5ada91909f12b0deb13afe","observation_id":"184b37cf-f457-4317-b48c-bd98e8febc5b","resolution":{"observed_at":"2026-08-04T17:06:13.983976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.986947Z","title":"Ho and Lexing Ying","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.986947Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:4e79b1b6d924918896470bb51e44fea28f3fd17fc30823071ca30282fcce5d78","observation_id":"22082030-8024-41d8-8368-d4a7517276c8","resolution":{"observed_at":"2026-08-04T17:06:13.986947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.989210Z","title":"AnO(N)distributed-memory parallel direct solver for planar integral equations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.989210Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:2682fd5aacd770d212c3b25d8ec084a7e4c35df6c67776791ffeac452628aa30","observation_id":"2fe6dea8-e605-4b0d-8d06-214ca27cb113","resolution":{"observed_at":"2026-08-04T17:06:13.989210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.991453Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.991453Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:7779a5fe5b2a4ac09edb38ef61c2229fe66c32c1a0429025fa7aa380e311b5f5","observation_id":"30fd123b-9b2a-4837-a01d-c5dbefd9aeb9","resolution":{"observed_at":"2026-08-04T17:06:13.991453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.993681Z","title":"Scalable linear time dense direct solver for 3-d problems without trailing sub-matrix dependencies","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.993681Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:a15ccb0fe897f91b96e6b051a7d2119372c8b70cea8259f9d77ad2d36efa82d9","observation_id":"fafe1ef8-0e80-46c5-b01d-d61025c79df8","resolution":{"observed_at":"2026-08-04T17:06:13.993681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.995984Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.995984Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:3eff07e36cfc85ddaaadcf257e2d3d3b1917cc29033f1bfe0d4e3a19a17c8bea","observation_id":"d632ff18-7bff-491e-90d4-5c51daf0c5bd","resolution":{"observed_at":"2026-08-04T17:06:13.995984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:13.998282Z","title":"A fast direct solver for boundary integral equations in two dimensions.Journal of Computational Physics, 205(1):1–23, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:13.998282Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:f31fda80625b0e5c85d9d5ea2a5ee43f8d0e398da809f729e8a41385276ce882","observation_id":"0a1d6dfe-e735-4c7e-9633-9937c4f5388c","resolution":{"observed_at":"2026-08-04T17:06:13.998282Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:14.000507Z","title":"A recursive skeletonization factorization based on strong admissibility.Multiscale Modeling & Simulation, 15(2):768–796, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:14.000507Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:4066192e23aff43ff27e7cabc0196712716ad72db9eb1a093865be56991879a3","observation_id":"a0469190-a0fc-485e-855f-6976b308108c","resolution":{"observed_at":"2026-08-04T17:06:14.000507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:14.002718Z","title":"FMM-LU: A Fast Direct Solver for Multiscale Boundary Integral Equations in Three Dimensions.Multiscale Modeling & Simulation, 21(4):1570–1601, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:14.002718Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:84724e9046242ce6d281f1c0a9b946d06464c37d1062505a918e0489cdcdb38d","observation_id":"f7f16c6b-781b-43dc-8e6d-591f5ab33e52","resolution":{"observed_at":"2026-08-04T17:06:14.002718Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:14.004868Z","title":"Randomized sparse direct solvers.SIAM Journal on Matrix Analysis and Applications, 34(1):197– 227, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:14.004868Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:53d9315aa5abce50fd5182e993b2be6e42aa62d385b5c22f4e60da7bec875e5b","observation_id":"c73eae95-707f-4804-92a6-fbbc7ff2702e","resolution":{"observed_at":"2026-08-04T17:06:14.004868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:14.007080Z","title":"Randomized Strong Recursive Skeletonization: Simultaneous Compression and LU Factorization of Hierarchical Matrices using Matrix-Vector Products, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:14.007080Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:bb79a89cc66ea430a1c8dfec46635943bc2125c2ff61624e53f7725c21602982","observation_id":"af9e09f3-bb5c-4d14-ab98-1f417b24d825","resolution":{"observed_at":"2026-08-04T17:06:14.007080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T17:06:14.009425Z","title":"H2Opus: a distributed- memory multi-GPU software package for non-local operators.Advances in Computational Mathematics, 48(3), May 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T17:06:14.009425Z"},"links":{"citing_paper":"/paper/2509.11152"},"observation_digest":"sha256:8be5b3da9742029450d293e8d70d513e8a38892595a66a875c99cc35af257e2a","observation_id":"52afd4b8-8e2f-4ee0-9ed7-4fc8f197e8a0","resolution":{"observed_at":"2026-08-04T17:06:14.009425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.11152","last_updated":"2025-09-14T08:05:32Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-04T17:06:12.027984Z","submitted_at":"2025-09-14T08:05:32Z","title":"Linear Complexity $\\mathcal{H}^2$ Direct Solver for Fine-Grained Parallel Architectures"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":27},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 1 inbound Pith citation observation for arXiv:2509.11152."}