{"as_of":"2026-08-21T19:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e628365f23a9cf06492488062d63cde9252b1c7c2efaf514821824d2c879707","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:42:43.801900Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T05:12:59.156021Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.03198","snapshot_observed_at":"2026-08-02T05:12:59.156021Z","title":"Fakih and L","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13532","last_updated":"2026-07-15T07:32:43Z","snapshot_observed_at":"2026-08-18T03:55:19.166676Z","submitted_at":"2026-07-15T07:32:43Z","title":"Computing Strong Rank-Revealing Factorizations for Matrices with Orthonormal Rows","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-02T05:12:59.156021Z"},"links":{"cited_paper":"/paper/2509.03198","citing_paper":"/paper/2607.13532"},"observation_digest":"sha256:4d306d74ec2f1f3f0d5fcf53ed382f00a402c59c367c151a38a0f368875f43a3","observation_id":"c9171d1b-4e31-4e9f-b014-4c5a67aa3a8d","resolution":{"observed_at":"2026-08-02T05:12:59.156021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.03198","snapshot_observed_at":"2026-08-01T05:34:48.030977Z","title":"Fakih and L","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.030977Z"},"links":{"cited_paper":"/paper/2509.03198","citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:6e31c1f9b921d12337855a5f8b652b411ba71f00dacc4e7cdb2442add0e46fac","observation_id":"9579b8a9-8c38-4ee7-b6fd-4e496cb0450a","resolution":{"observed_at":"2026-08-01T05:34:48.030977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.03198/citation-record","integrity":"/paper/2509.03198/integrity","json":"/paper/2509.03198/citation-record.json","paper":"/paper/2509.03198"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.187510Z","title":"Randomized gram–schmidt process with application to gmres","venue":null,"work_id":"fc9b604b-5c3f-4324-8f62-e37f467070d5","year":2022},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.673641Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:153777cacf96ee04b0029e4062d93f5d7896a36fca00dcc3d115e0ecb43aa0be","observation_id":"39793526-22dc-4173-9784-e19949918d98","resolution":{"observed_at":"2026-08-15T16:42:44.190878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.177511Z","title":"Communication avoiding low rank approximation based on qr with tournament pivoting","venue":null,"work_id":"3a359caf-094f-42bb-bbb8-e12af118bbe1","year":2021},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.677781Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:1c2131f7564f8078db305740cf0bba10eec16b7419d6c19123174fee4107ccaf","observation_id":"e783d695-4b1d-476f-b4ae-fb36d6c51bc1","resolution":{"observed_at":"2026-08-15T16:42:44.181041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.167889Z","title":"An improved approximation algorithm for the column subset selection problem","venue":null,"work_id":"6ac954c7-b531-4ff9-a9a4-1f4d81d222c0","year":2009},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.681355Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:8c28d4e807ede8b3b84beedb1e97fdd2ebff6d211e5f3b719dcdf911d6273163","observation_id":"d621e4d2-ad89-455b-b061-d0a1820a4dcc","resolution":{"observed_at":"2026-08-15T16:42:44.171220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.158216Z","title":"Linear least squares solutions by householder trans- formations","venue":null,"work_id":"33bbe85b-8af9-4403-88d8-108c4d476de8","year":1965},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.684629Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:0b9b28e53cab240e34997d03923f692d0b3658fa37bb172f2af71473a127f0d2","observation_id":"f9204304-fef2-43f4-af9e-e321b06e8de4","resolution":{"observed_at":"2026-08-15T16:42:44.161678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.148016Z","title":"Rank revealing qr factorizations.Linear algebra and its applications, 88: 67–82, 1987","venue":null,"work_id":"e553dd3f-3c86-4993-be5d-bb15765d1a4a","year":1987},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.688054Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:3b545c4e8b4dd25ad41955dd4f166cc120f19d608be342f9a671bf049202cd1e","observation_id":"d058b14b-ee81-467e-a8c3-0add0adeecc1","resolution":{"observed_at":"2026-08-15T16:42:44.151574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.137779Z","title":"Some applications of the rank revealing qr factorization","venue":null,"work_id":"98cf3f23-8ed7-46ca-86a8-1fa9aa9ffc92","year":1992},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.691473Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:9f11b964df91f4ad03d135bb3fb1d5bbccf63f0b125acb3b25272e44bdbe2947","observation_id":"33a9147d-97bb-438d-93fd-764593ec6c97","resolution":{"observed_at":"2026-08-15T16:42:44.141336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.127646Z","title":"On rank-revealing factorisations.SIAM Journal on Matrix Analysis and Applications, 15(2):592–622, 1994","venue":null,"work_id":"53bae21e-1ebd-4940-8775-e58ca38c1ad9","year":1994},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.695158Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:1672f60ec2446651d23d209ab1200944c4a0eabcb7ba84c2b973df37b19ed6cc","observation_id":"68f8ecf9-d58c-4057-8134-d1e35cd27bfb","resolution":{"observed_at":"2026-08-15T16:42:44.131290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.117235Z","title":"Optimal embedding dimension for sparse subspace embeddings","venue":null,"work_id":"7fce45a9-b2b0-4d29-91c4-4d95892209e2","year":2024},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.698203Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:e33a0d331e8a26a93094056f4f428f64d4343d55a7b6417450298c39a4864aae","observation_id":"ec40b1ff-83dc-4ef7-bab2-47bd9e9ad4aa","resolution":{"observed_at":"2026-08-15T16:42:44.120751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.107379Z","title":"Nearly tight oblivious subspace embeddings by trace inequalities","venue":null,"work_id":"912dcf97-f938-44c9-ae46-768683f3d659","year":2016},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.701461Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:822f7611c273a03dbb1e270cce7dbf4af6f2d33a86ac5a6515365a138af5d875","observation_id":"9f8c96f5-b9c3-437b-93bc-bec251f5674d","resolution":{"observed_at":"2026-08-15T16:42:44.110888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.704620Z","title":"An elementary proof of a theorem of johnson and lindenstrauss","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.704620Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:87df977a5085bfa2d8a80bd29d058a1d00b4d7c02dc556be113cd276a18ad1c7","observation_id":"2440531d-20d1-4f28-9720-a09e73c2cd9c","resolution":{"observed_at":"2026-08-15T16:42:43.704620Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.091313Z","title":"Communication avoiding rank revealing qr factorization with column pivoting.SIAM Journal on Matrix Analysis and Applications, 36(1):55–89, 2015","venue":null,"work_id":"be685357-fc7b-4efa-b9b3-29c2cf197a67","year":2015},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.707805Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:b9fc617d6dc80c4b55b187e94bb023413d6caf2271aa558c92351f29fa56af47","observation_id":"7afd612b-82a4-470f-bceb-f6a3378329fe","resolution":{"observed_at":"2026-08-15T16:42:44.094888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.080855Z","title":"Fast approximation of matrix coherence and statistical leverage","venue":null,"work_id":"21717a8a-b9fd-4aa7-b639-aed45ce31fa2","year":2012},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.711648Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:b855206e3c58fd2f52664793ef80cfa23f4783be7e8620a67228051a576d4964","observation_id":"071d3b32-806e-4b4e-b964-b64fcbd268dd","resolution":{"observed_at":"2026-08-15T16:42:44.084719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.715211Z","title":"Duersch and Ming Gu","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.715211Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:85290c5b850b5949879de823a8cd6305535d5a86df7c12327f8981d40dbaa98f","observation_id":"8d2f6c20-e650-4ab7-9abc-1261b87539ef","resolution":{"observed_at":"2026-08-15T16:42:43.715211Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.069944Z","title":"Fast and forward stable randomized algorithms for linear least-squares problems","venue":null,"work_id":"1ea6d771-5681-4992-890d-8c1419269206","year":2024},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.718641Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:31559eea3ebd24dfddd757eebb626c7b87334b8287be090c4b9ca373739896b6","observation_id":"21f88b51-3a69-4641-872a-088e7e8c152d","resolution":{"observed_at":"2026-08-15T16:42:44.074097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.060530Z","title":null,"venue":null,"work_id":"2209a5ae-2fff-4dfa-881b-79d38628dbf0","year":2024},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.722038Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:1c8ea20e50daca21c2fcc3191df1d3383dd5c567d633c94b286a99221757d285","observation_id":"11aabd67-ed03-4b9b-905e-af478894cbc1","resolution":{"observed_at":"2026-08-15T16:42:44.063733Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.050639Z","title":"Numerical methods for solving linear least squares problems.Numerische Mathematik, 7:206–216, 1965","venue":null,"work_id":"b88075e8-f5f0-42f6-b235-38d63e40a9eb","year":1965},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.725670Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:6bbd534b628ad7e99b56bfe753dd22758b42f57e9502e237b9950e88281f0f92","observation_id":"e7868d96-8caf-407c-80dc-efbe3f0e7859","resolution":{"observed_at":"2026-08-15T16:42:44.054133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.18496","last_updated":"2025-03-24T09:52:06Z","snapshot_observed_at":"2026-08-16T12:47:25.407539Z","submitted_at":"2025-03-24T09:52:06Z","title":"Randomized strong rank-revealing QR for column subset selection and low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.18496","snapshot_observed_at":"2026-08-15T16:42:43.728785Z","title":"Randomized strong rank-revealing qr for column subset selection and low-rank matrix approximation.arXiv preprint arXiv:2503.18496, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.728785Z"},"links":{"cited_paper":"/paper/2503.18496","citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:76f3764341f0e46fe56d2d2ace523cfd38554c3ea6ef6991c52b234cc429bc47","observation_id":"9a0f7f21-8c40-4d7e-8e7f-118462d7872e","resolution":{"observed_at":"2026-08-15T16:42:43.728785Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.040136Z","title":"Efficient algorithms for computing a strong rank- revealing qr factorization.SIAM Journal on Scientific Computing, 17(4):848–869, 1996","venue":null,"work_id":"dadeba55-5e42-44e4-b9bf-067d07bf8908","year":1996},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.732383Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:c6f82f46eb34e2feee948a0043c5832cc839987e40421b38e471c157d02e36c2","observation_id":"a210a07e-5750-46a6-a6fc-f6c8a53594c3","resolution":{"observed_at":"2026-08-15T16:42:44.043817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.030332Z","title":"Rank-revealing qr factorizations and the singular value decomposition","venue":null,"work_id":"c1c8eec9-2521-4775-b2cd-f88288f58da4","year":1992},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.735821Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:937aaa1f03a68d02a0bf8fecb5414ca83b8a0e1c67fc461b51fdc82674a3046c","observation_id":"80957d5a-b431-4722-a03c-173e6debb8ee","resolution":{"observed_at":"2026-08-15T16:42:44.033920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.739050Z","title":"Cambridge university press, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.739050Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:07defc64a4255edf974e356584a34033691cd38997b9149e3276b3ff9be058b5","observation_id":"100e13b2-9aaa-4bcd-9f1e-0f43c075b778","resolution":{"observed_at":"2026-08-15T16:42:43.739050Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:44.014178Z","title":"Ipsen and S","venue":null,"work_id":"4bfb62b1-8d78-449b-b355-71b95312ff76","year":2003},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.742432Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:8f3c5e3014187dd242bf91e69b71f4fd33e39c5167164bd32b87ee021e04250f","observation_id":"2a27bfc1-b9ee-4688-8217-55d7171de664","resolution":{"observed_at":"2026-08-15T16:42:44.017826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.745533Z","title":"Extensions of lipschitz mappings into a hilbert space","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.745533Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:92601c7cdf4bbd9fb86022d18ee17fdd2fb6413cdf719fb7f81630a47968a7a3","observation_id":"b130bcf0-a922-4c02-b34f-454af77d9adf","resolution":{"observed_at":"2026-08-15T16:42:43.745533Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.997985Z","title":"Numerical linear algebra.Canadian Mathematical Bulletin, 9(5):757–801, 1966","venue":null,"work_id":"abf98067-08b4-4da7-b50c-43b5eb98571e","year":1966},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.748791Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:e93e47cdfc0f7480a1ebe51916f7acdb9d523e4d4e6b3dd6d11bd7b2ce75eccd","observation_id":"ac24e69f-bc16-4792-8ce5-bef44683ccaf","resolution":{"observed_at":"2026-08-15T16:42:44.001612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.988144Z","title":"Sparser johnson-lindenstrauss transforms.Journal of the ACM (JACM), 61(1):1–23, 2014","venue":null,"work_id":"2bdb152b-9aed-4892-91a5-e064f12b24c1","year":2014},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.751997Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:1f7fc3f8015d3e8ab10e7a888f5d7ca5cc00e3372d91169ecd9cdf9ddf6964ab","observation_id":"639e634d-cb4a-480e-88bf-1fe3fdf9402e","resolution":{"observed_at":"2026-08-15T16:42:43.991577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.977546Z","title":"Lu factorization with panel rank revealing pivoting and its communication avoiding version.SIAM Journal on Matrix Analysis and Applications, 34(3):1401–1429, 2013","venue":null,"work_id":"225a99eb-07ae-490c-bb92-9ca7099ed2eb","year":2013},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.755461Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:26ab1317c95f8fc13196e7db277765e3f32c4455529c4ccd65f265d6d3e22412","observation_id":"75db5be1-b645-4161-aad4-19ed0b8c2771","resolution":{"observed_at":"2026-08-15T16:42:43.981343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.967027Z","title":"Optimality of the johnson-lindenstrauss lemma","venue":null,"work_id":"ef739bd0-5320-4d5a-80ed-65e9bf9eba92","year":2017},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.758582Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:29763120cbd40dfdd559da85202d876d6897fb3356a5431ce5633962dcc4dcf4","observation_id":"bd3d3f3c-0ec9-491c-90cd-cf5cb59ad892","resolution":{"observed_at":"2026-08-15T16:42:43.970493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.957014Z","title":"Randomized numerical linear algebra: Foun- dations and algorithms.Acta Numerica, 29:403–572, 2020","venue":null,"work_id":"67d2d25f-fd75-4b4a-96b4-c702629a86af","year":2020},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.761993Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:33617145dc1a19d4a2a347dadeb2eee4cf90edf90f61f911c22e03f508b06c90","observation_id":"caeb784d-9ee1-4757-87eb-ff1173cbb7c0","resolution":{"observed_at":"2026-08-15T16:42:43.960632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.946717Z","title":"Householder qr factorization with randomization for column pivoting (hqrrp)","venue":null,"work_id":"05c4bfeb-c1ea-4c75-ad54-f54a3fe3767d","year":2017},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.765654Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:07607df625b57e83f3bc0c58bbf644cf98efb71383d67715ce61321199c22a38","observation_id":"b1a472e3-a7e6-4457-9f8d-25267c97f2ff","resolution":{"observed_at":"2026-08-15T16:42:43.950633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.936186Z","title":"Low-distortion subspace embeddings in input- sparsity time and applications to robust linear regression","venue":null,"work_id":"d37d93c5-0ccf-417c-ab82-b339c1915316","year":2013},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.768995Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:7daba036af001f28faed902123107ec086f85dfacaa9d8455a4c5a0cff00a443","observation_id":"a1adb157-b8c8-4c00-a85e-7926819c4748","resolution":{"observed_at":"2026-08-15T16:42:43.939972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.925522Z","title":"Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings","venue":null,"work_id":"8f5ebeef-22ff-4ff9-8395-4a34655d4583","year":2013},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.772143Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:5854868dc8b815714062f31d0e16a770a7d5286a55c95529bf5c1efe9cced3a3","observation_id":"d7c0839b-ec53-4df7-8f3e-03cc70944a2b","resolution":{"observed_at":"2026-08-15T16:42:43.929336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.775304Z","title":"Lower bounds for oblivious subspace embeddings","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.775304Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:09eeabb8a4726fb55b00a1da9401c456b898e5d3f408c75ac16d01ae0c36a29b","observation_id":"931f9f13-0e38-4d70-9e6a-122a0072b526","resolution":{"observed_at":"2026-08-15T16:42:43.775304Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.909167Z","title":"On the existence and computation of rank-revealing lu factorizations.Linear Algebra and its Applications, 316(1-3):199–222, 2000","venue":null,"work_id":"b081863f-a95d-4a50-9af3-3d3a0ed2f72c","year":2000},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.778728Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:15a6c9f79fe40d9806b620a662c3ff08e01b008dfc8ed07d1e4f65b8fc75d50c","observation_id":"5264707a-9b83-4f42-bf54-5ab385e03d51","resolution":{"observed_at":"2026-08-15T16:42:43.912701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.899316Z","title":"balls into bins","venue":null,"work_id":"66400e8e-da34-4dec-8a74-92065121c4ad","year":1998},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.781823Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:ac68889e93f8206557a4240c5f06b7d5d2460912186a87ad3a66a72dd20b1162","observation_id":"68de0b87-cf7c-4c2f-9890-81bc4edc58a5","resolution":{"observed_at":"2026-08-15T16:42:43.902669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.784925Z","title":"Column subset selection is np-complete.Linear Algebra and its Applica- tions, 610:52–58, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.784925Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:5d2486a00766109e97b280989d3aba008116da7d9dd06fb164cbc26504c31bf5","observation_id":"f852404a-9d17-4aae-8e0b-7ada2b5681e6","resolution":{"observed_at":"2026-08-15T16:42:43.784925Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.888366Z","title":"Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation.SIAM Journal on Computing, 41(2): 293–331, 2012","venue":null,"work_id":"9f87a8ef-d33c-49f7-815e-0c9be84173aa","year":2012},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.788143Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:60b127ec299830a8af6d5f5bb0d87521c46da5f856217c07bc355c1c8a060528","observation_id":"b3445528-56f0-41a8-927b-92fdf3ba8d94","resolution":{"observed_at":"2026-08-15T16:42:43.892144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.791238Z","title":"Improved analysis of the subsampled randomized hadamard transform","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.791238Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:8308102e55b2daea93c90255c85ed2531b680855db6e6ce8755896112a7a7829","observation_id":"582a4b57-80d9-47f8-a68e-f25e821d40e3","resolution":{"observed_at":"2026-08-15T16:42:43.791238Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.871946Z","title":"Error analysis of direct methods of matrix inversion.Journal of the ACM (JACM), 8(3):281–330, 1961","venue":null,"work_id":"dacf7f70-3bd0-4330-9511-7de8a50075d0","year":1961},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.795190Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:fe65343db268abbe9aef87925bb04eb8aaa9f7ca71591e03d43a6ac6c93c0a42","observation_id":"bca04cfa-e888-4a98-a9ba-87860123c75c","resolution":{"observed_at":"2026-08-15T16:42:43.875527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.861385Z","title":"Sketching as a tool for numerical linear algebra.Foundations and Trends® in Theoretical Computer Science, 10(1–2):1–157, 2014","venue":null,"work_id":"60f082b0-a1a3-4d4e-ac70-e41224a42550","year":2014},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.798449Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:d7b5cd5cea4284000383420b254fcd27f6b5affd4e78766c8286852c81227361","observation_id":"c27839db-b4d1-4c25-b79a-9005750929ef","resolution":{"observed_at":"2026-08-15T16:42:43.865116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:42:43.848973Z","title":"Fast parallel randomized qr with column pivoting algorithms for reliable low-rank matrix approximations","venue":null,"work_id":"7473f546-0163-4429-aca2-ce761ce905dd","year":2017},"citing_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T16:42:43.801900Z"},"links":{"citing_paper":"/paper/2509.03198"},"observation_digest":"sha256:defadf0d7517358314a752fcae001fc88b3cc90b1473a700c618c7f5c39b01b1","observation_id":"011e7ec4-8498-48ac-9e04-60953407740d","resolution":{"observed_at":"2026-08-15T16:42:43.854475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","latest_version":3,"primary_category":"math.NA","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":30},"total_outbound_references":39},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 2 inbound Pith citation observations for arXiv:2509.03198."}