{"paper":{"title":"Dynamical mean-field theory of latching Potts networks","arxiv_id":"2611.16999","primary_cat":"q-bio.NC","submitted_at":"2026-11-12T16:02:03+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":1.0,"id":"s0","own":false,"role":"background","text":"Spontaneous transitions between memories, as observed in internally generated cognition such as mind-wandering and free association, require neural dynamics capable of destabilizing one attractive memory state and moving towards another.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.05,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":0.63,"id":"s1","own":false,"role":"gap","text":"We ask what minimal representational structure is required for such transitions to emerge in random associative networks.","hedge":{"p":0.97,"label":"unclear"},"own_p":0.18,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.63,"method":0.0,"result":0.0,"background":0.22,"limitation":0.0,"future_work":0.0,"contribution":0.15,"interpretation":0.0}},{"i":2,"p":0.74,"id":"s2","own":true,"role":"method","text":"To address this question, we study Potts associative networks with $S$ active states per unit and slow adaptive thresholds.","hedge":{"p":0.74,"label":"asserted"},"own_p":0.81,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.3,"role_probabilities":{"gap":0.0,"method":0.74,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.26,"interpretation":0.0}},{"i":3,"p":0.84,"id":"s3","own":false,"role":"background","text":"The $S=1$ case can model a standard Hopfield-like network of binary units.","hedge":{"p":0.53,"label":"asserted"},"own_p":0.11,"main_claim_p":0.02,"quantitative":true,"quantitative_p":0.77,"role_probabilities":{"gap":0.0,"method":0.15,"result":0.0,"background":0.84,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":4,"p":0.95,"id":"s4","own":true,"role":"method","text":"We employ dynamical mean-field theory in the extensive-load regime, where the number of stored patterns scales linearly with network size and connectivity, and we focus on transitions between two condensed memories, which are singled out in the connectivity matrix.","hedge":{"p":0.83,"label":"asserted"},"own_p":0.88,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.42,"role_probabilities":{"gap":0.0,"method":0.95,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.05,"interpretation":0.0}},{"i":5,"p":0.99,"id":"s5","own":true,"role":"result","text":"In the finite-load regime, we show that transitions are governed by an effective drive term, whose sign and temporal evolution distinguish high-latching (structured), low-latching (random), and non-latching regimes.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.12,"quantitative":false,"quantitative_p":0.38,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.99,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":6,"p":0.99,"id":"s6","own":true,"role":"result","text":"The resulting phase diagram shows that adaptation alone is not sufficient: transitions only occur within certain ranges of the overlap between the two memories.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.9,"main_claim_p":0.15,"quantitative":false,"quantitative_p":0.32,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.99,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.01}},{"i":7,"p":0.9,"id":"s7","own":true,"role":"result","text":"In the binary case $S=1$, in particular, no unit can be active in both memories but in different Potts states, thus strongly supressing the high-latching, structured transitions that exist for $S>1$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.7,"main_claim_p":0.14,"quantitative":true,"quantitative_p":0.91,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.9,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.1}},{"i":8,"p":0.93,"id":"s8","own":true,"role":"result","text":"In the extensive-load regime, non-condensed memories generate colored fluctuations and retarded self-interactions through an effective memory kernel.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.79,"main_claim_p":0.04,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.03,"result":0.93,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.04,"interpretation":0.0}},{"i":9,"p":0.99,"id":"s9","own":true,"role":"result","text":"We find that latching trajectories change the effective timescale of this kernel, a dynamical signature of transitions in the extensive-load regime.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.09,"quantitative":false,"quantitative_p":0.08,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.99,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.01}},{"i":10,"p":1.0,"id":"s10","own":true,"role":"interpretation","text":"These results indicate that multi-state Potts-like representations are essential for structured memory-to-memory transitions, a hallmark of spontaneous thought.","hedge":{"p":0.95,"label":"hedged_possibility"},"own_p":0.79,"main_claim_p":0.9,"quantitative":false,"quantitative_p":0.16,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":1.0}}]},"compiled":{"main_claim":{"p":1.0,"text":"These results indicate that multi-state Potts-like representations are essential for structured memory-to-memory transitions, a hallmark of spontaneous thought.","location":"abstract s10","hedge_strength":{"p":0.95,"label":"hedged possibility"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":8315,"cost_usd_reported":0.0},"compiled_at":"2026-11-13","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.04,"states_limitation":0.76,"human_participants":0.03,"controlled_comparison":0.12,"randomized_assignment":0.01,"states_quantitative_result":0.19,"compares_with_prior_results":0.33,"mentions_code_or_data_availability":0.01},"evidential_basis":{"p":0.96,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":0.96,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.04}},"contribution_type":{"p":1.0,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.0,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":1.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.49,"text":"In the finite-load regime, we show that transitions are governed by an effective drive term, whose sign and temporal evolution distinguish high-latching (structured), low-latching (random), and non-latching regimes.","location":"abstract s5"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":11,"sentences_in_abstract":11},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}