{"as_of":"2026-08-07T10:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0d73aba1bd87280dcbbf58fc0c83359bcfa2a2b1e8db2371b1198faacb978725","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:39:51.878860Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"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/2508.06706/citation-record","integrity":"/paper/2508.06706/integrity","json":"/paper/2508.06706/citation-record.json","paper":"/paper/2508.06706"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.13482","last_updated":"2023-03-04T20:10:22Z","snapshot_observed_at":"2026-08-04T13:48:33.644944Z","submitted_at":"2023-02-27T02:40:05Z","title":"PyReason: Software for Open World Temporal Logic","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13482","snapshot_observed_at":"2026-08-05T22:39:51.683918Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.683918Z"},"links":{"cited_paper":"/paper/2302.13482","citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:6501e3e413b7baa65ff621d434e2b745972dec4aec88aaafff4971a1281affbf","observation_id":"0c91db9c-6e5c-4bc6-bbf5-324f73656a56","resolution":{"observed_at":"2026-08-05T22:39:51.683918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13111","last_updated":"2024-10-17T00:49:53Z","snapshot_observed_at":"2026-07-06T19:34:59.826604Z","submitted_at":"2024-10-17T00:49:53Z","title":"Controllable Generation via Locally Constrained Resampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13111","snapshot_observed_at":"2026-08-05T22:39:51.688969Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.688969Z"},"links":{"cited_paper":"/paper/2410.13111","citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:5417ca7d16ea7f2e4cb51719d509a79886db08fb77a463f8142168f69d4d0c55","observation_id":"e71510d3-554c-47c1-9e2b-de4e601eb46d","resolution":{"observed_at":"2026-08-05T22:39:51.688969Z","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-05T22:39:52.811855Z","title":null,"venue":null,"work_id":"3d6162cc-8990-4e5f-8e52-a6c265406c9e","year":2022},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.694049Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:57f60c956d9e3470a69d642abf0be94e23280a43af5dca0e04bbb57db32ca7fa","observation_id":"0e0513aa-92af-458d-9206-2863ff62a5a7","resolution":{"observed_at":"2026-08-05T22:39:52.816202Z","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-05T22:39:52.797957Z","title":null,"venue":null,"work_id":"474c62e7-673d-4585-99ca-d80ca314fdf6","year":2022},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.698940Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:0d413fb4e34710ae98b83aff77caf354cb286265715791b29723b08a6a1ae6f9","observation_id":"59e48360-6485-4316-ac3e-0673e4a97296","resolution":{"observed_at":"2026-08-05T22:39:52.802087Z","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-05T22:39:52.782571Z","title":"d.; Serafini, L.; and Spranger, M","venue":null,"work_id":"a49eb60f-43c5-4659-953f-cca6104f5f5a","year":2022},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.703680Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:f69955d2634c767772827b85cec05e6445ac2608ad1f754c239c987fc5eb1f21","observation_id":"903152c2-e3ee-4441-b963-4ceb7a958224","resolution":{"observed_at":"2026-08-05T22:39:52.787842Z","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-05T22:39:52.768578Z","title":"M.; and Stuckenschmidt, H","venue":null,"work_id":"d68b7705-e15c-450c-8f25-aed7665875c6","year":2024},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.708144Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:9d0513b74e17a61c995a25fce8100672e42badb51db5df70b34ef962a48ba1de","observation_id":"d214b066-dea4-4f15-8622-cef90887c65f","resolution":{"observed_at":"2026-08-05T22:39:52.773164Z","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-05T22:39:52.754265Z","title":null,"venue":null,"work_id":"7a8482e2-c5fb-4505-b1e3-f960102ec17d","year":2013},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.713347Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:452a7d0e0357ea595bb51048f0821d0352f48905f0eb85bcea2a62eff71d0a2c","observation_id":"fbfdeace-93a2-4fe5-8fb8-0e5aa84b5480","resolution":{"observed_at":"2026-08-05T22:39:52.758314Z","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-05T22:39:52.740460Z","title":null,"venue":null,"work_id":"d464c6ed-a8a1-4e60-9147-1f11a160ab95","year":2013},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.717792Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:67fdc1e6cbbba9a3d15fec76aced4d29884ad0a726d55eec80e6218c0c25ad9b","observation_id":"087f8853-5ef9-495e-a2e7-f8855d0a933c","resolution":{"observed_at":"2026-08-05T22:39:52.744498Z","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-05T22:39:52.726766Z","title":null,"venue":null,"work_id":"d6357a03-f14e-47e0-9949-a7549001642b","year":2023},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.721938Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:69c6c3c3c5b82e2fc9e4f9bc0fa5bdbe8d138e2709fe8bedc89ae5b1db336e88","observation_id":"44dc907b-64cd-43f7-a394-4b9e0f6dfd0a","resolution":{"observed_at":"2026-08-05T22:39:52.731177Z","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":{"arxiv_id":"2303.03581","last_updated":"2023-03-07T01:29:52Z","snapshot_observed_at":"2026-07-06T14:59:31.795484Z","submitted_at":"2023-03-07T01:29:52Z","title":"Neural Compositional Rule Learning for Knowledge Graph Reasoning","version":1},"cited_work":{"arxiv_id":"2303.03581","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.03581","snapshot_observed_at":"2026-08-05T22:39:52.120183Z","title":"Neural Compositional Rule Learning for Knowledge Graph Reasoning","venue":"cs.AI","work_id":"85515481-441f-47fb-884f-839bb503d6c0","year":2023},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.726064Z"},"links":{"cited_paper":"/paper/2303.03581","citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:001308b45b442b6eb513ac1c3a1806773a2d655648ec11997dd1b2c450677f03","observation_id":"25a106c4-b61b-48dd-9acf-56535be8a321","resolution":{"observed_at":"2026-08-05T22:39:52.125272Z","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-05T22:39:52.712976Z","title":null,"venue":null,"work_id":"d6044a4a-3a13-4571-be70-9566bd5b199f","year":2020},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.730434Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:715fd9b95e1a6ce43d47d6b479fddc7d4dd9ba87e3f1e6be718a640ce0d04f40","observation_id":"d191513e-a7d0-4e49-ac37-02f7c57120d3","resolution":{"observed_at":"2026-08-05T22:39:52.717345Z","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-05T22:39:52.698604Z","title":null,"venue":null,"work_id":"74b87d78-6ea4-47bb-adb5-00d577516685","year":2018},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.735109Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:c1ce7c2157c0bcfbf2ca4e261400bca1fe2f3bfb8c3bc03a8f5d74a65ef4ddee","observation_id":"26f36069-017f-4f01-befc-5dde00cac0cc","resolution":{"observed_at":"2026-08-05T22:39:52.703242Z","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-05T22:39:52.683939Z","title":null,"venue":null,"work_id":"b4fc22a4-dfa7-4902-8d00-726afc5592b5","year":2021},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.739408Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:3629e3d40e4c815c99747585b300180fb478734c51080e14bcb9633b8ff03819","observation_id":"c8ff2c4e-516e-4e7c-af69-6e63356ca25d","resolution":{"observed_at":"2026-08-05T22:39:52.688320Z","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-05T22:39:52.669619Z","title":null,"venue":null,"work_id":"0b2abd4b-e9cc-4d52-a2dc-5dfff45926b5","year":2015},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.743395Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:293164cf677e17822d168d1a550fde14f9e93dadaaed49c625a1fdf4e1cfa5b5","observation_id":"f27402cc-72e8-40e1-8a10-2d05c191bd63","resolution":{"observed_at":"2026-08-05T22:39:52.674165Z","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-05T22:39:52.655072Z","title":null,"venue":null,"work_id":"27ce7f5a-002b-45a6-b369-9dabb453f320","year":2018},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.747720Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:55b3d6d009f4aa69b22261fcf019c1642ce760bdaa6cd1b90b029744ad181cd2","observation_id":"cd4dc9e9-a967-43b3-b5ea-09d05a1edd8a","resolution":{"observed_at":"2026-08-05T22:39:52.659644Z","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-05T22:39:52.640569Z","title":null,"venue":null,"work_id":"9532ad18-9737-4b34-9610-184f5fc26404","year":2018},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.752406Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:73b3e417bae08c1c624efe42e10f691de16a03360730c94f10a15aa7ed413930","observation_id":"fd2c1200-02df-47f4-b5df-9bec6bcdbed4","resolution":{"observed_at":"2026-08-05T22:39:52.644800Z","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":"2409.16238","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:39:52.094842Z","title":null,"venue":null,"work_id":"93ac613f-ead3-4c9a-bbed-5265a7df686e","year":2024},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.756478Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:004c90e969505af3b3d467294f7265f1900a09b40add6ad9c2d3314198a3c29c","observation_id":"771ba8a5-161b-4924-92d9-58ee130fd8a0","resolution":{"observed_at":"2026-08-05T22:39:52.103513Z","resolver_source":"raw_fallback","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-05T22:39:52.626484Z","title":null,"venue":null,"work_id":"1bd1872a-442d-49cb-92be-69b09e2abf53","year":2015},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.760662Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:f9ccae438f09ac045bdfe9d6e490d171c3305b31a198e591b4bcd9cd961ad15c","observation_id":"a582b9e4-143b-4471-9b9f-dac3ef3c3357","resolution":{"observed_at":"2026-08-05T22:39:52.630657Z","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-05T22:39:52.613090Z","title":"A.; Teflioudi, C.; Hose, K.; and Suchanek, F","venue":null,"work_id":"feb4f88d-dcde-41b0-a9e8-d2cb7ff232dc","year":2013},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.764798Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:6679c90dc4ebc999ba982bb459a78a7b83fe24a3fbd3cca532e76661e5289915","observation_id":"1dc0904a-4724-4001-bfc6-01551672ca1b","resolution":{"observed_at":"2026-08-05T22:39:52.617201Z","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-05T22:39:52.598595Z","title":null,"venue":null,"work_id":"97fc08d9-eb77-4c71-92f4-482e189d8208","year":2020},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.768951Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:b5fc2781312c08e94993525bb9d0fb92449fdfa398cdea4f73f4fa7753ddda07","observation_id":"860da8df-8216-4d8a-b140-708ce7813e02","resolution":{"observed_at":"2026-08-05T22:39:52.603489Z","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-05T22:39:52.584598Z","title":null,"venue":null,"work_id":"707a0562-a819-485a-87ce-2e37963df14f","year":1977},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.772945Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:0aa1f528fd676cd8389476d7c53c06e573179ededcf9a86ae46dfd9cd6ca5ca1","observation_id":"10426544-d061-47db-8b37-8f2ee0397d5c","resolution":{"observed_at":"2026-08-05T22:39:52.588770Z","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-05T22:39:52.570853Z","title":null,"venue":null,"work_id":"2002c870-4f13-401e-a3f6-7f0c977520ce","year":2019},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.776953Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:50ac70064a9735e055be8cd82a5949d733723abb09d67d40fb2effd17a8d77c6","observation_id":"4a03bac2-f906-4f31-9403-0b088d206922","resolution":{"observed_at":"2026-08-05T22:39:52.574961Z","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":{"arxiv_id":"2403.13312","last_updated":"2024-03-20T05:29:06Z","snapshot_observed_at":"2026-07-06T17:47:30.518562Z","submitted_at":"2024-03-20T05:29:06Z","title":"LeanReasoner: Boosting Complex Logical Reasoning with Lean","version":1},"cited_work":{"arxiv_id":"2403.13312","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.13312","snapshot_observed_at":"2026-08-05T22:39:52.014524Z","title":"LeanReasoner: Boosting Complex Logical Reasoning with Lean","venue":"cs.CL","work_id":"6e99af12-9b69-4c74-8cf4-f6356b2fd738","year":2024},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.780904Z"},"links":{"cited_paper":"/paper/2403.13312","citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:73978ccb56b850306fc409fce9f69d70ea97c21c461c4a29d99f1c9d73e44ea9","observation_id":"9acfe454-2b68-445b-a150-3c452d4ac173","resolution":{"observed_at":"2026-08-05T22:39:52.019717Z","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-05T22:39:52.556591Z","title":"V.; Nau, D.; Sliva, A.; Simari, G","venue":null,"work_id":"35fdd6fe-4107-4a88-9cdc-daf76ff2424d","year":2007},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.785253Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:1676666651bbe570d71b615ede152fef3a3b72574fc338da5356b170df77b36c","observation_id":"c84f2f18-9cdc-427e-8df6-a942b8b77b2a","resolution":{"observed_at":"2026-08-05T22:39:52.560908Z","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-05T22:39:52.542826Z","title":null,"venue":null,"work_id":"1f5b7bbd-b87f-45e0-81d8-deafbd8d6aad","year":2007},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.789106Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:b93780c0c1181e65847fb5f8fa69b6a19b741c01ada5b2648549ee37b61f9320","observation_id":"4b61aeb5-c340-40fd-8e2b-aacb70678bf7","resolution":{"observed_at":"2026-08-05T22:39:52.547203Z","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-05T22:39:52.528873Z","title":null,"venue":null,"work_id":"61bfb497-c0e3-4748-8c87-290eb57c9fd1","year":2021},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.792917Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:78dd70a8cc2016f8f55d9861af810db6584c5fdbaee17544e747e95d43cdec46","observation_id":"fa03e82c-2ff1-4800-99b5-fe469e2732f3","resolution":{"observed_at":"2026-08-05T22:39:52.533043Z","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-05T22:39:52.513854Z","title":null,"venue":null,"work_id":"87769a1b-eefd-4f9a-ba79-a9505bff2624","year":2025},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.796940Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:40d1cf935aea69396dea48ad1a4f09529f57f94922165d1adf4b4118683a3048","observation_id":"29e98bff-202c-4976-8af5-27f9e96d9823","resolution":{"observed_at":"2026-08-05T22:39:52.518251Z","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-05T22:39:52.499509Z","title":null,"venue":null,"work_id":"86e06b2f-b96d-4bb9-8454-691fff8b4ba9","year":2023},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.801291Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:0158a5acc3eeb66c7f34e9273e5a2e05e701413e87b9318cc4684bd9e2a2ad88","observation_id":"908a708f-caf8-4bc7-9810-04df5b1139ae","resolution":{"observed_at":"2026-08-05T22:39:52.503690Z","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-05T22:39:52.484805Z","title":null,"venue":null,"work_id":"68acccda-d2a6-4a39-9e5f-07aa1925113c","year":2018},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.805581Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:39b57f4ab0934301bf4d0e454784c9acc08e91fe8c02d27121e1940fe4fcfc1c","observation_id":"98dac1a5-efac-4658-8564-6316649aa5e8","resolution":{"observed_at":"2026-08-05T22:39:52.489407Z","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":{"arxiv_id":"2004.04412","last_updated":"2020-04-09T08:15:39Z","snapshot_observed_at":"2026-07-06T09:11:08.325778Z","submitted_at":"2020-04-09T08:15:39Z","title":"Reinforced Anytime Bottom Up Rule Learning for Knowledge Graph Completion","version":1},"cited_work":{"arxiv_id":"2004.04412","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.04412","snapshot_observed_at":"2026-08-05T22:39:51.991646Z","title":"Reinforced Anytime Bottom Up Rule Learning for Knowledge Graph Completion","venue":"cs.AI","work_id":"99533b55-04e2-4ff9-a30c-a8c78c07320f","year":2020},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.809934Z"},"links":{"cited_paper":"/paper/2004.04412","citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:214288b3971c75b88398cf0885f1553284bedbe3c6d44c671e0c3d536d540514","observation_id":"d2b875dc-0b4a-4a9d-91a7-eb907eba807b","resolution":{"observed_at":"2026-08-05T22:39:51.996450Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"1712.02121","last_updated":"2018-03-13T07:45:20Z","snapshot_observed_at":"2026-07-31T00:45:43.000232Z","submitted_at":"2017-12-06T10:41:47Z","title":"A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.02121","snapshot_observed_at":"2026-08-05T22:39:51.814251Z","title":"Q.; Nguyen, T","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.814251Z"},"links":{"cited_paper":"/paper/1712.02121","citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:c86e5f1d98387384220d8583966294f25cb67e1d8ca5b8497ca18c774d7e26ce","observation_id":"cf43f08e-3022-4b9b-92bf-133d9082aa9f","resolution":{"observed_at":"2026-08-05T22:39:51.814251Z","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-05T22:39:52.469341Z","title":null,"venue":null,"work_id":"323c6e43-5173-4135-bfcf-1c63b4a35fd0","year":1986},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.818852Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:76642c9caa9a0b438210d2dc65a56f84f9b889eff09c16c9f54ae5c668d3c58b","observation_id":"5d5c5a96-0a27-4627-bc6f-466929c3e140","resolution":{"observed_at":"2026-08-05T22:39:52.474067Z","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-05T22:39:52.455087Z","title":"G.; Wang, K.; and Wang, Z","venue":null,"work_id":"afcd991b-4675-4a36-a49a-7bf8e96f5b08","year":2018},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.822710Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:b86b421bf89e060a66b38637f4814762029d96a494fb401dd7c143612c16a22a","observation_id":"cfe927a8-bb81-42c5-8f4d-a7cf6e9e1527","resolution":{"observed_at":"2026-08-05T22:39:52.459337Z","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-05T22:39:52.440606Z","title":null,"venue":null,"work_id":"1e1c26c9-e184-4949-ab0d-b86d4396fbf3","year":2021},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.826720Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:1ceb6181894bf24993aceaf5f50bd6a49e72f31eaadad8cbc8b5fe641b0c215a","observation_id":"b27a34ff-3d05-4dcd-a884-fd7ae7fec796","resolution":{"observed_at":"2026-08-05T22:39:52.444696Z","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-05T22:39:52.426379Z","title":null,"venue":null,"work_id":"b13dff52-4d69-4246-b595-c9d18d0d3358","year":1980},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.830715Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:a6bd875738689d6d2bf964c1e3334d253e22d4fc87dfd38fb5e256b5f9427eeb","observation_id":"45ce3ffe-6883-40bb-a286-a21bd9f68892","resolution":{"observed_at":"2026-08-05T22:39:52.430647Z","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-05T22:39:52.412619Z","title":null,"venue":null,"work_id":"c50a154d-4a15-425b-8e95-4b423b734864","year":2020},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.835012Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:874974dd1d7befd3ca1bbd9adb2974bee1b512f5e83f98e705335c685525212e","observation_id":"6c46bbf1-4e54-4baf-9eec-19adec7c552e","resolution":{"observed_at":"2026-08-05T22:39:52.416531Z","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-05T22:39:52.398001Z","title":"I.; and Subrahmanian, V","venue":null,"work_id":"bd2cc14d-b6d1-4316-9ca7-ecb85276d49c","year":2012},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.839511Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:db2515d8c3086d585b5a0eb2ba351f02ad6e8f441f175907e14d17736585088b","observation_id":"f01870e6-c528-4325-979c-ddeaad2c8e3a","resolution":{"observed_at":"2026-08-05T22:39:52.402337Z","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":"2110.03395","last_updated":"2021-11-23T13:47:56Z","snapshot_observed_at":"2026-08-03T17:29:32.684581Z","submitted_at":"2021-10-07T12:35:55Z","title":"SLASH: Embracing Probabilistic Circuits into Neural Answer Set Programming","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.03395","snapshot_observed_at":"2026-08-05T22:39:51.843768Z","title":"S.; and Kersting, K","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.843768Z"},"links":{"cited_paper":"/paper/2110.03395","citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:7b1b2271966307f0c1f5cc2084520a5a2317074f6700ea3fba71dc10b74ed021","observation_id":"ac600620-49c6-4e4a-8c03-d5ca7a4162b5","resolution":{"observed_at":"2026-08-05T22:39:51.843768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.10197","last_updated":"2019-02-26T20:15:09Z","snapshot_observed_at":"2026-08-06T13:43:56.202740Z","submitted_at":"2019-02-26T20:15:09Z","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.10197","snapshot_observed_at":"2026-08-05T22:39:51.848310Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.848310Z"},"links":{"cited_paper":"/paper/1902.10197","citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:a46a3cebc2caee545d05dfdc052987344f58aa3bac70959412d5981cb7df3cdc","observation_id":"dece770d-60d3-441c-ab50-15da5fe01f19","resolution":{"observed_at":"2026-08-05T22:39:51.848310Z","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-05T22:39:52.361510Z","title":null,"venue":null,"work_id":"413064b0-f515-4df2-aec7-6b45a12166f5","year":2015},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.853309Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:75b6c69e07140e8d07e7237dddde45874cf56bef9a351af6aaa5579ef8788cff","observation_id":"403d9ef6-c377-4a8e-b223-e59947c4cad2","resolution":{"observed_at":"2026-08-05T22:39:52.387228Z","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-05T22:39:52.312641Z","title":null,"venue":null,"work_id":"8210fccb-79a7-4029-a507-7dd9a32eadf6","year":2016},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.857370Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:65aacc5288b535080d55a3769820d69b0076cab45428050cb696b1db837d381e","observation_id":"3612d1fd-0abf-4a49-9410-f7e0e464a734","resolution":{"observed_at":"2026-08-05T22:39:52.332712Z","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":{"arxiv_id":"1906.06187","last_updated":"2019-06-14T13:05:08Z","snapshot_observed_at":"2026-07-06T08:00:22.334753Z","submitted_at":"2019-06-14T13:05:08Z","title":"NLProlog: Reasoning with Weak Unification for Question Answering in Natural Language","version":1},"cited_work":{"arxiv_id":"1906.06187","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.06187","snapshot_observed_at":"2026-08-05T22:39:51.917047Z","title":"NLProlog: Reasoning with Weak Unification for Question Answering in Natural Language","venue":"cs.CL","work_id":"ece0b8ff-9d3f-416c-b659-4d2a98f7ded0","year":2019},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.861314Z"},"links":{"cited_paper":"/paper/1906.06187","citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:f68dce29dbbc79639ba26057b43d47c793c8cedb517efea336e09dcefb825d48","observation_id":"f11b6647-a356-4501-8d0b-0632a43b9de0","resolution":{"observed_at":"2026-08-05T22:39:51.924272Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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-05T22:39:52.270490Z","title":null,"venue":null,"work_id":"1b630bbe-27e2-499f-9e00-9ba90d34bddd","year":2024},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.865922Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:a25047c8c43f01e0d5d0f81fcaa887a7523955cd1d272b3cee3c5dd58674a1a5","observation_id":"c0aed0b8-d237-4ea4-bf18-accc30d16c7d","resolution":{"observed_at":"2026-08-05T22:39:52.283522Z","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-05T22:39:52.231982Z","title":null,"venue":null,"work_id":"424fd68e-8aa4-42fd-a585-0bc594ad7231","year":2018},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.870791Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:e2433ad2fcb23243a72bfff1a01b70d19528b17e9940c1d52a11f064b04e09ed","observation_id":"14c78f04-74a1-4be2-b860-800a01acb600","resolution":{"observed_at":"2026-08-05T22:39:52.245624Z","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-05T22:39:52.183522Z","title":null,"venue":null,"work_id":"71a0d2b8-67ce-4a6d-a674-d3ecad5ca930","year":2017},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.874915Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:826fdb44df64d2648c913ac83eb33dd9806d3ab46c221d6bd049d8978a3797da","observation_id":"55435dd2-00c3-4843-aa8e-6d49ac3e0875","resolution":{"observed_at":"2026-08-05T22:39:52.201543Z","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-05T22:39:52.168276Z","title":null,"venue":null,"work_id":"23a9766b-428c-41a0-8ef7-ee21fcd3f68c","year":2020},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.878860Z"},"links":{"citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:4827dfd02e24ac3c5e7258887c8dcb99dcea46aa33c16f1a6855a9c2debe3720","observation_id":"070c3e4a-b42d-49b6-8505-9d9c3e63e51a","resolution":{"observed_at":"2026-08-05T22:39:52.172506Z","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"}}],"paper":{"arxiv_id":"2508.06706","last_updated":"2025-08-08T21:17:03Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-06T11:02:30.053426Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":35,"verified_exact":3,"verified_fuzzy":6},"total_outbound_references":46},"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 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2508.06706."}