{"as_of":"2026-08-18T18:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e7aeb50e24bb924c353125d26f97777d7f7ed43e0a22fda1f477fd5d6d6aa55a","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:19:06.449541Z","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-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/2505.16012/citation-record","integrity":"/paper/2505.16012/integrity","json":"/paper/2505.16012/citation-record.json","paper":"/paper/2505.16012"},"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-07T15:19:08.672865Z","title":"Connecting knowledge compilation classes and width parameters","venue":null,"work_id":"0a970758-7c8e-44c9-9d5d-3cd9c871ff10","year":2020},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:05.433000Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:656fbd81ee79a16f615c5e5cb7d733a4ac29ff843cbf4bbb9c400fc0e67f86af","observation_id":"076b0c15-252c-473a-9c86-afd4d4b8fed8","resolution":{"observed_at":"2026-08-07T15:19:08.765965Z","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-07T15:19:08.462291Z","title":"Lower bounds for exact model counting and applications in probabilistic databases","venue":null,"work_id":"565bf397-3452-4757-b29c-33c2db4919a4","year":2013},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:05.481107Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:a8a342fb688d5c8fcec0b32031b308fd608b6bc4e75ab586df782ee658557808","observation_id":"6cd9484c-2098-4c3a-9879-b538c3fa6566","resolution":{"observed_at":"2026-08-07T15:19:08.537329Z","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-07T15:19:05.552783Z","title":"Expander cnfs have exponential DNNF size","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:05.552783Z"},"links":{"cited_paper":"/paper/1411.1995","citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:42878052039b17e4ade71c14db8878ee0e24902007cb0ae2a1f0d473f223faf9","observation_id":"63cad391-4052-443f-85b6-8931b3ee933e","resolution":{"observed_at":"2026-08-07T15:19:05.552783Z","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-07T15:19:08.213419Z","title":"Decomposable negation normal form","venue":null,"work_id":"cb804bef-f610-4178-87e0-2adcc10a8a73","year":2001},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:05.613597Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:a11efc5bea749d26907850a03f0b2ea991d33b30b1664811f968895b2a7d55a9","observation_id":"10b15c27-901b-472f-af95-19b6d5d4dda3","resolution":{"observed_at":"2026-08-07T15:19:08.302293Z","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-07T15:19:07.971643Z","title":"SDD: A new canonical representation of propositional knowledge bases","venue":null,"work_id":"91ea0d69-2b19-4f0b-afc0-130e3bcfd42a","year":2011},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:05.698195Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:94e168f31b3c7b5bd51e3744e5c6a829ddd8336ce58874a45d6b31725d18ba8a","observation_id":"57088f30-51c1-429c-be49-e0a0ba824b3c","resolution":{"observed_at":"2026-08-07T15:19:08.100973Z","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-07T15:19:07.806347Z","title":"Demaine, Fedor V","venue":null,"work_id":"bf5b7ad4-a924-442f-91c6-62055cba5342","year":2005},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:05.759489Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:6beed8cd42b12f6c32fbbe81618501626cf8ecb92a7c34f77b719a3f0854d801","observation_id":"924c1fd7-63a5-486e-b1a0-6b2b0223c8ff","resolution":{"observed_at":"2026-08-07T15:19:07.869410Z","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-07T15:19:07.704597Z","title":"Graph Theory, 3d Edition , volume 173 of Graduate texts in","venue":null,"work_id":"e7c57c4e-c376-4e37-8e96-758d7681c642","year":2005},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:05.808255Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:5207b4b3c1a964cd835205871799b40fa820ce3e6982df15c1a5039547d90db4","observation_id":"2cf9e870-6ab9-4bc6-8a24-4d6127eaaf1d","resolution":{"observed_at":"2026-08-07T15:19:07.745590Z","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-07T15:19:07.540529Z","title":"Hypertree decompo- sitions and tractable queries","venue":null,"work_id":"d6211f22-cf84-474b-9b65-c6bf7155cdcc","year":2002},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:05.883830Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:b6ba4d549d48bc659e04fe252d506886bb140247c4c939e0ae2be6db429dfe5c","observation_id":"d725fd2f-cbf5-4f65-9a1d-36e218894750","resolution":{"observed_at":"2026-08-07T15:19:07.621376Z","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-07T15:19:07.426059Z","title":"Generalized hy- pertree decompositions: NP-hardness and tractable variants","venue":null,"work_id":"9f79c027-509c-4580-8310-a573c9b2b646","year":2009},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:05.956579Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:ee950dd36662c164abf37eb22c7cbecd3871b838d0d937bd8339f11837e7dae7","observation_id":"715d8880-999c-4b93-bcd2-725000443b98","resolution":{"observed_at":"2026-08-07T15:19:07.475768Z","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-07T15:19:07.321295Z","title":"Lower bounds on dynamic programming for maximum weight independent set","venue":null,"work_id":"0612134f-1ae5-43ae-b201-7be7d5d86f7f","year":2021},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:06.042311Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:f84e628eb6d925ac988a055182a093db9de439681794401b48095b5db544a639","observation_id":"cbd6af99-c4e8-428e-8174-65e67db00e71","resolution":{"observed_at":"2026-08-07T15:19:07.358401Z","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-07T15:19:07.122046Z","title":"New canonical representations by augmenting obdds with conjunctive decomposition","venue":null,"work_id":"621f11a8-979b-491d-a2ac-71937d0f4cea","year":2017},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:06.099505Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:b654cc9f545c01e35cd7d29c3031ad9e45caab0c0e60c2a5ad7998c3a3ff0084","observation_id":"37e69491-b69d-4981-b6f4-e22001ee2c2a","resolution":{"observed_at":"2026-08-07T15:19:07.166668Z","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-07T15:19:06.990104Z","title":"On compiling CNF into decision-dnnf","venue":null,"work_id":"8493499c-852f-4a64-9480-bb451b826f36","year":2014},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:06.196977Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:96b34594f5b0b5e70e2d938c27d789b16638473fc3f1b0f158f3f784e7cd9233","observation_id":"7bc6c53c-d71d-44b7-a50a-76ae09fd968a","resolution":{"observed_at":"2026-08-07T15:19:07.045744Z","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-07T15:19:06.879814Z","title":"On the read-once property of branching programs and cnfs of bounded treewidth","venue":null,"work_id":"4caf259c-38c6-4041-86fc-9bbb14cac2d2","year":2016},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:06.276570Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:e5852f0e7b98243d4193459096c16ed02a06e94a93f1efadd5be37ba8d447cf5","observation_id":"ad90a0bb-5c4f-4f3e-bd66-f63db9a331ca","resolution":{"observed_at":"2026-08-07T15:19:06.922165Z","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-07T15:19:06.755897Z","title":"On oblivious branching programs with bounded repetition that cannot efficiently compute cnfs of bounded treewidth","venue":null,"work_id":"a79a5514-70c9-4ac3-9b8f-e294c6c81383","year":2017},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:06.336274Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:879a9981fa377b88b541aceefeadbb07671f7f3eca64bbf82a3f9c2b86af5dce","observation_id":"aa399257-acf3-4307-b210-fefa9f129b61","resolution":{"observed_at":"2026-08-07T15:19:06.804003Z","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-07T15:19:06.665197Z","title":"New width parameters of graphs","venue":null,"work_id":"a1a300b1-fbba-40eb-aad9-d88640a54bf3","year":2012},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:06.393424Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:891ee803ed7fd2a55e63463440697b92c56f6b51c26e38b87d06466fda8066d2","observation_id":"521b7335-af25-4793-b2af-5687cdb0235c","resolution":{"observed_at":"2026-08-07T15:19:06.696109Z","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-07T15:19:06.562210Z","title":"Let a ∈ S(B)|{(x,0)}","venue":null,"work_id":"f156a0e1-ce1e-488a-ae9b-1a6e1c20f1ef","year":null},"citing_paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:19:06.449541Z"},"links":{"citing_paper":"/paper/2505.16012"},"observation_digest":"sha256:47877d39f782092a5d394187553c74e32de1dd68702110c6a5d926b32b45f894","observation_id":"fa72ebe8-adaf-40ba-b076-4670b4e6b606","resolution":{"observed_at":"2026-08-07T15:19:06.594519Z","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"}}],"paper":{"arxiv_id":"2505.16012","last_updated":"2025-06-10T10:56:59Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-17T16:42:18.885841Z","submitted_at":"2025-05-21T20:55:50Z","title":"Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":16},"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 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2505.16012."}