{"as_of":"2026-08-16T14:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e9adb9929c42be5a1c37b6fdc84ef0b6a797fa016c9e1d8f18927f47f6cb9b20","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:01:11.211960Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.06275/citation-record","integrity":"/paper/1908.06275/integrity","json":"/paper/1908.06275/citation-record.json","paper":"/paper/1908.06275"},"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-14T13:01:11.794911Z","title":"Akshay, Supratik Chakraborty, Shubham Goel, Sumith K ulal, and Shetal Shah","venue":null,"work_id":"9da51069-2663-4a76-aee1-b186717f530f","year":2018},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.045720Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:61e0557b74bc0f67e54280fd9fa8caa76a07d4fea8dbf7d952642470665f8423","observation_id":"badca91e-216f-4eae-b7bb-d12b30bdd775","resolution":{"observed_at":"2026-08-14T13:01:11.801098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.781504Z","title":"Akshay, Supratik Chakraborty, Ajith K","venue":null,"work_id":"55645c76-5fc3-447b-b7a4-58ce7fc02064","year":2017},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.050225Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:886057e4dc87cb5f30a05a963c9d3229911c48422cb9e4c0ba13f6955020b203","observation_id":"cf46a2d6-8a4c-4273-874e-a670a0bea1c9","resolution":{"observed_at":"2026-08-14T13:01:11.785786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.767034Z","title":null,"venue":null,"work_id":"3b6928c9-824f-4be6-bb56-bad90a5a7a78","year":null},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.054511Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:7ee6a821ebacbc451513642be62fb30c99942cce97088bc05981806324f50000","observation_id":"3de259a9-a1db-4e77-af1d-1b3574b438c0","resolution":{"observed_at":"2026-08-14T13:01:11.772131Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.750790Z","title":null,"venue":null,"work_id":"a94868d3-2046-4bdd-8176-db184932ab76","year":1986},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.058891Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:c9ae3e632f66f07bfd924f94dcb1dbfbab74cedfaf463b85f142782bff6621c8","observation_id":"2879ff1c-dd7d-4a97-bfc4-0c8b5dd35ab4","resolution":{"observed_at":"2026-08-14T13:01:11.756052Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.730504Z","title":null,"venue":null,"work_id":"8602f58c-5ad7-4eac-96d1-ff7ed2d6119e","year":1991},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.063516Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:9508f3241ffb454a140bbcb19fad7c45bd31976f092d6d128d343d26323d1a17","observation_id":"8ad9337f-b55b-4dfe-9864-6fa94372fc12","resolution":{"observed_at":"2026-08-14T13:01:11.735156Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.711795Z","title":null,"venue":null,"work_id":"9ea63c41-fb48-4185-ad9d-35c7257596c1","year":1997},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.067762Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:3ab643acb7a4d2012203f8ccad1fde77b47d545e93effb97bd42fa7f20cb0703","observation_id":"85e7ab34-24dc-41db-8197-32e01f01b7a8","resolution":{"observed_at":"2026-08-14T13:01:11.716353Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.697830Z","title":"Tabajara, an d Moshe Y","venue":null,"work_id":"b5cb264b-fb8d-45d7-9c06-2c08eaa43051","year":2018},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.076761Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:e9684397fe6c7ad26b830d75ab2cafa8f52b049dcb7ec6c072d4ca5ea90bf727","observation_id":"47659f49-1a35-427c-ba7c-1c3abe385eea","resolution":{"observed_at":"2026-08-14T13:01:11.701918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.684006Z","title":"Decomposable negation normal form","venue":null,"work_id":"84580453-a2ae-4ba3-9ab6-1a33083747e0","year":2001},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.080855Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:e12974348feceaaac69e7d85aa2f32a8162f5b58b86619d54270e346909e524b","observation_id":"a5c7de9b-1c9f-4a71-8986-d7a9f77dab05","resolution":{"observed_at":"2026-08-14T13:01:11.688165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1106.1819","last_updated":"2011-06-09T13:56:25Z","snapshot_observed_at":"2026-08-15T04:44:20.144808Z","submitted_at":"2011-06-09T13:56:25Z","title":"A Knowledge Compilation Map","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1106.1819","snapshot_observed_at":"2026-08-14T13:01:11.084601Z","title":"A knowledge compila tion map","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.084601Z"},"links":{"cited_paper":"/paper/1106.1819","citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:7a086200f09ca2f7511f47680b79120c0676ee6567205f9a8d0d68a1d599ed15","observation_id":"e6dd8d67-68fe-4abd-a4a9-0e051072aadc","resolution":{"observed_at":"2026-08-14T13:01:11.084601Z","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-14T13:01:11.670387Z","title":"Tabajara, and Moshe Y","venue":null,"work_id":"2b9f04b9-67f1-49c3-ac3c-bb63378f75e7","year":2016},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.088399Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:28c8af6daa342b70b6185ae1beaae91f6c08bb2fb28fd08e91e5cbbc1b534d00","observation_id":"a634bf8c-8927-47da-a6fe-f962e6dcb232","resolution":{"observed_at":"2026-08-14T13:01:11.674578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.656164Z","title":null,"venue":null,"work_id":"7b7daee7-fc25-4764-8816-8e6d7ab1a559","year":2009},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.092274Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:af50a7aefba8417c962aac949e4ac6b68e60d5d49431462a65bcbb19e622cee5","observation_id":"a9323544-a41e-460e-b6ff-eabb9cfebc53","resolution":{"observed_at":"2026-08-14T13:01:11.661471Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.637148Z","title":null,"venue":null,"work_id":"620b2da9-d5c6-44e2-853c-d7a1caeb9f00","year":2011},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.098553Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:7705f884b156db5e9387df00727f6bb951c2dcaed4b6de37179bec947af7d679","observation_id":"e76f3ffd-e6c8-4b0a-8679-4df7cffb4368","resolution":{"observed_at":"2026-08-14T13:01:11.643829Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.619898Z","title":null,"venue":null,"work_id":"9b216c42-3b88-4c1e-a721-c304820e66ec","year":2015},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.102886Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:d5c1cc25c40b04ee36f0613e8ce0585f595f2e92aa5b49bf232ff85730e3ac03","observation_id":"56073749-88d3-4a7d-a926-8d4c0003caf7","resolution":{"observed_at":"2026-08-14T13:01:11.624102Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.606513Z","title":"Kuncak, M","venue":null,"work_id":"935395c6-6a39-41b9-baa0-9af6cf82349c","year":2010},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.107106Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:793034c5dd7b370038850d7b439410521b6cad88b5276448080b7e6b9ca2b860","observation_id":"4eea9b16-a579-4a3b-b50e-31e51a1397a2","resolution":{"observed_at":"2026-08-14T13:01:11.610783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1106.4578","last_updated":"2011-06-22T21:01:16Z","snapshot_observed_at":"2026-08-15T19:42:31.278906Z","submitted_at":"2011-06-22T21:01:16Z","title":"Propositional Independence - Formula-Variable Independence and Forgetting","version":1},"cited_work":{"arxiv_id":"1106.4578","doi":null,"metadata_source":"pith","pith_arxiv_id":"1106.4578","snapshot_observed_at":"2026-08-14T13:01:11.245573Z","title":"Propositional Independence - Formula-Variable Independence and Forgetting","venue":"cs.AI","work_id":"d365f6fe-1807-4a6f-a126-bee89d8db22f","year":2011},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.110797Z"},"links":{"cited_paper":"/paper/1106.4578","citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:63598a0e00d61241f7e0c5dbeb6a17c20cfeb8cab64dd15f628aa05ed31ceb32","observation_id":"9e09423e-3077-4ff9-9d6a-eb7459a68c60","resolution":{"observed_at":"2026-08-14T13:01:11.252199Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.593460Z","title":"Lowenheim","venue":null,"work_id":"81375e92-b8af-4483-a99e-32bfe7f404fb","year":1910},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.115530Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:790feb8199f76200ebf5c26d98e6bf1a0960d3786ff22aa93e1d073cce044e26","observation_id":"d07f0cf5-de6f-4140-b31e-be5c5dc5728f","resolution":{"observed_at":"2026-08-14T13:01:11.598234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.576707Z","title":"Efficient Ex traction of Skolem Functions from QRA T Proofs","venue":null,"work_id":"dd1c6750-f73a-4c0c-a6bb-6ab4093ba9c6","year":2014},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.119472Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:8008e266fed1f897dce6d389f0d18319cb187b032272935d5799b46deba85cc2","observation_id":"9af3253f-9c51-402a-a43a-0e9712dde2db","resolution":{"observed_at":"2026-08-14T13:01:11.583850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.562486Z","title":"Moskewicz, Conor F","venue":null,"work_id":"8b3d530c-e54b-4421-a2c6-ba471a99e3e7","year":2001},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.123854Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:1cd7b2949d0f3aa0a310361cccbd08407738c796d5926fb6a4d77235b6e7db8a","observation_id":"97a1746f-d288-4d5a-90b3-843ba0b863f5","resolution":{"observed_at":"2026-08-14T13:01:11.567055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.547105Z","title":"McIlraith, J","venue":null,"work_id":"e9a15892-315c-4a01-af40-262beb065309","year":2016},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.127959Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:c53f1f44f9ce679282e95a46c2c7e8001de655e67a6d818b3d4db3f8109875dd","observation_id":"17ec9efe-048a-47f3-b116-4f391867edb4","resolution":{"observed_at":"2026-08-14T13:01:11.552242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.528240Z","title":"QBFEval 2018","venue":null,"work_id":"479d0fc8-dfac-4dba-a70a-21959880464d","year":2018},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.132864Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:94cf9adca57a5808c59806ff697a09594b9ddad6e411bbf6a02cd0d05577953c","observation_id":"294e4203-6b64-4459-b916-b9c4c3771b3d","resolution":{"observed_at":"2026-08-14T13:01:11.534798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.515488Z","title":null,"venue":null,"work_id":"9fb10f48-c490-4822-a016-7f3d15689e04","year":2016},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.136595Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:96ebaf6218fcbec2c6fb415587d5e588742f8be76332d04e9a6b76ff9d952ce2","observation_id":"2923b4db-a197-4f25-b123-3368ade981c6","resolution":{"observed_at":"2026-08-14T13:01:11.519822Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.502537Z","title":null,"venue":null,"work_id":"0ca5124c-d707-4750-b2ff-94c84f372cca","year":2015},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.140299Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:f890dc6c114d671f060dd493d9e418c0960f3d071891ca5e7023e46f9c6a54bf","observation_id":"6e721d39-3f64-4f61-be14-982c2bbcd4c0","resolution":{"observed_at":"2026-08-14T13:01:11.506893Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.489917Z","title":"Rabe, Leander Tentrup, Cameron Rasmussen, an d Sanjit A","venue":null,"work_id":"b4c24334-e513-48ea-b98e-41638007e558","year":2018},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.144136Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:1d2353dc213f5b1d728e949292edb900b7c513ebe0dbe1cea62f5de5196a7d50","observation_id":"bf5d2599-0b74-46cb-a97c-c38219492876","resolution":{"observed_at":"2026-08-14T13:01:11.494398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.477013Z","title":"Tabajara and Moshe Y","venue":null,"work_id":"a5b548ec-0573-4a88-8cb3-923c68063120","year":2017},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.148177Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:9f39fd63a8efc0509564bba69dbc8bd10c44ecf9552d57402173027505bd2bc9","observation_id":"46f7744c-f890-4c34-891e-67e111b772b1","resolution":{"observed_at":"2026-08-14T13:01:11.481391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.464344Z","title":null,"venue":null,"work_id":"f45c1465-3d88-4975-a515-e62a9deeb364","year":1968},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.151551Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:4eab6d5cb15f26b04c61b3ad02ca701572621370731b69a8e17c179f9861a058","observation_id":"0f327540-43dd-46d8-95ec-f55d22f66954","resolution":{"observed_at":"2026-08-14T13:01:11.468379Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.452231Z","title":null,"venue":null,"work_id":"c7b569ca-e65d-41ca-b594-f4a9b572169c","year":1979},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.155882Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:ccd49bd4e3f9f4860a48ad5ca752907b53d3ac497433be48b5ed1ee90deb1fe1","observation_id":"7a6fd277-2e94-44bd-953c-ba13c5e91927","resolution":{"observed_at":"2026-08-14T13:01:11.456205Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.440543Z","title":null,"venue":null,"work_id":"8044e0ce-3f83-4071-aa3d-01820201df2a","year":null},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.159937Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:948252710a3b13ae54f1cb453a91473ceeb470dfda53a30a04930546ff5e6bd7","observation_id":"78a4085f-fe72-4561-90a3-3a5df08b07b0","resolution":{"observed_at":"2026-08-14T13:01:11.444554Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.427983Z","title":null,"venue":null,"work_id":"b683a065-15a7-44a0-ad6b-7f03002c49da","year":null},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.164982Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:fb9456436c293a72923d3e4780482d267fe1dccc3af63c09d78493b214d93ef6","observation_id":"7457118b-6a2b-4d61-b196-eaf9bec586bd","resolution":{"observed_at":"2026-08-14T13:01:11.432416Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.413300Z","title":"Note that in this case, we cannot use the sufficient conditio n as above, clearly,x1, x1 meet at a ∧ in [ˆg]1","venue":null,"work_id":"c71545db-02b0-40e1-b564-0d352a892dc4","year":null},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.168807Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:833139ce93222cea23664503862e3016a7716e925c3d2c8c4c68894ad7d51f38","observation_id":"69b9c712-d912-4f3f-81f9-153c4d6be0be","resolution":{"observed_at":"2026-08-14T13:01:11.418458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.399732Z","title":null,"venue":null,"work_id":"81214802-e455-4ebe-b73b-64706d84f3d9","year":null},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.173358Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:cc2897297c565913cfbe154d9487e8711693cb05c21ddd3f140465d128e6c903","observation_id":"1994aca9-abb3-4957-889b-0a671adabb58","resolution":{"observed_at":"2026-08-14T13:01:11.404145Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.384264Z","title":null,"venue":null,"work_id":"c1c78043-53a3-4a7c-9206-d69dcc4a896e","year":null},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.177644Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:78b815a9db3954f3ead69ed42cc07a56a38b9a20cebcd0a3391427db327cf0c2","observation_id":"ce881af2-a234-4491-a84c-30aa3352752d","resolution":{"observed_at":"2026-08-14T13:01:11.389951Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.369151Z","title":"negative) unate in xi ∈ X, then xi ∧F |xi=1 (resp","venue":null,"work_id":"310e9378-81cb-43cc-b3b6-91be7988d37b","year":null},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.182168Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:03c66eb333b927c9e372c2befd723f7d22c17cbdf7d78e26268764345750d830","observation_id":"782fd26b-a759-46d2-ac40-9c35d2896f95","resolution":{"observed_at":"2026-08-14T13:01:11.373796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.356415Z","title":"b) (~F1 ∧ ~ F2) ≼ syn (F1 ∧F2) if the output supports of F1 and F2, and similarly of ~ F1 and ~ F2, are disjoint","venue":null,"work_id":"234e316b-9f66-4421-921f-b9dac6ffd829","year":null},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.186279Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:25c18953b9fff58ae225d2bddcd54eeca3a92929d2d94e21d828542183ea0daf","observation_id":"a0d6241f-61cc-4e20-ab5f-67deb61c8fab","resolution":{"observed_at":"2026-08-14T13:01:11.361019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.342605Z","title":"Then F is semantically independent of Y and ∀YF (π ↓ X, Y) = 1 holds","venue":null,"work_id":"990fd0d6-56b2-4347-9f3c-dd217cd019b7","year":null},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.190579Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:e5cd22bd3f7fa0f9fb4327b5009c843785d0ad2fef557cc122f603cc4afef532","observation_id":"d1223e95-314f-4c7e-a05c-8fb76a371c1d","resolution":{"observed_at":"2026-08-14T13:01:11.347736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.328094Z","title":"Then F is semantically independent of X","venue":null,"work_id":"7b31003e-2d98-4bb5-9f2c-d7ad13aaefe9","year":null},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.195056Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:d92e75287827cf24957268d47f988786be2ee896849d61631fe6356715edcfca","observation_id":"dfe8fe9d-7abf-47a9-b4df-d1315b26e391","resolution":{"observed_at":"2026-08-14T13:01:11.332817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.314375Z","title":"It follows that F ⇔ (¬xi∧F |xi=0)∨(x∧F |xi =1) ⇒F |xi=1","venue":null,"work_id":"52a7cf8e-9b92-41dd-999a-d976142e55a4","year":null},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.200102Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:d7a61cedf7ae11029d42008f6dcc818e6a8f2840b223b5eb75ed1d52dd138ae3","observation_id":"c52c8067-c379-4458-ae30-a0e0d50fff62","resolution":{"observed_at":"2026-08-14T13:01:11.319608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.300737Z","title":"a) Since ∃X (F1(X, Y) ∨F2(X, Y)) ⇔ (∃XF1(X, Y) ∨ ∃XF2(X, Y)) and ∃X ( ~F1(X, Y) ∨ ~F2(X, Y) ) ⇔( ∃X~F1(X, Y) ∨ ∃X~F2(X, Y) ) , condition (a) of Definition 4 follows immediately","venue":null,"work_id":"84e36aab-9789-4041-85d7-8fe716170c00","year":null},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.204207Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:8ec901a394517c877e3927db4333f9132cba1fe612fd3eaeda01f07032fc8f4e","observation_id":"889bab67-cdf0-46a7-8c03-62691f3f05f1","resolution":{"observed_at":"2026-08-14T13:01:11.305602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.287133Z","title":null,"venue":null,"work_id":"1e0d5954-0fd2-4fe3-a34c-7d3474ebf125","year":null},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.208268Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:44769617ae232145a8572e507be97fedf4216d90e08fb62f6f62be689b016710","observation_id":"989a1a03-858c-40d0-97e1-2361d2156506","resolution":{"observed_at":"2026-08-14T13:01:11.291148Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:01:11.273643Z","title":"Similarly, if θF,T,xi,1 is a tautology, then (¬xi ∧F |xi=0) ≼ syn F","venue":null,"work_id":"1954497e-97f9-45a6-a296-d36e7cb68646","year":null},"citing_paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:11.211960Z"},"links":{"citing_paper":"/paper/1908.06275"},"observation_digest":"sha256:bcf6c1df7ba8229dd70c2aa9464f354be067ddc179ec0d4d666b5e2cbd708fef","observation_id":"e3eb8ae1-650c-4252-aa24-aa86d29480df","resolution":{"observed_at":"2026-08-14T13:01:11.278153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.06275","last_updated":"2019-08-17T09:42:00Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-16T04:43:16.109957Z","submitted_at":"2019-08-17T09:42:00Z","title":"Knowledge Compilation for Boolean Functional Synthesis"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":1,"verified_fuzzy":21},"total_outbound_references":39},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:1908.06275."}