{"as_of":"2026-08-18T11:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d4ad6153609e3d33f3d83afd93ac205ebdceadc744d1299750369db3083f1014","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-09T19:10:50.159852Z","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-18T06:34:40.430872+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/2502.00434/citation-record","integrity":"/paper/2502.00434/integrity","json":"/paper/2502.00434/citation-record.json","paper":"/paper/2502.00434"},"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-09T19:10:50.435683Z","title":"CV-width: A new complexity parameter for CNFs","venue":null,"work_id":"3d8ba53b-a447-4358-87a0-e48126392122","year":2014},"citing_paper":{"arxiv_id":"2502.00434","last_updated":"2025-02-01T14:00:04Z","snapshot_observed_at":"2026-08-17T16:42:40.110174Z","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:50.144375Z"},"links":{"citing_paper":"/paper/2502.00434"},"observation_digest":"sha256:8a77d4f0d3b882bddc5e3ce61a0a0c56dfeb54f40fe8cf160b7d40294d6b3018","observation_id":"fd09880c-c151-46b0-b87d-0669361010e9","resolution":{"observed_at":"2026-08-09T19:10:50.439222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T19:10:50.425170Z","title":"On compiling CNF into Decision-DNNF","venue":null,"work_id":"9175829f-748c-41e5-a7c1-6e7677367da9","year":2014},"citing_paper":{"arxiv_id":"2502.00434","last_updated":"2025-02-01T14:00:04Z","snapshot_observed_at":"2026-08-17T16:42:40.110174Z","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:50.148160Z"},"links":{"citing_paper":"/paper/2502.00434"},"observation_digest":"sha256:b88e1d418fbfea2649955e501a1e7fc078d323c6985a7a9e4712b88e95cdec41","observation_id":"bf907a28-cf03-448c-a2aa-14400634cfd8","resolution":{"observed_at":"2026-08-09T19:10:50.428655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T19:10:50.413211Z","title":"A top-down compiler for sentential decision diagrams","venue":null,"work_id":"eaa4230f-094d-44b2-b879-c516066f9968","year":2015},"citing_paper":{"arxiv_id":"2502.00434","last_updated":"2025-02-01T14:00:04Z","snapshot_observed_at":"2026-08-17T16:42:40.110174Z","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:50.151794Z"},"links":{"citing_paper":"/paper/2502.00434"},"observation_digest":"sha256:a8f7565195898ce8d0a0878b05fa414e8e02ba752402b5d1263bf859400dd2db","observation_id":"776ef420-4ee2-4b38-bc58-2087168ffc4c","resolution":{"observed_at":"2026-08-09T19:10:50.416822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T19:10:50.401744Z","title":"New compilation languages based on structured decomposability","venue":null,"work_id":"e295d575-2052-43c0-8817-5d05a22e10ae","year":2008},"citing_paper":{"arxiv_id":"2502.00434","last_updated":"2025-02-01T14:00:04Z","snapshot_observed_at":"2026-08-17T16:42:40.110174Z","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:50.155753Z"},"links":{"citing_paper":"/paper/2502.00434"},"observation_digest":"sha256:5b2263fbf84befee2fefbb2daf281ec22566584721d328ed6e8eea518b9f11c1","observation_id":"eb45ca44-3317-4270-85e1-e5f7db9c7fda","resolution":{"observed_at":"2026-08-09T19:10:50.405705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T19:10:50.197281Z","title":"A faster algorithm for propositional model counting parameterized by incidence treewidth","venue":null,"work_id":"a58d61a9-e2a5-4d9f-810b-eace933a2320","year":2020},"citing_paper":{"arxiv_id":"2502.00434","last_updated":"2025-02-01T14:00:04Z","snapshot_observed_at":"2026-08-17T16:42:40.110174Z","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:50.159852Z"},"links":{"citing_paper":"/paper/2502.00434"},"observation_digest":"sha256:42cc2f129dcf6296f8e2dc0d59d62fb87f4baa70d285aea948aaa53150ba9d91","observation_id":"1da36f17-deea-4bd1-a8fe-cd1b3e2bfbff","resolution":{"observed_at":"2026-08-09T19:10:50.394231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T19:10:50.458335Z","title":"An improved decision-DNNF compiler","venue":null,"work_id":"aa3c782d-9e28-437d-8bd5-c9957e3b1a49","year":2017},"citing_paper":{"arxiv_id":"2502.00434","last_updated":"2025-02-01T14:00:04Z","snapshot_observed_at":"2026-08-17T16:42:40.110174Z","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF","version":1},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:50.136602Z"},"links":{"citing_paper":"/paper/2502.00434"},"observation_digest":"sha256:60a1a72c7548f8c4508defd0f04c42cd4f7c4086455f785a35d1b27849e69679","observation_id":"5d03d631-24c4-4b0b-9064-45ee36f39d85","resolution":{"observed_at":"2026-08-09T19:10:50.462391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T19:10:50.469163Z","title":"Knowledge compilation and more with SharpSAT-TD","venue":null,"work_id":"e4714fd6-a42a-447e-8f0e-d4be00f94251","year":2023},"citing_paper":{"arxiv_id":"2502.00434","last_updated":"2025-02-01T14:00:04Z","snapshot_observed_at":"2026-08-17T16:42:40.110174Z","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:50.132330Z"},"links":{"citing_paper":"/paper/2502.00434"},"observation_digest":"sha256:1ef7e39d71e11cd35908fb9a5bec02eff42b0f3a5c5e5fd600fc7d4412a98bb1","observation_id":"17b658a7-b0af-488e-8033-3da177eb2dba","resolution":{"observed_at":"2026-08-09T19:10:50.473319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T19:10:50.490177Z","title":"Tractable QBF by knowledge compilation","venue":null,"work_id":"f82c2dc7-dda5-4b48-91ab-fb97d439a080","year":2019},"citing_paper":{"arxiv_id":"2502.00434","last_updated":"2025-02-01T14:00:04Z","snapshot_observed_at":"2026-08-17T16:42:40.110174Z","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:50.123542Z"},"links":{"citing_paper":"/paper/2502.00434"},"observation_digest":"sha256:cd04e4182e5d21042937bf40cae6d0f98f5333d97c2c2d02761d52d4eef83037","observation_id":"2fbdecc0-54bc-4ec9-a42e-d69f694e2118","resolution":{"observed_at":"2026-08-09T19:10:50.493201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T19:10:50.510131Z","title":"On compiling CNFs into structured deterministic DNNFs","venue":null,"work_id":"6df834b5-cc02-4bfd-9401-4091655b4cd4","year":2015},"citing_paper":{"arxiv_id":"2502.00434","last_updated":"2025-02-01T14:00:04Z","snapshot_observed_at":"2026-08-17T16:42:40.110174Z","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:50.116071Z"},"links":{"citing_paper":"/paper/2502.00434"},"observation_digest":"sha256:420085c2ce2d0207632630b2b39d62000f2fc2488f6d6734d68245c9cf22e59b","observation_id":"90d153e1-2519-4ae2-b3fc-bd0f38a47af1","resolution":{"observed_at":"2026-08-09T19:10:50.513408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T19:10:50.499616Z","title":"Fourier meets M¨ obius: fast subset convolution","venue":null,"work_id":"dbfa7ee1-229e-4084-83e3-b550f2f85cb8","year":2007},"citing_paper":{"arxiv_id":"2502.00434","last_updated":"2025-02-01T14:00:04Z","snapshot_observed_at":"2026-08-17T16:42:40.110174Z","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:50.119865Z"},"links":{"citing_paper":"/paper/2502.00434"},"observation_digest":"sha256:e33431a963d575fe523ab90485a85745e542b2e894efa2724402492b0784eae0","observation_id":"eaa3ffee-b137-4a62-b156-6779119c9e7f","resolution":{"observed_at":"2026-08-09T19:10:50.502994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T19:10:50.446982Z","title":"Muise, Sheila A","venue":null,"work_id":"02f21145-93f0-4a39-9c5c-7e8adf65e3a9","year":2012},"citing_paper":{"arxiv_id":"2502.00434","last_updated":"2025-02-01T14:00:04Z","snapshot_observed_at":"2026-08-17T16:42:40.110174Z","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:50.140505Z"},"links":{"citing_paper":"/paper/2502.00434"},"observation_digest":"sha256:be2510f57645cb7880d5209ff5a47608bee8ae39b3ebfb13b9daff5da98dde2f","observation_id":"36960563-f1cb-4ec9-9aff-de2a289be7f2","resolution":{"observed_at":"2026-08-09T19:10:50.450370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T19:10:50.480734Z","title":"New advances in compiling CNF into decomposable negation normal form","venue":null,"work_id":"13545164-7cd2-40ba-a064-94163c31241a","year":2004},"citing_paper":{"arxiv_id":"2502.00434","last_updated":"2025-02-01T14:00:04Z","snapshot_observed_at":"2026-08-17T16:42:40.110174Z","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:50.128310Z"},"links":{"citing_paper":"/paper/2502.00434"},"observation_digest":"sha256:96207981bd22ba9fd55001b714fe014178138d45840e124626ef9299cd7d42e3","observation_id":"b8526049-f02a-47b0-a0ef-c61ce0fc69bb","resolution":{"observed_at":"2026-08-09T19:10:50.483903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.1995","last_updated":"2015-02-19T13:43:45Z","snapshot_observed_at":"2026-08-17T16:41:51.726792Z","submitted_at":"2014-11-07T17:43:33Z","title":"A Strongly Exponential Separation of DNNFs from CNF Formulas","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.1995","snapshot_observed_at":"2026-08-09T19:10:50.111676Z","title":"Expander cnfs have exponential DNNF size","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2502.00434","last_updated":"2025-02-01T14:00:04Z","snapshot_observed_at":"2026-08-17T16:42:40.110174Z","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:50.111676Z"},"links":{"cited_paper":"/paper/1411.1995","citing_paper":"/paper/2502.00434"},"observation_digest":"sha256:9e4e6a53b7e7a36794f84fff217485dd5935c3dcea73df271e4e16e5b117c6cc","observation_id":"12f1303f-0c13-4e47-9b9a-18ae44e42cae","resolution":{"observed_at":"2026-08-09T19:10:50.111676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.00434","last_updated":"2025-02-01T14:00:04Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-17T16:42:40.110174Z","submitted_at":"2025-02-01T14:00:04Z","title":"Compilation and Fast Model Counting beyond CNF"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":12},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2502.00434."}