{"as_of":"2026-08-18T16:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a80703205b742413843fb836f346c26410ed0f6a5ff9dead68a91575d119a685","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:15:08.135790Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T16:26:07.201958Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-10T11:00:04.010211Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"cited_work":{"arxiv_id":"2507.14504","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.14504","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"[Sch21] Dominik Scheder","venue":null,"work_id":"b609465f-acde-4f11-9246-f50c16da1931","year":null},"citing_paper":{"arxiv_id":"2604.15031","last_updated":"2026-07-19T15:32:28Z","snapshot_observed_at":"2026-08-17T06:04:06.808834Z","submitted_at":"2026-04-16T14:01:49Z","title":"A Hypergraph Container Method for Spread SAT: Approximation and Speedup","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T10:58:33.718104Z"},"links":{"cited_paper":"/paper/2507.14504","citing_paper":"/paper/2604.15031"},"observation_digest":"sha256:75bc32968f57eb66870bffa63d51df6380b1c64048151a09581173cff3b9f95d","observation_id":"056405f5-ce3a-4c8d-a607-2373803f0471","resolution":{"observed_at":"2026-05-10T11:00:04.011876Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.14504","snapshot_observed_at":"2026-08-02T16:26:07.201958Z","title":"[Sch21] Dominik Scheder","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.15031","last_updated":"2026-07-19T15:32:28Z","snapshot_observed_at":"2026-08-17T06:04:06.808834Z","submitted_at":"2026-04-16T14:01:49Z","title":"A Hypergraph Container Method for Spread SAT: Approximation and Speedup","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T16:26:07.201958Z"},"links":{"cited_paper":"/paper/2507.14504","citing_paper":"/paper/2604.15031"},"observation_digest":"sha256:b6fafba6b9c95ae7b7e4c370a0777866ee551132cb800fedc1df4c1f0be3b63a","observation_id":"fe1395f0-7664-4030-a635-4b4dc29bdfa5","resolution":{"observed_at":"2026-08-02T16:26:07.201958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.14504/citation-record","integrity":"/paper/2507.14504/integrity","json":"/paper/2507.14504/citation-record.json","paper":"/paper/2507.14504"},"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-06T16:15:11.896387Z","title":"Algorithms and complexity results for #sat and bayesian inference","venue":null,"work_id":"2aa0a286-7aa0-4955-9005-f8dda52551c0","year":2003},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:04.885655Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:e82850ac2da8d547638f0d6d63d183d0594e5e3274ad78c58c456e1109191a1d","observation_id":"3700547b-0dea-4352-b13e-2b66635e3ae2","resolution":{"observed_at":"2026-08-06T16:15:11.898986Z","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-06T16:15:11.888604Z","title":"3-coloring in time o(1.3289 n)","venue":null,"work_id":"e7f070c1-c87b-424f-a9ca-07b3468d67d3","year":null},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:05.070387Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:ade7235524f7736cdc2de40537e64ef12fe71c3213b72aa9dddf8182b5a75d10","observation_id":"6c008a9a-463f-48e4-9e7b-88f2d70d1d8b","resolution":{"observed_at":"2026-08-06T16:15:11.891305Z","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-06T16:15:11.881425Z","title":"Handbook of Satisfiability - Second Edition, volume 336 of Frontiers in Artificial Intelligence and Applications","venue":null,"work_id":"795344a1-8f5c-4625-b49a-e3e1acadd6fa","year":null},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:05.259397Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:3e0a231b5fec2ce8fce560828695aba90ae275e6f9314ea1dbc01e77cb22d597","observation_id":"58ff8266-7d79-4ad9-a774-0e11b2b16ad1","resolution":{"observed_at":"2026-08-06T16:15:11.883810Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:15:05.414829Z","title":"On probabilistic inference by weighted model counting","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:05.414829Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:0c07ecc053da0b6c89b529278c49b2d5f3fba7d549133ee25a9e93535cf587b3","observation_id":"8010aa8c-f3c5-426b-9c16-3bf649119be5","resolution":{"observed_at":"2026-08-06T16:15:05.414829Z","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":"10.1609/aaai.v35i5.16487","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"An improved upper bound for SAT","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"b87dffcc-ea1d-4ec1-be6b-c4d944f6ee09","year":2021},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:05.509424Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:6f0b868d1d8a938d285ca0322c14689347221ee5d61542fd053d85a6613ffd23","observation_id":"0351ad19-c33e-43b8-afb7-f226e6e9f77e","resolution":{"observed_at":"2026-08-06T16:15:11.359175Z","resolver_source":"doi","status":"verified_exact"},"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-06T16:15:11.873862Z","title":null,"venue":null,"work_id":"9dbbdbd2-b6c7-4c25-9021-ef10c82fe81f","year":1971},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:05.604380Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:c556cea33cf2c6a168b6ab3144477b32e7e391537ac0261787480c8cc097ec56","observation_id":"30236536-361f-40f5-96b7-0e54891e2761","resolution":{"observed_at":"2026-08-06T16:15:11.876584Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:15:05.759618Z","title":"On problems as hard as CNF-SAT","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:05.759618Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:246c322362e283e46c1236548dacccda478c2bacb022e50e3f8a1bbe44010b76","observation_id":"a5fc5dfa-82dd-4095-b2aa-54e460d1ee53","resolution":{"observed_at":"2026-08-06T16:15:05.759618Z","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":"10.1016/j.tcs.2004.10.037","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Counting models for 2sat and 3sat for- mulae","venue":"Theoretical Computer Science","work_id":"70b90d97-16c5-41ca-b621-798cc67f246c","year":2005},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:05.828951Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:8dfa478fd1bbbec2ed911be07b2deea36b6d4271ae79997c92aed48b9733b0d4","observation_id":"045e905c-d477-4ef4-9d10-918ee24dc747","resolution":{"observed_at":"2026-08-06T16:15:11.114299Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/0304-3975(91)90315-s","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Counting the number of solutions for instances of satisfiability","venue":"Theoretical Computer Science","work_id":"2be3d5af-6b93-483a-930a-2e06e3935105","year":1991},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:05.905967Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:3576d4a8f786156f3c9f0986efcd5a4b759dfeabeff6bdbf5541824d38ad9c5e","observation_id":"4f4e894b-9103-4cf0-b474-5a17c14f2974","resolution":{"observed_at":"2026-08-06T16:15:10.856931Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:15:05.970817Z","title":"Dudek, Vu H","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:05.970817Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:7c9ecdda610f21ad935baed7569731fca2ccd7749d85c9a01be662a6b931304f","observation_id":"283c53e7-163f-4934-9d7c-ef934a4bd0ec","resolution":{"observed_at":"2026-08-06T16:15:05.970817Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:15:06.046077Z","title":"Meel, Roger Paredes, and Moshe Y","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:06.046077Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:c3caf9853000cc619085bfa2ff32d40c6dd70a9a743a691fcd2ba5c980bc3f78","observation_id":"05f56f4b-9f2c-4475-af5f-7e6ca3036aeb","resolution":{"observed_at":"2026-08-06T16:15:06.046077Z","resolver_source":null,"status":"malformed_identifier"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:15:06.134901Z","title":"An improved gpu-based SAT model counter","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:06.134901Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:ecc5a6e0b29677dd67fbab8782e8c7237822f57262b05ab708ba8b93ec8d1bc4","observation_id":"6f201450-ce67-4a1d-b576-81f5bac7594e","resolution":{"observed_at":"2026-08-06T16:15:06.134901Z","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-06T16:15:11.865677Z","title":"Exploiting database management systems and treewidth for counting","venue":null,"work_id":"f8df2193-281b-4149-b33c-287a9b0f30f0","year":null},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:06.209710Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:04269450f170cde9e3dc5a73133b6fbf7f79565c7b2b33793576838bc94f7697","observation_id":"d0ab3739-7783-4d7e-945a-15bcba5f600d","resolution":{"observed_at":"2026-08-06T16:15:11.868299Z","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":"10.1145/3560469","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"The silent (r)evolution of SAT","venue":"Communications of the ACM","work_id":"1b7a5b9a-551e-4691-92b4-5dec92a67383","year":2023},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:06.402427Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:9902c30e6b66a25d35c7cdc5bdcbc9874c0ca709c97f66fd18546829ca38b25d","observation_id":"3a218b43-5666-41a4-b481-0f5bcb6ff6a7","resolution":{"observed_at":"2026-08-06T16:15:10.490090Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:15:06.488553Z","title":"Solving projected model counting by utilizing treewidth and its limits","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:06.488553Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:9a4f2544d18f82e13d07be00e74efe978caf2e5c6c82a86637cf6cae5da6f605","observation_id":"788bf2ce-6e11-4ea6-b84e-53dbe7f37d7d","resolution":{"observed_at":"2026-08-06T16:15:06.488553Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:15:06.538911Z","title":"Fomin and Dieter Kratsch","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:06.538911Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:6696ec37cea5db6814004ce394e0728e74648854c5a68530f9876f57ac305fbb","observation_id":"f5b7facc-3d0b-4fbb-8ba9-d97a7266f675","resolution":{"observed_at":"2026-08-06T16:15:06.538911Z","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":"10.1007/s00453-007-9133-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"Fomin, Serge Gaspers, Saket Saurabh, and Alexey A","venue":"Algorithmica","work_id":"bee4bcf1-3c46-4db6-818e-e0113cd24af9","year":2009},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:06.630527Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:4bd2f8fbf96b071d2bc7c139ec45196ea3e7e9c197612d3b1fe4809f62b5bd06","observation_id":"022771a7-6de5-4ec5-acda-36796e8dfecd","resolution":{"observed_at":"2026-08-06T16:15:10.266712Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1137/1.9781611973068.67","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","work_id":"1d03f1c3-c5e1-46f6-aa2c-193a5baa2657","year":2009},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:06.712603Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:0bc8e6f3d189e9900ddb005d20184827dc0c2f2dabc6d71dc7a130d82218c1d8","observation_id":"f56ae421-14cb-450f-86e9-534d000a3273","resolution":{"observed_at":"2026-08-06T16:15:10.073334Z","resolver_source":"doi","status":"verified_exact"},"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-06T16:15:11.858354Z","title":"Gomes, Ashish Sabharwal, and Bart Selman","venue":null,"work_id":"088a2fd3-6586-4128-8266-0a3ebecfdf08","year":null},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:06.802760Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:ab089973d80945818c2cedf22083034429db9b3117bd4506f1bfdc03e36b1e5b","observation_id":"393e73bb-c119-4aad-af37-648c3e16671e","resolution":{"observed_at":"2026-08-06T16:15:11.860906Z","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":"10.1007/978-3-030-51825-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"Taming high treewidth with abstraction, nested dynamic programming, and database technology","venue":"Lecture notes in computer science","work_id":"f6a03d95-af2b-42b1-8632-340de96ddd57","year":2020},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:06.962495Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:117df361d4632b4773cb500b545facb3e867f91ea6650d8827a16ef2b80db292","observation_id":"84265b9f-7c1e-4ce9-bb42-2789860ce4cb","resolution":{"observed_at":"2026-08-06T16:15:09.626821Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:15:07.049427Z","title":"On the complexity of k-SAT","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:07.049427Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:9aed72c3f52d8cf77fbbd895fe9d747595122c4e62374f2b69f6ac5216705ac5","observation_id":"669f413c-878e-4515-bd90-5e322e52d9d4","resolution":{"observed_at":"2026-08-06T16:15:07.049427Z","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":"10.1137/0218026","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"CNF satisfiability test by counting and polynomial average time","venue":"SIAM Journal on Computing","work_id":"e4a9abc3-d3e7-452d-8ec0-713cdc12ca94","year":1989},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:07.101658Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:ff945db41825d5972f7dd073abbca78a57e3119a35f93fe9b6720d9d474bfb9f","observation_id":"7149a33a-3483-4a62-84d9-032a2748de9a","resolution":{"observed_at":"2026-08-06T16:15:09.471579Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:15:07.191268Z","title":"Integrating tree decompositions into decision heuris- tics of propositional model counters (short paper)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:07.191268Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:fde8747f0e139455aadcada6d7eb235b45ee3b6b08aab5b48b5cade240cff250","observation_id":"b1e3d18b-b62e-4f46-84f2-d458304eef34","resolution":{"observed_at":"2026-08-06T16:15:07.191268Z","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-06T16:15:11.850709Z","title":"New upper bound for the #3-sat problem","venue":null,"work_id":"45a38bcc-5e2a-4afc-a1cf-d13a5dbf29f5","year":null},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:07.257881Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:fbaaa76748b96d857c9c165e43aeaa7035171ab55da80941c1a30c04fdd3ba04","observation_id":"2e3d6eda-1f2a-4363-b914-b7453ea31b0f","resolution":{"observed_at":"2026-08-06T16:15:11.853342Z","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":"10.3233/faia201009","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"URL https://doi.org/10.3233/FAIA201009","venue":"Frontiers in artificial intelligence and applications","work_id":"13bf5a9c-6fed-42bd-8d7a-863008146c9b","year":null},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:06.895443Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:1bb99698b274f21d91ce2f1dde308c486f38434b1740b9229051bfe2398b62b5","observation_id":"a61681df-b407-45cc-a4b8-987cb6cf64e8","resolution":{"observed_at":"2026-08-06T16:15:09.822937Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:15:07.497300Z","title":"Shrotri, Kuldeep S","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:07.497300Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:2ccbf1fcc0c45ffce724c9328c22b973e073f1501712f480c93478c89fbd5fb8","observation_id":"e44505f9-99bd-42d9-b828-2392fe4c6480","resolution":{"observed_at":"2026-08-06T16:15:07.497300Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:15:07.551121Z","title":"On the hardness of approximate reasoning","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:07.551121Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:e19d85ce49dae9fa5ae1cc02015157d30113849d3c0318448e8ba5dd568adfa4","observation_id":"90be9a19-c915-40ed-b24e-772aeb47e78a","resolution":{"observed_at":"2026-08-06T16:15:07.551121Z","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":"10.1016/j.jda.2009.06.002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Algorithms for propositional model counting","venue":"Journal of Discrete Algorithms","work_id":"a29bb2df-aabf-46cf-9764-941d9d8c4b04","year":2010},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:07.627787Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:5576a23ec84e4722c0d935bd8efa853725591015d6b80ecafbec84efb9e06254","observation_id":"e22dc4a8-f7a7-4780-bc20-8b8518245d02","resolution":{"observed_at":"2026-08-06T16:15:08.968335Z","resolver_source":"doi","status":"verified_exact"},"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-06T16:15:11.842679Z","title":null,"venue":null,"work_id":"1e5484fd-dd42-42b4-9b79-a4e9056af857","year":2005},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:07.710956Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:dad4595dcaf11e713b0f7db5a3baaa1a29769900be5549317b6440975b9701dc","observation_id":"b091d314-8a04-4499-8d94-04932733f518","resolution":{"observed_at":"2026-08-06T16:15:11.845048Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T16:15:11.834612Z","title":null,"venue":null,"work_id":"c348a789-52ad-4b9a-a5da-8087a3f874bb","year":null},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:07.802916Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:55655637ea6e6c3c46ddd76b97f3d2bab9c2da01cb42a107a4d129a03edfa23d","observation_id":"635bb2ac-ed2d-49ce-a756-a751f5f87dc7","resolution":{"observed_at":"2026-08-06T16:15:11.837559Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"10.1007/978-3-540-79723-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"A tighter bound for counting max-weight solutions to 2sat instances","venue":"Lecture notes in computer science","work_id":"92de2473-8a7e-4611-9ca3-10c3d61200c2","year":2008},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:07.920417Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:1370e4ddc9bc589ad818aa557f2337cdd9f2d01ab7b8d1b2cef69f37cc084f94","observation_id":"c1e883f6-9267-4cf7-a720-207ec6c3c141","resolution":{"observed_at":"2026-08-06T16:15:08.791357Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/0020-0190(92)90160-w","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Lozinskii","venue":"Information Processing Letters","work_id":"985d05da-d58d-4173-8285-5e75cd145441","year":1992},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:07.395877Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:4420488127641d990a3025f316010f90aea2c456a54097052e63b6ab29521467","observation_id":"9ae4d012-fc34-4673-a29e-2ce5254e4035","resolution":{"observed_at":"2026-08-06T16:15:09.163987Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/0304-3975(95)00144-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Number of models and satisfiability of sets of clauses","venue":"Theoretical Computer Science","work_id":"4f83b07f-c17a-402f-bcec-a28166af1378","year":1996},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:08.062711Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:819332ead106dcc52b783dabfdfb41101abe86d43efaf7b1571d173a7b894a57","observation_id":"05fbb911-525f-43ac-809b-3f31ef535a03","resolution":{"observed_at":"2026-08-06T16:15:08.496291Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1609/aaai.v24i1.7537","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"at least two clauses are removed when we assign a value to x","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"fe9710e2-3b08-4c0c-a111-dbd530617128","year":2010},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:08.135790Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:d6be1574287d78a91f004e97d4561ed842b9b44322b156a9e7d82321b5c5c1a3","observation_id":"7730ff83-7d40-4670-b8a8-699a5a6078f3","resolution":{"observed_at":"2026-08-06T16:15:08.335814Z","resolver_source":"doi","status":"verified_exact"},"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":"10.24963/ijcai.2022/262","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"An exact maxsat algorithm: Further observations and further improvements","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","work_id":"5fac92e9-c5a6-4cd9-9c25-1fb494aed7a9","year":2022},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:07.998066Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:c60fa0642d61a550fab31bcf8f43441cc5e1a37d9b93e4a7f95e5c330fc12390","observation_id":"98d257f8-6753-44c4-aae0-4bc15d40dee3","resolution":{"observed_at":"2026-08-06T16:15:08.633227Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:15:05.675589Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":1971,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:05.675589Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:a2d1b1b32c468145da15b3039f5b75e064a3f53ac33ee1ac8d45cbe1d763e9cb","observation_id":"568a6301-afe3-4d68-8b4e-df7e7121ce44","resolution":{"observed_at":"2026-08-06T16:15:05.675589Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:15:07.853906Z","title":"URL https://doi.org/10.1016/0304-3975(79)90044-6","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":1979,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:07.853906Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:2763d9d10cc884ca71a6f72110c5c0f08cab8870a946666484da480862944fa7","observation_id":"18deffcd-d814-46b4-880d-d9405ac18bb8","resolution":{"observed_at":"2026-08-06T16:15:07.853906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12382","last_updated":"2020-03-25T18:46:23Z","snapshot_observed_at":"2026-07-06T09:07:49.229343Z","submitted_at":"2020-03-25T18:46:23Z","title":"PyMatting: A Python Library for Alpha Matting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.12382","snapshot_observed_at":"2026-08-06T16:15:04.966872Z","title":"URL https://doi.org/10.1109/SFCS.2003.1238208","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:04.966872Z"},"links":{"cited_paper":"/paper/2003.12382","citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:ead4dcf030678a0501238ed33e8341e9d3261ad13be72ddcfc20e06d7678920e","observation_id":"b01988cb-3a4b-4e84-928a-05fb2e0c66ab","resolution":{"observed_at":"2026-08-06T16:15:04.966872Z","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":"10.1016/j.jalgor.2004.06.008","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"URL https://doi.org/10.1016/j.jalgor.2004.06.008","venue":"Journal of Algorithms","work_id":"cece4db2-9aa7-4323-87e9-c1bea5e49cae","year":2004},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:05.151815Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:aa20e67e1983d13b3fcb67ae9673c0dbe2a9b4c0ea75d9911955e9e9d705b679","observation_id":"9adb9a17-c64e-4132-9afb-a333291cbaf9","resolution":{"observed_at":"2026-08-06T16:15:11.519229Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/j.ipl.2007.06.017","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"URL https://doi.org/10.1016/j.ipl.2007.06.017","venue":"Information Processing Letters","work_id":"17405bac-ae26-466f-b418-7e07debb1aea","year":2007},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:07.339541Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:7734f0f1e7b75cde6b7bd31fd2554cf8dd2fd938e64a31d6d422beee12b3aa12","observation_id":"05763aec-7f8b-43a7-8415-120a34950bb9","resolution":{"observed_at":"2026-08-06T16:15:09.284144Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:15:05.334530Z","title":"URL https://doi.org/10.3233/FAIA336","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:05.334530Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:c12ba6269e3a8fc46cc81868f43f96b7708e4058f1724f8df5355871b5c6ca7d","observation_id":"746d50f1-8aa2-462b-9016-e941a6aa4829","resolution":{"observed_at":"2026-08-06T16:15:05.334530Z","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":"10.1017/s147106842100003x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"URL https://doi.org/10.1017/S147106842100003X","venue":"Theory and Practice of Logic Programming","work_id":"dea90945-a3a8-4935-921b-fd892231ad3e","year":null},"citing_paper":{"arxiv_id":"2507.14504","last_updated":"2025-07-19T06:32:36Z","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:06.283907Z"},"links":{"citing_paper":"/paper/2507.14504"},"observation_digest":"sha256:9834fdaeaf7ae09673c11011e003c3d2ed61e45ec7eb46f2acddeb33978c8e18","observation_id":"8554df3b-ddff-44d4-8a22-b1c12e5ce44b","resolution":{"observed_at":"2026-08-06T16:15:10.688092Z","resolver_source":"doi","status":"verified_exact"},"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":"2507.14504","last_updated":"2025-07-19T06:32:36Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T16:12:16.958071Z","submitted_at":"2025-07-19T06:32:36Z","title":"New Algorithms for #2-SAT and #3-SAT"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":18,"verified_fuzzy":6},"total_outbound_references":42},"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 42 of 42 outbound references and 2 inbound Pith citation observations for arXiv:2507.14504."}