{"as_of":"2026-08-11T05:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2a61298996f900c793fdafa08f69619beb9a36c0bd5110ec90409fadac01fe5c","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:09:01.454339Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T02:26:26.853082Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.05677","last_updated":"2024-08-11T02:58:28Z","snapshot_observed_at":"2026-08-10T19:31:51.631182Z","submitted_at":"2024-08-11T02:58:28Z","title":"Tensor Decomposition Meets RKHS: Efficient Algorithms for Smooth and Misaligned Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.05677","snapshot_observed_at":"2026-08-06T17:09:01.454339Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.11723","last_updated":"2025-07-15T20:47:16Z","snapshot_observed_at":"2026-08-07T21:28:35.017950Z","submitted_at":"2025-07-15T20:47:16Z","title":"Smooth tensor decomposition with application to ambulatory blood pressure monitoring data","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T17:09:01.454339Z"},"links":{"cited_paper":"/paper/2408.05677","citing_paper":"/paper/2507.11723"},"observation_digest":"sha256:b95527a25259cbe3514ae498a5b774fc6dcae63b1f6333b3ab906f13803b3a99","observation_id":"2deb85f6-594d-4660-8617-9c551a02eb33","resolution":{"observed_at":"2026-08-06T17:09:01.454339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05677","last_updated":"2024-08-11T02:58:28Z","snapshot_observed_at":"2026-08-10T19:31:51.631182Z","submitted_at":"2024-08-11T02:58:28Z","title":"Tensor Decomposition Meets RKHS: Efficient Algorithms for Smooth and Misaligned Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.05677","snapshot_observed_at":"2026-08-05T13:55:42.786790Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00224","last_updated":"2025-08-29T20:25:18Z","snapshot_observed_at":"2026-08-10T05:27:18.738937Z","submitted_at":"2025-08-29T20:25:18Z","title":"Kernel manifolds: nonlinear-augmentation dimensionality reduction using reproducing kernel Hilbert spaces","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T13:55:42.786790Z"},"links":{"cited_paper":"/paper/2408.05677","citing_paper":"/paper/2509.00224"},"observation_digest":"sha256:8c2fb7e169a6284fb5eb83b4e40d9f2ab3d780f913108186cb741d1386277dce","observation_id":"50efbaaf-84d3-4b31-b100-d510417f266c","resolution":{"observed_at":"2026-08-05T13:55:42.786790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05677","last_updated":"2024-08-11T02:58:28Z","snapshot_observed_at":"2026-08-10T19:31:51.631182Z","submitted_at":"2024-08-11T02:58:28Z","title":"Tensor Decomposition Meets RKHS: Efficient Algorithms for Smooth and Misaligned Data","version":1},"cited_work":{"arxiv_id":"2408.05677","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.05677","snapshot_observed_at":"2026-07-02T02:26:26.853082Z","title":"Tensor decom- position meets rkhs: Efficient algorithms for smooth and misaligned data.arXiv preprint arXiv:2408.05677","venue":null,"work_id":"20f71384-d574-4760-972d-7b82f410a45d","year":2024},"citing_paper":{"arxiv_id":"2509.05221","last_updated":"2026-07-05T06:44:27Z","snapshot_observed_at":"2026-08-05T05:35:13.894935Z","submitted_at":"2025-09-05T16:32:26Z","title":"A functional tensor model for dynamic multilayer networks with common invariant subspaces and the RKHS estimation","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-18T18:30:59.391006Z"},"links":{"cited_paper":"/paper/2408.05677","citing_paper":"/paper/2509.05221"},"observation_digest":"sha256:6aec72ebe7dd651892eadf72728b5088a90d2dfd69f18a8c4b15f16d115d38c8","observation_id":"06febab5-1cef-454e-8318-7db2bc98993d","resolution":{"observed_at":"2026-05-18T18:31:44.010142Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05677","last_updated":"2024-08-11T02:58:28Z","snapshot_observed_at":"2026-08-10T19:31:51.631182Z","submitted_at":"2024-08-11T02:58:28Z","title":"Tensor Decomposition Meets RKHS: Efficient Algorithms for Smooth and Misaligned Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.05677","snapshot_observed_at":"2026-08-05T05:35:15.170867Z","title":"Tensor decom- position meets rkhs: Efficient algorithms for smooth and misaligned data.arXiv preprint arXiv:2408.05677,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.05221","last_updated":"2026-07-05T06:44:27Z","snapshot_observed_at":"2026-08-05T05:35:13.894935Z","submitted_at":"2025-09-05T16:32:26Z","title":"A functional tensor model for dynamic multilayer networks with common invariant subspaces and the RKHS estimation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T05:35:15.170867Z"},"links":{"cited_paper":"/paper/2408.05677","citing_paper":"/paper/2509.05221"},"observation_digest":"sha256:f35dbfc504dec4f2f75104fd163fa685e7420f2cf7f09644c391b8183961292c","observation_id":"37b410b1-467b-4bf9-a614-48a2a683aa5d","resolution":{"observed_at":"2026-08-05T05:35:15.170867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05677","last_updated":"2024-08-11T02:58:28Z","snapshot_observed_at":"2026-08-10T19:31:51.631182Z","submitted_at":"2024-08-11T02:58:28Z","title":"Tensor Decomposition Meets RKHS: Efficient Algorithms for Smooth and Misaligned Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.05677","snapshot_observed_at":"2026-08-03T17:33:55.227494Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.09165","last_updated":"2026-06-28T07:19:23Z","snapshot_observed_at":"2026-08-08T08:45:02.727124Z","submitted_at":"2025-12-09T22:26:29Z","title":"Spectral Embedding via Chebyshev Bases for Robust DeepONet Approximation","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T17:33:55.227494Z"},"links":{"cited_paper":"/paper/2408.05677","citing_paper":"/paper/2512.09165"},"observation_digest":"sha256:54cfa42da5234749f5d6b9441387323607ab51e26d54fc3b44902bd4bee01946","observation_id":"f4d2a0d9-f472-4f82-9f02-20eca91c9fb8","resolution":{"observed_at":"2026-08-03T17:33:55.227494Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05677","last_updated":"2024-08-11T02:58:28Z","snapshot_observed_at":"2026-08-10T19:31:51.631182Z","submitted_at":"2024-08-11T02:58:28Z","title":"Tensor Decomposition Meets RKHS: Efficient Algorithms for Smooth and Misaligned Data","version":1},"cited_work":{"arxiv_id":"2408.05677","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.05677","snapshot_observed_at":"2026-07-02T02:26:26.853082Z","title":"Tensor decom- position meets rkhs: Efficient algorithms for smooth and misaligned data.arXiv preprint arXiv:2408.05677","venue":null,"work_id":"20f71384-d574-4760-972d-7b82f410a45d","year":2024},"citing_paper":{"arxiv_id":"2606.04176","last_updated":"2026-06-02T19:41:07Z","snapshot_observed_at":"2026-08-01T14:40:03.598330Z","submitted_at":"2026-06-02T19:41:07Z","title":"Low-rank Distributional Matrix Completion","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-28T10:55:58.047096Z"},"links":{"cited_paper":"/paper/2408.05677","citing_paper":"/paper/2606.04176"},"observation_digest":"sha256:0c9baf8cec5f870e38aa4c68fd2947df4028ab84f280ec4f347c0d72563efd5b","observation_id":"08c198c9-cd7f-412b-97a6-4f0e74cbf886","resolution":{"observed_at":"2026-07-02T02:26:26.854770Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05677","last_updated":"2024-08-11T02:58:28Z","snapshot_observed_at":"2026-08-10T19:31:51.631182Z","submitted_at":"2024-08-11T02:58:28Z","title":"Tensor Decomposition Meets RKHS: Efficient Algorithms for Smooth and Misaligned Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.05677","snapshot_observed_at":"2026-08-01T18:09:38.615993Z","title":"Tensor decomposition meets RKHS: Efficient algorithms for smooth andmisaligneddata,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.17390","last_updated":"2026-07-21T12:57:11Z","snapshot_observed_at":"2026-08-08T08:58:04.262567Z","submitted_at":"2026-07-19T19:43:31Z","title":"Kernel Regression with Tensor Trains and Hadamard Overparameterization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T18:09:38.615993Z"},"links":{"cited_paper":"/paper/2408.05677","citing_paper":"/paper/2607.17390"},"observation_digest":"sha256:083dd82b1c30f66d9450238d5714549973391f321c74d0c74d08b188a7361ff2","observation_id":"4b66c447-33d0-4801-92e0-c307e9176146","resolution":{"observed_at":"2026-08-01T18:09:38.615993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.05677/citation-record","integrity":"/paper/2408.05677/integrity","json":"/paper/2408.05677/citation-record.json","paper":"/paper/2408.05677"},"outbound":[],"paper":{"arxiv_id":"2408.05677","last_updated":"2024-08-11T02:58:28Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-10T19:31:51.631182Z","submitted_at":"2024-08-11T02:58:28Z","title":"Tensor Decomposition Meets RKHS: Efficient Algorithms for Smooth and Misaligned Data"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2408.05677."}