Paper Citation Record · LEDGER

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition

As of 21 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2607.22194.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.22194 v1

Coverage vector

measured 38 of 38 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T05:34:49.451292Z

measured 38 of 38 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

38 of 38 outbound references displayed

verified exact0
verified fuzzy0
unresolved38
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 73683960-168b-4589-b33e-e4044abd3e61 · outbound

This paper cites an unresolved cited work.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Unresolved cited work

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.231013Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fb53e05d-4069-4971-8450-020f5cee5f4b · outbound

This paper cites eckart-young.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition eckart-young

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.272765Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a29888d3-08cf-4d36-be7d-26e0994ec3d3 · outbound

This paper cites explanatory.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition explanatory

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.313520Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b323de91-5e0a-4a95-8c6f-25ff926d7ad0 · outbound

This paper cites an unresolved cited work.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Unresolved cited work

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.356173Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 862290a7-9899-47f1-9d52-9d0251005f94 · outbound

This paper cites Beylkin and M.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Beylkin and M

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.397871Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 87a3ae32-873f-4c35-bf69-94ae1da90fb3 · outbound

This paper cites an unresolved cited work.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Unresolved cited work

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.442237Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3f8c4613-3597-4062-8c4b-e59e882be163 · outbound

This paper cites Battaglino, G.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Battaglino, G

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.466594Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fd769d40-0908-4c1e-b2bb-b35eb2cbe2aa · outbound

This paper cites Bharadwaj, O.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Bharadwaj, O

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.517955Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7bce85bc-44b5-44c0-a186-bfa2e0a4a752 · outbound

This paper cites Drineas, M.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Drineas, M

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.573708Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation edcc8e68-8ce4-429b-ba1c-2d9ca4e90b25 · outbound

This paper cites an unresolved cited work.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Unresolved cited work

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.619358Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c216aa9f-b033-457c-819c-0a9d197259a5 · outbound

This paper cites Gu and S.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Gu and S

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.664404Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1bbc929c-747a-4ed2-8604-2d8d170cc4c7 · outbound

This paper cites an unresolved cited work.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Unresolved cited work

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.702063Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d9cd18e7-86e6-468d-945c-77838b98358c · outbound

This paper cites Nelson and H.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Nelson and H

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.775675Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dfe62fd2-331d-49dd-89dd-36a7beeb0c2e · outbound

This paper cites Martinsson, G.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Martinsson, G

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.827396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 472fbf41-fc47-4c49-83b9-b481cc1ef7fa · outbound

This paper cites an unresolved cited work.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Unresolved cited work

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.879660Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d700c1e7-3a11-4c85-9e06-537c819b1023 · outbound

This paper cites an unresolved cited work.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Unresolved cited work

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.930431Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bf7d9488-8fde-440b-bf1a-541ebddcc408 · outbound

This paper cites Randomized strong rank-revealing QR for column subset selection and low-rank matrix approximation.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Randomized strong rank-revealing QR for column subset selection and low-rank matrix approximation

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.990678Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9579b8a9-8c38-4ee7-b6fd-4e496cb0450a · outbound

This paper cites Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:48.030977Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2b57426-4af1-4116-9b78-158d725c9c03 · outbound

This paper cites Cheng, R.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Cheng, R

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:48.083424Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 96a95e14-af8f-41af-945b-3cfd86c98135 · outbound

This paper cites Grigori and Z.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Grigori and Z

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:48.121910Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d7b50f6-6c41-4660-9180-f475cf04e9f4 · outbound

This paper cites Derezinski and M.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Derezinski and M

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:48.161922Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8267011b-9c8e-4b9d-9004-dd08b423039c · outbound

This paper cites an unresolved cited work.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Unresolved cited work

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:48.210319Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ba19541-7dbf-49a6-b674-a1da29981a9e · outbound

This paper cites Decomposition of Big Tensors With Low Multilinear Rank.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Decomposition of Big Tensors With Low Multilinear Rank

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:48.277644Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a63468b2-3603-4011-92b2-73a8ed1027e9 · outbound

This paper cites Uschmajew, Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation, SIAM J.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Uschmajew, Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation, SIAM J

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:48.344235Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b7ad9426-564c-41af-8ddb-ba85cb243c4b · outbound

This paper cites Drineas, M.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Drineas, M

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:48.458374Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 27168e9c-e15b-4ff1-8b98-dca917990059 · outbound

This paper cites Drineas, R.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Drineas, R

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:48.532046Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0cf62075-c6ba-4e84-aaa2-a152f5cb80b0 · outbound

This paper cites Hayashi, S.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Hayashi, S

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:48.607266Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 91b9313c-db0c-43ec-af7c-81ab67c1ea21 · outbound

This paper cites an unresolved cited work.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Unresolved cited work

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:48.697427Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c9862b10-5649-4beb-a3e3-c70bd582b601 · outbound

This paper cites Fishman, S.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Fishman, S

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:48.769058Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6e16d08b-d77b-4ee8-9c4a-8852b6e6d278 · outbound

This paper cites Benedikt, A.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Benedikt, A

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:48.896529Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2dfda9c7-3cf7-494d-9803-029f8d40050e · outbound

This paper cites an unresolved cited work.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Unresolved cited work

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:48.980003Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eb58b8b1-2d60-4e72-8b9c-22f0c178efdf · outbound

This paper cites Pierce and M.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Pierce and M

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:49.055057Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f58febe5-12f6-4ccf-9e1b-a5fd1349fb19 · outbound

This paper cites Pierce, Toward using matrix-free tensor decompositions to systematically improve approximate tensor-networks, Journal of Chemical Theory and Computation21, 6464 (2025).

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Pierce, Toward using matrix-free tensor decompositions to systematically improve approximate tensor-networks, Journal of Chemical Theory and Computation21, 6464 (2025)

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:49.131823Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 057aa062-c1d9-41c6-9a3e-3b7f8685fba5 · outbound

This paper cites Jørgensen and J.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Jørgensen and J

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:49.244617Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 60a924f1-5b0b-4924-991c-51bcfeeeb18d · outbound

This paper cites an unresolved cited work.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Unresolved cited work

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:49.320673Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1df73fdc-45f0-4b52-b994-ad421bd9babe · outbound

This paper cites an unresolved cited work.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Unresolved cited work

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:49.387210Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e00a7060-69c8-4124-97a6-960af6603f0e · outbound

This paper cites an unresolved cited work.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition Unresolved cited work

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:49.451292Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 43f0d7f8-d148-47c8-b1b2-3eb92043282f · outbound

This paper cites The angle between two CPD approximated tensors is computed efficiently by leveraging the Khatri-Rao product structure of the CPD approximation.

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition The angle between two CPD approximated tensors is computed efficiently by leveraging the Khatri-Rao product structure of the CPD approximation

Reference 700

Resolution: unresolved; no resolver link, observed 2026-08-01T05:34:47.196485Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.