{"as_of":"2026-08-22T22:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3905dc9d3e9e6a9b5de9e04929ba51a73c806ae6b231150afb47f4ebfad32ae7","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T20:13:03.812823Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2412.06111/citation-record","integrity":"/paper/2412.06111/integrity","json":"/paper/2412.06111/citation-record.json","paper":"/paper/2412.06111"},"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-11T20:13:04.606213Z","title":"Kolda and Brett W","venue":null,"work_id":"806ac1b2-eb33-4741-b3a1-e42e16f58898","year":2009},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.590832Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:47a1be01f427d7a950e09ba33951bc9bf8071883023812423c560239219f9fc1","observation_id":"2a35a9ed-1e29-412a-ae54-61f7f5476580","resolution":{"observed_at":"2026-08-11T20:13:04.611263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.590413Z","title":"Oseledets","venue":null,"work_id":"9fb508a3-d8e2-4f4a-9a46-8ddf13ed6a77","year":2011},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.596819Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:206c7aa5ab9fc07ee4a2d42b63035d19c39f3a36c7706e433d2622404b9eeeb2","observation_id":"231ccb9d-17af-466a-b124-22f8031d28b3","resolution":{"observed_at":"2026-08-11T20:13:04.595274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.574024Z","title":"Hierarchical singular value decomposi tion of tensors","venue":null,"work_id":"0c59f33c-6969-43d9-8ba2-ae646d524b1a","year":2009},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.602228Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:e926845a6f67fdb0eca0626d5eecb6250f7dc1c81f3f4fa408ef48bffe722ff6","observation_id":"26bd0e73-c5bb-4eb3-98f0-cf1ba6c0d2cb","resolution":{"observed_at":"2026-08-11T20:13:04.578991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.557867Z","title":"Classical sim ulation of quantum many-body systems with a tree tensor network","venue":null,"work_id":"d65af3d4-86f8-4620-81b6-d8a627ab04ad","year":2006},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.607500Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:e3bda0ccd5e26aa92adc8d56406cb540fb4def3ba09b9fb3868a29c4c40aa109","observation_id":"e0f84e0f-0b25-4bde-a7cc-2c81241c640a","resolution":{"observed_at":"2026-08-11T20:13:04.563857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.542185Z","title":"Simulating strongly correlated quantum systems with tree tensor networks","venue":null,"work_id":"b2b3ae82-cfbf-4892-8c43-f08df3ee0455","year":2010},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.612668Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:fea164ea69bc230ab778fcc3d10dbd316fb997d1d333774f951c89761723eecc","observation_id":"3eb233e5-9240-4369-a58b-d5e3d1351de5","resolution":{"observed_at":"2026-08-11T20:13:04.547341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.524921Z","title":"Tree tensor network state with variable tensor order: An efficient multir eference method for strongly correlated systems","venue":null,"work_id":"0f98660e-7552-4a8d-9957-b51dede80e20","year":2015},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.618195Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:61513469680e7e93d828b66be89f5ff3f1480b15f71e7cf5eea6ea159e218b94","observation_id":"f4bb427d-7ba2-4c0c-8054-0165e60866d8","resolution":{"observed_at":"2026-08-11T20:13:04.531024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.507035Z","title":"Ti me integration of tree tensor net- works","venue":null,"work_id":"399ece4d-3ec0-4b77-97eb-d0b6278e9574","year":2021},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.623956Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:95fb640504c0ed2a875f9a478e46320c8e7899cc817845a0e2f91925cb206cca","observation_id":"3d13fe1e-d02d-4d58-8615-fbd381dfc3cf","resolution":{"observed_at":"2026-08-11T20:13:04.512276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.490751Z","title":"Ra nk-adaptive time integration of tree tensor networks","venue":null,"work_id":"69ab7f2a-43f6-4776-9178-fffc29ba9ced","year":2023},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.629106Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:99baf43b26b398a459cb7904cd35281c321f8ebd7e10d9b9b388a9f71b1f9695","observation_id":"e77fca68-82ed-4321-8308-6a0caf6b71e5","resolution":{"observed_at":"2026-08-11T20:13:04.496103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.474523Z","title":"Griffiths singularities in the ran- dom quantum Ising antiferromagnet: A tree tensor network re normalization group study","venue":null,"work_id":"d26e7100-400b-4b6e-8dd0-b6973b339be6","year":2017},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.634346Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:5fd8a476ffeda966ad898051528c32144ae1b713afc9dfba4e0f6fdd27cb1db7","observation_id":"e471d395-bf03-497a-bfb5-9b436222c227","resolution":{"observed_at":"2026-08-11T20:13:04.480249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.456797Z","title":"Tree tensor network approach to sim ulating Shor’s algorithm","venue":null,"work_id":"68f23e28-d52c-43e9-abf5-95c3f00d7019","year":2017},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.639680Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:08af6f71611ad057aea05a1dc8b98d008b5b14d976fda7d25160d610b16ef1b6","observation_id":"45b6fe2c-b5c8-40fb-aa95-98c9d19aeb65","resolution":{"observed_at":"2026-08-11T20:13:04.462386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.436104Z","title":"Tree tens or networks for generative modeling","venue":null,"work_id":"bcd26502-aa12-4ddf-8c62-8c05a75a3f5c","year":2019},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.646003Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:249bcb68de2588fb942d6a071724fb3f03f09730542197253265e7eda36b2038","observation_id":"2e4f992a-ae01-40a0-8237-dda07d0f696e","resolution":{"observed_at":"2026-08-11T20:13:04.441507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.417026Z","title":null,"venue":null,"work_id":"b5f24108-4192-4c50-b080-c7432f350485","year":2011},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.652261Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:e38689e5f993e99a3926dd344cd834054a7584c3ddb2027c11c63d7238b6a0c4","observation_id":"d7d420f2-0e12-4d02-9154-c3cf4d334671","resolution":{"observed_at":"2026-08-11T20:13:04.423456Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.393942Z","title":"A multilinear singular value decomposition","venue":null,"work_id":"ef5c2bfc-963a-459b-896b-2a2bb38600b1","year":2000},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.657052Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:a6ce1f6f8deabecaf1a99f623d97e7e99e091774eb93e5e93eeb104d10d66da5","observation_id":"8efe46f8-0913-442c-b575-3634e11c6520","resolution":{"observed_at":"2026-08-11T20:13:04.400459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.376193Z","title":"A new truncation strategy for the higher-order singular value decomposition","venue":null,"work_id":"a044db41-3609-4aa4-a7ae-c5ab0215c464","year":2012},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.662006Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:eca35f028a23e45bb82dce0d17096ca79766bd9dfa1186253815c9624eb7c7d5","observation_id":"474892c7-79e4-4fbe-bcf8-4f8f173372d5","resolution":{"observed_at":"2026-08-11T20:13:04.381548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.358780Z","title":"Saibaba, and Misha E","venue":null,"work_id":"286c1eca-d50c-411b-96d4-64633528326a","year":2020},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.666891Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:bfc14f4be02c449e64431a445fc60c187e367b0f585e02762a060f899763e7ef","observation_id":"3ee49f8f-1901-46f7-86c4-f04d849632e0","resolution":{"observed_at":"2026-08-11T20:13:04.363981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.341341Z","title":"Randomized algorithms for the approximations of Tucker and the tensor train decompositions","venue":null,"work_id":"8e04ced1-487e-4c40-b7cb-b311c7e14108","year":2019},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.671905Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:7a31c8eb58b016cac416c5358d1ed73a93010b097a07386efd2bd4a437479e2f","observation_id":"ab7fae04-753c-40e6-b7e2-b8a21e46d0a0","resolution":{"observed_at":"2026-08-11T20:13:04.347606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.324228Z","title":"Reid, and Arvind K","venue":null,"work_id":"c79cbb3e-5288-4137-893e-5de23dcfc04a","year":2023},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.677056Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:c651dd3a11994209f769d7796f44b29035b98e77f03bfb9c626fb5673ae508c1","observation_id":"26fab354-6110-48bb-b5b7-4ca864d0bd86","resolution":{"observed_at":"2026-08-11T20:13:04.329543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.14873","last_updated":"2023-11-24T23:50:43Z","snapshot_observed_at":"2026-08-16T14:40:31.516084Z","submitted_at":"2023-11-24T23:50:43Z","title":"RTSMS: Randomized Tucker with single-mode sketching","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.14873","snapshot_observed_at":"2026-08-11T20:13:03.682264Z","title":"RTSMS: Randomize d Tucker with single-mode sketch- ing","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.682264Z"},"links":{"cited_paper":"/paper/2311.14873","citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:c07864b630e65c21cecd741e6db5261ee3ae35e3af6889ca06be1622cebf2e46","observation_id":"50c134d6-496d-4352-a9e5-33a29d1e4289","resolution":{"observed_at":"2026-08-11T20:13:03.682264Z","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-11T20:13:04.307176Z","title":null,"venue":null,"work_id":"962c76d3-7d12-45ac-ab8f-5508e7c1c93c","year":2011},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.687997Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:b604a1369057bf23e4f563728a95151260339c033635339499d93c5b5e1649a1","observation_id":"9654a64e-bfd0-434a-b907-9a4cb4d9e281","resolution":{"observed_at":"2026-08-11T20:13:04.312649Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.289984Z","title":"High-dimensional probability","venue":null,"work_id":"035ee842-652d-4c86-a157-5d92d63d1892","year":2018},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.692791Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:91653400887b02c7039b3fd87f3441753bf3d4ac91ec434b991ffde0abf88ae4","observation_id":"9946f687-97a8-4824-bd93-7aef2823c358","resolution":{"observed_at":"2026-08-11T20:13:04.295245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.271374Z","title":null,"venue":null,"work_id":"1e255347-32d0-4efd-84d2-a9b72ca36859","year":2011},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.697554Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:243bc75d41a94ab79d928f402457935b414924c23ea249eb82bcb2d5fbbd2606","observation_id":"81656de6-e335-4c86-a29d-321a2af7a7d1","resolution":{"observed_at":"2026-08-11T20:13:04.277866Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.254284Z","title":"New and improved Johnson –Lindenstrauss embeddings via the restricted isometry property","venue":null,"work_id":"72f9a2df-b659-4130-832b-898efa2571d4","year":2011},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.702396Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:ca3f23b9a6a199ec3afe87158cdd7771d8dc41e86c4f2248bf0b3dede7b154f8","observation_id":"8c895bb7-87e3-4e7c-8127-dc601e6908e3","resolution":{"observed_at":"2026-08-11T20:13:04.259891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.04686","last_updated":"2024-10-24T16:35:05Z","snapshot_observed_at":"2026-08-16T13:36:42.348807Z","submitted_at":"2024-07-05T17:49:15Z","title":"Near-optimal hierarchical matrix approximation from matrix-vector products","version":2},"cited_work":{"arxiv_id":"2407.04686","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.04686","snapshot_observed_at":"2026-08-11T20:13:03.919535Z","title":"Near-optimal hierarchical matrix approximation from matrix-vector products","venue":"cs.DS","work_id":"29f95b06-6568-4127-98b8-4ef7958b42f7","year":2024},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.707616Z"},"links":{"cited_paper":"/paper/2407.04686","citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:df9cc6d9529688459637dab320c299a4052b817cad8fb96ddc6d2076a72ee73f","observation_id":"162eb7b6-c57e-4ef7-b514-893c6fb369d9","resolution":{"observed_at":"2026-08-11T20:13:03.924943Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-17T06:04:21.907185Z","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-11T20:13:03.712691Z","title":"Fast and stable randomized low-rank matrix approximation","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.712691Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:bdc720e67d223ae034c50e0aae2d3f0d21e0181ad41697e8299807b86dfb775a","observation_id":"0ee70a2b-5bc4-460e-9b4f-7b1f8789ad16","resolution":{"observed_at":"2026-08-11T20:13:03.712691Z","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-11T20:13:04.235729Z","title":"Clarkson and David P","venue":null,"work_id":"7aba6763-2147-4998-ae14-24a2f5102caa","year":2009},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.717646Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:c9bafc78f3c00808773066fa454cf5bae10100f5cef47d8233083d28f549ae5b","observation_id":"c0654c81-87d5-4f74-8491-afa4b05194bd","resolution":{"observed_at":"2026-08-11T20:13:04.241328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.216297Z","title":"Tropp, Alp Yurtsever, Madeleine Udell, and Volk an Cevher","venue":null,"work_id":"da975a64-4193-445d-8ab9-ced1bfaca180","year":2017},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.723136Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:00234ba7d36dab22f4db6afbb3e12926a139db19fc32746f3f272cd4f92b33d6","observation_id":"19a28565-ddb2-43cc-b21a-12d03ec43a92","resolution":{"observed_at":"2026-08-11T20:13:04.221860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.199427Z","title":"Low-rank Tucker approximation of a tensor from streaming data","venue":null,"work_id":"eb990574-f20f-4d06-b4e1-66fa1f12404a","year":2020},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.727889Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:3ae95220d7d4edb1a3ede2d6f95be1b3188b97ef6e8e64383fa99141521b6a95","observation_id":"503c2700-6aaa-4c8e-885b-bb9c56d36c9c","resolution":{"observed_at":"2026-08-11T20:13:04.205034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.181845Z","title":"A multilinear Nystr¨ om algorithm for low-rank approxi- mation of tensors in Tucker format","venue":null,"work_id":"5279c4df-1610-4846-a563-b01f29b25fa0","year":1929},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.732950Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:41e2f9e30a289464381e5dbc65e900da49767710afa6ef511f06d4c5982b0558","observation_id":"fa351795-c851-411f-b5a4-9f17c586fda3","resolution":{"observed_at":"2026-08-11T20:13:04.187254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.165004Z","title":"A sequential multili near Nystr¨ om algorithm for stream- ing low-rank approximation of tensors in Tucker format","venue":null,"work_id":"265446af-627b-4e49-8a91-b236c3ad414c","year":2024},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.738148Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:c95c019abf9354902d3df2ce336c942f906688880996ed434a8fc9a92fd68978","observation_id":"3b381d8b-a0ab-4ce7-b455-852476513737","resolution":{"observed_at":"2026-08-11T20:13:04.170077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.148884Z","title":"Streaming tensor train approximation","venue":null,"work_id":"a81a87f5-aca9-4c9b-b54b-6f2ee7d31f7a","year":2023},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.742973Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:78d17184b8a089f91adf36f465ee7221fac77e3e359463f2391f55396c10a68e","observation_id":"03e09513-7cd8-4561-81e6-fb1d7f4f45cf","resolution":{"observed_at":"2026-08-11T20:13:04.154279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.133008Z","title":"Clarkson and David P","venue":null,"work_id":"ef718a0b-60b5-445c-a015-d28f2d6d118a","year":2017},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.747837Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:c3e5e79c17d9aaa921535da8c4920e9fcf7d1c7ee93967b295aed66fb817f6b6","observation_id":"9ec1a946-4482-45b7-91e5-0e06af5ef85e","resolution":{"observed_at":"2026-08-11T20:13:04.138142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.116897Z","title":"Improved matrix a lgorithms via the subsampled random- ized Hadamard transform","venue":null,"work_id":"1f3fda34-e608-4474-807a-ff32840c8a77","year":2013},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.753935Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:8103f27b91d2fe2b1afb2bef15831a3a1d37d8b7b39826c4c37aa26177499d86","observation_id":"de83f3a9-24d9-489d-bca1-c2f89b842234","resolution":{"observed_at":"2026-08-11T20:13:04.122148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.100772Z","title":"A fast randomized alg orithm for overdetermined linear least-squares regression","venue":null,"work_id":"66aa1de0-d6b7-4381-a42d-5026e81c5e78","year":2008},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.758708Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:8eb42ee0419f920bfccbc952b271c9c25dd5ae033b7ae39ca1785161e57b6192","observation_id":"e6b49e88-7f9e-4e2a-9044-b6db1dff7580","resolution":{"observed_at":"2026-08-11T20:13:04.106192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.083294Z","title":null,"venue":null,"work_id":"42c7b7cf-ea23-45a0-88e9-511dc5e083bb","year":2020},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.763201Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:8dd8a3a4d8da7194615fb81e89d1e7c0970ae87f089e83029e12039a7f88a148","observation_id":"35423d3f-ec49-4af5-a344-80a2faf3a1b1","resolution":{"observed_at":"2026-08-11T20:13:04.088664Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.066748Z","title":"Tracking tensor ring decompositi ons of streaming tensors, 2023","venue":null,"work_id":"424d9378-3fec-4352-9f56-5c53fd52bfa4","year":2023},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.768688Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:45978fa5d711014938048faad90eda8beba70f02f49249fbb05e70251f558c06","observation_id":"a121668c-703a-47f2-ba84-263f5adf9284","resolution":{"observed_at":"2026-08-11T20:13:04.071921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.048410Z","title":"On the optimal linear contrac- tion order of tree tensor networks, and beyond","venue":null,"work_id":"64361c41-18d4-4623-88f8-6cca2a8829b5","year":2024},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.775161Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:30681aa2bfea24e2ca28dfc43ecd3b72908db4b1f4ebd18b6d194442f121bd76","observation_id":"fc0560b6-b4a6-4b4c-a81a-b145a0b02b37","resolution":{"observed_at":"2026-08-11T20:13:04.054692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.027834Z","title":"Tensor Spaces and Numerical Tensor Calculus , volume 56 of Springer Series in Computational Mathematics","venue":null,"work_id":"ebcf04bd-b157-4c09-998b-a57d49904b3a","year":2019},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.780175Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:e545b8f1085e7c314a3d0560460c439b25c8af46c8f0d2cf3e2e4d91914a7f2e","observation_id":"82fd89c4-b8ad-46bf-a18f-008ced6910b2","resolution":{"observed_at":"2026-08-11T20:13:04.033456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:04.009016Z","title":"Cost-efficient Gaussian tensor network embeddings for tensor-structured inputs","venue":null,"work_id":"83556f76-b295-42c5-a42b-c80042216ec2","year":2022},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.785959Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:28e1e14709ef7719c70dbc134d3a19e054ca71f40ba28213bd78a196586fcd2d","observation_id":"e9aa09c2-6076-418d-b786-bd4dcdbb9f67","resolution":{"observed_at":"2026-08-11T20:13:04.015525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:03.991283Z","title":"Ahle, Michael Kapralov, Jakob B.T","venue":null,"work_id":"b2551a21-1c55-4656-a9e9-ac4c9bac3b33","year":2020},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.791775Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:846caebcf90ee22e461831991d002d35a4dca2e1c9478b08dccbf1cc8fd07510","observation_id":"29662ad4-0043-412b-a014-4c0399624483","resolution":{"observed_at":"2026-08-11T20:13:03.996787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.07417","last_updated":"2023-11-26T06:10:27Z","snapshot_observed_at":"2026-08-16T16:45:44.213316Z","submitted_at":"2022-07-15T11:55:09Z","title":"Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions","version":3},"cited_work":{"arxiv_id":"2207.07417","doi":null,"metadata_source":"pith","pith_arxiv_id":"2207.07417","snapshot_observed_at":"2026-08-11T20:13:03.874102Z","title":"Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions","venue":"cs.DS","work_id":"492ea2e4-7c2e-4bc8-ad36-feea26391351","year":2022},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.796697Z"},"links":{"cited_paper":"/paper/2207.07417","citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:e73685fa955bedb5a8895a097a8a19a5540a2b64f73453b70c0871ead7cb72fd","observation_id":"b0807300-4865-4d9a-bb87-a04ecc55fa35","resolution":{"observed_at":"2026-08-11T20:13:03.882116Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-11T20:13:03.974285Z","title":"A randomized tensor train singular value decomposition","venue":null,"work_id":"abcf05f8-66e7-40eb-8fd0-ec4ddb92b12a","year":2015},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.802191Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:296ac12af719b5b362bad96f2bd9d093508e318fafaedd8acbdfe451e6b098cf","observation_id":"f21ee44d-34fa-4219-bb2b-1217acee8021","resolution":{"observed_at":"2026-08-11T20:13:03.979917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.09471","last_updated":"2024-09-14T15:44:21Z","snapshot_observed_at":"2026-08-19T20:54:14.754342Z","submitted_at":"2024-09-14T15:44:21Z","title":"Randomized sketched TT-GMRES for linear systems with tensor structure","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.09471","snapshot_observed_at":"2026-08-11T20:13:03.807243Z","title":"Ran domized sketched TT-GMRES for linear systems with tensor structure","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.807243Z"},"links":{"cited_paper":"/paper/2409.09471","citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:9e08340417d9b9b84f09d98b70183ebf755ca10f213bea0a83a89b25636b178d","observation_id":"dbc12adb-96c2-4836-b229-13842f6678fd","resolution":{"observed_at":"2026-08-11T20:13:03.807243Z","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-11T20:13:03.955796Z","title":"TT-GMRES: solution to a linear system in the structured tensor format","venue":null,"work_id":"7d01648b-2cd9-438d-a831-337fb6b47ca7","year":2013},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.812823Z"},"links":{"citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:0ba8960e1265379dc9268f786624c1def02f378942aee9182168adc76d6ef04e","observation_id":"ceaf1a05-d965-4f32-94fb-81537fd9f105","resolution":{"observed_at":"2026-08-11T20:13:03.962249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":2,"verified_fuzzy":34},"total_outbound_references":43},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2412.06111."}