{"as_of":"2026-08-10T14:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eedfccd1a643a2b700511f12bffeabb8093f86dffd4032fdf0c872bd41be3ca4","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:42:33.004618Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2506.04840/citation-record","integrity":"/paper/2506.04840/integrity","json":"/paper/2506.04840/citation-record.json","paper":"/paper/2506.04840"},"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-07T10:42:33.435533Z","title":null,"venue":null,"work_id":"cf713951-dde2-4a7d-8c73-f5db66e81a3c","year":2021},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:31.623495Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:30b474ee13048ddd2e430d569f553184f0cb88adaf1c98d7b16f2ba5c58d84d9","observation_id":"301dd2ac-3c39-48cf-b7b6-573d4e2b9c05","resolution":{"observed_at":"2026-08-07T10:42:33.437843Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.428502Z","title":"4, 635–653","venue":null,"work_id":"b5b047c9-1579-4b33-87dd-5500a0ab03c5","year":2006},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:31.747071Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:24a8575531c967636182692493e8c08b96bc0268f56788b093ee7edf9cf85d00","observation_id":"47438945-7d99-4a10-a6eb-dd1a8442fb60","resolution":{"observed_at":"2026-08-07T10:42:33.430850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.421663Z","title":"Bader and Tamara G","venue":null,"work_id":"e2b243c2-139f-4072-961f-1f3738451559","year":2023},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:31.810665Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:21c6058e9501aea6e9edfe22f8d17c3fc9a7777bb62dca0fe93a8bee3c1a5f0d","observation_id":"706bb964-af23-4316-84ff-cd086dfe6a33","resolution":{"observed_at":"2026-08-07T10:42:33.424006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.414130Z","title":"185, 1–36","venue":null,"work_id":"58bc73c0-42d7-49fc-b9fa-066ec72f2e23","year":2021},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:31.852487Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:c5b6e955b54f264bc9207ee27bc9e91a9d40bbe97c35013fff33e8e61b678d88","observation_id":"71cf2a0d-dbd7-410b-9af6-506ab8a88c26","resolution":{"observed_at":"2026-08-07T10:42:33.416611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.407080Z","title":"3, 852–877","venue":null,"work_id":"08063569-9f15-4ed5-94bb-e8281c7cb566","year":2022},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:31.893497Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:39838266d9a8cf897fa865f4c87d0bc3f08f2f6829144e7bbe7c8a0967311850","observation_id":"72fcf2df-2f4d-4b8b-8f16-8ff2615e06e6","resolution":{"observed_at":"2026-08-07T10:42:33.409614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.399910Z","title":"1, 395–428","venue":null,"work_id":"bb77d283-9033-46f3-861b-72f17619aceb","year":2019},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:31.947510Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:2f774fe51a3184c3130aae0e275069d661030acd9b806dd882f067aa6df6f28b","observation_id":"4303856c-8341-47c3-b2f1-ad1435c3fce4","resolution":{"observed_at":"2026-08-07T10:42:33.402548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.393013Z","title":"2, 373–403","venue":null,"work_id":"af5e3281-37dd-4055-95c6-0146bf13e8d6","year":2023},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:31.983973Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:64475376b6df3bf2b19a862ab84d6c3395c151520160ea2f62e9c60cd8526e91","observation_id":"c46f10ad-f72b-4639-b954-fb308e38cd2c","resolution":{"observed_at":"2026-08-07T10:42:33.395359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.386166Z","title":"2, 605–636","venue":null,"work_id":"fe6323a2-8d13-40d2-b5a2-3fb218e8acf8","year":2020},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.015939Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:3072b790a363c303ad05138e31abc723b2c7cbd5c1f7a9fd3a70f20ec526921b","observation_id":"5d1dcf52-7c28-44aa-95ea-2ffffd5ce356","resolution":{"observed_at":"2026-08-07T10:42:33.388569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.378680Z","title":null,"venue":null,"work_id":"5d046f97-58e1-4ad6-b0f0-17449fad400b","year":2021},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.064898Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:53e686d875cff80eee989c632b2571d18b025c4c4cc0cb97bbe026e96d884fe9","observation_id":"ad92c9ae-67ad-4ab8-9383-d67304a990a8","resolution":{"observed_at":"2026-08-07T10:42:33.381023Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.372131Z","title":null,"venue":null,"work_id":"e8b6877b-606f-415b-8681-6b3e784f9d30","year":2021},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.095798Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:ceba00704825888d5960ce1d1d8720f4a52fa07204d87a769dc484c3a11ffee4","observation_id":"49299dfb-4ea3-4613-b459-5fae90f86cbc","resolution":{"observed_at":"2026-08-07T10:42:33.374355Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.365526Z","title":null,"venue":null,"work_id":"f82e7811-92fc-4c5e-b02a-4330eea46947","year":2025},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.147125Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:8c8eae12f7cdbfd506ac08c2271b55bf3d87e071d7e5e5956930c7579a08d785","observation_id":"dcc0e729-09a7-4b43-b2bd-ad814872f900","resolution":{"observed_at":"2026-08-07T10:42:33.367765Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.358387Z","title":"1, 256–297","venue":null,"work_id":"80358e12-c5e4-41a2-906f-c2d26961661c","year":2025},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.203573Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:763e0bebe9d21609b50e8475c3b925ea927c40172c561e022781a69146a14843","observation_id":"a9ee771f-5226-4eb4-8eda-787cb68f4169","resolution":{"observed_at":"2026-08-07T10:42:33.360827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.351715Z","title":"4-5, 249–429","venue":null,"work_id":"6f3057d7-505a-4240-9f1a-8f11c480aaa6","year":2016},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.245525Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:27afff053e747c3938997b9a95e9e2682e56382e3d24ef02c1725bec25b561f7","observation_id":"17a9e617-3e8a-4a6c-bc56-dcee493668f3","resolution":{"observed_at":"2026-08-07T10:42:33.353983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.344769Z","title":"6, 431–673","venue":null,"work_id":"ad5b9df2-aeda-4264-acf5-f611e702b2f4","year":2017},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.281744Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:159dba797c1f8b5f1415e6d30ecddb78ef3f5607b9d657e1d55c44fb7ba09ef3","observation_id":"1eaadeb9-d9f5-4a77-9588-2f5d285af34a","resolution":{"observed_at":"2026-08-07T10:42:33.347250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.336936Z","title":", rn) approximation of higher-order tensors , SIAM Journal on Matrix Analysis and Applications 21 (2000), no","venue":null,"work_id":"476af6c7-2d3a-4f91-9a17-4b4029c24f09","year":2000},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.331463Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:f9decb47501e22b9a8071218825be859ad13ee40955d2fb25ec32490cd2836be","observation_id":"6eec9ab6-2609-465b-a6fc-6bb26eb246cd","resolution":{"observed_at":"2026-08-07T10:42:33.340221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.329618Z","title":"1, 3475–3506","venue":null,"work_id":"7635b247-fddf-402d-98d9-ca36ea0d73c3","year":2012},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.366592Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:866e6fdb736ed64d343ab380a6858a12c0be6acce822c335a8aa23dffc117c69","observation_id":"46818e01-475f-4b4f-88e9-a524c29aa107","resolution":{"observed_at":"2026-08-07T10:42:33.332213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.322213Z","title":"Mahoney, A randomized algorithm for a tensor-based general- ization of the singular value decomposition , Linear Algebra and its Applications 420 (2007), no","venue":null,"work_id":"02d09a87-422a-40bc-abaf-db591ecbd74c","year":2007},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.400041Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:3137fc57c0c4624bd52b69ff745318ffa0339f03c0094b8f4d76150e2a832a4d","observation_id":"247de3d9-52db-490b-b7aa-dd89952d4420","resolution":{"observed_at":"2026-08-07T10:42:33.324831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.315097Z","title":"1, A139–A163","venue":null,"work_id":"2ae6fb83-e6b7-47cb-80cd-5ac51f8f0b79","year":2021},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.434482Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:2d54307e86144b45f10b89fce26503fcd68eb4af3a4963cf6eeae54b7e370b74","observation_id":"d21c30f1-9961-456d-9d89-890dfb64e61f","resolution":{"observed_at":"2026-08-07T10:42:33.317598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.308287Z","title":"3, 1315–1347","venue":null,"work_id":"df833476-284a-40c7-be82-c95b60a96a1f","year":2022},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.470294Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:0a2685195417d74ba486813057ec58b110871a799d1818bde153275ce1d9d6b9","observation_id":"dfd2455b-22bf-437a-9a26-2e7efe21fc71","resolution":{"observed_at":"2026-08-07T10:42:33.310579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.301066Z","title":"2, 248–271","venue":null,"work_id":"25d396d5-1b40-4f14-b735-a6e82ab63a07","year":2009},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.505939Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:7edf98be1a093963b094a4e2498ee2aff3c0f77722e11eed331808a16c650732","observation_id":"517aa630-a0be-454e-b6d7-fc2952315528","resolution":{"observed_at":"2026-08-07T10:42:33.303580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.293377Z","title":null,"venue":null,"work_id":"e9f5a6b3-ddb1-4b14-a81e-a317d018437b","year":2024},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.561549Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:d3319a600f1801d66ec88d544b711b1067d82b062382fec0edbe5c28cce0ff71","observation_id":"c32c6161-f0be-4ed2-97a4-b12f5a36b9d9","resolution":{"observed_at":"2026-08-07T10:42:33.295745Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.285044Z","title":"6, 643–660","venue":null,"work_id":"39c034a3-4812-4e29-976e-48b2994a703e","year":2001},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.611226Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:96f27d4ef70410de1ae1a9b045481bb0d456876c4e75881e2d50aa047a570d00","observation_id":"a815989f-d8da-41e8-8b3a-75b54d915ed8","resolution":{"observed_at":"2026-08-07T10:42:33.288064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.277433Z","title":"Golub and Charles F","venue":null,"work_id":"c8a7ae14-2d55-453a-b31a-33f5baac6820","year":2013},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.647049Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:0e72d7ed54d2d2a43e6d20bf751e615a6687cf6eed729c97b46df6859f1358c0","observation_id":"0f032e6b-5a02-45ae-aac9-9e76f5b0aac4","resolution":{"observed_at":"2026-08-07T10:42:33.280202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.270165Z","title":null,"venue":null,"work_id":"0bcf2bb1-b1d8-4126-b0f5-af066322952f","year":2012},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.666276Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:4d4a3d222937a10ce860cef79842ce7d944cb2f92396cb1d4187e88f5dbf15cb","observation_id":"bdd77bc1-f451-49e6-a67b-bc3bc6dea18e","resolution":{"observed_at":"2026-08-07T10:42:33.272662Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.263009Z","title":"1, 53–78","venue":null,"work_id":"b18b1594-7fb3-4572-a9e0-bc6c825cac56","year":2013},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.759005Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:e7db0e5747390d33f723dd6576c34a08ef49569680c683282e42fb7db681dddb","observation_id":"74b30114-3bed-42dd-ad31-8ec47194c1e9","resolution":{"observed_at":"2026-08-07T10:42:33.265369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.255928Z","title":"2, 217–288","venue":null,"work_id":"8ec5c041-dbdc-46d2-975a-4db46be9ab96","year":2011},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.807385Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:919da477b22a30aa5e3fdb0efa1b53bf31eed40671e86aae476ffff87c0d7fd6","observation_id":"651df9c6-acb2-45fe-b7df-be622f78c62b","resolution":{"observed_at":"2026-08-07T10:42:33.258423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.249211Z","title":"2, 1054–1075","venue":null,"work_id":"9c6ddc1e-edd8-48ad-bb9b-5bcd0f224247","year":2024},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.895078Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:6149e4a07913f5e0e6083dc49ee1edfbdfed51e173734a8c9582d216ddab4bbb","observation_id":"fa0d8747-f73a-442b-a33d-6640137a78e3","resolution":{"observed_at":"2026-08-07T10:42:33.251431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T16:52:11.338048Z","submitted_at":"2023-11-24T23:50:43Z","title":"RTSMS: Randomized Tucker with single-mode sketching","version":1},"cited_work":{"arxiv_id":"2311.14873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.14873","snapshot_observed_at":"2026-08-07T10:42:33.053573Z","title":"RTSMS: Randomized Tucker with single-mode sketching","venue":"math.NA","work_id":"576b9760-8d1c-45fb-96fc-9f5e80a6b7dc","year":2023},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.931058Z"},"links":{"cited_paper":"/paper/2311.14873","citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:1d71328c35b4d62db13b78bf6deea327d7434a45ab034cb256c3dc6b96dd3628","observation_id":"32f0fe34-c06f-462c-ab09-161080566f53","resolution":{"observed_at":"2026-08-07T10:42:33.056558Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.241969Z","title":null,"venue":null,"work_id":"03f3189f-e813-4629-bd2b-368bc0baafec","year":2011},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.934302Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:fb9dc391f65f6a5d86eb384d4c188a3bd805605da01aefec21fad2631a464dc4","observation_id":"b4183bc3-69cb-4944-ba75-1ffef2ce726b","resolution":{"observed_at":"2026-08-07T10:42:33.244488Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.235071Z","title":"3, 455–500","venue":null,"work_id":"4969629a-d520-44b1-8070-5e841623b8e0","year":2009},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.937506Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:39125975e29096e1018a231045ce34c161a35fc2ea71a22ae00935646e0a02e5","observation_id":"fdfa56e0-4539-40ff-adff-8047bdc3e1a0","resolution":{"observed_at":"2026-08-07T10:42:33.237627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.227362Z","title":"Ran zato, A","venue":null,"work_id":"2739f0c7-ea15-4126-89ac-d1d97505db84","year":2021},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.940428Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:d2f2d5f591c83bf2efb129bb0d51a56ac1fd03efe14f4c464d3a2779d22848ae","observation_id":"0901ef29-6ef5-42d8-acb8-df9276bd891d","resolution":{"observed_at":"2026-08-07T10:42:33.230253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.219979Z","title":"Ben gio, H","venue":null,"work_id":"878418ff-1779-42cc-bce7-096ae03764c3","year":2018},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.943304Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:0112fd74375cd2e8a8f857ea279d0d7125901862598c825bcc250429a2b223ec","observation_id":"0944476e-b4cf-4cb6-b68f-68056d6d8390","resolution":{"observed_at":"2026-08-07T10:42:33.222840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.211520Z","title":"1, 47–68","venue":null,"work_id":"a54db2fe-00f5-47a7-99ed-c795b68ac069","year":2011},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.946126Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:085f0d27a8179bb891867fce7c0786ad9608e356f4009b570d7c8c7315483faf","observation_id":"cbda53ec-5efe-4457-ac33-48a73182e420","resolution":{"observed_at":"2026-08-07T10:42:33.214532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.204042Z","title":"5, S485–S507","venue":null,"work_id":"1e2ad022-d24f-49f7-a7c1-ca50311b4b27","year":2016},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.948887Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:8dbe578d405f82078c6d9993642a78a5361ae4a9b6e1986fff451db68859747d","observation_id":"7997f95c-28ed-449c-8005-94ce237c6dc9","resolution":{"observed_at":"2026-08-07T10:42:33.206378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.197268Z","title":"2, A1186–A1213","venue":null,"work_id":"70c1a57c-f24e-4cca-b7c4-4ddec89dd5f2","year":2024},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.951869Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:333785e9d1997cdc7f4672742eb50549df0765239d8b98409c9e675f037972b6","observation_id":"6f98ff20-997e-45d6-88a0-b5476f65befb","resolution":{"observed_at":"2026-08-07T10:42:33.199606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.190128Z","title":"1, 189–215","venue":null,"work_id":"4ea9def7-a96c-4c04-8091-1117467a6a4d","year":2020},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.954933Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:de99c6668be120a92a57a9fd2139cbcb725eea5b1e55885c809d0e2f9b908296","observation_id":"c13235be-7006-4de4-9b3d-0e8016af83bb","resolution":{"observed_at":"2026-08-07T10:42:33.192702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.182313Z","title":"Cortes, N","venue":null,"work_id":"619e3a65-2644-429d-8300-21202d7c8172","year":2015},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.957565Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:3553c6521374885cf3768418138ccb238417b1330a9cd9c3f02c67e5e25a0ab8","observation_id":"59fcd163-c1e4-49d0-a01f-ee33a207ed81","resolution":{"observed_at":"2026-08-07T10:42:33.184838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.175121Z","title":null,"venue":null,"work_id":"e16d12e1-1131-48a2-960f-87309a7c6d95","year":2013},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.960264Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:37975cdb12e97b3952f01875fe8dbb05ab5a53d6e6fc46f7e49936843a75b7b7","observation_id":"0467baed-0bc3-4a54-8a59-0777fdf2b02e","resolution":{"observed_at":"2026-08-07T10:42:33.177708Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.167802Z","title":null,"venue":null,"work_id":"ea1b3e1c-c6f4-4dd8-b3f8-a7ae838cfb71","year":2024},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.963019Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:af62fa464b6a6b5c8630f18f79b4401d206550aaa56ac83afc5f70bf05cec267","observation_id":"2b5979b0-64fb-4e51-b2fb-f8bab131a7f0","resolution":{"observed_at":"2026-08-07T10:42:33.170481Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.160587Z","title":"3, 1100–1124","venue":null,"work_id":"0eab7d6a-d555-4b02-9e38-988642035281","year":2010},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.965780Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:9df0414d12358dcc3eddcfad4be35313702fc9d2cc6c5e4da83be31e44821d36","observation_id":"59ad0884-f1ac-4620-99cb-39fcf855ba3c","resolution":{"observed_at":"2026-08-07T10:42:33.163048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.152335Z","title":"Saibaba, HOID: higher order interpolatory decomposition for tensor s based on Tucker representation, SIAM Journal on Matrix Analysis and Applications 37 (2016), no","venue":null,"work_id":"103ae8a5-5be4-453b-b9d6-bee15b024e8a","year":2016},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.968913Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:a8ef70f0894d516c2b31e9d4558f3076043ad581a16465755ef83d45836e622f","observation_id":"0ffdb59c-a4ff-4ac6-8c12-b3a02581f35a","resolution":{"observed_at":"2026-08-07T10:42:33.155320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.145002Z","title":"2, 891–918","venue":null,"work_id":"9889e02a-9a03-4116-928d-3f1c5f5e4327","year":2013},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.971698Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:5e3c89457aab6b8fc74b0f745ae1a42616dd5afe8848a3f94e902fefce90dc71","observation_id":"5c42a8f5-35b6-46a7-8626-ca567224edc4","resolution":{"observed_at":"2026-08-07T10:42:33.147297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.138038Z","title":"6, 3352– 3393","venue":null,"work_id":"3a61bb5f-19a8-4c72-8c16-e4adb5021d3d","year":2010},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.974258Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:3b130f4619f7fbc0ccc069ca44c12ad5ec00cc3dcaa4a319a1fdb52203fbfb56","observation_id":"b613a24a-e016-4a2b-af8f-01de7bd6172b","resolution":{"observed_at":"2026-08-07T10:42:33.140514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.130701Z","title":"4, 1123–1150","venue":null,"work_id":"307c1da7-1752-4e35-b5d1-65796147c5ec","year":2020},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.977200Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:cd65c2529b2f209d0ecef816fea1700a148f4d905b4e4ab59c4029e8c415ca41","observation_id":"0700a81a-2fd9-4827-9992-dbba124e794f","resolution":{"observed_at":"2026-08-07T10:42:33.133058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.123586Z","title":"4, 1454–1485","venue":null,"work_id":"6e96ce1e-497d-4b46-92e7-843570fc2db4","year":2017},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.979652Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:d7f67582209e3619a74d16f5df624cee15cda5450399d7b0cd671efa8f464063","observation_id":"154de26a-6233-47d7-9f57-02af01977ee8","resolution":{"observed_at":"2026-08-07T10:42:33.125824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.116763Z","title":"3, 279–311","venue":null,"work_id":"04de9a40-1cbc-4aef-93e8-8e9129b53038","year":1966},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.982116Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:77ff54bb295c7c0d6150217677807f6b15eb0ace085a61cfefb9941feb061415","observation_id":"f92b32cd-bb81-47cd-8e00-6bb6f6da17f6","resolution":{"observed_at":"2026-08-07T10:42:33.119188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.109565Z","title":"2, A1027–A1052","venue":null,"work_id":"343733fb-a561-4e8d-b68c-721e00dcb6f7","year":2012},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.984482Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:4797953b5e264464f646fad1d9ec862db1de8c3ae9688951abed26772ee384ed","observation_id":"7ed65f65-bd9d-4472-8a83-b8552e303943","resolution":{"observed_at":"2026-08-07T10:42:33.112194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.102767Z","title":"Vervliet, O","venue":null,"work_id":"ccc1feb0-a602-4c39-8368-2e7e57b56033","year":2016},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.986787Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:e468eb417b09ed4d4313c848687031a9fd4aa1151b7682991cd6e67fbaaac713","observation_id":"2c941fdb-6d27-4723-a1db-c6b0ba4a96ee","resolution":{"observed_at":"2026-08-07T10:42:33.104854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.095441Z","title":"3, A1714–A1746","venue":null,"work_id":"b7e23e4c-1125-455a-97c1-701274b37760","year":2024},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.989528Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:78b788bd3c4a207d67ba525a3b2c1d6e963cbdd7ecaff6fc74c708c15d39fb01","observation_id":"8baa7e2d-6633-4600-b656-022fd3d0ddc7","resolution":{"observed_at":"2026-08-07T10:42:33.097955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.087504Z","title":null,"venue":null,"work_id":"34c00422-34e6-47f7-a0ba-0cbd32fb8ea1","year":2024},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.991939Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:7aedaa0f0119d183ec522ec7ae89e1f4714aca45daf3febdb47b8024d46ec30d","observation_id":"2a95ce67-ed34-4ceb-93fa-1fec6a99e314","resolution":{"observed_at":"2026-08-07T10:42:33.090007Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.079137Z","title":"3, 1339–1359","venue":null,"work_id":"d582b9a9-e523-41a3-9d1b-2e1734a974d0","year":2018},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.994178Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:e48be3708d300f5183217ff1925caef8cd739f06127c5a675a62e5d1d2d5be3f","observation_id":"aabc11d3-a865-45b6-952c-6be18e61724e","resolution":{"observed_at":"2026-08-07T10:42:33.081798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1606.05535","last_updated":"2016-06-17T14:40:18Z","snapshot_observed_at":"2026-08-09T02:58:02.298584Z","submitted_at":"2016-06-17T14:40:18Z","title":"Tensor Ring Decomposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.05535","snapshot_observed_at":"2026-08-07T10:42:32.997076Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.997076Z"},"links":{"cited_paper":"/paper/1606.05535","citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:6f203aaf93dc1c8fada371df94f422e76e890876f67836e3b4b7f043edf1d942","observation_id":"2e4cf48d-fcb3-474b-9b7c-8984183a433b","resolution":{"observed_at":"2026-08-07T10:42:32.997076Z","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-07T10:42:33.070369Z","title":"35, 2021, pp","venue":null,"work_id":"c74ccdbe-c13e-42f4-9bec-3ec822899a1c","year":2021},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:32.999860Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:c1e2480e235a7eff324a85af8445c434f6656ba051556285ce9a4c74c2b83dfd","observation_id":"fe064b8d-a629-4575-937b-8e63bb94a571","resolution":{"observed_at":"2026-08-07T10:42:33.073393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T10:42:33.061980Z","title":"6, 2928–2940","venue":null,"work_id":"1e7560b3-7cbd-439c-b5a2-b51e0c213046","year":2012},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:33.002152Z"},"links":{"citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:4f42503cdc1ac425590361fb7175b56691749ba7c6d88bbab888c6b6b31de11e","observation_id":"21ec065b-d57a-43e0-a16a-0f8126455c2f","resolution":{"observed_at":"2026-08-07T10:42:33.065063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.1885","last_updated":"2014-12-29T02:39:53Z","snapshot_observed_at":"2026-07-06T04:02:41.148806Z","submitted_at":"2014-12-05T03:04:32Z","title":"Decomposition of Big Tensors With Low Multilinear Rank","version":2},"cited_work":{"arxiv_id":"1412.1885","doi":null,"metadata_source":"pith","pith_arxiv_id":"1412.1885","snapshot_observed_at":"2026-08-07T10:42:33.031708Z","title":"Decomposition of Big Tensors With Low Multilinear Rank","venue":"cs.NA","work_id":"483a3742-6fe5-49ff-b34f-bafc0d4f1189","year":2014},"citing_paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T10:42:33.004618Z"},"links":{"cited_paper":"/paper/1412.1885","citing_paper":"/paper/2506.04840"},"observation_digest":"sha256:cb30c3e5e48da65e69c12289a9dc1d12976a07eac52a48fe9b36d1bc73c9a8c6","observation_id":"3f54b02e-2214-40b8-a171-dfb2f077b0d9","resolution":{"observed_at":"2026-08-07T10:42:33.036953Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.04840","last_updated":"2025-06-05T10:02:26Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-07T10:30:13.018376Z","submitted_at":"2025-06-05T10:02:26Z","title":"Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":11,"verified_exact":1,"verified_fuzzy":42},"total_outbound_references":55},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 0 inbound Pith citation observations for arXiv:2506.04840."}