{"total":54,"items":[{"citing_arxiv_id":"2607.00536","ref_index":10,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Online Matching with Size-Based and Convex Delays","primary_cat":"cs.DS","submitted_at":"2026-07-01T07:25:14+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Settles deterministic competitive ratio (up to constants) for MPMD-Size via reduction to metrical task systems on 2^{n-1} points and gives O(1)-competitive deterministic algorithm for polynomial convex delays with f'(0)>0 on uniform metrics.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.31119","ref_index":43,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Visualizing High-Dimensional Graph Embeddings via Informed Multi-View Projections","primary_cat":"cs.LG","submitted_at":"2026-06-30T04:28:26+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"High-dimensional graph embeddings are projected to 2D views optimized for aesthetic metrics using a differentiable edge-crossing surrogate, outperforming standard layouts in tests.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.27727","ref_index":1,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Beating Trivial Time for Tricky Triangle Tasks","primary_cat":"cs.DS","submitted_at":"2026-06-26T05:19:27+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"First sub-trivial algorithms for All-Edges Sparse Triangle, Sparse Monochromatic Triangle, Exact Triangle, and 4-cycle detection using AC0 word operations.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.17228","ref_index":24,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"A Stone-Cech Collecting Semantics for Residual Process Behaviour","primary_cat":"cs.LO","submitted_at":"2026-06-15T19:21:16+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Develops a Stone-Cech compact collecting semantics for residual process behaviour in CCS that distinguishes stable divergence, recurrent divergence, mixed recurrence with escape, and unbounded escape.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.11974","ref_index":50,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity","primary_cat":"cs.DS","submitted_at":"2026-06-10T11:53:00+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"Randomized LOCAL algorithm computes 2-ruling sets in O(log log n) rounds w.h.p. on graphs with arboricity O(log log n), nearly matching lower bounds and exponentially improving prior combinations of results.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.10693","ref_index":10,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties","primary_cat":"cs.DC","submitted_at":"2026-06-09T10:52:42+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"The ω(log n)–n^{o(1)} and ω(n^{1/(k+1)})–o(n^{1/k}) complexity gaps (with decidability) for LCL problems on trees extend to LPMSO problems on unbounded-degree rooted trees.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.08217","ref_index":21,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Revisiting Diameter in Directed Graphs","primary_cat":"cs.DS","submitted_at":"2026-06-06T15:12:29+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"The paper shows fine-grained hardness for approximating reachability diameter in directed graphs, gives additive approximations for unweighted cases, and constant-factor approximations for bounded treewidth and width-bounded DAGs.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.04652","ref_index":6,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Rectangular Matrix Multiplication in the Low-Bandwidth Model","primary_cat":"cs.DC","submitted_at":"2026-06-03T09:22:49+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"For matrix multiplication ⟨d,n,d⟩ the round complexity is Õ(d^{4/3}); for ⟨n,d,n⟩ it is Θ(d √n) when d ≤ √n and O(d^{2/3} n^{2/3}) when d ≥ √n.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.27837","ref_index":12,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Optimal Spectral Design with Prior Information","primary_cat":"math.OC","submitted_at":"2026-05-27T01:50:29+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Convex reformulation and polynomial-time algorithm for spectral design problems that update a prior information matrix by rank-one updates under Euclidean-norm bounds on the design vectors.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.22426","ref_index":9,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Monotone Erasure Codes","primary_cat":"cs.IT","submitted_at":"2026-05-21T12:48:05+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Monotone erasure codes are constructed from any monotone Boolean formula access structure, with efficient linear versions for partitioned structures, enabling a generalized AVID primitive.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.18285","ref_index":9,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Compositionality in Coalgebraic Trace Semantics","primary_cat":"cs.LO","submitted_at":"2026-05-18T12:14:45+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Introduces De Simone laws over Kleisli categories that guarantee compositionality of coalgebraic trace equivalence and recovers the classical De Simone format while adding a probabilistic variant.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.15094","ref_index":7,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Loop Termination and Generalized Collatz Sequences","primary_cat":"cs.LO","submitted_at":"2026-05-14T17:13:03+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Termination of one-variable linear-constraint loops over integers is decidable in polynomial time if the generalized Collatz conjecture holds, with any such procedure also settling specific instances of the conjecture.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.10941","ref_index":26,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity","primary_cat":"cs.CC","submitted_at":"2026-05-11T17:59:43+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Exponential lower bounds for cutting planes and Res(⊕) on binary clique formulas for random dense graphs, with polynomial randomized communication complexity for falsified clause finding.","context_count":1,"top_context_role":"method","top_context_polarity":"use_method","context_text":"to show that, in the right parameter regimes, after fixing variables, the remaining instance is similar enough to a smaller instance of the original problem, thus allowing us to restart the random walk. Randomized communication.Theorem 1.3 (qualitatively) generalizes the BPHP lower bound of Yang and Zhang [51]. They used query-to-communication lifting machinery from [26] to essen- tially reduce the communication lower bound to a correspondingdecision treelower bound. The proof in [51] is quite involved due to a white-box use of the lifting machinery. Later, [24] proved a structural theorem that allows a black-box proof of the main result in [51], and this theorem was recently extended and used in [46] to get a lower bound for the clause-search problem for random"},{"citing_arxiv_id":"2605.08397","ref_index":13,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations","primary_cat":"cs.DB","submitted_at":"2026-05-08T19:04:11+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"The paper develops a general incremental maintenance technique for arbitrary join queries that achieves update times bounded by an optimizable maintenance width using heavy-light partitioning.","context_count":1,"top_context_role":"method","top_context_polarity":"use_method","context_text":"We next discuss such a constant-delay enumeration procedure for a single setOUT d, for anyd∈ D(Q). Recall that for each degree configurationd∈ D(Q), our approach maintains a view treeT d. It then suffices to enumerateOUT d fromT d with constant delay. Prior work shows how from any view tree, the tuples in the join of the views in the tree can be enumerated with constant delay [13, Prop. 11]. The extended version of this article gives further details, illustrates the enumeration procedure for the 4-cycle query, and explains how to slightly change the approach to maintain the count version of the query with the same update time and constant-delay enumeration. 8 Conclusion In this paper we introduced an approach to adaptive maintenance of join queries under database updates"},{"citing_arxiv_id":"2605.03064","ref_index":6,"ref_count":2,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Neural networks as fuzzy logic formulas","primary_cat":"cs.LO","submitted_at":"2026-05-04T18:35:50+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Rational-weight ReLU neural networks and generalized polynomial rings are characterized as formulas in RPL, RPL(⊙)≤1, and fragments of LΠ1/2 logic.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.02114","ref_index":12,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Undirected Replacement Paths: Dual Fault Reduces to Single Source","primary_cat":"cs.DS","submitted_at":"2026-05-04T00:35:47+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"A weight-preserving reduction from undirected 2-FRP to SSRP establishes their computational equivalence and yields matching improved algorithms for 2-FRP.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.00743","ref_index":9,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams","primary_cat":"cs.CG","submitted_at":"2026-05-01T15:47:02+00:00","verdict":"CONDITIONAL","verdict_confidence":"MODERATE","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A 2D Voronoi-diagram data structure answers smallest-enclosing-disk rectangle queries in O(log^4 n) deterministic time after O(n log^2 n) preprocessing.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.27745","ref_index":4,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility","primary_cat":"cs.DS","submitted_at":"2026-04-30T11:36:32+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Maximum APD subset selection is polynomial-time for scanwidth at most 2, NP-hard for scanwidth 3, with an O(2^sw n) FPT algorithm and linear-time results when the induced network is reticulation-visible or has bounded invisible reticulations per biconnected component.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.26062","ref_index":22,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Incremental Strongly Connected Components with Predictions","primary_cat":"cs.DS","submitted_at":"2026-04-28T18:56:28+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A prediction-augmented data structure for incremental SCC maintenance achieves near-optimal update times with accurate edge-order predictions and degrades smoothly with prediction error.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.24134","ref_index":9,"ref_count":2,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines","primary_cat":"cs.DS","submitted_at":"2026-04-27T07:42:51+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Pointer-machine working-set heaps achieve amortized O(1) Push and O(α(n)) DecreaseKey, yielding Dijkstra with only additive O(m α(m)) overhead over optimal distance ordering.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.24782","ref_index":6,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Formalizing the Real Numbers in Homotopy Type Theory with Cubical Agda","primary_cat":"cs.LO","submitted_at":"2026-04-23T19:50:55+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A complete formalization of the HoTT Cauchy reals in Cubical Agda that type-checks without postulates or holes.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.19371","ref_index":56,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Suffix Random Access via Function Inversion: A Key for Asymmetric Streaming String Algorithms","primary_cat":"cs.DS","submitted_at":"2026-04-21T11:54:14+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"A bidirectional reduction between suffix random access and function inversion enables improved asymmetric streaming algorithms for exact/approximate pattern matching and relative Lempel-Ziv compression.","context_count":1,"top_context_role":"other","top_context_polarity":"unclear","context_text":"[54] Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey, and Konstantinos Mamouras. Automata theory on sliding windows. InProc. of STACS, pages 31:1-31:14, 2018.doi: 10.4230/LIPIcs.STACS.2018.31. [55] Moses Ganardi, Danny Hucke, and Markus Lohrey. Querying regular languages over sliding windows. InProc. of FSTTCS, pages 18:1-18:14, 2016.doi:10.4230/LIPIcs.FSTTCS.2016. 18. [56] Moses Ganardi, Danny Hucke, and Markus Lohrey. Randomized sliding window algorithms for regular languages. InProc. of ICALP, pages 127:1-127:13, 2018.doi:10.4230/LIPIcs. ICALP.2018.127. [57] Moses Ganardi, Danny Hucke, and Markus Lohrey. Sliding window algorithms for regular languages. InProc. of LATA, pages 26-35, 2018.doi:10.1007/978-3-319-77313-1_2."},{"citing_arxiv_id":"2604.14072","ref_index":3,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Persistent Iterators with Value Semantics","primary_cat":"cs.PL","submitted_at":"2026-04-15T16:44:37+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Persistent iterators snapshot container versions at creation to deliver value semantics and invalidation safety while preserving iterator-based programming in C++.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.08731","ref_index":14,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Optimal Single-Pass Streaming Lower Bounds for Approximating CSPs","primary_cat":"cs.CC","submitted_at":"2026-04-09T19:51:33+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"Tight single-pass linear-space lower bounds for approximating arbitrary Max-CSP(F) whenever the basic LP admits a (γ,β)-integrality gap.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.06874","ref_index":2,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Modelling Distributed Applications with Mixed-Choice Stateful Typestates","primary_cat":"cs.PL","submitted_at":"2026-04-08T09:37:08+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A probabilistic runtime extension to typestates adds mutable state, mixed input/output sessions, and monitoring of expected action ratios to model concurrent and quantitative aspects of distributed protocols.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.05862","ref_index":14,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Communication Requirements for Linearizable Registers","primary_cat":"cs.DC","submitted_at":"2026-04-07T13:24:41+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Linearizable atomic register implementations in asynchronous message-passing systems require extensive message chains among operations of all types.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.05246","ref_index":41,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"A Gradual Probabilistic Lambda Calculus","primary_cat":"cs.PL","submitted_at":"2026-04-06T23:13:56+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"GPLC is a gradual source probabilistic lambda calculus formalized with probabilistic couplings for static relations, elaborated to a distribution-based target language TPLC, and proven type-safe with conservative extension and gradual guarantee properties.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.03152","ref_index":4,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Engineering Algorithms for Dynamic Greedy Set Cover","primary_cat":"cs.DS","submitted_at":"2026-04-03T16:16:44+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"First experimental study of dynamic greedy set cover algorithms reveals practical tradeoffs in quality and efficiency across real instances.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"low-frequency regime(f <lnn) and thehigh-frequency regime(f≥lnn). The objective is to maintain a near-optimal approximation-nearf or near lnn, respectively-while maximizing efficiency. The most common efficiency metric is theupdate time, the time required to update the solution following each insertion/deletion. Additionally, there is growing research interest in therecourse[ 2, 4, 6, 8, 9, 17, 19, 20, 30, 31, 32, 33, 34, 45, 48, 49], which measures the number of changes made to the maintained solution per update step, a metric of increasing importance in dynamic environments where stability is required. Both metrics can be analyzed in terms of theiramortized(average) orworst-case(maximum) performance. Previous Results in Theory.While several works have dynamized the primal-dual approach"},{"citing_arxiv_id":"2603.18929","ref_index":13,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"On the Duality of Coverings in Hilbert Geometry","primary_cat":"math.MG","submitted_at":"2026-03-19T14:08:39+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Hilbert-geometry covering numbers satisfy polarity duality: N^H_K(G, α) is bounded above and below by c^{±d} times N^H_{G°}(K°, α) for an absolute constant c.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2601.16156","ref_index":22,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"All ascents exponential from valued constraint graphs of pathwidth three","primary_cat":"cs.DM","submitted_at":"2026-01-22T17:57:54+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A controlled doubling construction yields a pathwidth-three VCSP in which every ascent in the fitness landscape is exponentially long.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2601.15104","ref_index":10,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata","primary_cat":"cs.FL","submitted_at":"2026-01-21T15:46:49+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A Myhill-Nerode characterization for one-clock deterministic timed automata enables L*-style active learning of the canonical automaton.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2512.19521","ref_index":16,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Near-optimal streaming approximation for Max-DICUT in sublinear space using two passes","primary_cat":"cs.DS","submitted_at":"2025-12-22T16:14:22+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A two-pass sublinear-space streaming algorithm achieves (1/2-ε)-approximation for Max-DICUT on unbounded-degree graphs.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2512.04755","ref_index":1,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Typing Fallback Functions: A Semantic Approach to Type Safe Smart Contracts","primary_cat":"cs.PL","submitted_at":"2025-12-04T12:45:23+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Semantic typing via coinductively defined interpretations on a typed operational semantics ensures information flow control and non-interference for TinySol contracts that use fallback functions.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2511.10036","ref_index":19,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow","primary_cat":"cs.DS","submitted_at":"2025-11-13T07:21:00+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"A cut-preserving sparsifier constructed from approximate max-flow enables faster all-pairs minimum-cut algorithms in unweighted graphs across cut-query, dynamic, and streaming models.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2511.02960","ref_index":40,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"The Contiguous Art Gallery Problem is in {\\Theta}(n log n)","primary_cat":"cs.CG","submitted_at":"2025-11-04T20:01:54+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"O(n log n) algorithm and matching Omega(n log n) lower bound for partitioning a simple polygon's boundary into the minimum number of contiguous visible segments.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2510.27588","ref_index":29,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Learned Static Function Data Structures","primary_cat":"cs.DS","submitted_at":"2025-10-31T16:09:53+00:00","verdict":"ACCEPT","verdict_confidence":"MODERATE","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Learned static functions combine per-key ML-predicted prefix codes with classic static function storage to compress static key-value mappings beyond zero-order entropy limits.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2510.21236","ref_index":28,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"AgentBound: Securing Execution Boundaries of AI Agents","primary_cat":"cs.CR","submitted_at":"2025-10-24T08:10:36+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"AgentBound is the first declarative access control framework for Model Context Protocol servers that generates policies from source code at 80.9% accuracy and blocks most threats in malicious servers with negligible overhead.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2510.15712","ref_index":22,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"PLS-complete problems with lexicographic cost functions: Max-$k$-SAT and Abelian Permutation Orbit Minimization","primary_cat":"cs.CC","submitted_at":"2025-10-17T14:56:50+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Establishes PLS-completeness for lexicographic local search in 4-CNF and 3-CNF (double flips), and for Abelian permutation orbit minimization even when groups are cyclic or consist of involutions, with applications to bounded congestion games.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2510.15593","ref_index":16,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Temporal Graph Reconfiguration for Always-Connected Graphs","primary_cat":"cs.DS","submitted_at":"2025-10-17T12:40:32+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Defines LCR problem on always-connected temporal graphs, gives DP algorithm, proves APX-hardness of shortest reconfiguration, and establishes equivalence to STSR.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2510.00331","ref_index":11,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"One-Sided Local Crossing Minimization","primary_cat":"cs.DS","submitted_at":"2025-09-30T22:38:43+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"One-sided local crossing minimization is NP-hard for forests of high-degree stars (with tight ETH lower bound), solvable in quadratic time for degree-2 stars, and admits a 3-approximation via median heuristic with tie-breaking.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2509.24565","ref_index":4,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation","primary_cat":"cs.DS","submitted_at":"2025-09-29T10:18:25+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"The work defines separated low-diameter decompositions for directed graphs and proves the first sub-logarithmic diameter guarantees via small modifications to two prior algorithms.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2505.17314","ref_index":10,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs","primary_cat":"cs.CC","submitted_at":"2025-05-22T22:08:00+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"Regularity in hypergraphs is fine-grained equivalent to the general case for clique detection, enabling a complete classification of k-sparse Boolean CSP optimization complexity by constraint degree: linear for d≤1, clique-equivalent for d=2, and exhaustive-search for d≥3 under 3-uniform hyperclique","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2505.15699","ref_index":9,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Families of tractable problems with respect to vertex-interval-membership width and its generalisations","primary_cat":"cs.DM","submitted_at":"2025-05-21T16:12:39+00:00","verdict":null,"verdict_confidence":null,"novelty_score":null,"formal_verification":null,"one_line_summary":null,"context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2505.07922","ref_index":22,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Homomorphism Indistinguishability Relations induced by Quantum Groups","primary_cat":"quant-ph","submitted_at":"2025-05-12T16:58:51+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Generalizes homomorphism indistinguishability equivalences induced by orthogonal easy quantum groups, including a classification of (0,0)-intertwiners for graph-theoretic versions.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2502.15029","ref_index":7,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Voter Model Meets Rumour Spreading: an FPRAS for Consensus Probabilities on Voter Models with Agnostic Nodes","primary_cat":"cs.MA","submitted_at":"2025-02-20T20:34:21+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Develops an FPRAS for consensus probabilities in voter models with agnostic nodes by combining martingale analysis with rumour-spreading bounds and MCMC estimation.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2501.15303","ref_index":40,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Guarded Negation Transitive Closure Logic","primary_cat":"cs.LO","submitted_at":"2025-01-25T19:00:51+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2412.14061","ref_index":27,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Fast Byzantine Total Order Broadcast","primary_cat":"cs.DC","submitted_at":"2024-12-18T17:07:57+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Flutter achieves 2Δ + ε good-case latency for Byzantine Total Order Broadcast via a new binary consensus called Blink, under partial synchrony with 5f+1 servers.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2406.10069","ref_index":5,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"CycleTrajectory: An End-to-End Pipeline for Enriching and Analyzing GPS Trajectories to Understand Cycling Behavior and Environment","primary_cat":"cs.DB","submitted_at":"2024-06-14T14:24:25+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"CycleTrajectory is a pipeline that filters, resamples, map-matches via OSRM, enriches with OSM road data, and derives cycling metrics from action-camera GPS trajectories, reporting 5.64% map-matching error.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2308.07923","ref_index":19,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"On the enumeration of Tarski fixed points","primary_cat":"cs.DM","submitted_at":"2023-08-15T17:59:33+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Derives query lower bounds matching lattice width for Tarski fixed point enumeration of isotone maps and gives poly-space algorithms for increasing/decreasing cases on lattices including binary relations.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2305.18250","ref_index":65,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"On Complexity Bounds and Confluence of Parallel Term Rewriting","primary_cat":"cs.LO","submitted_at":"2023-05-29T17:16:25+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Automatic techniques derive upper and lower bounds on parallel complexity of term rewriting by reusing sequential methods, with sufficient criteria for confluence of the parallel-innermost relation, shown via AProVE extension and benchmarks.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}