Pith. sign in

super hub Canonical reference

Overcoming catastrophic forgetting in neural networks

Canonical reference. 76% of citing Pith papers cite this work as background.

110 Pith papers citing it
4,193 external citations · OpenAlex
Background 76% of classified citations

hub tools

citation-role summary

background 26 method 2 baseline 1

citation-polarity summary

authors

co-cited works

representative citing papers

On the Limits of PAC Learning of Networks from Opinion Dynamics

cs.SI · 2026-05-14 · conditional · novelty 8.0

PAC learning of networks from threshold opinion dynamics is efficient when influencers per agent are bounded but computationally hard for majority rules, with a heuristic succeeding in over 98% of simulations.

NP-Hardness and a PTAS for the Pinwheel Problem

cs.DS · 2026-04-15 · unverdicted · novelty 8.0

The pinwheel problem is NP-hard, implying hardness for related problems like bamboo garden trimming, and admits a PTAS that improves on the prior 9/7 approximation factor.

Non-Euclidean Erd\H{o}s-Anning Theorems

math.MG · 2024-01-12 · unverdicted · novelty 8.0

Proves non-Euclidean analogs of the Erdős-Anning theorem on integer-distance point sets and resolves Guy's equilateral dimension question via additively weighted Voronoi diagrams.

The Ramsey community number as a renormalization-group crossing

cond-mat.stat-mech · 2026-07-07 · conditional · novelty 7.0

The Ramsey community number on the diamond hierarchical lattice is derived as an exact RG crossing of Bayesian evidence, with closed-form r_k and a thermodynamically ordered hierarchical community phase.

A model of local and global reciprocity

physics.soc-ph · 2026-06-11 · unverdicted · novelty 7.0

A framework integrating local direct reciprocity and global indirect reciprocity shows conditional cooperators resist invasion by unconditional strategies and that forgiving strategies best sustain cooperation.

Quantum Hierarchical Locally Recoverable Codes

cs.IT · 2026-06-04 · accept · novelty 7.0

Random and explicit (r,δ) quantum LRCs and h-level hierarchical QLRCs are constructed via CSS dual-containing codes, with distance bounds, a Singleton-like bound, and an efficient decoder for the Tamo–Barg family.

The Abstraction Gap in Vision-Language Causal Reasoning

cs.CL · 2026-05-27 · unverdicted · novelty 7.0

Introduces Abstraction Gap metric and CAGE benchmark showing seven of eight VLMs have large gaps between text plausibility and chain-based causal reasoning, with one model succeeding.

Innovation: An Almost Characterization of Hallucination

cs.LG · 2026-05-26 · unverdicted · novelty 7.0

Introduces the 'innovation' property of LLMs and proves it is an almost characterization of hallucination while deriving new lower bounds on hallucination rates via missing mass.

Partitioning Neural Co-Variability

q-bio.QM · 2026-05-07 · unverdicted · novelty 7.0

The PMNLV model extends single-neuron overdispersion to populations via matrix-normal gain priors, showing shared co-variability highest in V1 and declining along the mouse visual hierarchy.

Do Melody and Rhythm Coevolve?

cs.SD · 2026-05-07 · unverdicted · novelty 7.0

Large-scale analysis of global popular music shows uncorrelated melodic and rhythmic diversities, with only rhythm linked to ethnic and linguistic heterogeneity.

Smoothness Errors in Dynamics Models and How to Avoid Them

cs.LG · 2026-02-05 · unverdicted · novelty 7.0

Relaxed unitary convolutions for GNNs on meshes balance smoothness preservation with natural smoothing in dynamics, outperforming unitary convolutions and other models on PDEs and weather tasks.

TPV: Parameter Perturbations Through the Lens of Test Prediction Variance

stat.ML · 2025-12-11 · unverdicted · novelty 7.0

TPV measures first-order sensitivity of model outputs to parameter perturbations, unifies robustness analysis under one lens, proves train-to-test convergence in overparameterized limits, and enables label-free pruning and model selection applications.

Bayesian Social Deduction with Graph-Informed Language Models

cs.AI · 2025-06-21 · unverdicted · novelty 7.0

Hybrid Bayesian-graph LLM agent reaches competitive performance against large models and achieves 67% win rate against humans in controlled Avalon play, outperforming baselines and human teammates.

citing papers explorer

Showing 50 of 110 citing papers.