{"as_of":"2026-08-16T06:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1101f63666c94450c2a34d8696820426062eca59a2a0a68377f31ca3cccb2d36","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:44:08.285481Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/1908.02721/citation-record","integrity":"/paper/1908.02721/integrity","json":"/paper/1908.02721/citation-record.json","paper":"/paper/1908.02721"},"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-14T14:44:08.586153Z","title":"The expression of a tensor or a polyadic as a sum of products","venue":null,"work_id":"55af4879-7dea-45fc-aa5a-041f90c601f6","year":1927},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.191640Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:1a467a7880795c113b67312d63e1f1c723682e70873062d07cb1128a07947a5b","observation_id":"3f06bf98-b159-4dc9-988c-41475b7db7ff","resolution":{"observed_at":"2026-08-14T14:44:08.590125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:44:08.195634Z","title":"Some mathematical notes on three-mode factor analysis","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.195634Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:a02fb8c6349f939ea12dc629f384cc92bf54976fa9feabdaeaf386af8c302e5b","observation_id":"daac341a-4035-4e61-8c1e-804bd4b0994d","resolution":{"observed_at":"2026-08-14T14:44:08.195634Z","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-14T14:44:08.569540Z","title":"Tensor-train decomposition","venue":null,"work_id":"f0645eb6-e9bc-4c64-bdc8-fb79f3a95eee","year":2011},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.199057Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:07da5b28a459c09e9a4ac2db905fe0bd74edbf3410e808e885f26f8ac994c886","observation_id":"8205237e-1e68-4ef8-92fc-c36ec3780621","resolution":{"observed_at":"2026-08-14T14:44:08.572969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.559794Z","title":"Solution of linear systems and ma- trix inversion in the TT-format","venue":null,"work_id":"0b8ea3d7-adfe-490f-afba-f4a1e6ed2b3e","year":2012},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.202588Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:28728e2a2f7264e3adef5326368fc505e7e14efbc8c88eacf328edd1309d59b3","observation_id":"6af4177c-641b-4806-8865-714882673315","resolution":{"observed_at":"2026-08-14T14:44:08.563387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.549216Z","title":"Enabling high-dimensional hierarchical uncertainty quantifi- cation by ANOVA and tensor-train decomposition","venue":null,"work_id":"0057b976-e9ef-4b80-aeae-f74cc5973e49","year":2014},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.206274Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:83f6cda77b62fe2781d898f4809b8184b5d4864fc907682e00324b9660136772","observation_id":"55546d0a-e4a2-4201-90cb-24743eea07a9","resolution":{"observed_at":"2026-08-14T14:44:08.552775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.538308Z","title":"Model reduction and simu- lation of nonlinear circuits via tensor decomposition","venue":null,"work_id":"278c699f-bef3-453d-afe1-4c849c6a3575","year":2015},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.209795Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:b5f7e573c71772c9d69c10f10be97f3a5c4c6bbc6b1cbed6ccce7cada9418d21","observation_id":"e93a6c72-8849-4159-9ce3-559dab59f9d5","resolution":{"observed_at":"2026-08-14T14:44:08.542464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.527230Z","title":"Tensor computation: A new framework for high-dimensional problems in EDA","venue":null,"work_id":"67815058-ba4d-4834-a48d-ce3b6bd57243","year":2017},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.213467Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:eaac38775b9ec59ba1b8422e6538df0406d4bc4c98034413839509cf694fb5a7","observation_id":"282e37da-0688-47de-af12-b909eace802f","resolution":{"observed_at":"2026-08-14T14:44:08.531299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.517094Z","title":"Tensor network alter- nating linear scheme for MIMO Volterra system identification","venue":null,"work_id":"7484fc13-d879-45eb-a1d1-6c6234a71e82","year":2017},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.216584Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:7c8eea35968ccb6939e4c82082b0911c30ebeaaf00fd51e26a0a2b1acbac5fe3","observation_id":"71a0545a-4154-448f-9163-24dd81a017b6","resolution":{"observed_at":"2026-08-14T14:44:08.520161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.507832Z","title":"Approximation of 2 d× 2d matrices using tensor decom- position","venue":null,"work_id":"f99c3714-08c8-4dff-a570-a30589a8538e","year":2010},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.220127Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:c6d49a95eaaf6374fe9fa7629f1d4d57584d4d659658023eae76d0f65bb64699","observation_id":"0f523925-fdbd-4cae-8afe-a5c5d42c59cc","resolution":{"observed_at":"2026-08-14T14:44:08.511210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.498069Z","title":"On low-rank approximability of solutions to high-dimensional operator equations and eigenvalue problems","venue":null,"work_id":"65f2998b-1860-43a9-9873-3dbefac8dd96","year":2016},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.223324Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:91c4991ebd20f2c4f3b29a790d01cd3e4b3e00245788747a2b4ae80a3e5a5a5f","observation_id":"db17c826-754a-46b5-8a05-850894fd0bd7","resolution":{"observed_at":"2026-08-14T14:44:08.501248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.487366Z","title":"Computing low-rank approximations of large-scale matrices with the tensor network randomized SVD","venue":null,"work_id":"f3cab55c-12ce-4926-8eb7-c4e4008278dc","year":2018},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.226674Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:3daf3f501ee89e60c8694db089382df46e0f63e67273d74bc2e924839e52b0fe","observation_id":"7945de5b-be83-4134-835d-a018aa927fbf","resolution":{"observed_at":"2026-08-14T14:44:08.491110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.477086Z","title":"Efficient low rank tensor ring completion","venue":null,"work_id":"6afdc094-e99a-4c24-afe8-5bc5d84baf18","year":2017},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.230009Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:d5f9bc345262d20f3d73a1ccafbf49733d7fcd0548f4b7d10e61f835e33741e4","observation_id":"46b63751-955b-4c34-878c-4982f07aa70a","resolution":{"observed_at":"2026-08-14T14:44:08.480947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.06128","last_updated":"2018-11-13T07:59:54Z","snapshot_observed_at":"2026-08-14T19:25:10.667879Z","submitted_at":"2018-04-17T09:37:11Z","title":"Fast and Accurate Tensor Completion with Total Variation Regularized Tensor Trains","version":3},"cited_work":{"arxiv_id":"1804.06128","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.06128","snapshot_observed_at":"2026-08-14T14:44:08.313559Z","title":"Fast and Accurate Tensor Completion with Total Variation Regularized Tensor Trains","venue":"cs.NA","work_id":"8248cc31-40b3-471e-9624-b53baa88b427","year":2018},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.234339Z"},"links":{"cited_paper":"/paper/1804.06128","citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:0848f2b7290148ec72bd1ee121c507c064b54fc6f0fdc27d4011a3e2f95391d7","observation_id":"c53d07a6-a1cf-4abd-bd6a-8bd43853d86b","resolution":{"observed_at":"2026-08-14T14:44:08.319598Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.467239Z","title":"Tensor train neigh- borhood preserving embedding","venue":null,"work_id":"18d3f60d-f072-45e8-b5a4-f34701cf1b5d","year":2018},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.238150Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:6b772bf84e0bb9a2f03eec4aef205d4cad5f21fbed12a58c0dd153b488bc8c3c","observation_id":"3b994df1-0ace-4f59-b03e-fa574286a5fd","resolution":{"observed_at":"2026-08-14T14:44:08.470825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.457708Z","title":"Support vector machine based on low-rank tensor train decomposition for big data applications","venue":null,"work_id":"bc5d790a-5e3c-46c7-afd7-fa108e812f75","year":2017},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.241489Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:84cf3e564fabcd782b63d4df21806c28f7d2d1ae2466e50eb6e40c4e29a1ad86","observation_id":"53419364-7fc4-4a64-a937-910f5f0f510c","resolution":{"observed_at":"2026-08-14T14:44:08.461063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.446856Z","title":"Par- allelized tensor train learning of polynomial classifiers","venue":null,"work_id":"4c262c28-5dc6-4174-9af0-0af1a6832008","year":2017},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.244821Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:00a1d17779cafef3b1a95fb76d5b3df3a163ac56cf92258c70dcf589d56ee0a0","observation_id":"ab5ad543-5685-49e1-a618-5cfef66d7ba1","resolution":{"observed_at":"2026-08-14T14:44:08.451379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.436816Z","title":"Whole brain fMRI pattern analysis based on tensor neural network","venue":null,"work_id":"c5edc8ed-af47-4fc2-8c75-dc118d2dfbe9","year":2018},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.248082Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:798b190656c3a80a71a53d04e69039a811550a5512077b1e178249d2b87dce19","observation_id":"7eb9719b-2bb0-467d-9b18-316017608352","resolution":{"observed_at":"2026-08-14T14:44:08.440379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.427352Z","title":"TT-cross approximation for mul- tidimensional arrays","venue":null,"work_id":"b04bd6b9-83f4-4f3b-9581-d956050f4acf","year":2010},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.251450Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:a077e424d11ed43324b09d41eeb09b90734c84097df6a62fb4695c142ab82b67","observation_id":"b563d1e5-fb54-419f-8906-aa7b557e7d18","resolution":{"observed_at":"2026-08-14T14:44:08.430594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.417370Z","title":"Fast adaptive interpolation of multi-dimensional arrays in tensor train format","venue":null,"work_id":"68f25606-9cb0-484d-bd21-ca5f958319b2","year":2011},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.254547Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:fafb58abff2f310c1d55a18f5203178e157c54a7b4817f5286295272d1306d01","observation_id":"0579e4ec-39ee-4e50-9c7b-c3c2f802a9bb","resolution":{"observed_at":"2026-08-14T14:44:08.420922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.408055Z","title":"A randomized tensor train singular value decomposition","venue":null,"work_id":"c238ed16-e096-4739-b042-024e98c32ae3","year":2017},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.258300Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:0a0f866210e213100c146f02c0224849d65a910d09a5bc7a283d2188d82b12f5","observation_id":"81d83089-1cc7-41e5-a3a3-36729a642059","resolution":{"observed_at":"2026-08-14T14:44:08.411683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.398066Z","title":"Finding struc- ture with randomness: Probabilistic algorithms for constructing approxi- mate matrix decompositions","venue":null,"work_id":"c082a3c4-ed47-43e5-93eb-1da75f2b00bd","year":2011},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.261965Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:83ac410e9439099500b8c0a879933a0a41c7640283c848bff4f83385d8f896bb","observation_id":"488f7003-b92e-41a0-8781-b277f63d62a8","resolution":{"observed_at":"2026-08-14T14:44:08.401626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.388853Z","title":"A theory of pseudoskeleton approximations","venue":null,"work_id":"b141b352-1828-4ccc-887a-b8bd20fec79f","year":1997},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.264947Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:df76c8cfbdb6338ca4fdae77a1aa0daaf9f9d790de9506fb5d9b7cf89b23b54a","observation_id":"33fb128f-11e9-473a-9cb2-fe03d464869c","resolution":{"observed_at":"2026-08-14T14:44:08.391762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.379676Z","title":"Generic construction of efficient matrix product operators","venue":null,"work_id":"33994c38-2585-45a0-a55c-ea696340b232","year":2017},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.268353Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:2562077f67c6672ca4bfe28209f10bd09604901db883b4a35bd6fdf699ebe275","observation_id":"0a637ae3-86a5-4ce4-b59f-28dbc995a802","resolution":{"observed_at":"2026-08-14T14:44:08.382900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.369604Z","title":"Xerus - A general purpose tensor library, 2014–2017","venue":null,"work_id":"9407e284-0b30-4eea-a34f-d68829e46b9a","year":2014},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.271607Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:45dcec9a0761f86f54370ac040e556b6133d972ca27f886ab07408cc789f3ea7","observation_id":"ea5caabd-db72-4ad7-bcb7-ae01ad9ad9ba","resolution":{"observed_at":"2026-08-14T14:44:08.373275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.359635Z","title":"Corrected one-site density matrix renormalization group and alternating minimal energy algorithm","venue":null,"work_id":"24e72561-33da-4634-95a0-677010699db5","year":2013},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.274797Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:386c03a6ba16dfef271633b4360f52ccb5e133f867cea6c46b4f05d5faa4e23b","observation_id":"74ad48fd-5b26-4da5-b1d6-27810a889ec7","resolution":{"observed_at":"2026-08-14T14:44:08.363249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.348968Z","title":"SNAP Datasets: Stanford large network dataset collection, June 2015","venue":null,"work_id":"ae4eb481-2053-4738-816b-c856338457ac","year":2015},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.279182Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:f5e4c73bb8f9fca98786faf294f5d4b24eecf0e6ff7225972a4c65fb644ce72b","observation_id":"78d9ea55-725f-480b-a407-a18268fe826f","resolution":{"observed_at":"2026-08-14T14:44:08.353058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.337714Z","title":null,"venue":null,"work_id":"e0c81124-a35f-4865-b63e-a0e5bfb33bda","year":1981},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.282464Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:ceb9bc0a79314ed5aef9274f56ba30f3605a90458f21d967542e4cc1dd431781","observation_id":"790b60c7-d0ec-4ec4-b5ca-e3f4787c36b9","resolution":{"observed_at":"2026-08-14T14:44:08.341298Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T14:44:08.327302Z","title":"Introduction to Algorithms","venue":null,"work_id":"8ac6d9ff-48a1-42ce-b082-869bc4b84e14","year":2009},"citing_paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:44:08.285481Z"},"links":{"citing_paper":"/paper/1908.02721"},"observation_digest":"sha256:960fb789904f581bba7aba552d81ab6d8d362822ea69fca8a26d0914313f9fef","observation_id":"b99329d1-a54a-4ba6-917b-3ae20744fc47","resolution":{"observed_at":"2026-08-14T14:44:08.330748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.02721","last_updated":"2020-11-02T05:21:33Z","latest_version":2,"primary_category":"math.NA","snapshot_observed_at":"2026-08-14T14:34:27.396250Z","submitted_at":"2019-08-07T16:49:58Z","title":"Faster Tensor Train Decomposition for Sparse Data"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":25},"total_outbound_references":28},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:1908.02721."}