{"as_of":"2026-08-23T07:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ac5dc2834692acfd60a6a17ab8f71e6dfa80f4281a98e0ec8451620971159fbc","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-23T06:30:58.430688+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-11T20:13:03.796697Z","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-11T20:13:03.874102Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2207.07417","last_updated":"2023-11-26T06:10:27Z","snapshot_observed_at":"2026-08-16T16:45:44.213316Z","submitted_at":"2022-07-15T11:55:09Z","title":"Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions","version":3},"cited_work":{"arxiv_id":"2207.07417","doi":null,"metadata_source":"pith","pith_arxiv_id":"2207.07417","snapshot_observed_at":"2026-08-11T20:13:03.874102Z","title":"Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions","venue":"cs.DS","work_id":"492ea2e4-7c2e-4bc8-ad36-feea26391351","year":2022},"citing_paper":{"arxiv_id":"2412.06111","last_updated":"2024-12-09T00:11:01Z","snapshot_observed_at":"2026-08-20T17:34:47.735985Z","submitted_at":"2024-12-09T00:11:01Z","title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T20:13:03.796697Z"},"links":{"cited_paper":"/paper/2207.07417","citing_paper":"/paper/2412.06111"},"observation_digest":"sha256:13038ced4800ebf4f11836d48a30ead06d94ad9766690792fb5d78a8681fdd5a","observation_id":"b0807300-4865-4d9a-bb87-a04ecc55fa35","resolution":{"observed_at":"2026-08-11T20:13:03.882116Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2207.07417/citation-record","integrity":"/paper/2207.07417/integrity","json":"/paper/2207.07417/citation-record.json","paper":"/paper/2207.07417"},"outbound":[],"paper":{"arxiv_id":"2207.07417","last_updated":"2023-11-26T06:10:27Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T16:45:44.213316Z","submitted_at":"2022-07-15T11:55:09Z","title":"Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2207.07417."}