{"as_of":"2026-08-14T20:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ff87f10399ae9db88d454fe39b5a8e1ed97f61bd693c79015a3b0bdbb348cd6a","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T01:02:34.708820Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2506.12383/citation-record","integrity":"/paper/2506.12383/integrity","json":"/paper/2506.12383/citation-record.json","paper":"/paper/2506.12383"},"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-07T01:02:35.292165Z","title":"•B(i, D)is a block-diagonal matrix with block size D 2i−1 × D 2i−1 , where each block is aB 1, D 2i−1 butterfly factor","venue":null,"work_id":"e6ab12b2-061a-4d7b-abda-29c057cbbbab","year":2022},"citing_paper":{"arxiv_id":"2506.12383","last_updated":"2025-06-14T07:39:15Z","snapshot_observed_at":"2026-08-13T19:36:40.937086Z","submitted_at":"2025-06-14T07:39:15Z","title":"Scaling Probabilistic Circuits via Monarch Matrices","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T01:02:34.635224Z"},"links":{"citing_paper":"/paper/2506.12383"},"observation_digest":"sha256:a6aa0efc9804dc8fefc9f58e812236e320ad9034cb68e2bee44d70c57f9311e4","observation_id":"3fdd1c60-64cd-4368-b9fd-befd241ec300","resolution":{"observed_at":"2026-08-07T01:02:35.368833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T01:02:35.117575Z","title":"Notice that the delta functions require (for a non-zero entry) that j(i) c =j (i+1) c whenever c̸=i","venue":null,"work_id":"e8217129-ddaa-41a8-8d30-4fc737b1c501","year":2024},"citing_paper":{"arxiv_id":"2506.12383","last_updated":"2025-06-14T07:39:15Z","snapshot_observed_at":"2026-08-13T19:36:40.937086Z","submitted_at":"2025-06-14T07:39:15Z","title":"Scaling Probabilistic Circuits via Monarch Matrices","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T01:02:34.708820Z"},"links":{"citing_paper":"/paper/2506.12383"},"observation_digest":"sha256:b1c1d43dc60abe1603c76a1cde788c0d351b7ca86723e06ebf6a7a46efcee2a1","observation_id":"672d8034-897e-4b99-9496-6041666d9388","resolution":{"observed_at":"2026-08-07T01:02:35.228639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11415","last_updated":"2025-02-20T20:51:09Z","snapshot_observed_at":"2026-08-12T22:22:56.145154Z","submitted_at":"2024-10-15T09:02:55Z","title":"KLay: Accelerating Arithmetic Circuits for Neurosymbolic AI","version":3},"cited_work":{"arxiv_id":"2410.11415","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.11415","snapshot_observed_at":"2026-08-07T01:02:34.920862Z","title":"KLay: Accelerating Arithmetic Circuits for Neurosymbolic AI","venue":"cs.LG","work_id":"69e8aa1d-70f5-4197-8682-3caaa3c67e40","year":2024},"citing_paper":{"arxiv_id":"2506.12383","last_updated":"2025-06-14T07:39:15Z","snapshot_observed_at":"2026-08-13T19:36:40.937086Z","submitted_at":"2025-06-14T07:39:15Z","title":"Scaling Probabilistic Circuits via Monarch Matrices","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T01:02:34.180007Z"},"links":{"cited_paper":"/paper/2410.11415","citing_paper":"/paper/2506.12383"},"observation_digest":"sha256:4fdeb7b99474565f3dc9c65515a561560d84c0558d7eb97f43e7dc0a5052e664","observation_id":"677c8c57-d6b6-486c-83e7-3658458fdfd3","resolution":{"observed_at":"2026-08-07T01:02:34.999378Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.3005","last_updated":"2014-03-04T18:30:26Z","snapshot_observed_at":"2026-08-05T11:04:54.095339Z","submitted_at":"2013-12-11T00:25:57Z","title":"One Billion Word Benchmark for Measuring Progress in Statistical Language Modeling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.3005","snapshot_observed_at":"2026-08-07T01:02:33.661816Z","title":"One billion word benchmark for measuring progress in statistical language modeling","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.12383","last_updated":"2025-06-14T07:39:15Z","snapshot_observed_at":"2026-08-13T19:36:40.937086Z","submitted_at":"2025-06-14T07:39:15Z","title":"Scaling Probabilistic Circuits via Monarch Matrices","version":1},"reference_index":1970,"source":"pdf_text","source_observed_at":"2026-08-07T01:02:33.661816Z"},"links":{"cited_paper":"/paper/1312.3005","citing_paper":"/paper/2506.12383"},"observation_digest":"sha256:e2a420aef448651343f4e7f23d2756cd5bce4c644a30193798fa3000e7065427","observation_id":"38fda189-99d3-42c5-a9cc-81a66f310931","resolution":{"observed_at":"2026-08-07T01:02:33.661816Z","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-07T01:02:35.875261Z","title":"On the latent variable interpretation in sum-product networks","venue":null,"work_id":"7154ca2c-694d-408f-8a1f-130be0e06085","year":null},"citing_paper":{"arxiv_id":"2506.12383","last_updated":"2025-06-14T07:39:15Z","snapshot_observed_at":"2026-08-13T19:36:40.937086Z","submitted_at":"2025-06-14T07:39:15Z","title":"Scaling Probabilistic Circuits via Monarch Matrices","version":1},"reference_index":1995,"source":"pdf_text","source_observed_at":"2026-08-07T01:02:34.347373Z"},"links":{"citing_paper":"/paper/2506.12383"},"observation_digest":"sha256:768b83bccea9bf1ceba87ccc9261c19c68a82d94e19b898d85eeb7782fe75b43","observation_id":"08299f58-a6dc-46db-b107-70a10a0e366a","resolution":{"observed_at":"2026-08-07T01:02:35.970058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T01:02:36.088059Z","title":"Accessed: 2024-12-1","venue":null,"work_id":"7bc1bf45-dc84-48bb-934e-915646e98e88","year":2024},"citing_paper":{"arxiv_id":"2506.12383","last_updated":"2025-06-14T07:39:15Z","snapshot_observed_at":"2026-08-13T19:36:40.937086Z","submitted_at":"2025-06-14T07:39:15Z","title":"Scaling Probabilistic Circuits via Monarch Matrices","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-07T01:02:34.267989Z"},"links":{"citing_paper":"/paper/2506.12383"},"observation_digest":"sha256:0f66bdbd614d23e57237f17a8cfb87d2c466b9ca6600e2bce8f1ca13f7cd910e","observation_id":"d9e7c3d5-a427-4027-ab3b-98de74135178","resolution":{"observed_at":"2026-08-07T01:02:36.186734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T01:02:36.305055Z","title":"Tractable learning for structured probability spaces: A case study in learning preference distributions","venue":null,"work_id":"e0b519bb-c027-4035-ac81-59dfc1d2b342","year":2015},"citing_paper":{"arxiv_id":"2506.12383","last_updated":"2025-06-14T07:39:15Z","snapshot_observed_at":"2026-08-13T19:36:40.937086Z","submitted_at":"2025-06-14T07:39:15Z","title":"Scaling Probabilistic Circuits via Monarch Matrices","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-07T01:02:33.727356Z"},"links":{"citing_paper":"/paper/2506.12383"},"observation_digest":"sha256:e2e8d9a0b66024194e4a6cf6c29b4a108d77f863e5b07797cf3010ce82d4a753","observation_id":"7717dc48-9b4b-41fb-a835-d52fc7cfa999","resolution":{"observed_at":"2026-08-07T01:02:36.417151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-07T01:02:33.962789Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.12383","last_updated":"2025-06-14T07:39:15Z","snapshot_observed_at":"2026-08-13T19:36:40.937086Z","submitted_at":"2025-06-14T07:39:15Z","title":"Scaling Probabilistic Circuits via Monarch Matrices","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T01:02:33.962789Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/2506.12383"},"observation_digest":"sha256:fdad91ac0929ecb5344978ca7fa41fe7a1232d87ee5323e613cbfea204e3d742","observation_id":"35cac194-764e-4423-8fef-6863103aea13","resolution":{"observed_at":"2026-08-07T01:02:33.962789Z","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-07T01:02:35.644051Z","title":"Interpolating Butterfly and Monarch Matrices Butterfly matrices (Dao et al., 2019; Meng et al.,","venue":null,"work_id":"eba2849c-9351-4fc8-bcd8-83eb63c87ebe","year":2019},"citing_paper":{"arxiv_id":"2506.12383","last_updated":"2025-06-14T07:39:15Z","snapshot_observed_at":"2026-08-13T19:36:40.937086Z","submitted_at":"2025-06-14T07:39:15Z","title":"Scaling Probabilistic Circuits via Monarch Matrices","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T01:02:34.476427Z"},"links":{"citing_paper":"/paper/2506.12383"},"observation_digest":"sha256:508c89fdd036db0d79a13a0aa136bc24c4fba74e87bb9102d1e47e3b2bd4aa16","observation_id":"ff58e531-db7c-4230-ae26-4fea52fd4e1a","resolution":{"observed_at":"2026-08-07T01:02:35.770609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.07953","last_updated":"2025-02-03T17:00:48Z","snapshot_observed_at":"2026-08-12T22:46:21.303434Z","submitted_at":"2024-09-12T11:32:01Z","title":"What is the Relationship between Tensor Factorizations and Circuits (and How Can We Exploit it)?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.07953","snapshot_observed_at":"2026-08-07T01:02:34.081854Z","title":"Scaling up probabilistic circuits by latent variable distillation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.12383","last_updated":"2025-06-14T07:39:15Z","snapshot_observed_at":"2026-08-13T19:36:40.937086Z","submitted_at":"2025-06-14T07:39:15Z","title":"Scaling Probabilistic Circuits via Monarch Matrices","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T01:02:34.081854Z"},"links":{"cited_paper":"/paper/2409.07953","citing_paper":"/paper/2506.12383"},"observation_digest":"sha256:252690dffc846b6d14a54e1d4404a6f7f306e9ccfb1aae9bec57c695abf0766a","observation_id":"3afe4318-3094-4fb5-9f2f-98b4d3dfbc16","resolution":{"observed_at":"2026-08-07T01:02:34.081854Z","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-07T01:02:35.439610Z","title":"They are constructed as the product of sparse matrices known as butterfly factor matrices (Parker, 1995)","venue":null,"work_id":"4a51b9e7-0376-4ee0-b1d4-6c463160ac38","year":1995},"citing_paper":{"arxiv_id":"2506.12383","last_updated":"2025-06-14T07:39:15Z","snapshot_observed_at":"2026-08-13T19:36:40.937086Z","submitted_at":"2025-06-14T07:39:15Z","title":"Scaling Probabilistic Circuits via Monarch Matrices","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T01:02:34.547462Z"},"links":{"citing_paper":"/paper/2506.12383"},"observation_digest":"sha256:13c6fdce3bd139bf0432f447b3b4b43e52a2de50d561f5734f2e28a9af9adf13","observation_id":"77ecbc51-04c3-45b4-889f-8af44a6b1d7f","resolution":{"observed_at":"2026-08-07T01:02:35.511016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.05379","last_updated":"2021-10-22T13:44:01Z","snapshot_observed_at":"2026-08-06T03:07:17.178592Z","submitted_at":"2021-02-10T11:04:17Z","title":"Argmax Flows and Multinomial Diffusion: Learning Categorical Distributions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.05379","snapshot_observed_at":"2026-08-07T01:02:33.848281Z","title":"Argmax flows and multinomial diffusion: Towards non-autoregressive language models.arXiv preprint arXiv:2102.05379, 3(4):5,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.12383","last_updated":"2025-06-14T07:39:15Z","snapshot_observed_at":"2026-08-13T19:36:40.937086Z","submitted_at":"2025-06-14T07:39:15Z","title":"Scaling Probabilistic Circuits via Monarch Matrices","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T01:02:33.848281Z"},"links":{"cited_paper":"/paper/2102.05379","citing_paper":"/paper/2506.12383"},"observation_digest":"sha256:11e1885a0328faa3703bf9b4f082ff6fc65a9c9d4f603a236f73d7055f5c4956","observation_id":"7a17d95a-4c41-4809-8588-ffcaf6563a89","resolution":{"observed_at":"2026-08-07T01:02:33.848281Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12256","last_updated":"2025-04-30T06:42:02Z","snapshot_observed_at":"2026-08-14T16:46:16.961258Z","submitted_at":"2024-11-19T06:10:22Z","title":"Restructuring Tractable Probabilistic Circuits","version":2},"cited_work":{"arxiv_id":"2411.12256","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.12256","snapshot_observed_at":"2026-08-07T01:02:34.801186Z","title":"Restructuring Tractable Probabilistic Circuits","venue":"cs.AI","work_id":"cade598a-6ca6-4d96-b9fc-8ce63c06c160","year":2024},"citing_paper":{"arxiv_id":"2506.12383","last_updated":"2025-06-14T07:39:15Z","snapshot_observed_at":"2026-08-13T19:36:40.937086Z","submitted_at":"2025-06-14T07:39:15Z","title":"Scaling Probabilistic Circuits via Monarch Matrices","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T01:02:34.407739Z"},"links":{"cited_paper":"/paper/2411.12256","citing_paper":"/paper/2506.12383"},"observation_digest":"sha256:fcde51e33b016a84fdb983f94e70789f91e4a59f5b0f446d0020220a0eb0fdb0","observation_id":"4006c374-94fe-4da8-95f7-e55f6b6ff229","resolution":{"observed_at":"2026-08-07T01:02:34.870777Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.12383","last_updated":"2025-06-14T07:39:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T19:36:40.937086Z","submitted_at":"2025-06-14T07:39:15Z","title":"Scaling Probabilistic Circuits via Monarch Matrices"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":7},"total_outbound_references":13},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2506.12383."}