{"as_of":"2026-08-20T06:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3ef6de323425edf9d6d681c2df5b12fab2eecdaa2025a400a2976c4a79d7334a","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-20T06:33:59.587034+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-16T11:25:22.692844Z","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-16T11:25:23.480706Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1208.1237","last_updated":"2013-10-07T14:15:01Z","snapshot_observed_at":"2026-08-17T15:49:42.649315Z","submitted_at":"2012-08-06T18:49:07Z","title":"Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization","version":3},"cited_work":{"arxiv_id":"1208.1237","doi":null,"metadata_source":"pith","pith_arxiv_id":"1208.1237","snapshot_observed_at":"2026-08-16T11:25:23.480706Z","title":"Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization","venue":"stat.ML","work_id":"4a593e38-f845-4875-a655-9a1e38c2729b","year":2012},"citing_paper":{"arxiv_id":"2504.15683","last_updated":"2025-04-22T08:06:37Z","snapshot_observed_at":"2026-08-19T20:30:19.859198Z","submitted_at":"2025-04-22T08:06:37Z","title":"FinTextSim: Enhancing Financial Text Analysis with BERTopic","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T11:25:22.692844Z"},"links":{"cited_paper":"/paper/1208.1237","citing_paper":"/paper/2504.15683"},"observation_digest":"sha256:e2657cecd9763463ae4bfe190e9f0dbcde794948e6020488766c667cb445aeb9","observation_id":"c3290c1f-415b-4249-b8f1-0be4342ac1a9","resolution":{"observed_at":"2026-08-16T11:25:23.486516Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1208.1237/citation-record","integrity":"/paper/1208.1237/integrity","json":"/paper/1208.1237/citation-record.json","paper":"/paper/1208.1237"},"outbound":[],"paper":{"arxiv_id":"1208.1237","last_updated":"2013-10-07T14:15:01Z","latest_version":3,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-17T15:49:42.649315Z","submitted_at":"2012-08-06T18:49:07Z","title":"Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1208.1237."}