{"as_of":"2026-08-08T11:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4483a9a849ad9f33bb1c6eaa54117d814de6364eadb74fde4c292be130d4ac82","coverage":[{"denominator":67,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":67,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T08:40:00.522043Z","state":"measured"},{"denominator":67,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":67,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2607.29361/citation-record","integrity":"/paper/2607.29361/integrity","json":"/paper/2607.29361/citation-record.json","paper":"/paper/2607.29361"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.16937","last_updated":"2025-09-06T14:27:10Z","snapshot_observed_at":"2026-08-07T14:50:27.040751Z","submitted_at":"2025-05-22T17:27:40Z","title":"Quasi-optimal hierarchically semi-separable matrix approximation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.16937","snapshot_observed_at":"2026-08-03T08:39:54.127544Z","title":"arXiv preprint arXiv:2505.16937 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:54.127544Z"},"links":{"cited_paper":"/paper/2505.16937","citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:af34c8c46875a11a5022ad4e72e6d97aaa49d585807f37b0e80d118ab9fa8abf","observation_id":"5f5e888d-24c5-43bd-a799-e44cf6922e0e","resolution":{"observed_at":"2026-08-03T08:39:54.127544Z","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":"10.1137/25m176622x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Matrix Analysis and Applications","work_id":"74b67065-78c4-4013-b242-743f2be6da4f","year":2026},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:54.174383Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:c4bc6a43e1a5b98ac63b8612a254335211d45fd7cb8ebaa5d84bde3de5d39851","observation_id":"98ba39ba-a4fc-40d3-be31-bacd85719021","resolution":{"observed_at":"2026-08-03T08:43:27.002424Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T08:39:54.268377Z","title":"and Ho, Kenneth L","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:54.268377Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:24b833eb6bb73d644d7d8a02afef30a5a20be0476fa0c3f7fd550568282ddcea","observation_id":"e57b1fe1-85d5-4cf4-8442-3b29871b61b9","resolution":{"observed_at":"2026-08-03T08:39:54.268377Z","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":"10.1137/15m1007173","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Ho, Kenneth L","venue":"Multiscale Modeling and Simulation","work_id":"48f43b21-f490-406c-afff-668d73b832db","year":2015},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:54.376644Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:5730ba1bd12e0f0efecd233dd6470a6ca14a893c66329ba5db193ffbeff784c1","observation_id":"e3c3ccd2-b2d2-4135-b6cf-059a6392d21e","resolution":{"observed_at":"2026-08-03T08:43:26.950270Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978322.87","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the 2025","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"163b8b11-6d74-453e-aead-a036c9861c09","year":2025},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:54.466651Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:c7ef83d0112572cf32b003ca34121a0922227744c64ba76033fde4557de310a3","observation_id":"098baa91-ab9a-4ce6-be8b-1e5f1fbcd420","resolution":{"observed_at":"2026-08-03T08:43:26.889723Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T08:39:54.578725Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:54.578725Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:8703570065815a5df69fbc08e915c0b11c2d7529ffe9b6a61f7b8e819e766042","observation_id":"579b4fdd-f670-43f5-8ec7-1064e0c77938","resolution":{"observed_at":"2026-08-03T08:39:54.578725Z","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-03T08:39:54.660703Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:54.660703Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:ea155e216dd0dfb8fb0a25ddc40a3188f31729b1516a6d94ecdda0f419e2e293","observation_id":"03acdcaf-8c9f-460c-83e5-ad853a0326d6","resolution":{"observed_at":"2026-08-03T08:39:54.660703Z","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-03T08:39:54.770796Z","title":"and Martinsson, P","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:54.770796Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:e7e51d900534cd75f969777c172f1971934db5be6479d36a0a4d2dca23dc1f73","observation_id":"ec405bae-a59c-4f4f-98c6-1f2893a6cdba","resolution":{"observed_at":"2026-08-03T08:39:54.770796Z","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":"10.1137/19m1294873","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Yang, Haizhao , TITLE =","venue":"SIAM Journal on Scientific Computing","work_id":"6ef1d07c-c24f-4e94-8b17-0d68fd0c6553","year":2020},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:54.921134Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:5b2d22e7cb9b60452a82980c1535ff8d400805f539965da75b3605dee64e1cda","observation_id":"36b94663-cda6-4828-b6e2-6b4be226c613","resolution":{"observed_at":"2026-08-03T08:43:26.836549Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-36265-7_51","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Dewilde, P","venue":"Lecture notes in computer science","work_id":"4fdb9f63-a43c-4f4b-932a-4a1e9b824104","year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:54.993182Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:83e407eb91bf93a94ad82acfacc7a42afd64a6ac2220e9f3d79e7a7ce4275ba5","observation_id":"29f7b9ca-712e-4e73-aea5-51633b83b122","resolution":{"observed_at":"2026-08-03T08:43:26.777960Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/20m1386451","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Matrix Analysis and Applications","work_id":"51a88485-bebf-45af-ba85-871d3a3a48bb","year":2021},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:55.131244Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:0efcf4c68253883e9898d38c5ea1b63b35fecee80c539b24d7ab5e65a4c8cfd8","observation_id":"5660ec84-12e9-4324-a3e1-d6c7119f25bc","resolution":{"observed_at":"2026-08-03T08:43:26.725698Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T08:39:55.247412Z","title":"and Martinsson, Per-Gunnar , TITLE =","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:55.247412Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:7a540c69f82a1f011749fb7a7c950261e78b3b59f27f99d6773cdfb1fc4b4e3c","observation_id":"dd2b6ada-4e92-4898-9331-9ba0cb2d658b","resolution":{"observed_at":"2026-08-03T08:39:55.247412Z","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-03T08:39:55.322888Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:55.322888Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:fb2708e314bac9cae63b28ca06a75eb19498f7bbe961f6c7c6d9ded321543742","observation_id":"f0d61928-7e2e-43a8-8265-25a5c8520807","resolution":{"observed_at":"2026-08-03T08:39:55.322888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.19290","last_updated":"2025-07-25T14:04:20Z","snapshot_observed_at":"2026-08-06T21:45:12.587447Z","submitted_at":"2025-07-25T14:04:20Z","title":"Query Efficient Structured Matrix Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.19290","snapshot_observed_at":"2026-08-03T08:39:55.429483Z","title":"arXiv preprint arXiv:2507.19290 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:55.429483Z"},"links":{"cited_paper":"/paper/2507.19290","citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:fda21fccef873d16be30b7b7abd7322af0bb2c32a67d01abe98fa099c0def95d","observation_id":"47aab406-f0df-4953-a5ed-285635e9db96","resolution":{"observed_at":"2026-08-03T08:39:55.429483Z","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":"10.1137/24m1708796","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Matrix Analysis and Applications","work_id":"c5d82068-ddf7-47dd-a1fd-4c42ca872415","year":2025},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:55.655951Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:23b0bf9cc14c13d15867f78d8763be1ee99628add4f2cf4934f6e87d2eece733","observation_id":"30f4dfbb-01e4-4548-9766-cd2dd47f7fec","resolution":{"observed_at":"2026-08-03T08:43:26.614626Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-08-03T08:39:55.739442Z","title":"arXiv preprint arXiv:2009.11392 , year=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:55.739442Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:0beccdb4adc8bf837c35c2c6001068a609834a9b444f35845dba032435cdae8a","observation_id":"90f34e5e-d0d7-4f45-aef2-988ce68f53d8","resolution":{"observed_at":"2026-08-03T08:39:55.739442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.08434","last_updated":"2020-04-17T19:56:46Z","snapshot_observed_at":"2026-07-06T09:13:14.889743Z","submitted_at":"2020-04-17T19:56:46Z","title":"Projection-Cost-Preserving Sketches: Proof Strategies and Constructions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.08434","snapshot_observed_at":"2026-08-03T08:39:55.802074Z","title":"arXiv preprint arXiv:2004.08434 , year=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:55.802074Z"},"links":{"cited_paper":"/paper/2004.08434","citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:5913353e5fc6ed3a4ddad8fb487ebed03d327212087a4290fdd1a68edba0fe7f","observation_id":"68ded9f5-083d-4f5a-a697-a28d294f9066","resolution":{"observed_at":"2026-08-03T08:39:55.802074Z","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-03T08:39:55.872310Z","title":"and Woodruff, David P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:55.872310Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:bc251b260362425c0ea8ea91acf0cea6bd5b4b6f6ebcf1c420ffdf1ac0901e02","observation_id":"68e01c86-2fbb-4228-9537-580bf1241625","resolution":{"observed_at":"2026-08-03T08:39:55.872310Z","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-03T08:39:55.972948Z","title":"Krylov Methods are (nearly) Optimal for Low-Rank Approximation , url =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:55.972948Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:2d2a8703b1d8a5cdfe920aad56bffe5cec83f8e0d45d47607535c824ec426377","observation_id":"8e09df4e-dae9-48a0-a011-5d84408ee440","resolution":{"observed_at":"2026-08-03T08:39:55.972948Z","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-03T08:39:56.035352Z","title":"2018 , ISBN =","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:56.035352Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:d644448e6829773dc4576a0e62efc76fdf417bd9f7bbd3f88e25c4d4aadf5209","observation_id":"c485621b-1250-4b43-a380-6ab0620c1c09","resolution":{"observed_at":"2026-08-03T08:39:56.035352Z","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-03T08:39:56.156860Z","title":"2026 , eprint=","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:56.156860Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:99c9ab5278c2935cf0324327c1e2f0f2cc2e9d122dd875e352fe4b66de5d5a75","observation_id":"e32433a1-5b1a-4b76-b11e-8003f1d7038d","resolution":{"observed_at":"2026-08-03T08:39:56.156860Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.12179","snapshot_observed_at":"2026-08-03T08:39:56.280803Z","title":"arXiv preprint arXiv:2606.12179 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:56.280803Z"},"links":{"cited_paper":"/paper/2606.12179","citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:f9dfb145a64cd3514bd7476cf338c6811090d04a43790136a1a729c9aefc5714","observation_id":"99570f57-ccfb-430b-9289-594ce0087fc7","resolution":{"observed_at":"2026-08-03T08:39:56.280803Z","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-03T08:39:56.441813Z","title":"SIAM Journal on Matrix Analysis and Applications , volume =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:56.441813Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:fdddd49bd43faf2bd82d5ac350d220280976524cc6e490db94eb2342843f3f22","observation_id":"067e7fee-dccf-4750-85ce-c5810d2c5ef8","resolution":{"observed_at":"2026-08-03T08:39:56.441813Z","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":"10.1137/25m1742710","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Matrix Analysis and Applications","work_id":"91a2ae31-fead-410f-ab1c-9d38b921ccfe","year":2026},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:56.566318Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:49c5cc63d9cb0ee433ece3663d13a8c5c529cbbc5ffa2d44ee4d1ee88f816b7b","observation_id":"efbdeab1-3b8b-4cc9-8cf3-5d2352f1e028","resolution":{"observed_at":"2026-08-03T08:43:26.560588Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T08:39:56.797594Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:56.797594Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:f8c8f8769dc40d79ab02caa46b568f2fd8d4d0dfedafe9defaa3bf93fb43c5dc","observation_id":"88697903-478b-4d2d-863c-493084a91fec","resolution":{"observed_at":"2026-08-03T08:39:56.797594Z","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-03T08:39:56.920063Z","title":", TITLE =","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:56.920063Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:cbe4814410a16bb8e65a143bd5cc42ee3a4c386f8c5d39713cb6684b52496a75","observation_id":"0869bc19-7c47-4751-a688-94e60aae1cb8","resolution":{"observed_at":"2026-08-03T08:39:56.920063Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1311.2448","last_updated":"2013-11-11T14:12:28Z","snapshot_observed_at":"2026-07-06T03:27:51.625375Z","submitted_at":"2013-11-11T14:12:28Z","title":"Recovery of Sparse Matrices via Matrix Sketching","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1311.2448","snapshot_observed_at":"2026-08-03T08:39:57.049074Z","title":"arXiv preprint arXiv:1311.2448 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:57.049074Z"},"links":{"cited_paper":"/paper/1311.2448","citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:f783b33b489fe77fcc3661b8f099e60fe55ebb633c83e224f158cf66bb4bc1a9","observation_id":"87f7f5ff-bfc6-4602-a0b6-8caedf38f2a2","resolution":{"observed_at":"2026-08-03T08:39:57.049074Z","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-03T08:39:57.185208Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:57.185208Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:4cf71e19c012d8375773a3b76cea33ad46c20d93b666778f3d71cf3a13099d36","observation_id":"84da0d20-1dce-4a93-8afd-6e622a7053ed","resolution":{"observed_at":"2026-08-03T08:39:57.185208Z","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":"10.1137/0720013","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Mor\\'e, Jorge J","venue":"SIAM Journal on Numerical Analysis","work_id":"ec4eb753-6c5f-46e8-96fd-8951c05071da","year":1983},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:57.433430Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:0f8482886ce1b20e7b031859baed5b96d69ce540cc16234ebcadd32806765631","observation_id":"637c16f8-f649-45bc-aa41-6391ae8c21a2","resolution":{"observed_at":"2026-08-03T08:43:26.508418Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0607026","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Cai, Jin-Yi , TITLE =","venue":"SIAM Journal on Algebraic and Discrete Methods","work_id":"cc3e2589-7589-406f-bddb-22511fdf6e04","year":1986},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:57.497885Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:ab33dd0a7ff8beb4ca5adc21ece8d5e2d44b3a8f7fd824fe67498608721502a3","observation_id":"72edc28b-715f-4915-9128-31c2cb22cd43","resolution":{"observed_at":"2026-08-03T08:43:26.455876Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977585.ch32","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"a26d19ac-9b53-44b2-8c2f-99b64be838e9","year":2023},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:57.525284Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:f279d3e70ec305ce93598aabe58694c9a27b218d49222b09d18dec33444541e2","observation_id":"a5765678-a65b-4809-a47d-078ef9a6ce57","resolution":{"observed_at":"2026-08-03T08:43:26.403198Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.10684","last_updated":"2022-01-26T00:05:12Z","snapshot_observed_at":"2026-07-06T12:31:16.768817Z","submitted_at":"2022-01-26T00:05:12Z","title":"Stochastic diagonal estimation: probabilistic bounds and an improved algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.10684","snapshot_observed_at":"2026-08-03T08:39:57.570885Z","title":"arXiv preprint arXiv:2201.10684 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:57.570885Z"},"links":{"cited_paper":"/paper/2201.10684","citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:a516443104a6c558dc9518d54b91c41ad29b597161d8c1ed533f6a1840a53d95","observation_id":"d5827c93-75fa-46e6-813d-18b24afcf159","resolution":{"observed_at":"2026-08-03T08:39:57.570885Z","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":"10.1002/nla.779","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Saad, Yousef , TITLE =","venue":"Numerical Linear Algebra with Applications","work_id":"10f6e379-0588-4f1d-a252-767d0e966d14","year":2012},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:57.674286Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:d874e4f7e31acca40a17a0d6912069ddc4bb0acc702b2d3efa5999c2135d0166","observation_id":"63abc8fd-868a-49bb-a235-17d64b229987","resolution":{"observed_at":"2026-08-03T08:43:26.349946Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.apnum.2007.01.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Kokiopoulou, E","venue":"Applied Numerical Mathematics","work_id":"3fdb0c0a-03c6-4868-847e-fa3942064eac","year":2007},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:57.780537Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:bbe913912eb2f58d5511a0fb722dccca796130640feec7026d08a5839a18c220","observation_id":"79c3fb51-7cfc-458c-9787-be6176b26367","resolution":{"observed_at":"2026-08-03T08:43:26.292633Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T08:39:57.847019Z","title":"Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:57.847019Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:14108c9c61144fa1812125965d089697e77210b260a4d3378e4add8678f430fa","observation_id":"548dc181-9364-4a1e-94ba-6d9cb35593c2","resolution":{"observed_at":"2026-08-03T08:39:57.847019Z","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":"10.1137/1.9781611977554.ch159","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the 2023","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"9eab17ea-5211-4b0f-b2d5-1f912fc7f1c6","year":2023},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:57.961792Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:f07ae85241ac45b7a454380a558b0cae47f83197060099876a6326867b7e0e62","observation_id":"a8485707-625c-4b46-9aee-92c176f28419","resolution":{"observed_at":"2026-08-03T08:43:26.230844Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T08:39:58.150270Z","title":"A Butterfly-Based Direct Integral-Equation Solver Using Hierarchical","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:58.150270Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:1373e4ceab06bf3a057da72ff367597805b6aad0f44bbd99a8b54c88e4ad9a02","observation_id":"fa9d4e2f-f53c-4195-a541-d0603a3dbfd6","resolution":{"observed_at":"2026-08-03T08:39:58.150270Z","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-03T08:39:58.314263Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:58.314263Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:8542b7252107d39bb75f51b072f3b4c7811cdf511405333aafbbf93bda14b26e","observation_id":"8506c66a-fbda-4aee-977b-a998e1e7cdbd","resolution":{"observed_at":"2026-08-03T08:39:58.314263Z","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-03T08:39:58.424907Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:58.424907Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:8d53dc10380f2218439a04f70e07102f3a8e39679108c6b61d3e14fd81bf5409","observation_id":"b21ad95c-4b4a-4a1c-a76d-68331e595323","resolution":{"observed_at":"2026-08-03T08:39:58.424907Z","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-03T08:39:58.572767Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:58.572767Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:555d402780f9f21de55d025fbeb095c39a2c8ad169849835ea08b450791a72ce","observation_id":"0397205f-6269-4d1a-81df-026765f0cbe4","resolution":{"observed_at":"2026-08-03T08:39:58.572767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.21828","last_updated":"2026-05-20T23:51:12Z","snapshot_observed_at":"2026-08-04T09:02:52.374450Z","submitted_at":"2026-05-20T23:51:12Z","title":"A Butterfly-Accelerated Manifold Harmonic Transform","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.21828","snapshot_observed_at":"2026-08-03T08:39:58.735834Z","title":"arXiv preprint arXiv:2605.21828 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:58.735834Z"},"links":{"cited_paper":"/paper/2605.21828","citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:99eeb21ebaf59f4299118da31a8d724e17e3ef34da49858e49deeff3d34c3683","observation_id":"faf8c1bb-e915-40ed-bee6-27cdc791fea5","resolution":{"observed_at":"2026-08-03T08:39:58.735834Z","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-03T08:39:58.850507Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:58.850507Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:e428faa0ddfe8808acfed308301f4a2db65049112bbad1077d9ba35ff5c51b61","observation_id":"cf1b5127-64cb-4036-bec7-cdb152c8267a","resolution":{"observed_at":"2026-08-03T08:39:58.850507Z","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":"10.1016/j.acha.2009.08.005","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Applied and Computational Harmonic Analysis","work_id":"ec52d541-f91b-4c02-a93c-4da836e39099","year":2010},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:58.973748Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:9fdb2ef84351bf0f8d1be37e1f067636f7ff67371557b5ad6d06e054492929ed","observation_id":"c5cd5acf-3a6e-4feb-9233-d199c89ab1f9","resolution":{"observed_at":"2026-08-03T08:43:26.120510Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T08:39:59.080982Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:59.080982Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:b0d8314e2a9b142b20b85e4656d2c0bab611ba463b99e4153fae363547136661","observation_id":"587e299c-853d-446b-a8c2-44316fcf4d1c","resolution":{"observed_at":"2026-08-03T08:39:59.080982Z","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":"10.1137/16m1074941","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Scientific Computing","work_id":"bb637459-12e7-4e09-82f2-69551b8948d0","year":2017},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:59.192079Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:f19544d72141779f4884bfe0af015466c7d6aaa6db88ff782fa88f6255e77749","observation_id":"aa789758-de41-47d4-9c37-50c17736f778","resolution":{"observed_at":"2026-08-03T08:43:26.016220Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T08:39:59.349160Z","title":"2009 , publisher=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:59.349160Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:5905ddc037ef39891e5f0358d932b3c59cea1751fdf08fc9cf6bf9c31094261d","observation_id":"afbf4fe2-52dc-4d34-bc2a-177b0c0c8526","resolution":{"observed_at":"2026-08-03T08:39:59.349160Z","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":"10.1137/080734339","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Multiscale Model","venue":"Multiscale Modeling and Simulation","work_id":"76c97d6b-51b5-4a0d-9c6b-1a2db28bf103","year":2009},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:59.514272Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:d83ba5d04571758941397a28fa5a3b0c5b6665aa8d787cfbfcd165b86b162e50","observation_id":"29337b93-30ce-49f3-9232-8d4c4185e9af","resolution":{"observed_at":"2026-08-03T08:43:25.948081Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T08:39:59.638823Z","title":"2010 , publisher=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:59.638823Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:8d7463f75847ff5db225035f695c26bec92e925af3628fc9167eadc60977d5b6","observation_id":"32e9b301-d75d-4df6-9f93-1df0e25df18c","resolution":{"observed_at":"2026-08-03T08:39:59.638823Z","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":"10.1016/j.jcp.2010.05.004","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of Computational Physics","work_id":"3ba2bcdf-de68-41a0-b38c-96bffa48fae0","year":2010},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:59.725033Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:15316ebfdfbda57e5e1761c9f544faf2f46d9b96b1714ade40ba60977dbedde2","observation_id":"a567ee76-0f8f-4e2c-9f07-b83b9ef4299a","resolution":{"observed_at":"2026-08-03T08:43:25.855016Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T08:39:59.872718Z","title":"2012 , publisher=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:59.872718Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:6427acb3a256cb47245e951bcb2b6e3b62a4415b43aa5ce6137a9a67612df68c","observation_id":"baea2680-32d8-425e-8bef-c27f3fcf05cc","resolution":{"observed_at":"2026-08-03T08:39:59.872718Z","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":"10.1088/0067-0049/199/1/5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"The Astrophysical Journal Supplement Series","work_id":"018e0c3a-f16d-4350-9ee5-05ba077e0b5b","year":2012},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:59.985255Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:36681d8cd8c7f3014ed7abf8dbda50a7c687fa5db745eead83ea9efa85394138","observation_id":"69430e72-958f-49d0-beea-2daf3ad87261","resolution":{"observed_at":"2026-08-03T08:43:25.736897Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T08:40:00.144386Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.144386Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:588119b9b7f7fd80285bf79d5d3cde0cb088e77908396bd870feb60104720399","observation_id":"02e27d09-76e2-45d7-a8db-c4c268354cdf","resolution":{"observed_at":"2026-08-03T08:40:00.144386Z","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-03T08:40:00.342024Z","title":"IEEE Transactions on Antennas and Propagation , volume=","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.342024Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:93d13c54b91c6944738769db6ef471ba5ca3c6ac96d7318180d401f0ec6b552b","observation_id":"88706be9-0bb7-46db-a21b-3dc20759fe36","resolution":{"observed_at":"2026-08-03T08:40:00.342024Z","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-03T08:40:00.413834Z","title":"and Boag, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.413834Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:39947ef113f82a8fc8adaa49e403281d5ea44d2d00fce1faf068d0b5b233b815","observation_id":"1c5df84b-6dbd-4397-938d-08219ce9a73c","resolution":{"observed_at":"2026-08-03T08:40:00.413834Z","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-03T08:40:00.419895Z","title":"International conference on machine learning , pages=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.419895Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:f74c867116d9ded0a90dfd4fbb937fe89ab8a0b10222547d384e294f3a5e032d","observation_id":"245ca023-cd3b-474b-8670-1886595ee6bb","resolution":{"observed_at":"2026-08-03T08:40:00.419895Z","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-03T08:40:00.425090Z","title":"Proceedings of the 36th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.425090Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:3edad5e3f2d5970330d872c5c5841696adea6526927e1db878d5429bfdc581bc","observation_id":"987db674-d226-4afd-86b0-7fe37fe94a16","resolution":{"observed_at":"2026-08-03T08:40:00.425090Z","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-03T08:40:00.430051Z","title":"International Conference on Learning Representations , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.430051Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:091cb7b396ba72b903c96d962c2631b2fd332bf3741b4afceec4c507d4a73e86","observation_id":"096f4b15-b844-4692-bb5f-1ac6817f92ac","resolution":{"observed_at":"2026-08-03T08:40:00.430051Z","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-03T08:40:00.435026Z","title":"Parameter-Efficient Orthogonal Finetuning via Butterfly Factorization , url =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.435026Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:1bc2f634e304f6597403d8ef285be82a8966ad9efed3be750aedd43a7b835da6","observation_id":"6de411ba-c4d3-41a5-89fa-8db28728b4d4","resolution":{"observed_at":"2026-08-03T08:40:00.435026Z","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-03T08:40:00.440937Z","title":"SIAM Journal on Mathematics of Data Science , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.440937Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:2a1fd5df6edda6af4d90291b9a4e8f1fac822cdd63c7c5188a1fb3aac9c8095f","observation_id":"1bf8378e-aa04-404b-8ecf-a7063ce856ca","resolution":{"observed_at":"2026-08-03T08:40:00.440937Z","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":"10.1137/22m1488727","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Mathematics of Data Science","work_id":"7dc695ac-2a84-41df-b3c6-859d758561a7","year":2023},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.447326Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:6d7a18cdb300d8c66dd8f95dbdbf17150f1740558187c0490f1393986febf6b0","observation_id":"fbfd31b7-6aa3-4bd0-ac88-a3ae2e9e7c57","resolution":{"observed_at":"2026-08-03T08:43:25.567848Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T08:40:00.452912Z","title":"SIAM Journal on Scientific Computing , volume=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.452912Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:423606eb37b77057b19ebecc45b42c667ba0d3a34d8a993f0a524d9137deab26","observation_id":"811c42fe-4594-4787-88f6-ee712018874c","resolution":{"observed_at":"2026-08-03T08:40:00.452912Z","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":"10.1137/20m1349667","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Scientific Computing","work_id":"4bf535ed-50ce-4a33-8a42-1f8ee125b04c","year":2021},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.460446Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:8aa23740463277e9fdde083ef1ef0a31351112d8e0493761db5eaf3d919e76c0","observation_id":"3f010cef-bfac-4a3a-ac03-79d7244a9c56","resolution":{"observed_at":"2026-08-03T08:43:25.396750Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T08:40:00.471084Z","title":"A parallel nonuniform fast","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.471084Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:4a50fa191b00814651def12c17f0db6c752fbe828770b54956498c9ae7e2809b","observation_id":"4beb3509-bbdf-4d96-98a5-36f93972a089","resolution":{"observed_at":"2026-08-03T08:40:00.471084Z","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-03T08:40:00.491681Z","title":"and Magland, Jeremy and af Klinteberg, Ludvig , TITLE =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.491681Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:edec54717532020761b3f2811ef99220c5f1efc5d2bda040ddfe377ba2510b51","observation_id":"84465575-8ceb-49fd-b734-05b79bc52638","resolution":{"observed_at":"2026-08-03T08:40:00.491681Z","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-03T08:40:00.501372Z","title":"A Nonuniform Fast","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.501372Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:df05b8a2cae5f423104632fc1f8130d4a1b84ffafc3681edf4758847c42fc6c3","observation_id":"906e777f-b41c-4976-ae66-8d0dcd591a1e","resolution":{"observed_at":"2026-08-03T08:40:00.501372Z","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":"10.1137/25m1796758","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and O'Neil, Michael , TITLE =","venue":"SIAM Journal on Scientific Computing","work_id":"2a90afb8-4204-4fad-9f4b-4e3f1f65675a","year":2026},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.513536Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:963cc1e814504e38a23ad9f37ee36d4cc680e2dbd8e7e1d3e78204c6dfcf3dd5","observation_id":"27173907-95d6-4a2e-84e7-49357a3caa61","resolution":{"observed_at":"2026-08-03T08:43:25.272075Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T08:40:00.522043Z","title":"Proceedings of Thirty Ninth Conference on Learning Theory , pages =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-03T08:40:00.522043Z"},"links":{"citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:d0dc315a7e03fef75d01d9b5e9d393e3db15105fa28da55cf236f7ee1f9a8492","observation_id":"803ad9a9-dfad-4d4e-98b6-9c6505750544","resolution":{"observed_at":"2026-08-03T08:40:00.522043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees"},"reference_resolution":{"displayed":67,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":45,"verified_exact":22,"verified_fuzzy":0},"total_outbound_references":67},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 67 of 67 outbound references and 0 inbound Pith citation observations for arXiv:2607.29361."}