{"as_of":"2026-08-22T01:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d104496c4da40b19ced345f9b3a759f425444c4fa5f14483f2d812e3f4932e71","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-21T06:32:19.484+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-15T21:46:14.859393Z","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-15T21:46:15.141130Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1604.07243","last_updated":"2017-06-14T14:08:22Z","snapshot_observed_at":"2026-08-14T22:00:15.629921Z","submitted_at":"2016-04-25T13:22:55Z","title":"Learning Arbitrary Sum-Product Network Leaves with Expectation-Maximization","version":3},"cited_work":{"arxiv_id":"1604.07243","doi":null,"metadata_source":"pith","pith_arxiv_id":"1604.07243","snapshot_observed_at":"2026-08-15T21:46:15.141130Z","title":"Learning Arbitrary Sum-Product Network Leaves with Expectation-Maximization","venue":"cs.LG","work_id":"11087286-55e0-41f7-8e5f-1ab92ad759da","year":2016},"citing_paper":{"arxiv_id":"2608.12869","last_updated":"2026-08-13T06:34:01Z","snapshot_observed_at":"2026-08-16T23:11:11.237568Z","submitted_at":"2026-08-13T06:34:01Z","title":"A Compositional Theory of Curvature in Probabilistic Circuits","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-15T21:46:14.859393Z"},"links":{"cited_paper":"/paper/1604.07243","citing_paper":"/paper/2608.12869"},"observation_digest":"sha256:ba3670867218c0a5a4a31378537a869f109b328ca1439dd24b9cd05cb0181c6e","observation_id":"a7f45f43-d228-4a12-bbe5-ba254bcf6b5e","resolution":{"observed_at":"2026-08-15T21:46:15.148952Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1604.07243/citation-record","integrity":"/paper/1604.07243/integrity","json":"/paper/1604.07243/citation-record.json","paper":"/paper/1604.07243"},"outbound":[],"paper":{"arxiv_id":"1604.07243","last_updated":"2017-06-14T14:08:22Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T22:00:15.629921Z","submitted_at":"2016-04-25T13:22:55Z","title":"Learning Arbitrary Sum-Product Network Leaves with Expectation-Maximization"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1604.07243."}