{"as_of":"2026-08-23T17:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dbc15018387e4de4782ef28a5163ff40df572b80c42bd2caacbc2901f27ca89d","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T21:53:52.664943Z","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-07-03T23:39:03.994523Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1710.02812","last_updated":"2019-05-10T09:37:09Z","snapshot_observed_at":"2026-08-20T02:10:17.899534Z","submitted_at":"2017-10-08T09:28:07Z","title":"A Hierarchical Singular Value Decomposition Algorithm for Low Rank Matrices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.02812","snapshot_observed_at":"2026-08-11T21:53:52.664943Z","title":"A hierarchical singular value decomposition algorithm for low rank matrices,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.04082","last_updated":"2024-12-05T11:32:53Z","snapshot_observed_at":"2026-08-19T12:25:57.970037Z","submitted_at":"2024-12-05T11:32:53Z","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T21:53:52.664943Z"},"links":{"cited_paper":"/paper/1710.02812","citing_paper":"/paper/2412.04082"},"observation_digest":"sha256:6173029e67d8e24cacd7d1d49ea20566fb8832e1cd6be60db1cf4c9824aeabd8","observation_id":"3dafd564-1bc4-42ec-a959-6a9a513e0b53","resolution":{"observed_at":"2026-08-11T21:53:52.664943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.02812","last_updated":"2019-05-10T09:37:09Z","snapshot_observed_at":"2026-08-20T02:10:17.899534Z","submitted_at":"2017-10-08T09:28:07Z","title":"A Hierarchical Singular Value Decomposition Algorithm for Low Rank Matrices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.02812","snapshot_observed_at":"2026-08-08T20:55:14.217349Z","title":"and Ramakrishna, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04959","last_updated":"2025-06-11T12:14:36Z","snapshot_observed_at":"2026-08-19T06:05:09.445916Z","submitted_at":"2025-02-07T14:22:56Z","title":"No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspaces","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T20:55:14.217349Z"},"links":{"cited_paper":"/paper/1710.02812","citing_paper":"/paper/2502.04959"},"observation_digest":"sha256:ad835749f9432b92794ded55444739dff8c8f025a8591c5041c99c334ea2af70","observation_id":"1d312822-01ae-4579-bd17-88d383740bdd","resolution":{"observed_at":"2026-08-08T20:55:14.217349Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.02812","last_updated":"2019-05-10T09:37:09Z","snapshot_observed_at":"2026-08-20T02:10:17.899534Z","submitted_at":"2017-10-08T09:28:07Z","title":"A Hierarchical Singular Value Decomposition Algorithm for Low Rank Matrices","version":2},"cited_work":{"arxiv_id":"1710.02812","doi":null,"metadata_source":"pith","pith_arxiv_id":"1710.02812","snapshot_observed_at":"2026-07-03T23:39:03.994523Z","title":"A Hierarchical Singular Value Decomposition Algorithm for Low Rank Matrices","venue":"cs.NA","work_id":"a355754f-c3c6-4758-b1e4-a1a98457fff0","year":2017},"citing_paper":{"arxiv_id":"2606.11480","last_updated":"2026-06-09T22:14:16Z","snapshot_observed_at":"2026-08-17T15:53:43.745743Z","submitted_at":"2026-06-09T22:14:16Z","title":"Accurate and Resource-Efficient Federated Continual Learning","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-27T13:40:35.795292Z"},"links":{"cited_paper":"/paper/1710.02812","citing_paper":"/paper/2606.11480"},"observation_digest":"sha256:ef291fb0b0f07dc4a679c2ce1bb780cc040e84a601f57fdf79a324a729e80221","observation_id":"3d7c61b6-6bd2-46ed-9490-a7d3741b1b02","resolution":{"observed_at":"2026-07-03T04:47:37.944078Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1710.02812","last_updated":"2019-05-10T09:37:09Z","snapshot_observed_at":"2026-08-20T02:10:17.899534Z","submitted_at":"2017-10-08T09:28:07Z","title":"A Hierarchical Singular Value Decomposition Algorithm for Low Rank Matrices","version":2},"cited_work":{"arxiv_id":"1710.02812","doi":null,"metadata_source":"pith","pith_arxiv_id":"1710.02812","snapshot_observed_at":"2026-07-03T23:39:03.994523Z","title":"A Hierarchical Singular Value Decomposition Algorithm for Low Rank Matrices","venue":"cs.NA","work_id":"a355754f-c3c6-4758-b1e4-a1a98457fff0","year":2017},"citing_paper":{"arxiv_id":"2606.18627","last_updated":"2026-06-23T03:37:22Z","snapshot_observed_at":"2026-08-17T21:25:11.509461Z","submitted_at":"2026-06-17T02:48:35Z","title":"PACT: Preserving Anchored Cores in Task-vectors for Model Merging","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T21:57:07.546038Z"},"links":{"cited_paper":"/paper/1710.02812","citing_paper":"/paper/2606.18627"},"observation_digest":"sha256:e2143d15060d0fb6df68291ba14b75e257e2c4d4393b3b4101af031eacf55adb","observation_id":"9a74cdae-292a-47cb-9076-1c92367b8eda","resolution":{"observed_at":"2026-07-03T23:39:03.997093Z","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/1710.02812/citation-record","integrity":"/paper/1710.02812/integrity","json":"/paper/1710.02812/citation-record.json","paper":"/paper/1710.02812"},"outbound":[],"paper":{"arxiv_id":"1710.02812","last_updated":"2019-05-10T09:37:09Z","latest_version":2,"primary_category":"cs.NA","snapshot_observed_at":"2026-08-20T02:10:17.899534Z","submitted_at":"2017-10-08T09:28:07Z","title":"A Hierarchical Singular Value Decomposition Algorithm for Low Rank Matrices"},"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 4 inbound Pith citation observations for arXiv:1710.02812."}