{"as_of":"2026-08-20T08:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dc961b7d46e58c1a9e5722abc116e3111215cccd149105b72e8c2ac813ecf1fa","coverage":[{"denominator":100,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T20:08:33.475848Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2502.00145/citation-record","integrity":"/paper/2502.00145/integrity","json":"/paper/2502.00145/citation-record.json","paper":"/paper/2502.00145"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T20:08:31.291638Z","title":"Faceted answer-set navigation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.291638Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:12091e961661e4705fb2ab3a303d70887188d98837f3e062d59b42df1af9b269","observation_id":"555f654e-89f2-4e2e-9b21-50d2e42b683e","resolution":{"observed_at":"2026-08-09T20:08:31.291638Z","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-09T20:08:31.320715Z","title":"Advances in WASP","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.320715Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:4c700e57d69df390b1c89715ae67247a90613d7b0493b004e3ad1ff02b9a5182","observation_id":"67318a0c-2bda-4d54-bae3-1e00014425fb","resolution":{"observed_at":"2026-08-09T20:08:31.320715Z","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-09T20:08:31.325552Z","title":"Inconsistency proofs for ASP: the ASP - DRUPE format","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.325552Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:87c4b5f1f3abb35a7621d14afed24101908ce3a3d3541f8700aae8bac1bc2553","observation_id":"27e51bf5-416c-470d-943e-2eecc6275507","resolution":{"observed_at":"2026-08-09T20:08:31.325552Z","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-09T20:08:31.334770Z","title":"ASP and subset minimality: Enumeration, cautious reasoning and MUS es","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.334770Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:2e04b519b5b5d6d357f747ef5b6137eafc5ba8b6467563961ec73f082c911142","observation_id":"749119fb-0a15-446b-85cd-3e916c66f3c7","resolution":{"observed_at":"2026-08-09T20:08:31.334770Z","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-09T20:08:31.346828Z","title":"Optimizing planning domains by automatic action schema splitting","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.346828Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:91960565b8fd5ef9bf9cac41d643bbb506a8828abda14f86ee10e38df40ae89f","observation_id":"8846635f-960e-4857-a66e-d98835debd0a","resolution":{"observed_at":"2026-08-09T20:08:31.346828Z","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-09T20:08:31.366857Z","title":"Partial grounding in planning using small language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.366857Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:a570a1448e11409a8ae5ac791d4ece22e2175520e49785516af485c58c3cc4a8","observation_id":"6495d3f3-5787-443b-973d-117ce79ff29c","resolution":{"observed_at":"2026-08-09T20:08:31.366857Z","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-09T20:08:31.371337Z","title":"On the glucose SAT solver","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.371337Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:8c00217e2d0ae89fe5666408dc084c0fad36f59226d3191979cc1a7dde5cec86","observation_id":"0895fdc1-e44f-48d4-be75-fabdf6bc0116","resolution":{"observed_at":"2026-08-09T20:08:31.371337Z","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-09T20:08:31.375238Z","title":"A new exact solver for (weighted) max \\# sat","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.375238Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:1c15dc019ce135b9ebeedf16865b9d1a8e58ab3c4ae916c90cd82fc12180804c","observation_id":"6fea284d-db0b-450c-b2d2-9d1c444b032c","resolution":{"observed_at":"2026-08-09T20:08:31.375238Z","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-09T20:08:31.379451Z","title":"Stable model counting and its application in probabilistic logic programming","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.379451Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:216f3d75f927299b5fc594f971d6b1686c244c9d7df1f4c42a6141487049dbe9","observation_id":"3b19df23-0d32-4f6f-9dc3-9eb3218b5f86","resolution":{"observed_at":"2026-08-09T20:08:31.379451Z","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-09T20:08:31.384416Z","title":"Learning planning domains from non-redundant fully-observed traces: Theoretical foundations and complexity analysis","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.384416Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:4523a9a06e14f4e0e143ed13ae19fa8709fdbafed7b7b66f9f8b863be077f284","observation_id":"78bee6c5-c307-4654-99cf-d085ad41d5ef","resolution":{"observed_at":"2026-08-09T20:08:31.384416Z","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-09T20:08:31.424772Z","title":"CadiBack : Extracting backbones with CaDiCaL","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.424772Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:63cdf036ac24f4caa383d846d3a958d4c2490cadbc298e704781502e6dc40742","observation_id":"bb9cd1b3-f6e1-47a7-8b59-4d9bd4d93c70","resolution":{"observed_at":"2026-08-09T20:08:31.424772Z","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-09T20:08:31.444335Z","title":"Course of action generation for cyber security using classical planning","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.444335Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:7ac209c00dccd96e27ccffcf8a4a1362f1191743f481a0ef6bfc8ec8f8f19578","observation_id":"ba0f036f-7d67-4cc1-9f49-4641c317dd4f","resolution":{"observed_at":"2026-08-09T20:08:31.444335Z","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-09T20:08:31.488319Z","title":"Representative answer sets: Collecting something of everything","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.488319Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:95fdf1d27279fd226fa31281acffa8a6a046fb7791753996ceb675b5f9e44078","observation_id":"cebd160c-b329-4607-87ab-3e0d4de132a3","resolution":{"observed_at":"2026-08-09T20:08:31.488319Z","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-09T20:08:31.504761Z","title":"Policies that generalize: Solving many planning problems with the same policy","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.504761Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:8d0f9169b9a610aa6265a6aa00c81fbf6d77ff1ed8e417463e500471adf572cd","observation_id":"2e7aec2a-9418-420e-965e-19e3cc178a6c","resolution":{"observed_at":"2026-08-09T20:08:31.504761Z","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-09T20:08:31.514759Z","title":"The computational complexity of propositional STRIPS planning","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.514759Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:6100fd811e68a813ea26a79f590e13dabad2a4ae1be9925d7c59401b29ccbec9","observation_id":"3346fa1b-c407-4514-8b80-886fb568a236","resolution":{"observed_at":"2026-08-09T20:08:31.514759Z","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-09T20:08:31.519630Z","title":"A system for explainable answer set programming","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.519630Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:ed31a49cc967220c02da2cb52b7e24e4b0bceb12b766d6aeee8f255edc03c5cd","observation_id":"3a3df2e9-fdaf-4ec4-a48b-88200c3249de","resolution":{"observed_at":"2026-08-09T20:08:31.519630Z","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-09T20:08:31.529387Z","title":"Interactive plan selection using linear temporal logic, disjunctive action landmarks, and natural language instruction","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.529387Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:481665a919c7d457e2bc27877c61ba9f6e9e5e83186eb8c9b69a4f09f0cb2d45","observation_id":"7b72f972-1633-4c72-830c-560b45b31638","resolution":{"observed_at":"2026-08-09T20:08:31.529387Z","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-09T20:08:31.542869Z","title":"Chen, Sylvie Thi \\'e baux, and Felipe Trevizan","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.542869Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:872d0ac201111d2c207b82e28f88cc39f3cfed0f1af6c22d17ac0d8563d6cb12","observation_id":"e0af6086-e3f0-42c6-8420-fb7513bec18b","resolution":{"observed_at":"2026-08-09T20:08:31.542869Z","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-09T20:08:31.584779Z","title":"Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence ( AAAI 2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.584779Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:748db32f354391b46dd59c743f38e626edf568e13d24883f664d91af79415186","observation_id":"202a8e97-b47c-4a59-82c0-75369b6f43de","resolution":{"observed_at":"2026-08-09T20:08:31.584779Z","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-09T20:08:31.680146Z","title":null,"venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.680146Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:bee004b6286e854e2820d188cf9c55137ea057257efed77a6d315fc70a964ce5","observation_id":"ff6643fb-95df-41d9-8681-7fd5c6a96db2","resolution":{"observed_at":"2026-08-09T20:08:31.680146Z","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-09T20:08:37.124582Z","title":"Corr \\^e a, Markus Hecher, Malte Helmert, Davide Mario Longo, Florian Pommerening, and Stefan Woltran","venue":null,"work_id":"80c5ea7c-eed7-4c11-8ec8-f38b11868cff","year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.687591Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:ec18132eb2821663d23d24dae0c07c1aaef4854568d60f50c996c1db50847672","observation_id":"e5011b9b-87ea-4960-a771-70ba48722d2f","resolution":{"observed_at":"2026-08-09T20:08:37.128819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:37.113264Z","title":"A knowledge compilation map","venue":null,"work_id":"d323453c-99ca-4fc4-b02e-442741521901","year":2002},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.691238Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:352f1328614e181f7cb9488ec268521aa27ee65aef719484afc8984ec03abbeb","observation_id":"32ec8781-8512-4900-8a06-1b7f00f4d4cf","resolution":{"observed_at":"2026-08-09T20:08:37.117518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:37.089406Z","title":"Knowledge compilation","venue":null,"work_id":"6774c8a5-ea52-4bee-9f90-496b74dd68fa","year":2024},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.695727Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:3850bdad3c68b2990dc8e05a8560227c3b0cd6a12f0c5ff4ae7b17535c261c18","observation_id":"7bbb5bef-5844-4368-bf72-c04979798238","resolution":{"observed_at":"2026-08-09T20:08:37.098329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.996732Z","title":"Compiling knowledge into decomposable negation normal form","venue":null,"work_id":"fdb70332-c937-4a40-9f58-04369acea4b4","year":1999},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.699683Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:fb4d3c46c603e72505ebeb7febaccd2d5015fa5f57caca09766259c4721668b6","observation_id":"4f20a7eb-6d9d-46ed-a7d9-8ee4b5ff6a5e","resolution":{"observed_at":"2026-08-09T20:08:37.064009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.911716Z","title":"Decomposable negation normal form","venue":null,"work_id":"8bd3a371-beef-49b2-998d-3ae5de180c98","year":2001},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.703632Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:eca4bf239c96b36ca133a0dd9a40678d409c01f8448b019c2ccb776d71be8caa","observation_id":"ee9c910d-4144-44f9-84ea-3e6ea120fdcf","resolution":{"observed_at":"2026-08-09T20:08:36.943109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.900130Z","title":"On the tractable counting of theory models and its application to truth maintenance and belief revision","venue":null,"work_id":"b6c9bae3-27a2-471c-9c1a-9602823ae840","year":2001},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.708004Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:10b4bb6151f81e7fbee0491317c9dc94cf2bdb97e070df9848dff82270934eae","observation_id":"2eb8dbe2-20ba-46d5-b0e1-0fd5a54db3ae","resolution":{"observed_at":"2026-08-09T20:08:36.904848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.889828Z","title":"New advances in compiling CNF into decomposable negation normal form","venue":null,"work_id":"4824f956-b1d4-4585-804f-2cc9c9b96e49","year":2004},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.711801Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:36ced8633aae189ca66c53101eeb4400033ba93aca113a118078a3e613c24c55","observation_id":"ac3bb831-43e2-48e5-8f02-41cecf3842c0","resolution":{"observed_at":"2026-08-09T20:08:36.893363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.778657Z","title":"Probabilistic planning via heuristic forward search and weighted model counting","venue":null,"work_id":"8b1eb28f-2f11-4e89-989b-7a9950ce84e5","year":2007},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.716213Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:f14fa3e1ab9bc6564e9d7ffa4fc4ea603d66935c5c90dea3fdd5fb72f7050957","observation_id":"d28b32e5-6036-4aed-8f2f-48b780183ce1","resolution":{"observed_at":"2026-08-09T20:08:36.815093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.767040Z","title":"Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence ( AAAI 2024)","venue":null,"work_id":"08b184dc-0f86-4ced-91a3-7d1f40e78878","year":2024},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.721592Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:46af1c7a8144aaec24d471d64863598cf33e7b0304c452c7a0b9a78fdafb98b4","observation_id":"660a1604-d4be-43a4-b593-dac0f6305f2e","resolution":{"observed_at":"2026-08-09T20:08:36.771947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.755666Z","title":"A new approach to plan-space explanation: Analyzing plan-property dependencies in oversubscription planning","venue":null,"work_id":"bb7f4e43-9645-40c1-8df0-98d0169684df","year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.778324Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:033b5d12aaea44aa0969b054026e9bddbb4628cf3a89c34e12ccdbcbbfc9a5d6","observation_id":"e7a8f7ea-642d-4c7f-a034-5b8d02e500dc","resolution":{"observed_at":"2026-08-09T20:08:36.760053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.711289Z","title":"Epistemic logic programs: Non-ground and counting complexity","venue":null,"work_id":"8d24379f-10d0-4e20-aeb1-d9f079e46b1f","year":2024},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.834637Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:af0b2984602ae3fd7f7ff7bc9af5b51eaad37390c9f92cb7b49c9068934d2143","observation_id":"f221b498-583a-4e89-858a-74f928e7f62e","resolution":{"observed_at":"2026-08-09T20:08:36.738185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.676322Z","title":"aspmc: New frontiers of algebraic answer set counting","venue":null,"work_id":"ecfcefb3-e4e6-4d3a-8b73-b32c0e4b2993","year":2024},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.882751Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:8ab282627b818a82c81da4d318b9361794f85c0e47d10075ce4d54465bc5270f","observation_id":"44d9295b-1d92-437c-888a-e457c377e9ca","resolution":{"observed_at":"2026-08-09T20:08:36.680328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.664740Z","title":"Optimizing the optimization of planning domains by automatic action schema splitting","venue":null,"work_id":"600bb4aa-760a-4471-a6da-d9d7d1e41108","year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.886828Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:8c525a14c2b3009dfa8b623816c0b8acbd947602924a76e406cc91f668c6a7dd","observation_id":"fc199c32-24a4-47c4-aabc-17c9e0c19e89","resolution":{"observed_at":"2026-08-09T20:08:36.668731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.652665Z","title":"Fenner, Frederic Green, Steven Homer, and Randall Pruim","venue":null,"work_id":"8b70c260-70c6-4781-b7ae-d1b84e7ef64c","year":1999},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.897102Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:ba45a8f8310c85a1689e9ea80ace00106ad1ee3710dc2891d06a1d053e5ead08","observation_id":"eaf23316-17a5-4a8d-ab61-d782865af508","resolution":{"observed_at":"2026-08-09T20:08:36.657074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.604658Z","title":"Answer set solving with bounded treewidth revisited","venue":null,"work_id":"ae635952-8f99-4766-82be-278714703ece","year":2017},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.915526Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:2004cd76e5ef7cf750e200b3245e88730b5a9c01ed2ea4388171615e02fb1dcd","observation_id":"63a0e7ca-4dcb-4292-8d1e-81277b6133c3","resolution":{"observed_at":"2026-08-09T20:08:36.644831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.554722Z","title":"Fichte, Markus Hecher, and Florim Hamiti","venue":null,"work_id":"ecb19c73-4da8-4153-893e-ab9bd8ede2a1","year":2020},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.928887Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:b2fbbbf8fdc4cf00ce1b104241262d541b0b584dfc6b75e9f5e2e16e6220e669","observation_id":"2344d3cb-891e-4ac8-b1ff-ee6ade2a6be5","resolution":{"observed_at":"2026-08-09T20:08:36.559120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.541159Z","title":"Rushing and strolling among answer sets -- navigation made easy","venue":null,"work_id":"2aa71074-c19c-4e14-a72e-9c7d2e98f299","year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:31.945663Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:9ac772708ab1c2fcab8190051eb08730519506fe83c2acd24297e246c16e795a","observation_id":"725f2bd4-585b-4148-8fe7-65aeeb7ec8c6","resolution":{"observed_at":"2026-08-09T20:08:36.545409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.529374Z","title":null,"venue":null,"work_id":"d8a71866-82b1-4eec-985f-026b52f04d14","year":2022},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.084751Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:1efe22c69d124f2ee7e84a207482a78411d475c3dd072bf64387e58a61c00f38","observation_id":"f0db626e-b611-41bb-bcc1-fd0ce633183c","resolution":{"observed_at":"2026-08-09T20:08:36.533432Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.516232Z","title":"Proofs for propositional model counting","venue":null,"work_id":"6311c6f7-1859-4df3-9d13-ad970286a643","year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.146319Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:bf6c91b212c79c7f6b645534e226e78a4d3f12e6f8d4488d6ba71a655dd189d0","observation_id":"ce3d218c-e859-4ad1-a4de-1d0b12359b6d","resolution":{"observed_at":"2026-08-09T20:08:36.521404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.465783Z","title":"IASCAR: incremental answer set counting by anytime refinement","venue":null,"work_id":"e9f74150-c4d7-4ae0-b635-6fab73ea2d03","year":2024},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.199533Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:fa84c25c06ef914e472508cc02a8859a5620340bc33c8a71a918d9ba1b678690","observation_id":"6402cd91-7894-4d80-ac44-19cf33d020c2","resolution":{"observed_at":"2026-08-09T20:08:36.487101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.454704Z","title":"Benton, and Christian Muise","venue":null,"work_id":"baae32f4-f283-4780-ada0-eb4b5df94c89","year":2024},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.211520Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:cbadd74a1c14b1c169d94993041d40d54a9d6930427feb27b0293e4e6b7d2a98","observation_id":"4635fabe-f417-431a-81e2-455b84d009d6","resolution":{"observed_at":"2026-08-09T20:08:36.457986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.444598Z","title":"Frisch and Peter Gregory, editors","venue":null,"work_id":"2cb58730-18cb-4c67-bb59-18e051cef777","year":2022},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.219566Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:49a01917808aee4f28fe28c2fb7195e83455bea29f6a8d091d5aa60cebc4dcec","observation_id":"29a41793-9f30-4f4e-9b29-3952d3600013","resolution":{"observed_at":"2026-08-09T20:08:36.447882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.434806Z","title":"Solution enumeration for projected boolean search problems","venue":null,"work_id":"dbe7a436-c307-4aed-a725-45d266feccb4","year":2009},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.224157Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:25bd28f820665ba7bd2b29af0042082e0c823655228331e714a62b1efcc77f7e","observation_id":"1846249c-e4c0-46cf-9920-b9836ffdc364","resolution":{"observed_at":"2026-08-09T20:08:36.438597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.422867Z","title":"Advances in gringo series 3","venue":null,"work_id":"e3f0e907-dd5e-4d43-b2fa-eeda8428f7e6","year":2011},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.230426Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:d05161a1540f9b86f759d9e48f92ab6f97703247f023e3bae924a3cc5b04492d","observation_id":"265124c2-1ea2-408b-b7ae-18c45269b68a","resolution":{"observed_at":"2026-08-09T20:08:36.426874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1405.3694","last_updated":"2014-05-14T21:33:07Z","snapshot_observed_at":"2026-08-15T14:31:01.619560Z","submitted_at":"2014-05-14T21:33:07Z","title":"Clingo = ASP + Control: Preliminary Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1405.3694","snapshot_observed_at":"2026-08-09T20:08:32.234939Z","title":"Clingo = ASP + control: Preliminary report","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.234939Z"},"links":{"cited_paper":"/paper/1405.3694","citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:2b1204c8145f5340d1b20229bf22b968442f46c2ced92923d86c44491257e8e3","observation_id":"8a26aec0-d1a3-42de-902e-25970e8ffd2e","resolution":{"observed_at":"2026-08-09T20:08:32.234939Z","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-09T20:08:36.393228Z","title":"Computational complexity of probabilistic turing machines","venue":null,"work_id":"d98c18f7-ae89-4fa2-b6d5-fcd27261f551","year":1977},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.240136Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:ddb47bba8c8d8dcf758a37f0c17c2a235935a1653b7264034507d43c20f42a99","observation_id":"9fbd6b34-526f-4072-9165-003e4588f55f","resolution":{"observed_at":"2026-08-09T20:08:36.414897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.356914Z","title":"Learning how to ground a plan -- Partial grounding in classical planning","venue":null,"work_id":"b8d33aa2-429b-4b89-9e08-d582897b95ea","year":2019},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.245040Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:d91b79e349386fb7dff34b90724004fd286e2ab0a02ed444073808d6f98ca932","observation_id":"8163c7a0-9c04-4386-8a8c-26b4dac23be3","resolution":{"observed_at":"2026-08-09T20:08:36.361764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.346536Z","title":"A planning approach to repair domains with incomplete action effects","venue":null,"work_id":"c3b6fb69-3e6d-49c9-9b4c-cbbdbd082d8c","year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.255709Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:c53f7ff141a0ad23018bd9eb6a6a345efdf5d63709003ec9e5d0d80dcc023158","observation_id":"bf6be6d4-5e2a-4534-b9ab-b873bf62d06f","resolution":{"observed_at":"2026-08-09T20:08:36.350480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.334768Z","title":"Plingo: A System for Probabilistic Reasoning in Clingo Based on LP \\( ^ MLN \\)","venue":null,"work_id":"36da9b4f-3e07-4cb5-9007-1535dcf0b9bb","year":2022},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.337700Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:d01801cf412105488b083d55777705a81a5ebc2dbf14109a36a38d3a724a37f3","observation_id":"ee9c3691-b1cf-4f5b-8f77-c4a33bf26b70","resolution":{"observed_at":"2026-08-09T20:08:36.339552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.290939Z","title":null,"venue":null,"work_id":"40ceb157-4f52-4d79-8e46-df95d4cb2c85","year":2009},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.400002Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:2f9a3631b94d9559daaa79f73a6af72ba2b143eb94b1b13b8cfc5eb86557fe6b","observation_id":"ba0e8618-26d0-4bf5-99c5-f3ec0fb3a696","resolution":{"observed_at":"2026-08-09T20:08:36.310063Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.280853Z","title":"The Fast Downward planning system","venue":null,"work_id":"48fac623-5f41-4b70-a92c-a5d0cfedff3a","year":2006},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.438222Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:7cddf7138a551a98352aabd5f5dcba245c211ec61132d059d0c1e6e3414cdff9","observation_id":"e2673686-24a7-44d8-8438-7eab1f8f4c03","resolution":{"observed_at":"2026-08-09T20:08:36.284154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.269737Z","title":"Concise finite-domain representations for PDDL planning tasks","venue":null,"work_id":"2575d7bb-daed-41f3-9bfa-d5b00b936ce7","year":2009},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.442551Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:a9a6189a07f6c9023314f0c313968f52334a1320d9b31baa07640024d9d027b1","observation_id":"28165ba5-04cd-421c-aada-290d3fcb6b01","resolution":{"observed_at":"2026-08-09T20:08:36.273130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.258294Z","title":"Encoding lifted classical planning in propositional logic","venue":null,"work_id":"ec4dfa71-def9-49ca-ac3e-734e4a4774bc","year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.446641Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:9612e09acf8e51f65cddda33f88e1df118cd7c90753b620b58b4669c3e7771aa","observation_id":"6d23aa86-86e4-4d6a-86ce-be093a5d4e7f","resolution":{"observed_at":"2026-08-09T20:08:36.263240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.223594Z","title":"Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence ( AAAI 2022)","venue":null,"work_id":"824434fd-f4c8-41c2-a626-bb548989c687","year":2022},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.451847Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:bfd1f95e6491c4a895f74c8259aecb96d431aa36e1b1669efe49e2e40e92103e","observation_id":"920f7470-888c-4c18-81a3-e5a569b08064","resolution":{"observed_at":"2026-08-09T20:08:36.238167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.201076Z","title":"Everardo, Ankit K","venue":null,"work_id":"e233586e-f808-494f-9b8d-3d1f148b8974","year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.456142Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:15932332c9ca745e8d93b46305f3544e1b579b11fb447d9de2e08da5952ac71b","observation_id":"f07ce53b-8471-4b15-ae8c-195002ba454e","resolution":{"observed_at":"2026-08-09T20:08:36.206304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.186487Z","title":"Cost-optimal planning with landmarks","venue":null,"work_id":"ee870097-e41b-466c-8c28-1fb108804b80","year":2009},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.490827Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:db6c176ba686dc5fddf82150a6516f0f100815859764d3f17669f8d77a791eb1","observation_id":"292ea642-184d-4378-829d-7f129bb1f477","resolution":{"observed_at":"2026-08-09T20:08:36.190462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.173749Z","title":"K* search over orbit space for top-k planning","venue":null,"work_id":"3bcbe333-2a00-431c-a91d-eabf739f5b39","year":2023},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.496493Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:ce89c6e65e52764665ed7b3b4820bc1644bb4d522ed73313715b983852e2d346","observation_id":"c28cd26d-617f-48d4-8be2-62893a4bc4c4","resolution":{"observed_at":"2026-08-09T20:08:36.178847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.139779Z","title":"Reshaping diverse planning","venue":null,"work_id":"ae0d1509-ea04-4d1a-92bc-0cb1438a4986","year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.509012Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:c16705a6479622426bb32d707ac6779c5170121a1f3931f3bc56d009cdf59c89","observation_id":"70e31232-d23c-419f-8ce3-e4950668665f","resolution":{"observed_at":"2026-08-09T20:08:36.153122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.116662Z","title":"A novel iterative approach to top-k planning","venue":null,"work_id":"0ef258a9-8f01-431d-b46a-86d3f6cb973e","year":2018},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.533371Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:4ce58a1853765a71ee6bd028bda111ffd1dbf20c162fc50acb54ff6163fe35a4","observation_id":"b0469fe9-8094-42b9-81af-45c2de2b160b","resolution":{"observed_at":"2026-08-09T20:08:36.120486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.104757Z","title":"Planning as satisfiability","venue":null,"work_id":"e32b6bb2-f746-4956-8e4f-bc0168fd12c6","year":1992},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.546979Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:3aea5022ae60c81d45c9318799462913b91c2561353367c0b646eab6abb0dba7","observation_id":"5ea70abd-5ff0-47f1-a5ac-0b199e0565aa","resolution":{"observed_at":"2026-08-09T20:08:36.109271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.090534Z","title":"Knowledge compilation and more with SharpSAT-TD","venue":null,"work_id":"bcee3770-f1f5-4b19-aab8-cf4342ce1054","year":2023},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.551799Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:72fe5e97267637b759efccf84715fadac03167116a188bf77b37b6c45e4e4fd4","observation_id":"2e54c9ab-c604-42a1-9d96-1c81d32a7908","resolution":{"observed_at":"2026-08-09T20:08:36.094730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:36.078144Z","title":"Propositional logic -- deduction and algorithms , volume 48 of Cambridge tracts in theoretical computer science","venue":null,"work_id":"9fdb510b-a76f-464b-9f66-9fa0f4090536","year":1999},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.556979Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:17636d321a7fc9b7b5f6ebe1f54bd8fc8508f6538641b6abf8222f40cf6ae8f8","observation_id":"6f3940e1-d76e-4c69-805e-0a421f5bcc3e","resolution":{"observed_at":"2026-08-09T20:08:36.082337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.943040Z","title":"Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling (ICAPS 2023)","venue":null,"work_id":"c9b4e807-a6d7-47c8-bf01-f1f3531bce74","year":2023},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.567041Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:6e21a1333e57b12f6f218aba455ef0671270e37b0af32d4b09d6d99b6648499d","observation_id":"4737637e-f2ae-4a38-9ae5-894093b6469a","resolution":{"observed_at":"2026-08-09T20:08:36.013587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.844563Z","title":"Learning pruning rules for heuristic search planning","venue":null,"work_id":"7d1d7584-b927-4d18-9197-edb2284bf7e7","year":2014},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.654062Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:e70932322804853d79992e048d67898732262ab794dcdd322373adcf1c20e0b3","observation_id":"23f46df1-5646-4718-b596-ada0b59f6971","resolution":{"observed_at":"2026-08-09T20:08:35.857553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.832561Z","title":null,"venue":null,"work_id":"883e6c21-8755-4cd1-934b-e03ea385f297","year":2021},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.733702Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:58de261c7b39381306ed8ca11cfda60a7d5ce7bdbab47413e10b4a3b59aeef5e","observation_id":"b8e35cf1-a261-499a-9b41-3dfa8d45fc4b","resolution":{"observed_at":"2026-08-09T20:08:35.836844Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.821345Z","title":"An improved decision- DNNF compiler","venue":null,"work_id":"06345440-a850-4375-aac3-ce783d4cf1cb","year":2017},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.765639Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:9f44ea42b7a2b79ab75910ac3f7c06db6e6632e6fcd2a6b47d290e97de2584f8","observation_id":"9189dbc1-3948-4d84-bf7a-aa6ef736b4cb","resolution":{"observed_at":"2026-08-09T20:08:35.825670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.810635Z","title":"Meel, and Roland H","venue":null,"work_id":"53518311-52a2-4fac-aeb5-b0b8a2e9c7f7","year":2021},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.774762Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:ae718a886f4c982c5701d6e4ff927287425fb2c565ec42be073352e45a50f9d0","observation_id":"76d30d58-a07c-4fbe-a6a2-2d8c24880b60","resolution":{"observed_at":"2026-08-09T20:08:35.814569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.798145Z","title":"Towards automated modeling assistance: An efficient approach for repairing flawed planning domains","venue":null,"work_id":"6e108bd3-4a0d-49c4-9619-36b81123504f","year":2023},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.787133Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:9fd388f1856a0d655b7d6637357d3a86254ece34ee5152f08d78b9202144f2a3","observation_id":"3e06de20-d3d4-4b56-a540-5cb330611792","resolution":{"observed_at":"2026-08-09T20:08:35.802846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.624683Z","title":"Proceedings of Twenty-Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2023) , volume 271","venue":null,"work_id":"2dd2a095-6092-42ab-8a70-f4cf38e429c2","year":2023},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.805915Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:4a3382b96c189881eccc8161f55052b0ca2cc6cf2593cad6baccce22dd325f78","observation_id":"c4ca3a1e-4a10-419d-9aaa-4713c5295b3c","resolution":{"observed_at":"2026-08-09T20:08:35.709798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.579802Z","title":"On CNF conversion for disjoint SAT enumeration","venue":null,"work_id":"f07dfd56-39c0-473b-a658-5ac4f43a4aea","year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.809746Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:6f8eaafdc74037d4d5ea90c77570881c925c2830ace362410d422c0598f60d02","observation_id":"7cb49ec5-ab4e-41bc-8e7a-be4a00783186","resolution":{"observed_at":"2026-08-09T20:08:35.584798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.566357Z","title":null,"venue":null,"work_id":"ac9b7330-d8bd-4f3c-a3d1-373cc4adf200","year":2021},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.813262Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:2c8c7d7de4c8ee5ec94232ddae6626710dc015451df338724b25c5b812be8c5f","observation_id":"00940556-b243-4969-90ef-e5b56eed7433","resolution":{"observed_at":"2026-08-09T20:08:35.571372Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.553545Z","title":"Planning.Domains","venue":null,"work_id":"bfc708c5-95e1-403f-87a6-3a0b087d319c","year":2016},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.817310Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:2c77eeaa17522ccc96723e405d915b675d5178afb994e007450859a9e80a9a24","observation_id":"f2328890-c6f2-4a8b-9732-a7eec17374aa","resolution":{"observed_at":"2026-08-09T20:08:35.558977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.504743Z","title":"Papadimitriou and Mihalis Yannakakis","venue":null,"work_id":"cd659a96-afd6-4f10-b351-740fe17d055b","year":1982},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.823174Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:4bdf3cada10ecdff76c148a52c8eecc54b5c6cce0bbf0be68d1d4d620c9c2c9a","observation_id":"88e5a8cd-ccf0-42d0-9f2b-0fb4051d4388","resolution":{"observed_at":"2026-08-09T20:08:35.544506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.311232Z","title":"Papadimitriou","venue":null,"work_id":"63136af9-0941-40e0-a8ee-baeaf0d2c6b2","year":1994},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.827304Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:70ff326e2f61a30ab6a316571e78ebdfee5ed7e8792fe5329798774fdda24046","observation_id":"29d9bd97-9851-4385-90ae-b4d2d5aad48e","resolution":{"observed_at":"2026-08-09T20:08:35.372328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.298915Z","title":"Benton, and Christian Muise","venue":null,"work_id":"4e99d7c0-7aca-4899-b12e-dc05f194ca1a","year":2024},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.924757Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:a0f2a8d0701e5d6d13d6c56e653405ddff309ee7fe15970eed16228ead1b8f92","observation_id":"1f555084-1398-4358-bd82-2a9de4de18d3","resolution":{"observed_at":"2026-08-09T20:08:35.303790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.287581Z","title":"On the extraction, ordering, and usage of landmarks in planning","venue":null,"work_id":"cbe88765-fa06-46cf-a889-0cace78efc5e","year":2001},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.965119Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:368bac4a3b653eb9b37c822c10673226c19bf1ebe921f60a5e5df75ce97f402f","observation_id":"dc1a9d92-eaa2-4502-a1cc-beea6b91fcd1","resolution":{"observed_at":"2026-08-09T20:08:35.291305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.274895Z","title":"Landmarks revisited","venue":null,"work_id":"fa41c937-5b68-470a-a46c-e4d233e9fcd1","year":2008},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.969474Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:a451af03bdbcf5fad4823bd6b532a222aa197f6c92da3a943ebee86c71e4520f","observation_id":"97af89ce-ca0a-478d-a2fc-25cc3b4d3128","resolution":{"observed_at":"2026-08-09T20:08:35.279351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.218519Z","title":"Madagascar: Scalable planning with SAT","venue":null,"work_id":"73865f46-b9e6-4797-b2fc-21c676a8231b","year":2011},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.973493Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:cd984bb945d35c7a8bcb608e8ced1f26acb8f9d13bd81620e8f8e8b3d6e5094e","observation_id":"28c533ac-b516-434e-b2dd-383722697265","resolution":{"observed_at":"2026-08-09T20:08:35.267579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:35.007222Z","title":"Planning as satisfiability: Heuristics","venue":null,"work_id":"0ddf3d7c-c3c9-4472-859e-1001cf7cba6b","year":2012},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.977877Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:d12478102985b85074e4f8cd675f98a76e1d7737f7cacc0ee8b43d31366fdc36","observation_id":"d08863f3-4223-4749-8733-6af5e8ce6a1d","resolution":{"observed_at":"2026-08-09T20:08:35.066536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:34.991322Z","title":"Madagascar: Scalable planning with SAT","venue":null,"work_id":"ae93a353-3331-4332-a6a8-2f1de7506879","year":2014},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.981824Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:ff1fb0c95bc29351688ca330c8395a0dfd795ec72ea2fcf5be16ce221b45065d","observation_id":"f4663e44-98f3-45ec-9a5c-a91851893574","resolution":{"observed_at":"2026-08-09T20:08:34.998414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:34.955308Z","title":"Handbook of Automated Reasoning (in 2 volumes)","venue":null,"work_id":"a02dbc5a-ac7d-49a1-b523-f5bf076a1c10","year":2001},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.986515Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:d0aa4b7a8cbc4e8119356006dce2a2ed46c8da379017e102803632a3deba521e","observation_id":"79fccf8f-4666-4193-9b3c-ba750aa8b172","resolution":{"observed_at":"2026-08-09T20:08:34.977664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:34.773215Z","title":null,"venue":null,"work_id":"0fa96f88-29c3-4a0c-b0d9-64e8b08dc5c6","year":2024},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.991936Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:cb851937ac000012e82f13e1c6b3c94b10fb18da045d86a379470fbd0171f59a","observation_id":"37b5ab8b-b1fc-4180-ab9b-0acf801638ac","resolution":{"observed_at":"2026-08-09T20:08:34.777042Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:34.760165Z","title":"Artificial I ntelligence --- A Modern Approach","venue":null,"work_id":"40e87ae6-be63-4c8a-856e-3c3834be867a","year":1995},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.995966Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:8ab9019b74ab6d1e7a53c5572f24691fb29c02e16d9421d67097ec4857642942","observation_id":"b6c68dc8-196c-4427-8e2e-a72b4633b194","resolution":{"observed_at":"2026-08-09T20:08:34.764795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:34.664457Z","title":"Learning domain-independent planning heuristics with hypergraph networks","venue":null,"work_id":"94aaae4d-fb01-49fa-9ea5-c11731ee9239","year":2020},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:32.999925Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:57a432a135a783d8c65d448b49e7223768d1ccc9510bc25798388f77fb3a0397","observation_id":"22e056ae-0d68-4451-b009-eaed1310441a","resolution":{"observed_at":"2026-08-09T20:08:34.751435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:34.530862Z","title":null,"venue":null,"work_id":"bb00ff45-fb0f-4a0b-8b1c-ab5f75705f00","year":2004},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.003694Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:ebea19606faa7625476cf4f8f841bd29d0166ae2b912b6acf55e84999f79fe35","observation_id":"dd15066d-daaa-4788-a5a5-1321fccf224d","resolution":{"observed_at":"2026-08-09T20:08:34.568131Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:34.517729Z","title":"Riabov, Michael Katz, and Octavian Udrea","venue":null,"work_id":"d9e23a54-a2d2-43c5-9e23-346a81c2634f","year":2018},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.030083Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:059fc78b888a5e39dbe2cd6e3de1eea78805c8aca26d75713868888663ada8fc","observation_id":"064ff06b-d527-4657-a3d5-0c017681db07","resolution":{"observed_at":"2026-08-09T20:08:34.522461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:34.505959Z","title":"Disjoint partial enumeration without blocking clauses","venue":null,"work_id":"8f958562-c4ee-4e77-a037-51f6e778f77a","year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.120748Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:8dc321fdfbce850c2c05755d6669bf84f6812a29444e19ae7b399312d2b18b17","observation_id":"95755179-32bb-4f2e-91be-0f3320df1953","resolution":{"observed_at":"2026-08-09T20:08:34.509934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:34.480830Z","title":"Symbolic top-k planning","venue":null,"work_id":"f7acbca9-3a07-4018-9628-4b1c3626156f","year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.180707Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:5b89eaf98eb191f3c055fb5913e050a0557eefa68c2d6450a1fd4dffbcb33e01","observation_id":"94917ec6-7d7b-4d37-9688-a9944e2d3da1","resolution":{"observed_at":"2026-08-09T20:08:34.496640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:34.279160Z","title":"Fichte, and Augusto B","venue":null,"work_id":"a0b205be-42e1-476a-895b-e028322b2769","year":2025},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.185877Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:b9134f0fa27b0c879a34e9f4cf3c1f853b2603d8c62991c09def29d6507fefcd","observation_id":"fe26206c-2263-4122-9df1-0198c0caab2b","resolution":{"observed_at":"2026-08-09T20:08:34.362826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:34.233253Z","title":"Stockmeyer and Albert R","venue":null,"work_id":"530e110b-a9ff-4076-9545-d9c1b9cf203f","year":1973},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.190682Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:8bb6a89228408e8f85fd93961c62408d09375c98b891057ff85999bfcf3ff51d","observation_id":"00d77eca-42b5-426a-a441-cb740d6488db","resolution":{"observed_at":"2026-08-09T20:08:34.238001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:34.219324Z","title":"Stockmeyer","venue":null,"work_id":"d1684f22-536e-4422-b6fe-b9a381e24ce3","year":1976},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.195611Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:2b1736374b784dfe47b85b9646c86a016583fd7a87e0e21473696a6df66ac2bc","observation_id":"a46be665-2766-4c4b-af44-bb12329c437f","resolution":{"observed_at":"2026-08-09T20:08:34.223763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:34.169393Z","title":"Reusing d- DNNFs for efficient feature-model counting","venue":null,"work_id":"4ae44340-016d-4a43-8fed-69295059d933","year":2024},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.200493Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:a6c586804d0548873e6e6ca95287a2e6783cf92fbbd65a2cdc18f7760cd33683","observation_id":"636b874b-e50a-4092-9be6-527aaef51992","resolution":{"observed_at":"2026-08-09T20:08:34.209003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:33.985043Z","title":"The 2023 International Planning Competition","venue":null,"work_id":"debd9485-2c50-4742-acf6-c57ec616101f","year":2023},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.204496Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:dd86372b01fb3abdcc8546fa21242f4cea1fe4feaccd3fb32c87caa7c5d75b77","observation_id":"c1620163-1caf-4263-86fa-9d850aabac4b","resolution":{"observed_at":"2026-08-09T20:08:33.990096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:33.972749Z","title":"Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (ICAPS 2022)","venue":null,"work_id":"eb4a27e9-c91d-46fe-ac3b-27bfd1fcc1e3","year":2022},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.208475Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:8a342574350603f4755590edba736ff40172fffcc628c67885b74a1eb014d84c","observation_id":"c4fd9dfc-48b1-4ee4-a114-9e5e7d823b60","resolution":{"observed_at":"2026-08-09T20:08:33.977033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:33.958341Z","title":"Efficient symbolic search for cost-optimal planning","venue":null,"work_id":"1480ee27-3a69-4428-93fc-c29481ce41ae","year":2017},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.212244Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:ddd52634f7b1dacc063c07941c821893608a0656efee28cffae6cbe5776f67c3","observation_id":"76bb8f88-8e10-4f4f-bb59-3613102b03a4","resolution":{"observed_at":"2026-08-09T20:08:33.962856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:33.757467Z","title":"Understanding Inconsistency -- A Contribution to the Field of Non-monotonic Reasoning","venue":null,"work_id":"cc83d954-ce9d-4caa-8c9a-fbeba70076cf","year":2019},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.275013Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:0363279a68e7beabebe30c4bdf26ada394c0efa2da66ad7421b2d5b50fe00d5d","observation_id":"1f765ca9-b93c-404e-8c2b-b7dd3401c2c7","resolution":{"observed_at":"2026-08-09T20:08:33.867168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:33.744496Z","title":null,"venue":null,"work_id":"d7021260-96e5-441c-9042-9f1f1c385ab1","year":1979},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.403649Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:4324f347bf4e3f26b8d745db3d6d6956de4354d620b6f7f18b90b45fb9871545","observation_id":"cbdffab1-92ff-4d5b-b305-c415866737fe","resolution":{"observed_at":"2026-08-09T20:08:33.748989Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:33.731227Z","title":"Loopless top-k planning","venue":null,"work_id":"b8800815-aab4-4677-9643-470e9755c570","year":null},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.464608Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:5f7fabccdb13da39410993134989bae43bd4b67ee8f639aae3bca684399b5711","observation_id":"77d47214-1aa2-46db-89cc-86469d343e96","resolution":{"observed_at":"2026-08-09T20:08:33.736215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:33.718646Z","title":"Complete sets and the polynomial-time hierarchy","venue":null,"work_id":"abee6dea-c8e4-419a-b4b8-d134d5bc3d25","year":1976},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.471975Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:8cbfcf9a96c71780661c71d8959e94fab4d2c8c247f9f5aa633d2d9de663937d","observation_id":"a6988f65-15fb-4fa3-9378-b9d5cd0d7a62","resolution":{"observed_at":"2026-08-09T20:08:33.722805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-09T20:08:33.516695Z","title":"Landmark extraction via planning graph propagation","venue":null,"work_id":"c0327385-e0e6-40c8-85a4-f22eb607e905","year":2003},"citing_paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-09T20:08:33.475848Z"},"links":{"citing_paper":"/paper/2502.00145"},"observation_digest":"sha256:70ffd5573c7527f3fb39bd901aecc212d2d84b00e8b75ea008db780c3190b678","observation_id":"92009db4-033f-479d-9f1e-2cf61cf09aac","resolution":{"observed_at":"2026-08-09T20:08:33.594374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.00145","last_updated":"2025-01-31T20:03:51Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-20T07:36:36.483788Z","submitted_at":"2025-01-31T20:03:51Z","title":"Counting and Reasoning with Plans"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":0,"verified_fuzzy":72},"total_outbound_references":100},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 100 of 100 outbound references and 0 inbound Pith citation observations for arXiv:2502.00145."}