{"as_of":"2026-08-09T19:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c8189c8ceedf2d97e1f5243a9ddb3cfe89d50285d20984979eb9817eecb6090d","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-09T06:31:02.800959+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-08T02:43:10.472872Z","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:8ffb82114b228b909c8b515617411521dd2d2924d2ef3bee6c5ae2504b7c6894","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T02:43:10.472872Z","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:973eb7016548c7530dd2604d80b6ea8f22385f792d5993da643da23149def50d","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T02:43:10.472872Z","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:ce0bf53760715dd053f9ba7a41c8c7111a8d361c0e8625cbc1ff8a6de9c0cd41","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-08T02:43:10.472872Z","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:794989c32b7ed1791022f8e699dc4fa884bf01afc976fd75db482ec3aefdb1b5","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T02:43:10.472872Z","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:08ad6c7dd3513a00a7a71097dfc38ecb6d784c60d0946e91fd8233b3e5a8d47c","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-08T02:43:10.472872Z","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:ca56b19de9235b46a95c5bd0af8815d9a8a21ee86074171dad44dc3bbefd315a","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.03365","last_updated":"2016-06-04T09:51:30Z","snapshot_observed_at":"2026-08-08T13:26:17.517503Z","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-08T02:43:10.472872Z","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:2f02fd5a10d96aa583c34f00d1878bb2cb1c3c6c904e5deeafba08c248a0c10f","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-08T02:43:10.472872Z","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:faa3723593e7c8366418273f1f4278c421e063d3f1acdd26eb97abdebadd5a30","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-08T02:43:10.472872Z","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:d90099a80d8b9465494d3dfae8449f8eccc31c29e1deed5e5c014052bbeaf630","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T02:43:10.472872Z","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:a6034d924f9e431b7ae8f1f882f28cfd0785e80f962fe93b646e45d0c9a3da91","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T02:43:10.472872Z","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:37340b1b106a79e66d87c638c116ea47d72cc358fe407541d1b03a81488f38fd","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T02:43:10.472872Z","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:8d90f442c976a9b439b791203cad4ba9a88fe1af82bc176b4836224bdbc623e2","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T02:43:10.472872Z","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:8b4f91932992cdb9672a1df3bdc6f0104b1c1d7bfc17383acd412c09377c4df1","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T02:43:10.472872Z","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:e28de82475369d71c1528406b6772c707e3ecaac58e08b1fb570e3b6e00848dc","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T02:43:10.472872Z","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:4ee858a89a9cdd486c57dc5c25c64557eb41567fc9b4da65838568ca2b15d32c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T02:43:10.472872Z","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:4803d5f945c3250190767c60f536c3bcbe525660134edf52fe8ee3e6c27060a7","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-07T10:37:36.859772Z","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-08T02:43:10.472872Z","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:11fc580e4c8093b7060a430a5184f1593eca208d54f8766d512434673b818493","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-08T02:43:10.472872Z","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:5c7c2cdbf3f6a426e3b026fe21d3ee09e56282a8046959a0f346761adb4f5f73","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T02:43:10.472872Z","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:ba0dfd25ee5a0584f8e4c8a73b058609d1f356d204d778f1ef95939ede38c48f","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T02:43:10.472872Z","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:7273184146480fdef1e35c271419b6339c9406705e26ae471d0a72131488259c","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-08T02:43:10.472872Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2507.04385."}