{"as_of":"2026-08-07T10:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5025f6b388675e5483289f8c48877a06828df5635b8b2310211821072ea3748a","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-07T06:34:17.273281+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-06T12:20:43.195811Z","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-06T12:20:44.346289Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1401.0579","last_updated":"2014-01-03T02:52:17Z","snapshot_observed_at":"2026-07-06T03:32:23.116729Z","submitted_at":"2014-01-03T02:52:17Z","title":"More Algorithms for Provable Dictionary Learning","version":1},"cited_work":{"arxiv_id":"1401.0579","doi":null,"metadata_source":"pith","pith_arxiv_id":"1401.0579","snapshot_observed_at":"2026-08-06T12:20:44.346289Z","title":"More Algorithms for Provable Dictionary Learning","venue":"cs.DS","work_id":"4e42c20c-dbc1-41f8-9eea-be80247fced7","year":2014},"citing_paper":{"arxiv_id":"2507.22038","last_updated":"2025-07-29T17:40:23Z","snapshot_observed_at":"2026-08-06T12:20:22.379870Z","submitted_at":"2025-07-29T17:40:23Z","title":"Sample Complexity of Branch-length Estimation by Maximum Likelihood","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T12:20:43.195811Z"},"links":{"cited_paper":"/paper/1401.0579","citing_paper":"/paper/2507.22038"},"observation_digest":"sha256:652759da17ffe5ea1786c39f4e12849ef08537bb348262a6e65a2262997f0e4e","observation_id":"627f97a2-97b9-47af-b498-94f20d7ca501","resolution":{"observed_at":"2026-08-06T12:20:44.353968Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1401.0579/citation-record","integrity":"/paper/1401.0579/integrity","json":"/paper/1401.0579/citation-record.json","paper":"/paper/1401.0579"},"outbound":[],"paper":{"arxiv_id":"1401.0579","last_updated":"2014-01-03T02:52:17Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T03:32:23.116729Z","submitted_at":"2014-01-03T02:52:17Z","title":"More Algorithms for Provable Dictionary Learning"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1401.0579."}