{"as_of":"2026-08-23T11:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ae811572405671e63f0fcb1e00b1bea39f24a4a95eef87cbf8a09e1b2e3160c4","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T00:03:39.211752Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T10:57:30.705538Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18224","snapshot_observed_at":"2026-08-04T10:57:30.705538Z","title":"Meel and Alexis de Colnet","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-14T12:15:01.268648Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:30.705538Z"},"links":{"cited_paper":"/paper/2406.18224","citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:6f1d0b8691875bf9b307b78df06bc49f6d10a509774c13f3d742e980efabc53c","observation_id":"506bd300-a964-4c81-ada8-0abc409601ba","resolution":{"observed_at":"2026-08-04T10:57:30.705538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.18224/citation-record","integrity":"/paper/2406.18224/integrity","json":"/paper/2406.18224/citation-record.json","paper":"/paper/2406.18224"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"\\# NFA admits an FPRAS: efficient enumeration, counting, and uniform generation for logspace classes","venue":null,"work_id":"d707e8c3-6bce-4224-bcf7-6a900a71877e","year":2021},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:ae326bb63ea135e95e247d5da6a4e3d791f3a3b23bce7abbc65e2b2aef5ed9f6","observation_id":"bad1db2f-8783-4f67-b9bc-e9430b5736f0","resolution":{"observed_at":"2026-05-24T00:05:54.278694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"When is approximate counting for conjunctive queries tractable? In 53rd Annual ACM SIGACT Symposium on Theory of Computing , pages 1015--1027","venue":null,"work_id":"a93dd890-d4b7-4a44-baab-35ab19d93d46","year":2021},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:b20948ed4836671a27c219673403327e2b730d6da1d77a3aeea13490e0cbd747","observation_id":"d84f846a-88f9-4451-a8bb-9c79805f1035","resolution":{"observed_at":"2026-05-24T00:05:54.275668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Compilers principles, techniques & tools","venue":null,"work_id":"60d0329c-4d5b-40e4-8072-fe828b439aef","year":2007},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:b5074a2f65a54574144b7f7ae5fdcd93cd319aeb2804507fbc6a9f5dfe79acaa","observation_id":"a340945f-ed97-42a7-9aa0-d2cba280eb58","resolution":{"observed_at":"2026-05-24T00:05:54.267632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"On probabilistic inference by weighted model counting","venue":null,"work_id":"237e93f7-d45f-490f-a147-fa2f97be5e17","year":2008},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:a1944b983313ad1479d1a4994039a345de1dcb048c019301a04d962611ddecbf","observation_id":"5f0bbdfe-71e5-40a1-854a-0b9cefd407a7","resolution":{"observed_at":"2026-05-24T00:05:54.286807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Decomposable negation normal form","venue":null,"work_id":"d598fb86-888a-4a9e-b2f2-e2899b79fe7e","year":2001},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:ff6e2b1efb9754d6b1a6a520d3e2f10e60db65167554a646da41d73f5927e44a","observation_id":"2ed6b691-8cae-4a48-8f08-b289c9e82a24","resolution":{"observed_at":"2026-05-24T00:05:54.272344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Sweedyk, and Stephen R","venue":null,"work_id":"8f10a146-0f39-407d-9006-e8e9552f244f","year":1997},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:9ac11be014e34e63a2d3b71624180870aac85ebc8605b5cf903eb8b7041fd483","observation_id":"c7b84dc4-9ddc-4cab-bdaf-7dc38131b4da","resolution":{"observed_at":"2026-05-24T00:05:54.283891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Grammar-based whitebox fuzzing","venue":null,"work_id":"e64476c2-6fb3-459b-b566-e2cc053c9f6f","year":2008},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:9187678cceff4e648303684a1bcf63cff01bbf3647e4df654c63035893a8524e","observation_id":"8b326384-23a5-4b9b-9d6b-786faf7d2f19","resolution":{"observed_at":"2026-05-24T00:05:54.290484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Knowledge compilation meets database theory: compiling queries to decision diagrams","venue":null,"work_id":"172355df-0200-4e67-8b8f-268c2c6df010","year":2011},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:0b10d5fdb718b896d055fbab86c291984718c3ce0e428895931ac4bd6db262e5","observation_id":"419ffa22-c816-493f-8064-8036cf01d670","resolution":{"observed_at":"2026-05-24T00:05:54.264014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Sweedyk, and Stephen R","venue":null,"work_id":"40add499-80d9-43c6-af98-e0956be0210e","year":1995},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:d34c6c743f586dc1b0e50e878f2fdef40a4b14d5f47fd34a6244940470918a15","observation_id":"5245533b-f8ce-44ba-9ea0-5b14cd1cc645","resolution":{"observed_at":"2026-05-24T00:05:54.250142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Meel, Sourav Chakraborty, and Umang Mathur","venue":null,"work_id":"6a63c4a3-60d9-41a1-83d7-d754b83877e3","year":2024},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:55b6cf16a77fc7eacb7b409a9020e0ea5c3bb70a598a7c11b06d1aadf6a39b2c","observation_id":"0ea4a642-7f47-4f4a-ad70-68514a6cbb4d","resolution":{"observed_at":"2026-05-24T00:05:54.252806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Estimating the size of union of sets in streaming models","venue":null,"work_id":"b5e7789e-1188-4719-846f-fd7404ee773c","year":2021},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:1985953305cb406145612cd04b13704f6e8f5f177dd6e8d382bd37f4d4474a08","observation_id":"f6c5d438-ed3b-4517-b05a-d55c394dfc42","resolution":{"observed_at":"2026-05-24T00:05:54.255422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Pruning conformant plans by counting models on compiled d-dnnf representations","venue":null,"work_id":"99920b8d-f659-4249-9c42-4119fbc5d36b","year":2005},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:996b7a9d517a30ad0401fa24afdd45b7e4236fca9a49ee9faf4deb5a66e7c20a","observation_id":"f448ec5f-590e-40ad-8da1-b51db5027ac7","resolution":{"observed_at":"2026-05-24T00:05:54.245442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Knowledge compilation meets uniform sampling","venue":null,"work_id":"31b216e2-ef62-41db-8b36-d52e250bed98","year":2018},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:4e0cd1f3109d370aa84e924caece1538f8331192ca1e7d934b80fe5e8a3f7d4f","observation_id":"d1bd31f6-918d-4156-a171-5b1abbaf3c99","resolution":{"observed_at":"2026-05-24T00:05:54.247751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"Valiant, Sven Skyum, S","venue":null,"work_id":"710cac55-9ff3-477e-9dd9-47294d7b9a24","year":1983},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:4bbbe7b45b00a1c5a3c0f988d9a75d2599276bb99a6a73d283d7b5fd49159585","observation_id":"7f726521-e007-4049-ae5c-9a12cececf1d","resolution":{"observed_at":"2026-05-24T00:05:54.258066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-05T21:23:00.469572Z","title":"The Fuzzing Book","venue":null,"work_id":"3df70aad-47f5-40ed-a867-33107b3dd514","year":2024},"citing_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-24T00:03:39.211752Z"},"links":{"citing_paper":"/paper/2406.18224"},"observation_digest":"sha256:0b6c85f0ffa3a672f1716f49b70cbe86dbb86b120ca92418c74427d34ee34e25","observation_id":"e454bb83-2c64-47bf-9577-7432c7ab8736","resolution":{"observed_at":"2026-05-24T00:05:54.261378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T20:58:21.404902Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":15},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 1 inbound Pith citation observation for arXiv:2406.18224."}