{"as_of":"2026-08-11T15:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb119b1bca1de09791fd8dac0860588d750d7d71659e11ca9a36e6c20d12e533","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:17:16.904505Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T16:17:17.022645Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1708.00132","last_updated":"2017-08-02T01:23:18Z","snapshot_observed_at":"2026-08-09T22:42:02.242476Z","submitted_at":"2017-08-01T02:18:41Z","title":"On Tensor Train Rank Minimization: Statistical Efficiency and Scalable Algorithm","version":2},"cited_work":{"arxiv_id":"1708.00132","doi":null,"metadata_source":"pith","pith_arxiv_id":"1708.00132","snapshot_observed_at":"2026-08-10T16:17:17.022645Z","title":"On Tensor Train Rank Minimization: Statistical Efficiency and Scalable Algorithm","venue":"stat.ML","work_id":"6b554a27-2eae-4aa0-bce4-e643d0b312dc","year":2017},"citing_paper":{"arxiv_id":"2501.13385","last_updated":"2025-01-23T05:03:50Z","snapshot_observed_at":"2026-08-10T15:58:09.933117Z","submitted_at":"2025-01-23T05:03:50Z","title":"Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T16:17:16.904505Z"},"links":{"cited_paper":"/paper/1708.00132","citing_paper":"/paper/2501.13385"},"observation_digest":"sha256:3ee52fa3cb1dfe01719e73aacf912fd4d80026629fe1828bf1fe7e4d3c6a58c6","observation_id":"1b4f361d-c5ce-471e-93ad-917cc6149f17","resolution":{"observed_at":"2026-08-10T16:17:17.026330Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1708.00132/citation-record","integrity":"/paper/1708.00132/integrity","json":"/paper/1708.00132/citation-record.json","paper":"/paper/1708.00132"},"outbound":[],"paper":{"arxiv_id":"1708.00132","last_updated":"2017-08-02T01:23:18Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-09T22:42:02.242476Z","submitted_at":"2017-08-01T02:18:41Z","title":"On Tensor Train Rank Minimization: Statistical Efficiency and Scalable Algorithm"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1708.00132."}