{"as_of":"2026-08-10T01:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5212c2dc3caa115e7ac844fd24bb733f5146577cf044fac429405d2857155eed","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T06:57:23.207779Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.13602","last_updated":"2019-07-31T17:07:08Z","snapshot_observed_at":"2026-07-31T17:25:20.803516Z","submitted_at":"2019-07-31T17:07:08Z","title":"Binary component decomposition Part II: The asymmetric case","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.13602","snapshot_observed_at":"2026-07-11T12:06:20.451363Z","title":"arXiv preprint arXiv:1907.13602 (2019)","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-11T12:06:20.451363Z"},"links":{"cited_paper":"/paper/1907.13602","citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:4965926f7d49a1405587615f6f12c94fc48434eb0fce96f384e90246c9b742d9","observation_id":"a180792a-23cc-4c53-9d45-4b868cf11b78","resolution":{"observed_at":"2026-07-11T12:06:20.451363Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.13602","last_updated":"2019-07-31T17:07:08Z","snapshot_observed_at":"2026-07-31T17:25:20.803516Z","submitted_at":"2019-07-31T17:07:08Z","title":"Binary component decomposition Part II: The asymmetric case","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.13602","snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"arXiv preprint arXiv:1907.13602 (2019)","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"cited_paper":"/paper/1907.13602","citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:c29e2fc17d83dc2c58d457a30518f1e8fc605ee1f57fc9148d10c8ce4f5dcc42","observation_id":"3a51a476-3a72-47d2-81f1-c8282f507377","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1907.13602/citation-record","integrity":"/paper/1907.13602/integrity","json":"/paper/1907.13602/citation-record.json","paper":"/paper/1907.13602"},"outbound":[],"paper":{"arxiv_id":"1907.13602","last_updated":"2019-07-31T17:07:08Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-31T17:25:20.803516Z","submitted_at":"2019-07-31T17:07:08Z","title":"Binary component decomposition Part II: The asymmetric case"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1907.13602."}