{"as_of":"2026-08-07T09:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8ec9ad67db3e7e5e3e9f8fee05787a869ec5644dce2289c776f7c6630ba50788","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:54:23.106538Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2507.04385/citation-record","integrity":"/paper/2507.04385/integrity","json":"/paper/2507.04385/citation-record.json","paper":"/paper/2507.04385"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:54:24.277033Z","title":"This comparison highlights the flexibility of APCs compared to the prior autoencoding scheme introduced in Vergari et al","venue":null,"work_id":"87604d44-edbb-4d68-8131-de23414e6cda","year":2018},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:23.018912Z"},"links":{"citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:d395b9a5d60a87ea51e51504986f88922b74ddeaaf23d7ed06101a45c26580df","observation_id":"c948597d-30e1-4d07-9243-2f80584b544a","resolution":{"observed_at":"2026-08-06T19:54:24.303569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:54:24.609633Z","title":"C.4 Additional Reconstruction Visualizations To provide further visual insights and extend the quantitative reconstructions presented in Fig","venue":null,"work_id":"562af8db-157a-4895-bac7-f7c23d10a8c8","year":2018},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:22.853394Z"},"links":{"citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:fffa85fdbc9c9792e2a177262ca3fb526e0e966cfcb0c21ee21b7fa4c82b5fe8","observation_id":"0024cdda-cfcd-4a54-a6dd-8d1c5f4263f2","resolution":{"observed_at":"2026-08-06T19:54:24.703875Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-06T19:54:21.843711Z","title":"What is the relationship between tensor factorizations and circuits (and how can we exploit it)?Transactions on Machine Learning Research (TMLR), 2025a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:21.843711Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:e38873e9e32a9d48fc37d4846a903673e16dc491fe9acbf2e1ad0255dcc22c92","observation_id":"ad791225-0fc5-49b4-b567-1b7350c41a37","resolution":{"observed_at":"2026-08-06T19:54:21.843711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:54:24.137385Z","title":"Full Evidence: APCs are successfully distilling the knowledge from their teacher","venue":null,"work_id":"b866ef81-419f-4e89-8884-7102f3209b53","year":2022},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:23.106538Z"},"links":{"citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:5fed30128d89f91dd16c44bc2121bdf923b496a8ea5868260bf4942f67b4e111","observation_id":"fcb80fcb-d80f-4907-930d-08e9d606e518","resolution":{"observed_at":"2026-08-06T19:54:24.213385Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1903.12136","last_updated":"2019-03-28T17:23:50Z","snapshot_observed_at":"2026-07-06T07:42:21.954799Z","submitted_at":"2019-03-28T17:23:50Z","title":"Distilling Task-Specific Knowledge from BERT into Simple Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.12136","snapshot_observed_at":"2026-08-06T19:54:22.245575Z","title":"Distilling task-specific knowledge from bert into simple neural networks.arXiv preprint arXiv:1903.12136,","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:22.245575Z"},"links":{"cited_paper":"/paper/1903.12136","citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:9deba97d1c7b645fbb2acff331202def023c1e0a57df12fc6ed1847c5daf26e2","observation_id":"73e08c52-20b4-453b-9074-dbac3c88acd7","resolution":{"observed_at":"2026-08-06T19:54:22.245575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.03851","last_updated":"2019-02-19T15:59:07Z","snapshot_observed_at":"2026-08-07T03:08:28.578719Z","submitted_at":"2018-01-11T16:22:07Z","title":"Autoencoders and Probabilistic Inference with Missing Data: An Exact Solution for The Factor Analysis Case","version":3},"cited_work":{"arxiv_id":"1801.03851","doi":null,"metadata_source":"pith","pith_arxiv_id":"1801.03851","snapshot_observed_at":"2026-08-06T19:54:23.291705Z","title":"Autoencoders and Probabilistic Inference with Missing Data: An Exact Solution for The Factor Analysis Case","venue":"cs.LG","work_id":"0410a6fe-1c2b-4bea-a737-86fba5b53047","year":2018},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:22.324439Z"},"links":{"cited_paper":"/paper/1801.03851","citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:8eb527489b8d948de72bd51d3cb5c7791e8f8e8cdb02d718a8f893314517224b","observation_id":"40a36fc3-6fa7-4e2d-b58b-1d483e383ad1","resolution":{"observed_at":"2026-08-06T19:54:23.359391Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1506.03365","last_updated":"2016-06-04T09:51:30Z","snapshot_observed_at":"2026-08-02T13:27:26.592273Z","submitted_at":"2015-06-10T15:38:47Z","title":"LSUN: Construction of a Large-scale Image Dataset using Deep Learning with Humans in the Loop","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.03365","snapshot_observed_at":"2026-08-06T19:54:22.538615Z","title":"LSUN: construction of a large-scale image dataset using deep learning with humans in the loop.arXiv preprint arXiv:1506.03365,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:22.538615Z"},"links":{"cited_paper":"/paper/1506.03365","citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:80d225d8567fe4246ac5d4631c1e39c8f0b95a445110bcb21ee203dbb5ce87cd","observation_id":"169de85b-3d75-4f7f-8fb6-e0e41d90a3e0","resolution":{"observed_at":"2026-08-06T19:54:22.538615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.06160","last_updated":"2018-02-02T01:43:54Z","snapshot_observed_at":"2026-07-06T05:00:35.763958Z","submitted_at":"2016-06-20T15:02:31Z","title":"DoReFa-Net: Training Low Bitwidth Convolutional Neural Networks with Low Bitwidth Gradients","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.06160","snapshot_observed_at":"2026-08-06T19:54:22.601019Z","title":"DoReFa-Net: Training low bitwidth convolutional neural networks with low bitwidth gradients.arXiv preprint arXiv:1606.06160,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:22.601019Z"},"links":{"cited_paper":"/paper/1606.06160","citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:7af80841dcfcb27e362487b09fde910830fb5475ec52987f8ecdd2d9943ba261","observation_id":"294f066e-14d8-4891-a894-92b7e83ff5f9","resolution":{"observed_at":"2026-08-06T19:54:22.601019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:54:25.023739Z","title":"Our implementation is available as open-source software athttps: //github.com/placeholder-url","venue":null,"work_id":"7d44a7d7-d27e-4335-9ad0-5c853b58129a","year":2019},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:22.653812Z"},"links":{"citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:e997abe996fbaba187d5e003417b39edda987f12b4baeb02183b81191d2afdd9","observation_id":"c1379fca-118f-4860-976f-e2b0c5a389eb","resolution":{"observed_at":"2026-08-06T19:54:25.106557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:54:24.834543Z","title":"convolutional","venue":null,"work_id":"c54b4e68-d952-4464-8b75-b2e8dbd17c74","year":2018},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:22.739496Z"},"links":{"citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:addd02ea6ac133829c37940e6c8bc6f3ebceab6991c93bf9dbb969075ef2a55d","observation_id":"1e8a097b-d38c-4ed9-9042-d52befaf3dbb","resolution":{"observed_at":"2026-08-06T19:54:24.910794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:54:24.371303Z","title":null,"venue":null,"work_id":"03c03840-ced8-4ce9-991c-28e93095acf7","year":2017},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:22.951774Z"},"links":{"citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:f11212ab2a9e752a35c54f6b1b78a6587900dd565e5f96c2c51ba66946735d78","observation_id":"be8ab835-3ae5-4dbe-ba67-7ebf6e8bbe66","resolution":{"observed_at":"2026-08-06T19:54:24.487793Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:54:25.886129Z","title":"not-miwae: Deep generative modelling with missing not at random data","venue":null,"work_id":"aa3b40e4-82c8-42e5-b10a-3018053dc3d1","year":2021},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:21.525193Z"},"links":{"citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:6302dbefcbd2adef06373ed4414a09fd37ccf460d4f877538a77465c505d625e","observation_id":"c940f089-b709-429f-a25c-7b6c9cbfae40","resolution":{"observed_at":"2026-08-06T19:54:26.040335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1104.4153","last_updated":"2011-04-21T01:39:25Z","snapshot_observed_at":"2026-07-06T02:26:40.487677Z","submitted_at":"2011-04-21T01:39:25Z","title":"Learning invariant features through local space contraction","version":1},"cited_work":{"arxiv_id":"1104.4153","doi":null,"metadata_source":"pith","pith_arxiv_id":"1104.4153","snapshot_observed_at":"2026-08-06T19:54:23.486236Z","title":"Learning invariant features through local space contraction","venue":"cs.AI","work_id":"a5766a64-e376-48bf-9300-d0e72c5ae6d0","year":2011},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:22.160725Z"},"links":{"cited_paper":"/paper/1104.4153","citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:9711a14bbc128cac9b9bf07a36a7df8f76227342427dface857216d66658e16d","observation_id":"99cedca0-0a6e-4d5e-8a96-00c7bd52a4a5","resolution":{"observed_at":"2026-08-06T19:54:23.571366Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:54:25.219278Z","title":"22 Lili Mou, Ran Jia, Yan Xu, Ge Li, Lu Zhang, and Zhi Jin","venue":null,"work_id":"92f5a307-9a1b-4aab-a3ab-1088c44be8ba","year":2015},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:22.096394Z"},"links":{"citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:24b70c4ee1a40af6f2799656262d37ee563b3d5a0c212bc4c355ec58aa0fd520","observation_id":"dedeb374-758d-4c71-ba87-dc2794a790db","resolution":{"observed_at":"2026-08-06T19:54:25.344066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:54:25.447107Z","title":"Learning markov network structure with decision trees.2010 IEEE International Conference on Data Mining,","venue":null,"work_id":"27bbfefe-0051-4117-a6f2-61a92714ec10","year":2010},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:21.980855Z"},"links":{"citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:26cdb268fb2d2ceb0314237683221e5b3acf814b2620020641ae96760460b8dd","observation_id":"6a4d4a62-e8e9-4069-8005-b61ac9387c40","resolution":{"observed_at":"2026-08-06T19:54:25.518411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1708.07747","last_updated":"2017-09-15T21:29:49Z","snapshot_observed_at":"2026-07-06T05:56:41.814255Z","submitted_at":"2017-08-25T14:01:29Z","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.07747","snapshot_observed_at":"2026-08-06T19:54:22.416141Z","title":"Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms.arXiv preprint arXiv:1708.07747,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:22.416141Z"},"links":{"cited_paper":"/paper/1708.07747","citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:52efdb577935135508de414986888413a6a31dd53c733dd54dd15a26145c01cb","observation_id":"d08ff380-3b03-490a-84ee-3e880c888ceb","resolution":{"observed_at":"2026-08-06T19:54:22.416141Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.10650","last_updated":"2021-03-16T18:33:19Z","snapshot_observed_at":"2026-08-03T08:00:26.366369Z","submitted_at":"2020-11-20T21:35:31Z","title":"Very Deep VAEs Generalize Autoregressive Models and Can Outperform Them on Images","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.10650","snapshot_observed_at":"2026-08-06T19:54:21.024377Z","title":"Very deep vaes generalize autoregressive models and can outperform them on images.arXiv preprint arXiv:2011.10650, abs/2011.10650,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:21.024377Z"},"links":{"cited_paper":"/paper/2011.10650","citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:724e2624d23524933ae3be564255fd0e888fd9c976a370df696fae167b47e2be","observation_id":"e1960aaf-e50d-4481-9635-ba524d44ce1a","resolution":{"observed_at":"2026-08-06T19:54:21.024377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12847","last_updated":"2024-11-19T20:31:53Z","snapshot_observed_at":"2026-07-06T19:52:51.053162Z","submitted_at":"2024-11-19T20:31:53Z","title":"mDAE : modified Denoising AutoEncoder for missing data imputation","version":1},"cited_work":{"arxiv_id":"2411.12847","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.12847","snapshot_observed_at":"2026-08-06T19:54:23.919378Z","title":"mDAE : modified Denoising AutoEncoder for missing data imputation","venue":"cs.LG","work_id":"4138e04f-4316-4754-9765-ac2ee5994ecb","year":2024},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:21.200174Z"},"links":{"cited_paper":"/paper/2411.12847","citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:c7095162cee29c585f9178e2317d0752305bb5de9da7fee98abbedc805ecf3ff","observation_id":"7d636746-cc97-4558-bac4-4e80a720b562","resolution":{"observed_at":"2026-08-06T19:54:24.040768Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10544","last_updated":"2024-02-16T10:58:18Z","snapshot_observed_at":"2026-07-06T15:28:57.284717Z","submitted_at":"2023-05-17T20:02:08Z","title":"Tractable Probabilistic Graph Representation Learning with Graph-Induced Sum-Product Networks","version":2},"cited_work":{"arxiv_id":"2305.10544","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.10544","snapshot_observed_at":"2026-08-06T19:54:23.696740Z","title":"Tractable Probabilistic Graph Representation Learning with Graph-Induced Sum-Product Networks","venue":"cs.LG","work_id":"3096b965-3ed8-426b-a0be-98122132ffea","year":2023},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:21.379934Z"},"links":{"cited_paper":"/paper/2305.10544","citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:570036df8a734ac1da7a8636868a27450a774e94f1fdc093eddbe3feebfd16b8","observation_id":"cf825e0e-0c83-418f-94e9-9df954eb0c6c","resolution":{"observed_at":"2026-08-06T19:54:23.790024Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:54:25.621228Z","title":"Grammar variational autoencoder","venue":null,"work_id":"e29cdbb6-e81e-44c1-89b6-5c8ebdcb8a65","year":1945},"citing_paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-06T19:54:21.653288Z"},"links":{"citing_paper":"/paper/2507.04385"},"observation_digest":"sha256:616c32f8414f7b09ac877d82f5644ce39c76d8a20cd4b6fde6391db56f4ec40a","observation_id":"3b485c4a-e711-48ca-b7d7-224ee9a3eb5b","resolution":{"observed_at":"2026-08-06T19:54:25.758902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2507.04385","last_updated":"2025-07-26T11:51:01Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T03:08:13.951869Z","submitted_at":"2025-07-06T13:17:16Z","title":"Tractable Representation Learning with Probabilistic Circuits"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":4,"verified_fuzzy":7},"total_outbound_references":20},"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 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2507.04385."}