{"as_of":"2026-08-08T14:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2ac6a8405e26cea93eb8188710c941a79260baddb39af10893597d821e1edc02","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-08T06:32:00.761636+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-06T23:55:22.730156Z","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-06T23:55:26.569784Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"0708.4149","last_updated":"2007-09-27T17:04:40Z","snapshot_observed_at":"2026-08-01T20:39:27.885168Z","submitted_at":"2007-08-30T13:01:33Z","title":"On the complexity of nonnegative matrix factorization","version":2},"cited_work":{"arxiv_id":"0708.4149","doi":null,"metadata_source":"pith","pith_arxiv_id":"0708.4149","snapshot_observed_at":"2026-08-06T23:55:26.569784Z","title":"On the complexity of nonnegative matrix factorization","venue":"cs.NA","work_id":"4a263300-3f41-42f7-b080-05630d53e29f","year":2007},"citing_paper":{"arxiv_id":"2506.15855","last_updated":"2025-06-28T00:27:34Z","snapshot_observed_at":"2026-08-07T21:20:39.676438Z","submitted_at":"2025-06-18T20:04:28Z","title":"Bayesian Non-Negative Matrix Factorization with Correlated Mutation Type Probabilities for Mutational Signatures","version":2},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-06T23:55:22.730156Z"},"links":{"cited_paper":"/paper/0708.4149","citing_paper":"/paper/2506.15855"},"observation_digest":"sha256:7959e63141e6f24c7726211c7a0efd771651585113a86e80dabccfa10d218891","observation_id":"a3ca4223-b21c-4488-af0b-754eaed3d6d4","resolution":{"observed_at":"2026-08-06T23:55:26.572809Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/0708.4149/citation-record","integrity":"/paper/0708.4149/integrity","json":"/paper/0708.4149/citation-record.json","paper":"/paper/0708.4149"},"outbound":[],"paper":{"arxiv_id":"0708.4149","last_updated":"2007-09-27T17:04:40Z","latest_version":2,"primary_category":"cs.NA","snapshot_observed_at":"2026-08-01T20:39:27.885168Z","submitted_at":"2007-08-30T13:01:33Z","title":"On the complexity of 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:0708.4149."}