{"as_of":"2026-08-19T23:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b47ad37dd4e3015011bd17468475a372effceafba28d4720ae2c7bd2318d4066","coverage":[{"denominator":63,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":63,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:03:17.663795Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T09:56:40.793890Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.06146","snapshot_observed_at":"2026-07-14T09:56:40.793890Z","title":"Attias, X","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10697","last_updated":"2026-07-12T10:40:39Z","snapshot_observed_at":"2026-08-19T20:21:59.505855Z","submitted_at":"2026-07-12T10:40:39Z","title":"A Better Analysis For PPSZ For 3-SAT","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T09:56:40.793890Z"},"links":{"cited_paper":"/paper/2505.06146","citing_paper":"/paper/2607.10697"},"observation_digest":"sha256:1b2130d0762495471552f773fd339c9c825748ba3daaec007f1e84b6433ad987","observation_id":"2cc6fb09-a2d4-4981-bf73-69a86c9b6439","resolution":{"observed_at":"2026-07-14T09:56:40.793890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.06146/citation-record","integrity":"/paper/2505.06146/integrity","json":"/paper/2505.06146/citation-record.json","paper":"/paper/2505.06146"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:03:18.656417Z","title":"Paging with succinct predictions","venue":null,"work_id":"5d8f33e8-20f7-4b82-bee4-057b208998a8","year":2023},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.359285Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:135ac1ab5dfa1ff5395aefb879212473decbe33c0f91d2cbea0af71328fe1c30","observation_id":"cbb0f819-aeca-48d6-867e-140cd0b119a1","resolution":{"observed_at":"2026-08-15T23:03:18.661279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.640987Z","title":"Improved approximation algorithms for max nae-sat and max sat","venue":null,"work_id":"b29f1ba2-0835-4e4d-b8a6-c0d1e4f18ef9","year":2005},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.364769Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:4c3b476424fac9eb78de03b5b7421ac16e1e561e809ded866ab6094822b53169","observation_id":"f29db105-820f-4446-9457-0190954a2208","resolution":{"observed_at":"2026-08-15T23:03:18.645682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:03:17.369805Z","title":"Proof verification and the hardness of approximation problems","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.369805Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:aa90c248e47c75b9660862cf3f910217503277726b5400398ce191f7d6e99201","observation_id":"b48dfb71-32f5-4607-9b75-7c9595f32915","resolution":{"observed_at":"2026-08-15T23:03:17.369805Z","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-15T23:03:18.615272Z","title":"https://algorithms-with-predictions.github.io/, 2023","venue":null,"work_id":"6c53f407-47ae-46ef-9e9d-7cfee39bc52d","year":2023},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.376324Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:aa8237b6e12bf96130b675b3bb7252a0cd1f7cdc339563ceb1f9cf842d46f53b","observation_id":"4943fdbf-2a16-4e58-b477-f0d31d864e17","resolution":{"observed_at":"2026-08-15T23:03:18.620038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:03:17.381193Z","title":"Probabilistic checking of proofs: A new characterization of np","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.381193Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:1b81b2b0840fe316900b5d1fc18329b82fec9822a248ecc3ab8d1c86781a8ba8","observation_id":"b9c6c91b-20a7-4bcb-a64f-3bb6057c742e","resolution":{"observed_at":"2026-08-15T23:03:17.381193Z","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-15T23:03:18.588517Z","title":"Balanced max 2-sat might not be the hardest","venue":null,"work_id":"a228f47c-7fa8-468f-b249-661d5d8265ad","year":2007},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.386404Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:29856ea3cb4197e2f0e0075136e7de4fe98b3815d2a066f7373e70bc31ddd388","observation_id":"0e5e51a9-981a-491e-aa16-d4d2f9123a2a","resolution":{"observed_at":"2026-08-15T23:03:18.593725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.572622Z","title":"Learning-augmented maximum independent set","venue":null,"work_id":"228c7874-8048-498e-a085-93ff8002e317","year":2024},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.391888Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:ba088a74aaeab89fdf3e55497b823f30a3d83b37a5c50657860c00fb6fea996c","observation_id":"9a21812c-2ce4-4238-9b70-6724d4bcfaec","resolution":{"observed_at":"2026-08-15T23:03:18.577377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00841","last_updated":"2025-02-02T16:26:23Z","snapshot_observed_at":"2026-08-19T20:20:48.654947Z","submitted_at":"2025-02-02T16:26:23Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","version":1},"cited_work":{"arxiv_id":"2502.00841","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.00841","snapshot_observed_at":"2026-08-15T23:03:17.720775Z","title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","venue":"cs.DS","work_id":"1c750a49-c144-4a23-bcc2-06839ca730b0","year":2025},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.396723Z"},"links":{"cited_paper":"/paper/2502.00841","citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:256cc058a5ba9d05d93a1e1286aa67cf348c47260038b0f9d5a680a244ec22c9","observation_id":"49d44891-1182-4acc-afe0-7941a7408b26","resolution":{"observed_at":"2026-08-15T23:03:17.728368Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.556123Z","title":"Parsimonious learning-augmented approximations for dense instances of np-hard problems","venue":null,"work_id":"592206b9-574a-44d4-a9fe-0bf45295a87a","year":2024},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.401750Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:14983ca30829d3bdbc242b899f8d79267029ed590ac0b1b821611b2304460747","observation_id":"5efedb9b-7e46-49cc-83a0-677f31b2e006","resolution":{"observed_at":"2026-08-15T23:03:18.561759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.540189Z","title":"Tight approximability of max 2-sat and relatives, under ugc","venue":null,"work_id":"d3392b41-2e30-4167-91b0-da3ad2115cce","year":2024},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.406424Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:14139dd3a2cf7d39745434745d2f854f3b83386c6fa669f7364f9a84c9764845","observation_id":"1c10abba-ecf9-446f-8f0d-22352386f010","resolution":{"observed_at":"2026-08-15T23:03:18.545354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.523343Z","title":"Improving a probabilistic 3-sat algorithm by dynamic search and independent clause pairs","venue":null,"work_id":"dc449002-0039-459b-b000-aa9680dabf14","year":2003},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.412097Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:6a30bce8cdfb422220bae07e3aee26561ee31724aa18a192bf1ded6483be65e4","observation_id":"5e06a1e3-14aa-4b60-9eff-5aac8a3eab64","resolution":{"observed_at":"2026-08-15T23:03:18.528165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.506822Z","title":"Learning-augmented approximation algorithms for maximum cut and related problems","venue":null,"work_id":"8fd5a309-5111-4113-a4e6-eb2b6781a28a","year":2024},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.416959Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:91036c5c704b8d6849fcf3493919a94f678744700c7b6d62727aea37a1f87fd0","observation_id":"d1fb4dce-f80c-4697-8524-c0acc5b730c8","resolution":{"observed_at":"2026-08-15T23:03:18.512237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:03:17.421557Z","title":"The complexity of satisfiability of small depth circuits","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.421557Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:a084646b94c07e6075185c55b07adbae9b54c98fab24b377b4c23c9abc836b39","observation_id":"ed6a3507-b536-4d07-9111-8ddf122739d8","resolution":{"observed_at":"2026-08-15T23:03:17.421557Z","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-15T23:03:18.481675Z","title":"The complexity of theorem-proving procedures","venue":null,"work_id":"8ac7907e-16c3-4663-8ff0-6c054f2475bc","year":1971},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.426169Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:608ab03514021fbe3c46595e7e5f97815d0c8f180958bc089ea31a7370e09db5","observation_id":"97294657-fbff-4530-981f-31c90f897b64","resolution":{"observed_at":"2026-08-15T23:03:18.486265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.466852Z","title":"The adwords problem: online keyword matching with budgeted bidders under random permutations","venue":null,"work_id":"679aafa5-0607-4255-9c3a-765facff247d","year":2009},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.430965Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:a102a7839dfdbc4f2d0606e50316b76166ab2d242424f3d0efa543b119477543","observation_id":"a9db9252-ec82-490f-8e2d-b3ef5a2bea5c","resolution":{"observed_at":"2026-08-15T23:03:18.471539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.451923Z","title":"Mildly exponential reduction from gap-3sat to polynomial-gap label-cover","venue":null,"work_id":"5d45a055-8b23-4672-90be-e566451e0d38","year":2016},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.435587Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:0c9df620efc684b55173c14de0a49dcbfdd446daa5f5975b59314b5648ae2e1c","observation_id":"d4447dbc-701f-496d-9974-b8ae1b6683cb","resolution":{"observed_at":"2026-08-15T23:03:18.456665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.435991Z","title":"Learning-augmented streaming algorithms for approximating max-cut","venue":null,"work_id":"17843cc2-4b01-4699-b3ff-cb64ebcc7b66","year":2025},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.440231Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:049cbc87f809581bae854c04b4883839a62a5d9af3455425aa8b89eb82cbcb4d","observation_id":"55b5d65c-45ed-4ebe-9218-82544d39f0ce","resolution":{"observed_at":"2026-08-15T23:03:18.441126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.420575Z","title":"Learning-augmented k -means clustering","venue":null,"work_id":"d5b8a329-bb89-4f34-b483-f59b53548e35","year":null},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.444860Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:e0a828a85c9093c4e21616f02b45e7de8ec0f10a79ce2242fca53c7c868459c5","observation_id":"8a3ad491-6468-4aba-a091-b76ebc39e5c0","resolution":{"observed_at":"2026-08-15T23:03:18.425518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.405332Z","title":"Refuting smoothed 3cnf formulas","venue":null,"work_id":"b07b6f27-1cea-4d5b-aa99-11880deb4d7e","year":2007},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.450213Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:b54d8bac32acce3e1f82fb2271dadfd61bf2e1c76635a3a057eb77e599ebe772","observation_id":"c2dad4ae-61a8-4d9f-bbc3-5b36b56cceec","resolution":{"observed_at":"2026-08-15T23:03:18.410049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.389098Z","title":"Approximating the value of two power proof systems, with applications to max 2sat and max dicut","venue":null,"work_id":"41de343c-36ad-45f0-a0cf-850fa9ddb25c","year":1995},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.455186Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:06db4a818c95e914748c0c66662f6aaa78f0842bf142acafbe13668271e51c81","observation_id":"9b4bfd69-a0ee-4e02-8a56-07d69e0692ef","resolution":{"observed_at":"2026-08-15T23:03:18.394345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.373880Z","title":"Approximate cluster recovery from noisy labels","venue":null,"work_id":"17ce8677-e79d-43f8-8006-091588c580b6","year":2022},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.459851Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:e44a1c75de8e1d90074d1185f005e59ca12334843977e489ed76b422ffeb570e","observation_id":"bf5e6b4f-ae35-4694-804d-0fe1f4d4538c","resolution":{"observed_at":"2026-08-15T23:03:18.379038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.358844Z","title":"Constraint satisfaction problems with advice","venue":null,"work_id":"663d7982-04a9-40b4-b15a-3156abeeab4d","year":2025},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.465434Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:f2050831d494b3959b34c2ad81127496053e3dd6fbde744da8fd7a9731e40ce9","observation_id":"72bbd366-cc8d-4c69-a453-6b8206f3ced0","resolution":{"observed_at":"2026-08-15T23:03:18.363731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.341605Z","title":"878-approximation algorithms for max cut and max 2sat","venue":null,"work_id":"59e7f3c9-d040-496a-8328-19adaf47e9ac","year":1994},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.470241Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:cbccb86d80b17c48bece61b30c559081506a99cc9a33d185f325af4dbfeb40dc","observation_id":"948cb110-5233-4a5c-a89d-d04c6df2219c","resolution":{"observed_at":"2026-08-15T23:03:18.347196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.324402Z","title":"Some optimal inapproximability results","venue":null,"work_id":"c02b9197-b603-45a5-939b-4b10d0a0be79","year":2001},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.475968Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:90e9d2f07fb697943e2a7b228966ed16b3bf50a758aa27a30be7f952887a1abc","observation_id":"10948576-15e4-4f5a-a789-9eea48daff04","resolution":{"observed_at":"2026-08-15T23:03:18.329564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.308047Z","title":"3-sat faster and simpler---unique-sat bounds for ppsz hold in general","venue":null,"work_id":"bd8c8fc0-6d5d-47b3-8b00-6a0a89122597","year":2014},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.480754Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:9cae23f2272e457df45ff92cb0f5f273922e8a8d17dce822c5c80471c3ecd63b","observation_id":"e2c825f2-0b76-41fb-80d5-f621598ecfce","resolution":{"observed_at":"2026-08-15T23:03:18.313705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.291436Z","title":"Breaking the ppsz barrier for unique 3-sat","venue":null,"work_id":"63d19b94-d97d-4d0b-9885-5b8e3e2e100c","year":2014},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.485306Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:56c8f9b5bf84c6fa283d8fd419bc1dbf7f5ba22a987b8a0ba8514839e2c2c518","observation_id":"97afc032-38cc-45af-8403-0066a118dc13","resolution":{"observed_at":"2026-08-15T23:03:18.296579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.275902Z","title":"Faster k-sat algorithms using biased-ppsz","venue":null,"work_id":"30be4ac7-2caf-40be-bfa5-7d87e23efe57","year":2019},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.490143Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:d61ba44b9ea00bd45f9c6a08b920e3f42f7721090d61d075bdf8a90876a58d1e","observation_id":"9bd9daad-0bd6-4ec6-87b0-d8352fffbbc3","resolution":{"observed_at":"2026-08-15T23:03:18.280741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.259140Z","title":"A probabilistic 3—sat algorithm further improved","venue":null,"work_id":"0c4f4c47-a720-4385-97a4-659a0138b00a","year":2002},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.495120Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:6ec35c4e5e59dd082371ada919f65af7952feb6e460f22858eb4cf783e54ddc0","observation_id":"2fc66836-3cc5-451b-903a-dc6133d137c3","resolution":{"observed_at":"2026-08-15T23:03:18.264880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:03:17.499866Z","title":"On the complexity of k-sat","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.499866Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:fc65b6b80ced31671195a173d3a26dfccb3390d6745fce1775b1fc1fcc4334e9","observation_id":"0fb58794-8407-438a-92fb-48fa3bd9967a","resolution":{"observed_at":"2026-08-15T23:03:17.499866Z","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-15T23:03:18.231280Z","title":"Improved upper bounds for 3-sat","venue":null,"work_id":"f06a95a0-d033-42e7-a0fa-03e7d4c3b174","year":2004},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.504528Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:709adc2ed129f8ae8d82e8484789d719b01717be4931ddc68d1433d527545bac","observation_id":"8209a917-5b54-4d06-b108-bd9c5946c9dd","resolution":{"observed_at":"2026-08-15T23:03:18.236674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.213911Z","title":"Approximation algorithms for combinatorial problems","venue":null,"work_id":"eef8dd52-dde4-47c7-980a-36d969fe2181","year":1973},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.509326Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:183cb1943597d3e91d06cb911c94982d7ddf9596931e659306580d2eee81c843","observation_id":"0c430b50-4d26-49e2-8cb8-7548132acf96","resolution":{"observed_at":"2026-08-15T23:03:18.218916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.196558Z","title":"Reducibility among combinatorial problemst","venue":null,"work_id":"18afb686-1303-461b-b6ca-5097a2b42fb7","year":1972},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.514241Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:abdca29d4ae78976e4952bae8814b04e6903d297d5877d372ce04f58f27bfc48","observation_id":"868539b0-9549-4dda-85f7-405f7133d13d","resolution":{"observed_at":"2026-08-15T23:03:18.201564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.181171Z","title":"On coloring resilient graphs","venue":null,"work_id":"dbae7e9e-45c9-45c4-9477-a0d6dc88cef4","year":2014},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.519437Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:f770d8aa23b40de5d73c54b06a3a0b68a3848e38f0f66b3efb4190abff1c5004","observation_id":"b6f1867e-5b32-49da-9a65-476f7db6a531","resolution":{"observed_at":"2026-08-15T23:03:18.186148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.164934Z","title":"New methods for 3-sat decision and worst-case analysis","venue":null,"work_id":"3f8d6396-eefa-42af-af89-919408f7d351","year":1999},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.524024Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:497248b00d9f8c1da5dd9da532d3f7ee62ada85d48f4a8d2bd4a0ba54b649c5e","observation_id":"d48371a7-fe62-48fd-b7a4-81b7a56c244d","resolution":{"observed_at":"2026-08-15T23:03:18.169915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.148274Z","title":"A 7/8-approximation algorithm for max 3sat? In Proceedings 38th Annual Symposium on Foundations of Computer Science , pages 406--415","venue":null,"work_id":"e69e73f5-3f97-4faa-8cb3-ff68c3d2350f","year":1997},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.528518Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:3cac065ce94f1b8e3bf58ec0c581378c75dd9bb160e6690f08156cf572308f0f","observation_id":"69c1764b-5570-4ef1-8f41-2a2a89d4546d","resolution":{"observed_at":"2026-08-15T23:03:18.153533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:03:17.533437Z","title":null,"venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.533437Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:67d202414de91dd174c67868ef8c37895129ae753e4f2f6638548d7b7f240874","observation_id":"59794d6f-8351-450b-acdc-67d363739a11","resolution":{"observed_at":"2026-08-15T23:03:17.533437Z","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-15T23:03:18.120625Z","title":"Chain, generalization of covering code, and deterministic algorithm for k-sat","venue":null,"work_id":"3d5501a9-618f-4e2d-a1d6-6cc539c02791","year":2018},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.538079Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:fbc7d53ff76dc414ec3233fceb309dbec037ce5ab9910b70297df2b794118a3e","observation_id":"79cb242a-b028-498d-a398-19d0038fa297","resolution":{"observed_at":"2026-08-15T23:03:18.125683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:03:17.542854Z","title":"Online scheduling via learned weights","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.542854Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:4b8fb530a664b80703e450f102cace94fe707735f3b0cd7e7d7893623ea9481c","observation_id":"3f9ec015-3864-4b6b-a270-63a12135004e","resolution":{"observed_at":"2026-08-15T23:03:17.542854Z","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-15T23:03:18.093781Z","title":"Improved rounding techniques for the max 2-sat and max di-cut problems","venue":null,"work_id":"4169138e-92d7-4dd1-bc5c-7756151a55cf","year":2002},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.547948Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:04130f6ecf515cd3d77beef9e6435b74d2342cb84b8b0715c86c08543e1aa10d","observation_id":"eb9013e5-3022-478d-8d5f-e660ddc7b4f1","resolution":{"observed_at":"2026-08-15T23:03:18.099040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:03:17.553104Z","title":"Competitive caching with machine learned advice","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.553104Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:16b911be337cb12d9e2171e073ff3ad35512cdf8a267ee8c6f7a3d80b4d65c34","observation_id":"1247ed75-3aad-4703-8ec9-f8f8212dbbac","resolution":{"observed_at":"2026-08-15T23:03:17.553104Z","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-15T23:03:18.066311Z","title":"Scheduling with predictions and the price of misprediction","venue":null,"work_id":"aa899d85-62f0-4e1f-a431-b329bc77a733","year":2020},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.557783Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:6e9f2cf2982410b6eabbb634bf32ca3f5079a1f9e6576ce821bf6d58282767e9","observation_id":"467e16f6-75d5-4f19-a22c-7ddbe411e4ff","resolution":{"observed_at":"2026-08-15T23:03:18.071918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.050304Z","title":"0.935-approximation randomized algorithm for max 2sat and its derandomization","venue":null,"work_id":"fede1923-240c-4090-a484-28185a8fc877","year":null},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.562707Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:9f4fe131a3f42490d2cb99e732fe1b1744b1be4f4682b74797bd3596796b6630","observation_id":"91c237a0-7b6f-41b2-b68d-2cf7a244e2e9","resolution":{"observed_at":"2026-08-15T23:03:18.055349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1607.02986","last_updated":"2016-07-11T14:54:04Z","snapshot_observed_at":"2026-08-14T21:48:56.249902Z","submitted_at":"2016-07-11T14:54:04Z","title":"A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.02986","snapshot_observed_at":"2026-08-15T23:03:17.567570Z","title":"A birthday repetition theorem and complexity of approximating dense csps","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.567570Z"},"links":{"cited_paper":"/paper/1607.02986","citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:f79ed816e0146584935707209d68b0510cfe0b4234498643d48558dd28ea1a69","observation_id":"370329ec-2518-41c9-982f-5d0fa49a3848","resolution":{"observed_at":"2026-08-15T23:03:17.567570Z","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-15T23:03:18.034435Z","title":"Solving satisfiability in less than 2n steps","venue":null,"work_id":"fbdbb1cc-64c3-4d48-ab17-d4c2e0f77af4","year":1985},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.573134Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:8fa7048a4103a4b9d1d36e0b463c64ccd97f559d713a45c13965d9a86f431098","observation_id":"3a4a372a-6fff-4918-a3e7-ec0241c30794","resolution":{"observed_at":"2026-08-15T23:03:18.039375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:18.018500Z","title":"A full derandomization of sch \\\"o ning's k-sat algorithm","venue":null,"work_id":"c4601aaa-1a04-4432-ab4e-8beb6213f25e","year":2011},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.577661Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:9ebe6b2713bf29e304a6cd24e1177f777e3aa4f0b0541ab57e83c9433238965f","observation_id":"157dc311-9c1c-4434-8634-93ab61b76823","resolution":{"observed_at":"2026-08-15T23:03:18.023228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:03:17.582221Z","title":"Algorithms with predictions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.582221Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:cf6b1c1bdfa204cab3ca5433bd172c6144c267267ea377b03ce295309b50d524","observation_id":"c9bd39a7-b461-43aa-aba9-78fe1d8aa381","resolution":{"observed_at":"2026-08-15T23:03:17.582221Z","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-15T23:03:17.982307Z","title":"Improved learning-augmented algorithms for k-means and k-medians clustering","venue":null,"work_id":"d5dc6f36-b4f8-435e-b370-aae5cc7a6478","year":2023},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.586863Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:b58b901d9d27e152a8362c4f4fa28dceaeebdeb88a1b800f4d49c8d3d3ab0f5c","observation_id":"13cee999-d2d9-479f-b3c7-317d1c644291","resolution":{"observed_at":"2026-08-15T23:03:17.988105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:17.966568Z","title":"An improved exponential-time algorithm for k-sat","venue":null,"work_id":"438c544c-aa4e-40cf-9995-14215f00f5b4","year":2005},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.591619Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:5ffc17f4ed885df42ad5a586bbe17fad576760450ba67a537e5d6303d5c120bf","observation_id":"ea76153f-f376-428a-abcb-73e3c6db46ef","resolution":{"observed_at":"2026-08-15T23:03:17.971508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:17.950929Z","title":"Satisfiability coding lemma","venue":null,"work_id":"8692d412-16a8-4617-81dc-ef50cc905df9","year":1997},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.597123Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:c8ddaa138238545282b514913648d2dd82e7fecdca6ef605ab28f380768992e2","observation_id":"b3733679-03bb-4fd2-9e92-fe7614c00d6e","resolution":{"observed_at":"2026-08-15T23:03:17.955648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:03:17.601692Z","title":"Improving online algorithms via ml predictions","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.601692Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:4c16cf0981bf4e3cd489c8a23ff6a9eb067a53cfacca841c275ce8f698eaca78","observation_id":"29b46c47-a990-49eb-99fe-754e77ab9559","resolution":{"observed_at":"2026-08-15T23:03:17.601692Z","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-15T23:03:17.923857Z","title":"An improvement of the algorithm of hertli for the unique 3sat problem","venue":null,"work_id":"e5cba791-c8ff-4e58-9213-e60b8d8f9333","year":2020},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.606173Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:dca2ded6b06de1e0cb9f3ba2631eacfbbc0a4002e762b7cc78e6e7dd842ba6d6","observation_id":"a342db9e-e041-45f7-a092-c5ffac8a480c","resolution":{"observed_at":"2026-08-15T23:03:17.929331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:17.907149Z","title":"A new approach on solving 3-satisfiability","venue":null,"work_id":"bd5a6b14-4bc0-4492-a1d1-fd4a79e84f07","year":1996},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.611975Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:ea183bbefd48709b4ffce9a68ec4385b78a50bae591a47885541f47d7b1426df","observation_id":"99ead743-09f6-4909-b36f-4e796b303593","resolution":{"observed_at":"2026-08-15T23:03:17.912109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:17.889737Z","title":"Near-optimal bounds for online caching with machine learned advice","venue":null,"work_id":"b5e4bdca-47d2-4bd0-9f97-068cc083b5b4","year":2020},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.616618Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:112fc05f56980bab0121a378b236d06baf77b2b0e5e5230503d1032ece24818c","observation_id":"3408c134-c8dd-4c58-94a6-bcce85047548","resolution":{"observed_at":"2026-08-15T23:03:17.894882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:03:17.621461Z","title":"Beyond the worst-case analysis of algorithms","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.621461Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:ba713501dbfb222632113dacbdb9694dd3e1e3fd9e888280375f22f6a5be74be","observation_id":"5e89b27c-4a41-47fc-af74-41fd878c0519","resolution":{"observed_at":"2026-08-15T23:03:17.621461Z","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-15T23:03:17.860752Z","title":"Approximating csps with global cardinality constraints using sdp hierarchies","venue":null,"work_id":"08cad5f1-e8e3-40c2-8102-315fcb35d544","year":2012},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.626165Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:4df7ae9047d6395e59d08e866cb1e298dbe0a27070684864ebcab891e0273352","observation_id":"29923d8f-5b7d-492d-b98d-eefbe4f0b457","resolution":{"observed_at":"2026-08-15T23:03:17.866583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:17.842470Z","title":"Solving 3-satisfiability in less than 1, 579 n steps","venue":null,"work_id":"325ef5bf-2c96-4d8e-82cb-e78ce1aae398","year":1992},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.630654Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:851e5626247d4accf26781a27b6e699e7a667904df7d08db80bc20eab2828279","observation_id":"e5c1936c-8ef0-46fe-ac7e-2a58404fcaae","resolution":{"observed_at":"2026-08-15T23:03:17.847863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:17.825157Z","title":"A probabilistic algorithm for k-sat and constraint satisfaction problems","venue":null,"work_id":"da7649ef-2606-4b12-90e9-6bc4fde4bb6f","year":1999},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.635203Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:7fd43056afa61a12f6296d4be70216bbbb92a648b6cfb55cf6baf445280bedab","observation_id":"b18fc5f0-ef51-4d63-b42a-b4234dd879ef","resolution":{"observed_at":"2026-08-15T23:03:17.830815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T23:03:17.807992Z","title":"Ppsz is better than you think","venue":null,"work_id":"a25860a1-1dcb-466e-8bf0-534bb667084c","year":2024},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.639892Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:f7c8334e2b482a09a9db59eee3142a6cf2ac09df9489ca96629e885bdedded9f","observation_id":"f738f0b0-8bde-4adf-8824-ea8cfa761daa","resolution":{"observed_at":"2026-08-15T23:03:17.813303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:03:17.644385Z","title":"Generating hard satisfiability problems","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.644385Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:490ad9cd15fe9b12eb9a4f3706a6927f4c50a77c574bd0146a2e86a19204f789","observation_id":"c2d88551-8fb5-406b-86ce-056b4e773c0c","resolution":{"observed_at":"2026-08-15T23:03:17.644385Z","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-15T23:03:17.779021Z","title":"Ppsz for general k-sat-making hertli's analysis simpler and 3-sat faster","venue":null,"work_id":"93848c42-7382-45c8-9ec5-f5e3387d0239","year":2017},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.650251Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:858da308d18563a36b1ce73491671e6415591b29ecd307e36bb2fb8fc5c7c9a3","observation_id":"5ccc11ea-377e-4311-a767-1d7307ca9e9e","resolution":{"observed_at":"2026-08-15T23:03:17.784265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:03:17.654950Z","title":"Optimal online assignment with forecasts","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.654950Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:ac4c29f62c3ac41339e80091a57b8eaec5922090139436b50017bbd2defd1b96","observation_id":"1dd1a2c5-116d-4cc2-b0d8-0ba159491081","resolution":{"observed_at":"2026-08-15T23:03:17.654950Z","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-15T23:03:17.659372Z","title":"Optimal robustness-consistency trade-offs for learning-augmented online algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.659372Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:b89df2effd5d36ba62ee31c244016dd1dc0413b243994ccf5410dbc9d241842e","observation_id":"9abf02d2-cba2-4294-a630-197ebc72474d","resolution":{"observed_at":"2026-08-15T23:03:17.659372Z","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-15T23:03:17.740490Z","title":"Analyzing the max 2-sat and max di-cut approximation algorithms of feige and goemans","venue":null,"work_id":"e7eb500d-58ff-49d6-b3ad-c4b805c6a1ce","year":2000},"citing_paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-15T23:03:17.663795Z"},"links":{"citing_paper":"/paper/2505.06146"},"observation_digest":"sha256:768deed7f5be4a3dd6606da99151d19fa57f883b7e24b2c7db75e99cb5133144","observation_id":"0ddcde2b-075a-46a1-81a6-d9791945244b","resolution":{"observed_at":"2026-08-15T23:03:17.745844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.06146","last_updated":"2025-05-30T18:17:43Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-19T22:53:51.553076Z","submitted_at":"2025-05-09T15:54:34Z","title":"Learning-Augmented Algorithms for Boolean Satisfiability"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":1,"verified_fuzzy":48},"total_outbound_references":63},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 1 inbound Pith citation observation for arXiv:2505.06146."}