{"total":12,"items":[{"citing_arxiv_id":"2606.31345","ref_index":7,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Automated High-Precision Extraction and Forensic Verification of Data-Bearing Vector Figures","primary_cat":"cs.CR","submitted_at":"2026-06-30T08:43:32+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"An automated system extracts data from vector figures with bit-exact recovery for matplotlib markers, maps precision across renderers and formats, and provides injective verification via re-rendering certificates.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.20490","ref_index":21,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Software package MaRDI Open Interfaces for improved interoperability in numerical optimization","primary_cat":"cs.MS","submitted_at":"2026-06-18T17:07:33+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":3.0,"formal_verification":"none","one_line_summary":"MaRDI Open Interfaces supplies common interfaces for nonlinear optimization solvers, shown via an application to physics-informed neural network training on the viscous Burgers' equation.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.18141","ref_index":17,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Behind Python: The Languages That Power AI","primary_cat":"cs.PL","submitted_at":"2026-06-16T16:41:24+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Controlled benchmarks of five algorithms across six languages show C and C++ tied for fastest, Rust 9% behind, Julia 3.3x slower, Go 5x slower, and Python 315x slower, with workload-dependent rank shifts and differing memory footprints.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.08339","ref_index":12,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Floating-point autotuning with customized precisions","primary_cat":"cs.MS","submitted_at":"2026-06-06T21:10:12+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"PROMISE tool automates mixed-precision tuning with user-defined floating-point formats, validated on linear solvers and Rodinia benchmarks showing many variables can use lower precision safely.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.05466","ref_index":10,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Look Before You Leap: Checking In on Type Tag Checking","primary_cat":"cs.PL","submitted_at":"2026-06-03T21:44:02+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":3.0,"formal_verification":"none","one_line_summary":"Updated microbenchmarks on modern CPUs show low-bit tagging fastest for symbolic workloads while NaN-boxing avoids allocation overhead for floats.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.31035","ref_index":12,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"MixFP4: Enhancing NVFP4 with Adaptive FP4/INT4 Block Representations","primary_cat":"cs.AR","submitted_at":"2026-05-29T09:05:42+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"MixFP4 extends NVFP4 by adaptively selecting between two FP4 micro-formats per block using repurposed scale sign bits and a unified E2M2 compute path, claiming better accuracy than standard NVFP4 at 3.1% area and 1.5% power overhead.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.00768","ref_index":16,"ref_count":3,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Characterizing the Expressivity of Local Attention in Transformers","primary_cat":"cs.CL","submitted_at":"2026-05-01T16:30:52+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Local attention in fixed-precision transformers introduces a second past operator in linear temporal logic, strictly increasing expressivity over global attention alone, with hybrids being most expressive.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.20876","ref_index":16,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"High-Accuracy Numerical Solutions of Particle Motion in Static Magnetic Fields","primary_cat":"physics.comp-ph","submitted_at":"2026-04-10T19:54:30+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"The Parker-Sochacki method delivers 4 to 13 orders of magnitude better kinetic energy conservation than Runge-Kutta methods for charged particle motion in static magnetic fields while running faster at matched accuracy.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.04854","ref_index":1,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Assessing Large Language Models for Stabilizing Numerical Expressions in Scientific Software","primary_cat":"cs.SE","submitted_at":"2026-04-06T16:57:23+00:00","verdict":null,"verdict_confidence":null,"novelty_score":null,"formal_verification":null,"one_line_summary":null,"context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"This is consistent with our hypothesis that LLMs lack the rigor to accurately assess the magnitude, range, and sensitivity of numerical errors. High-precision literals are rarely encountered as concrete values during training, whereas LLMs recognize control- flow syntax but fail to reason about their implications for numerical stability. 2 Background and Related Work The IEEE-754 standard [1, 17] formally defines the representation and semantics of floating-point numbers, including rounding modes, overflow behavior, and special values. These works form the the- oretical basis for understanding numerical error propagation and the limitations of finite-precision computation. Floating-Point Analysis and Stabilization.A large body of work has focused on automatically analyzing and improving nu-"},{"citing_arxiv_id":"2601.17198","ref_index":10,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Odd but Error-Free FastTwoSum: More General Conditions for FastTwoSum as an Error-Free Transformation for Faithful Rounding Modes","primary_cat":"cs.MS","submitted_at":"2026-01-23T22:06:52+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Establishes sufficient more-general conditions for FastTwoSum as an error-free transformation under faithful rounding modes and introduces a configurable ExtractScalar splitting for round-to-odd.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2507.07953","ref_index":43,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Incremental Collision Laws Based on the Bouc-Wen Model: Improved Collision Models and Further Results","primary_cat":"physics.class-ph","submitted_at":"2025-07-10T17:38:52+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":2.0,"formal_verification":"none","one_line_summary":"Augments incremental collision laws using the Bouc-Wen model to incorporate external forces as inputs, extends valid parameter ranges, and performs further identification studies on convex viscoplastic body collisions.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2506.11277","ref_index":24,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Analysis of Floating-Point Matrix Multiplication Computed via Integer Arithmetic","primary_cat":"math.NA","submitted_at":"2025-06-12T20:33:50+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Error analysis and cost estimator for recasting floating-point matrix multiplication as accumulated integer products on mixed-precision hardware.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}