{"as_of":"2026-08-21T06:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d1e6efd5ff18abc5e8b10e8ff2fc945ac0626f2a5495e31a6b15a69f18b74672","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-15T15:44:41.708734Z","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-15T15:44:41.761212Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1105.1476","last_updated":"2012-09-07T09:31:45Z","snapshot_observed_at":"2026-08-17T22:48:21.650967Z","submitted_at":"2011-05-07T21:46:34Z","title":"EM algorithm and variants: an informal tutorial","version":2},"cited_work":{"arxiv_id":"1105.1476","doi":null,"metadata_source":"pith","pith_arxiv_id":"1105.1476","snapshot_observed_at":"2026-08-15T15:44:41.761212Z","title":"EM algorithm and variants: an informal tutorial","venue":"stat.CO","work_id":"9e39862c-d209-4197-b0ad-cd030e0b94b9","year":2011},"citing_paper":{"arxiv_id":"2601.22378","last_updated":"2026-07-04T21:34:49Z","snapshot_observed_at":"2026-08-20T15:27:22.948760Z","submitted_at":"2026-01-29T22:41:43Z","title":"It's all In the (Exponential) Family: An Equivalence between Maximum Likelihood Estimation and Control Variates for Sketching Algorithms","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T15:44:41.708734Z"},"links":{"cited_paper":"/paper/1105.1476","citing_paper":"/paper/2601.22378"},"observation_digest":"sha256:f203fe03cc21802b6b8112a034444a5e1be3753892c85f877d45694e2b834740","observation_id":"fdb29298-71f6-425a-8dba-9def6e73930b","resolution":{"observed_at":"2026-08-15T15:44:41.767737Z","resolver_source":"local_arxiv","status":"verified_exact"},"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/1105.1476/citation-record","integrity":"/paper/1105.1476/integrity","json":"/paper/1105.1476/citation-record.json","paper":"/paper/1105.1476"},"outbound":[],"paper":{"arxiv_id":"1105.1476","last_updated":"2012-09-07T09:31:45Z","latest_version":2,"primary_category":"stat.CO","snapshot_observed_at":"2026-08-17T22:48:21.650967Z","submitted_at":"2011-05-07T21:46:34Z","title":"EM algorithm and variants: an informal tutorial"},"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 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1105.1476."}