{"as_of":"2026-08-22T07:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db4f72e1c3a604197687b29dc565a9e4d3a834947877383c7e6def38e70acb6e","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T05:34:49.451292Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"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/2607.22194/citation-record","integrity":"/paper/2607.22194/integrity","json":"/paper/2607.22194/citation-record.json","paper":"/paper/2607.22194"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.231013Z","title":null,"venue":null,"work_id":null,"year":1927},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.231013Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:e26264a18e74bcefe9bb8d0444e5e4320b5a6c8bfb5169df03b6591a7fd62d47","observation_id":"73683960-168b-4589-b33e-e4044abd3e61","resolution":{"observed_at":"2026-08-01T05:34:47.231013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.272765Z","title":"eckart-young","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.272765Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:c682a9a0d5e6ed69c90bde74a3f62ed99e825a3635acb106fe9bbb417617064b","observation_id":"fb53e05d-4069-4971-8450-020f5cee5f4b","resolution":{"observed_at":"2026-08-01T05:34:47.272765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.313520Z","title":"explanatory","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.313520Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:f41f95dda19421dda2d446269d80014538a4b57f995f49bdd9ee8d5b9998f92e","observation_id":"a29888d3-08cf-4d36-be7d-26e0994ec3d3","resolution":{"observed_at":"2026-08-01T05:34:47.313520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.356173Z","title":null,"venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.356173Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:bbb36e5407a80d1eb2033e2016ec297b2a7d13c0ccff27f390a1654dd7dcef1b","observation_id":"b323de91-5e0a-4a95-8c6f-25ff926d7ad0","resolution":{"observed_at":"2026-08-01T05:34:47.356173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.397871Z","title":"Beylkin and M","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.397871Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:373b5e18a3f5441b81402c4fffc0819cc7293f462808c554862aa71cd53ec3d0","observation_id":"862290a7-9899-47f1-9d52-9d0251005f94","resolution":{"observed_at":"2026-08-01T05:34:47.397871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.442237Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.442237Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:9d82d7ba06d56f17bd1fc3442f3d7055384d87846c4e1156f613fdb910e3581c","observation_id":"87a3ae32-873f-4c35-bf69-94ae1da90fb3","resolution":{"observed_at":"2026-08-01T05:34:47.442237Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.466594Z","title":"Battaglino, G","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.466594Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:d8905ebb30e5fb15241331c799ef49ca2e2649ea923dae945fddaf1d7408de75","observation_id":"3f8c4613-3597-4062-8c4b-e59e882be163","resolution":{"observed_at":"2026-08-01T05:34:47.466594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.517955Z","title":"Bharadwaj, O","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.517955Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:1cec1b1e91a7851303a824b65362495071643cfc93d52bc6ff3cad227dfb31a3","observation_id":"fd769d40-0908-4c1e-b2bb-b35eb2cbe2aa","resolution":{"observed_at":"2026-08-01T05:34:47.517955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.573708Z","title":"Drineas, M","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.573708Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:ac2c7ad8713d8507ab20b66e42e0fd4556e3464bbc6502d1a5ec214314427a67","observation_id":"7bce85bc-44b5-44c0-a186-bfa2e0a4a752","resolution":{"observed_at":"2026-08-01T05:34:47.573708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.619358Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.619358Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:b59742a00f9d70bd5dd9a4828c07725d9225078cbe9ece98cc3c53599db438c3","observation_id":"edcc8e68-8ce4-429b-ba1c-2d9ca4e90b25","resolution":{"observed_at":"2026-08-01T05:34:47.619358Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.664404Z","title":"Gu and S","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.664404Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:06023289a44d6171644a9485dde428f98f6ebf18d625431e8149de6a86c2b381","observation_id":"c216aa9f-b033-457c-819c-0a9d197259a5","resolution":{"observed_at":"2026-08-01T05:34:47.664404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.702063Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.702063Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:f75bb2a3dc624fa51f6dd03e7c6b0087be4d8236b35fbaa5cb02df6b8e133bb7","observation_id":"1bbc929c-747a-4ed2-8604-2d8d170cc4c7","resolution":{"observed_at":"2026-08-01T05:34:47.702063Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.775675Z","title":"Nelson and H","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.775675Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:6a1ab4cd24c95e6ea4b31b657d4c79d4efe2a3d4042e93e5f009bfc971be578b","observation_id":"d9cd18e7-86e6-468d-945c-77838b98358c","resolution":{"observed_at":"2026-08-01T05:34:47.775675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.827396Z","title":"Martinsson, G","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.827396Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:b260007f7cd108757f18a6a9374bb12bf18863733e81413d1567a7bddd7b4269","observation_id":"dfe62fd2-331d-49dd-89dd-36a7beeb0c2e","resolution":{"observed_at":"2026-08-01T05:34:47.827396Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.879660Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.879660Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:35f1c2416172c96e4b6b6eb7269058c4104ce9a30899e2a8c2798dccea0b760b","observation_id":"472fbf41-fc47-4c49-83b9-b481cc1ef7fa","resolution":{"observed_at":"2026-08-01T05:34:47.879660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.930431Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.930431Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:06868040ac490973b3dfeeeb145de2f3cc534d6d6cf18decf749a815af5944c6","observation_id":"d700c1e7-3a11-4c85-9e06-537c819b1023","resolution":{"observed_at":"2026-08-01T05:34:47.930431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.18496","last_updated":"2025-03-24T09:52:06Z","snapshot_observed_at":"2026-08-16T12:47:25.407539Z","submitted_at":"2025-03-24T09:52:06Z","title":"Randomized strong rank-revealing QR for column subset selection and low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.18496","snapshot_observed_at":"2026-08-01T05:34:47.990678Z","title":"Grigori and Z","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.990678Z"},"links":{"cited_paper":"/paper/2503.18496","citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:217a7e43cca0333d1475256d96d1dac6a32b16ad1f771143ccc024ad2c8920d4","observation_id":"bf7d9488-8fde-440b-bf1a-541ebddcc408","resolution":{"observed_at":"2026-08-01T05:34:47.990678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.03198","last_updated":"2026-07-24T10:51:06Z","snapshot_observed_at":"2026-08-15T16:31:20.462303Z","submitted_at":"2025-09-03T10:34:28Z","title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.03198","snapshot_observed_at":"2026-08-01T05:34:48.030977Z","title":"Fakih and L","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.030977Z"},"links":{"cited_paper":"/paper/2509.03198","citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:6e31c1f9b921d12337855a5f8b652b411ba71f00dacc4e7cdb2442add0e46fac","observation_id":"9579b8a9-8c38-4ee7-b6fd-4e496cb0450a","resolution":{"observed_at":"2026-08-01T05:34:48.030977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:48.083424Z","title":"Cheng, R","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.083424Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:7bd83feea0da6f818c1daf302ce05be91765e8602583663eb5f591a8f26f3b34","observation_id":"f2b57426-4af1-4116-9b78-158d725c9c03","resolution":{"observed_at":"2026-08-01T05:34:48.083424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:48.121910Z","title":"Grigori and Z","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.121910Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:b8c8dabcccf112f3924249a2c79efb2960f42566f59a35aa5c796a78e23f8ba3","observation_id":"96a95e14-af8f-41af-945b-3cfd86c98135","resolution":{"observed_at":"2026-08-01T05:34:48.121910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:48.161922Z","title":"Derezinski and M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.161922Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:9772e5a87bb2636b8906fb2b392cd212e5a262e6e4a8867e818f409da383c74b","observation_id":"9d7b50f6-6c41-4660-9180-f475cf04e9f4","resolution":{"observed_at":"2026-08-01T05:34:48.161922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:48.210319Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.210319Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:80afae0705588ef78d1ad624627bf83a7bfc2e9350ee9053360eb829785417ad","observation_id":"8267011b-9c8e-4b9d-9004-dd08b423039c","resolution":{"observed_at":"2026-08-01T05:34:48.210319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.1885","last_updated":"2014-12-29T02:39:53Z","snapshot_observed_at":"2026-08-14T23:08:52.295899Z","submitted_at":"2014-12-05T03:04:32Z","title":"Decomposition of Big Tensors With Low Multilinear Rank","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.1885","snapshot_observed_at":"2026-08-01T05:34:48.277644Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.277644Z"},"links":{"cited_paper":"/paper/1412.1885","citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:62855ba4999b40836fda655ff821de344bd8acca02ae186e1cd451b91a717e83","observation_id":"4ba19541-7dbf-49a6-b674-a1da29981a9e","resolution":{"observed_at":"2026-08-01T05:34:48.277644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:48.344235Z","title":"Uschmajew, Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation, SIAM J","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.344235Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:45af47bbeb88cb183bfd48c624a3c04b7dfce98cb3472dab6903c3e2df6d586d","observation_id":"a63468b2-3603-4011-92b2-73a8ed1027e9","resolution":{"observed_at":"2026-08-01T05:34:48.344235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:48.458374Z","title":"Drineas, M","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.458374Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:ce9d040cf831abe58e50f29dbf22f13ba16af969d8f45744a7c902531381fced","observation_id":"b7ad9426-564c-41af-8ddb-ba85cb243c4b","resolution":{"observed_at":"2026-08-01T05:34:48.458374Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:48.532046Z","title":"Drineas, R","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.532046Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:c29cc64f04580b12f230d1dde5c44bcd811c3764c4ccbe958a15f25a603b1adb","observation_id":"27168e9c-e15b-4ff1-8b98-dca917990059","resolution":{"observed_at":"2026-08-01T05:34:48.532046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:48.607266Z","title":"Hayashi, S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.607266Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:5f44ae23eb5ac9bbf9ae05ebfcbd000a5b8eb6137c440195517374c08248baa3","observation_id":"0cf62075-c6ba-4e84-aaa2-a152f5cb80b0","resolution":{"observed_at":"2026-08-01T05:34:48.607266Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:48.697427Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.697427Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:ed23d9b51f337c82662d202f39c928e7c31fa5a5f48b1488389766e9b8516845","observation_id":"91b9313c-db0c-43ec-af7c-81ab67c1ea21","resolution":{"observed_at":"2026-08-01T05:34:48.697427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:48.769058Z","title":"Fishman, S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.769058Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:76115e9629a7254c592587bc71115ba94e6618b2664887e65dc8f00e206bcef3","observation_id":"c9862b10-5649-4beb-a3e3-c70bd582b601","resolution":{"observed_at":"2026-08-01T05:34:48.769058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:48.896529Z","title":"Benedikt, A","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.896529Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:60e16c09b2769d5121d35de22b81e3a88cf9c7e30aa21d6ffd100b3bb9e594dd","observation_id":"6e16d08b-d77b-4ee8-9c4a-8852b6e6d278","resolution":{"observed_at":"2026-08-01T05:34:48.896529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:48.980003Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:48.980003Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:d7dc19fe7489047f2a4bfdf5b6d844e380aed70900830d653bcea5fdf4c7be07","observation_id":"2dfda9c7-3cf7-494d-9803-029f8d40050e","resolution":{"observed_at":"2026-08-01T05:34:48.980003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:49.055057Z","title":"Pierce and M","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:49.055057Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:a123c4e4aab04674d851a270e41dfb8eb31f7ee0e10bd85bac607104d3be2510","observation_id":"eb58b8b1-2d60-4e72-8b9c-22f0c178efdf","resolution":{"observed_at":"2026-08-01T05:34:49.055057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:49.131823Z","title":"Pierce, Toward using matrix-free tensor decompositions to systematically improve approximate tensor-networks, Journal of Chemical Theory and Computation21, 6464 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:49.131823Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:f12f6cde1c8354e414ac20e729e7061193e52dde3b9e87fc59ab67ca7cd3bd51","observation_id":"f58febe5-12f6-4ccf-9e1b-a5fd1349fb19","resolution":{"observed_at":"2026-08-01T05:34:49.131823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:49.244617Z","title":"Jørgensen and J","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:49.244617Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:cd04285c357902fbe69693808e07f622b28e4cb8376c3e2bc7eb591ca2cb22e4","observation_id":"057aa062-c1d9-41c6-9a3e-3b7f8685fba5","resolution":{"observed_at":"2026-08-01T05:34:49.244617Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:49.320673Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:49.320673Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:ec00c98b43d742fc59edd139c7e549885009652080e1b560dcde7f8a05555b8a","observation_id":"60a924f1-5b0b-4924-991c-51bcfeeeb18d","resolution":{"observed_at":"2026-08-01T05:34:49.320673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:49.387210Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:49.387210Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:4cdf7db9b2ce11907c7e51297245d2f577509a7258537e9131b69b2225d18377","observation_id":"1df73fdc-45f0-4b52-b994-ad421bd9babe","resolution":{"observed_at":"2026-08-01T05:34:49.387210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:49.451292Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:49.451292Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:294927af0e55ab150e292a827b1d74315034611dea57c602ec0116ea068459a5","observation_id":"e00a7060-69c8-4124-97a6-960af6603f0e","resolution":{"observed_at":"2026-08-01T05:34:49.451292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:34:47.196485Z","title":"The angle between two CPD approximated tensors is computed efficiently by leveraging the Khatri-Rao product structure of the CPD approximation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition","version":1},"reference_index":700,"source":"pdf_text","source_observed_at":"2026-08-01T05:34:47.196485Z"},"links":{"citing_paper":"/paper/2607.22194"},"observation_digest":"sha256:bc269297e7da038efb30d13d8c2977a5da93fdae4465a1a996ab300dc243d7c2","observation_id":"43f0d7f8-d148-47c8-b1b2-3eb92043282f","resolution":{"observed_at":"2026-08-01T05:34:47.196485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22194","last_updated":"2026-07-24T11:08:54Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-19T03:07:58.731087Z","submitted_at":"2026-07-24T11:08:54Z","title":"Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":38,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":38},"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 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2607.22194."}