{"as_of":"2026-08-21T06:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:afb50ca91500905ada21edbfb97a624299075d5a3f99f279a7ab64a71a58090d","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T07:07:49.523646Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"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/2605.29687/citation-record","integrity":"/paper/2605.29687/integrity","json":"/paper/2605.29687/citation-record.json","paper":"/paper/2605.29687"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3233/faia201008","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Maximum Satisfiability , volume =","venue":"Frontiers in artificial intelligence and applications","work_id":"90c9d1d1-61b2-4058-adb3-e640ec59a7b1","year":2021},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:dcfa234962d52a2283ca89d3d36d19bd29d736177d9f64ab8000106eb2d82289","observation_id":"648edcf6-3cd0-41d8-8af7-2d8e29beb377","resolution":{"observed_at":"2026-06-29T07:13:15.770145Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T07:07:49.523646Z","title":"IOS Press, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:dfc3982daa77eded6596358459ab1c575f9bc35b072b9698efe2c7db75813db7","observation_id":"4a2f8dbc-7d51-4781-a74e-de1f44b03c45","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Logically consistent language models via neuro-symbolic integration","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:b16f50f6d489e2fc4eb2bdb77765eb75d552d6834a5a83ecca410c3d5af0b4c8","observation_id":"f24b8ae5-de9c-4d95-81a8-535efe6d6c4c","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:052c029f63dfc1d966846e46540557a90cc6c3fd153ce4d5a0d477d55a15dad5","observation_id":"f973620d-569d-4753-b71a-efd0042ceaf3","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Pal: Program-aided language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:846337a69c25ea5b80686ff05dbe0381932495fed741c8c64141eaf4797ad7fa","observation_id":"1bc459ba-18ec-4399-a46c-bcc97a92fb0b","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Pddl—the planning domain definition language.Technical Report, Tech","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:184f51b29f7354c6db9eea0b7df31ec497524dcbb16619bccae76003a6fb7e0c","observation_id":"4d36cd05-d849-493e-9075-b2fb3fe27ab2","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Gemini-3.1-Pro https://blog.google/innovation-and-ai/ models-and-research/gemini-models/gemini-3-1-pro/ , 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:9158972f024e8b0dff8b75c57304c5ace64d18c3aa3bdddd1d832e17c71be4cd","observation_id":"5626906d-1c49-43ca-b21a-e86be817a0dd","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:db34559a97de760f48725726aa8262922853233f5ba4516e917933bca0ed5154","observation_id":"c2ff6b75-88e2-4fa9-b31f-8bf36b055b9b","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Large language models can solve real-world planning rigorously with formal verification tools","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:9d67f18ea59658ce70340a81a836f3db881eb4d9edce3e3a1b0ae9aee301a68d","observation_id":"60198141-d37c-40ea-84f4-3cfe43d9f5d0","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Planning anything with rigor: General-purpose zero-shot planning with llm-based formalized programming","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:3338de8976aaa8fbc0cff74368e3eb98c11d277ada0e6a594f3d9cbead89fce4","observation_id":"c9db2046-d8f2-4cee-8052-28f5b41c0435","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"https://huggingface.co, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:55c0ab5ca00e7c3938f5778203b1a4b8514221db4833b6eafc99584730c0eace","observation_id":"48aedac5-27b1-4536-a782-b5fac85351c6","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-94144-8_26","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PySAT: A Python toolkit for prototyping with SAT oracles","venue":"Lecture notes in computer science","work_id":"69cf9f0a-485f-4d11-90da-81bc9d40e68c","year":2018},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:0421318e099ca580ceb674bd40bed60f2aecf0bd8c3260d7e35eec458a9ee370","observation_id":"ff6c3539-4d82-43ef-a0b6-cbee3f699453","resolution":{"observed_at":"2026-06-29T07:13:15.766994Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T07:07:49.523646Z","title":"RC2: an efficient MaxSAT solver","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:cf4b52e56deadd7f702d9ede17a4de3445211b529495a3af7d987105a7a0a08c","observation_id":"90a25fe4-eab6-4ccf-8602-5ff11532619e","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Exploiting maxsat for preference-based planning","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:e6d02837e1e14e66d81cb77da101ed4a175fa69647c3ba843f93787f0c4e6a94","observation_id":"b11faad7-3e38-4975-bac9-2d2ae0d8adcb","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Hsu, and Sheila A","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:fc6f81747c639f1f86fec27be16fa5acb10be36d6a539e193b49c7f230c23b72","observation_id":"ca7f06e4-91e1-4431-87c8-d1496f7b117b","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Position: Llms can’t plan, but can help planning in llm-modulo frameworks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:1afd5f0c645ab03b64f0f982595087ed54a615fac641234c683baacedcaaffd4","observation_id":"93096a01-aadb-441d-819d-69ab1d4d4d08","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Maxsat, hard and soft constraints","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:0f63da76a52d1ece662d7318a3dc496bcf588cd2d7a76e19f075a952d75cd5a7","observation_id":"de6aaedc-7223-44b3-bb27-49a4b418b462","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Liang, Chenyang Yang, and Brad A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:dc36fd535665746f78ab89cc3405b722b4b353788a6b9e0bcaf399b1900a03e4","observation_id":"a593ab20-e80c-4a2d-8ee0-b3f9d371647d","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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":"7503.360812","doi":"10.1145/3597503.3608128","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Liang, Chenyang Yang, and Brad A","venue":null,"work_id":"63f2d17f-5bb1-4c99-a332-29e7459afbe5","year":2024},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:bd64f8652f79a6c21415e2f4e55d193f013333020efcc5ecca7c2a07fe973a7d","observation_id":"2dfdf022-7c55-48d6-b53c-821f1337c60c","resolution":{"observed_at":"2026-06-29T07:13:15.763916Z","resolver_source":"arxiv_id","status":"verified_exact"},"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-07-20T19:52:52.149931+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T19:52:52.149931+00:00","source":"openalex_status_cache"},{"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T07:07:49.523646Z","title":"Zebralogic: On the scaling limits of llms for logical reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:8cde39cb2efb5094594173ab92d0b4346ad83a405fad196c13b2e71e5fa132b9","observation_id":"15f0201d-0aaf-400b-b6ca-83bfb61dd667","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Truthfulqa: Measuring how models mimic hu- man falsehoods","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:c17902e0ba77faf8a2639c426f779b4148e5d4e824ea6afde2e323010136e2f6","observation_id":"8fcd5ec7-36d3-40b7-9f7f-ad28c77db77c","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Llama-3.3 https://www.llama.com/docs/model-cards-and-prompt-formats/ llama3_3/, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:ad416732d1b38a674bec55cebdbf6e2b97d9f9d23f7b7b5b031b24cf2d0ef0c4","observation_id":"d7725120-7da1-4b13-8c5f-e2c2b8229d42","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"GPT5.5 https://openai.com/index/introducing-gpt-5-5/ , 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:633b4f4c9fcd5d4870b60a88adc41cf70d8c47a1783324ead7ea80bc5c723c3a","observation_id":"f39d1919-0863-46c5-9e0f-1e42cf5a8b39","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Logic-lm: Empowering large language models with symbolic solvers for faithful logical reasoning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:e71523750197777c3e352606e33436b8ca0d4df45ecbae41e1eaf4811bd1086b","observation_id":"f5238dbf-aab0-46d8-806c-dcde3d3a37b1","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"PhD thesis, University of Cambridge, UK, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:831a2945e73350ee36f7e49e407edd9aee4dd41854fcc131209483bccb5262d7","observation_id":"b39bd469-89f6-4791-a4c1-f1df46b6ff6d","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.19443","last_updated":"2025-05-26T03:00:21Z","snapshot_observed_at":"2026-08-20T00:20:09.989630Z","submitted_at":"2025-05-26T03:00:21Z","title":"Vibe Coding vs. Agentic Coding: Fundamentals and Practical Implications of Agentic AI","version":1},"cited_work":{"arxiv_id":"2505.19443","doi":"10.48550/arxiv.2505.19443","metadata_source":"pith","pith_arxiv_id":"2505.19443","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Vibe coding vs","venue":"cs.SE","work_id":"08c219fa-416b-4ec1-bfc1-39e8436a4d8c","year":2025},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"cited_paper":"/paper/2505.19443","citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:4f11cfa71d6b2c75048eb577159b50a6ff9b60dd5c3d6f84e80340bdfea0cebb","observation_id":"e236c64a-48ad-4f99-a051-0afc7cf53928","resolution":{"observed_at":"2026-06-29T07:13:16.708485Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T07:07:49.523646Z","title":"Constraintllm: A neuro-symbolic framework for industrial-level constraint programming","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:b56d4b5c1ebba39082172b661be9162c5ebcc083958ce8af787942fb4c6d62b0","observation_id":"d5676976-1990-451d-bda1-1710bc0ceac9","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"The illusion of thinking: Understanding the strengths and limitations of reasoning models via the lens of problem complexity","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:db443948e1c439681fcbb6add79d1ca71b6bfb894f5f289ce4f03337916f48b3","observation_id":"20af1086-65e9-4cf7-b0aa-c3154a14baf3","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.00539","last_updated":"2025-04-06T08:39:04Z","snapshot_observed_at":"2026-08-18T08:54:51.803384Z","submitted_at":"2024-12-31T16:49:27Z","title":"MCP-Solver: Integrating Language Models with Constraint Programming Systems","version":2},"cited_work":{"arxiv_id":"2501.00539","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.00539","snapshot_observed_at":"2026-06-29T07:13:16.709962Z","title":"Mcp-solver: Integrating language models with constraint programming systems","venue":null,"work_id":"b2a300f3-14e1-4f74-ba55-00bc7dd55a1c","year":2024},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"cited_paper":"/paper/2501.00539","citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:db6290c088f04ccf510c6bb86d418d0380510d9a993e41f4984214b8e24881d3","observation_id":"35c36428-be48-4284-989d-a734c8f78f20","resolution":{"observed_at":"2026-06-29T07:13:16.712144Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T07:07:49.523646Z","title":"On the planning abilities of large language models-a critical investigation.Advances in Neural Information Processing Systems, 36:75993–76005, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:01a8f4c8fa05f30d0034ff858f77d391efb4b0cf83097904cdbcd619693c3200","observation_id":"735c897c-badb-472f-926a-d0dc6b8ebbee","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:8d7621c89cbfb59837ce4882a4fb740e1ebefb93a7053fb3188781a1b65ff0cd","observation_id":"48a14836-1020-44ef-9e05-db49d1b5d26c","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Aristotle: Mastering logical reasoning with a logic- complete decompose-search-resolve framework","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:9b93eed0e4f3cafd7d33ca9486d0fdf19c63d3a289c08e840541a1dcfea8207a","observation_id":"c69d6fa1-6630-4296-bc36-21607e0d14a8","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:d772c4c739c403a90f7276277ebd8bcf55c0cc1d0f78e3338b07d3a97bdbc19f","observation_id":"3df14b06-7854-40b2-89fa-33ae03505220","resolution":{"observed_at":"2026-06-29T07:13:16.716336Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T07:07:49.523646Z","title":"Satlm: Satisfiability-aided language models using declarative prompting.Advances in Neural Information Processing Systems, 36: 45548–45580, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:cf0e86ebb8a3899080703b37f7c33eb67c64934e5f80a16dea35172f5e1d1713","observation_id":"480ab3a5-62d0-4c70-82d0-5889abe7fac2","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"Multilingual machine translation with large language models: Empirical results and analysis","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:5701ccd84c588714f26def5a4e5c870a7ded07f357f4836fed475320c8e321b0","observation_id":"b811325d-63a4-4c31-9c8e-02cdd557d297","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:4ad663dca2fef45082d55bc1283b86f7d2c101833ff18a2f4e3b9e9b6d42ed78","observation_id":"af5dcfaa-b5cc-498e-b732-b1a608af3bed","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:7c95c5d53b06121ea814bdc87ef6f240292d5a18b3818b45abff04a48e31cb25","observation_id":"1eb872c8-46ea-473c-85f8-05c4163e656a","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","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-06-29T07:07:49.523646Z","title":"objective_cost","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T07:07:49.523646Z"},"links":{"citing_paper":"/paper/2605.29687"},"observation_digest":"sha256:9fa0a805dcec761099a4e5c6905ea33358d53d793ee230e501f0d4ea15a04c5a","observation_id":"08c12ee5-65f7-48db-9936-57e065454fe8","resolution":{"observed_at":"2026-06-29T07:07:49.523646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.29687","last_updated":"2026-05-28T09:51:33Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-17T04:19:29.590355Z","submitted_at":"2026-05-28T09:51:33Z","title":"Reliable Reasoning with Large Language Models via Preference-Based Maximum Satisfiability"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":38},"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 21 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2605.29687."}