What is Hackers' Pub?

GitHub - milesmcc/truthsocial: Automatically updated dump of Truth Social's source code (reskinned Mastodon)

Automatically updated dump of Truth Social's source code (reskinned Mastodon) - milesmcc/truthsocial

github.com · GitHub

Ministry of Foreign Affairs of Ukraine - MFA Statement on Foreign Military Participation in the May 9 Parade in Moscow

On May 8, Ukraine, along with the rest of Europe and the world, will celebrate the 80th anniversary of the victory over Nazism

mfa.gov.ua

《日本國會圖書館》從漫畫單行本到成人雜誌無所不收 潛入世上最大的同人誌書庫 | 宅宅新聞

許多國家都會設立所謂的「國家圖書館」，並且透過法律要求國內各種出版物，都必須拿出至少一份呈繳、送存，最終形成一個龐大的國家文化資料庫。而在日本，這種國家圖書館的職責就由「國立國會圖書館」負責。跟其他國

news.gamme.com.tw

Apple to add AI search partners to Safari as Google usage falls - 9to5Mac

Apple is going to add AI search providers to the Safari browser on iPhone, iPad, and Mac. Bloomberg reports Apple...

9to5mac.com · 9to5Mac

Beyond Theorem Proving: Formulation, Framework and Benchmark for Formal Problem-Solving

As a seemingly self-explanatory task, problem-solving has been a significant component of science and engineering. However, a general yet concrete formulation of problem-solving itself is missing. With the recent development of AI-based problem-solving agents, the demand for process-level verifiability is rapidly increasing yet underexplored. To fill these gaps, we present a principled formulation of problem-solving as a deterministic Markov decision process; a novel framework, FPS (Formal Problem-Solving), which utilizes existing FTP (formal theorem proving) environments to perform process-verified problem-solving; and D-FPS (Deductive FPS), decoupling solving and answer verification for better human-alignment. The expressiveness, soundness and completeness of the frameworks are proven. We construct three benchmarks on problem-solving: FormalMath500, a formalization of a subset of the MATH500 benchmark; MiniF2F-Solving and PutnamBench-Solving, adaptations of FTP benchmarks MiniF2F and PutnamBench. For faithful, interpretable, and human-aligned evaluation, we propose RPE (Restricted Propositional Equivalence), a symbolic approach to determine the correctness of answers by formal verification. We evaluate four prevalent FTP models and two prompting methods as baselines, solving at most 23.77% of FormalMath500, 27.47% of MiniF2F-Solving, and 0.31% of PutnamBench-Solving.

arxiv.org · arXiv.org

イーロン・マスクのSpaceXが展開する衛星インターネット「Starlink」がトランプ関税の恩恵を受けていることが内部文書から明らかに

ドナルド・トランプ大統領がアフリカのレソトからの輸入品に50％の関税を課すと発表しました。この発表から2週間も経たないうちに、レソトの通信規制当局はStarlinkの代表者と会合を開き、同国初の衛星インターネットサービスとしてStarlinkを採用したことをThe Washington Postが報じています。

gigazine.net · GIGAZINE

SAT-Solving the Poset Cover Problem

The poset cover problem seeks a minimum set of partial orders whose linear extensions cover a given set of linear orders. Recognizing its NP-completeness, we devised a non-trivial reduction to the Boolean satisfiability problem using a technique we call swap graphs, which avoids the complexity explosion of the naive method. By leveraging modern SAT solvers, we efficiently solve instances with reasonable universe sizes. Experimental results using the Z3 theorem prover on randomly generated inputs demonstrate the effectiveness of our method.

arxiv.org · arXiv.org

GitHub - milesmcc/truthsocial: Automatically updated dump of Truth Social's source code (reskinned Mastodon)

Automatically updated dump of Truth Social's source code (reskinned Mastodon) - milesmcc/truthsocial

github.com · GitHub

FormalMATH: Benchmarking Formal Mathematical Reasoning of Large Language Models

Formal mathematical reasoning remains a critical challenge for artificial intelligence, hindered by limitations of existing benchmarks in scope and scale. To address this, we present FormalMATH, a large-scale Lean4 benchmark comprising 5,560 formally verified problems spanning from high-school Olympiad challenges to undergraduate-level theorems across diverse domains (e.g., algebra, applied mathematics, calculus, number theory, and discrete mathematics). To mitigate the inefficiency of manual formalization, we introduce a novel human-in-the-loop autoformalization pipeline that integrates: (1) specialized large language models (LLMs) for statement autoformalization, (2) multi-LLM semantic verification, and (3) negation-based disproof filtering strategies using off-the-shelf LLM-based provers. This approach reduces expert annotation costs by retaining 72.09% of statements before manual verification while ensuring fidelity to the original natural-language problems. Our evaluation of state-of-the-art LLM-based theorem provers reveals significant limitations: even the strongest models achieve only 16.46% success rate under practical sampling budgets, exhibiting pronounced domain bias (e.g., excelling in algebra but failing in calculus) and over-reliance on simplified automation tactics. Notably, we identify a counterintuitive inverse relationship between natural-language solution guidance and proof success in chain-of-thought reasoning scenarios, suggesting that human-written informal reasoning introduces noise rather than clarity in the formal reasoning settings. We believe that FormalMATH provides a robust benchmark for benchmarking formal mathematical reasoning.

arxiv.org · arXiv.org

Firefox 138 に新しいコントラスト設定が追加

blog.w0s.jp · 富永日記帳

Cue: Apple will add AI search in mobile Safari, challenging Google

“Prior to AI, my feeling around this was none of the others were valid choices.”…

arstechnica.com · Ars Technica

“그냥 김문수로 가자”···국민의힘 ‘단일화 포기론’ 고개

김문수 국민의힘 대선 후보와 국민의힘 지도부의 갈등이 끝내 법적 공방으로 치달으면서 당내에서 차라리 단일화를 포기하자는 의견이 8일 제기됐다. 김 후보를 당의 단독 후보로 인정하고 지원에 매진하자는 것이다. 갈등이 이전투구 양상으로 흐르면서 단일화를 하더라도 효과가 떨어질 것이라는 판단이 깔렸다. 김 후보와 국민의힘 지도부는 이날 단일화 일정을 두고 ...

www.khan.co.kr · 경향신문

Hamburg Werbefrei – Volksentscheid Hamburg Werbefrei

Damit es zur Volksabstimmung kommt, brauchen wir bis zum 13. Mai 2025 die Unterstützung von 80.000 Menschen.

www.hamburg-werbefrei.de