{"total":4,"items":[{"citing_arxiv_id":"2606.05464","ref_index":46,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Step-by-Step Optimization-like Reasoning in LLMs over Expanding Search Spaces","primary_cat":"cs.AI","submitted_at":"2026-06-03T21:43:38+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Introduces OPT* tasks and two training regimes (solver-guided online policy optimization with rank-based reward shaping and search-based offline RL) plus a theoretical link between search success and information extraction per budget unit, showing empirical gains in optimization-like reasoning.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.28709","ref_index":3,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Improved bounds for the double cap conjecture","primary_cat":"math.CO","submitted_at":"2026-05-27T16:33:54+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Improved upper bound α_3 ≤ 0.2953 for Witsenhausen's problem in dimension 3 via harmonic analysis, geometric fractional chromatic number, and a computer-searched 33-point set.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.20522","ref_index":6,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"From Image to Music Language: A Two-Stage Structure Decoding Approach for Complex Polyphonic OMR","primary_cat":"cs.SD","submitted_at":"2026-04-22T13:01:36+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"A two-stage OMR pipeline decodes symbol candidates into polyphonic score structures via topology recognition with probability-guided search.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"1909.01066","ref_index":153,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Language Models as Knowledge Bases?","primary_cat":"cs.CL","submitted_at":"2019-09-03T11:11:08+00:00","verdict":"ACCEPT","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"BERT stores relational knowledge extractable via cloze queries without fine-tuning and matches supervised baselines on open-domain QA tasks.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}