{"data":[{"id":"10.48550/arxiv.2610.12466","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.12466","identifiers":[{"identifier":"2610.12466","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Drew T.","familyName":"Nguyen","name":"Nguyen, Drew T.","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"William","familyName":"Fithian","name":"Fithian, William","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"On the estimation and validity of AI time horizons---a statistical look at the METR plot"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Artificial Intelligence (cs.AI)","lang":"en","subjectScheme":"arXiv"},{"subject":"Machine Learning (cs.LG)","lang":"en","subjectScheme":"arXiv"},{"subject":"Machine Learning (stat.ML)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T17:59:50Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-12T00:23:55Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"1","rightsList":[{"rightsUri":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","rights":"arXiv.org perpetual, non-exclusive license"}],"descriptions":[{"descriptionType":"Abstract","description":"METR's 50\\% time horizon measures the human completion time of software tasks that an AI solves with 50\\% probability, allowing AI capabilities to be expressed in interpretable units. On 228 tasks and 26 AIs, we recompute the time horizons using splines and item-response theory to relax the assumption that the AI difficulty of a task depends linearly on the log of human time. Our fitted spline can be interpreted as a function that \\emph{converts} human time to AI difficulty; it is nearly flat in a region from 2--30 min but close to linear elsewhere. Hence, a time-horizon jump from 3 min to 30 min is much easier than one from 30 min to 5 hours despite the same multiplier of $10 \\times$. Overall, we contribute time-horizon point estimates that perform better under a cross-validated suite of proper scoring rules, as well as diagnostic plots for assessing time horizons' construct validity. We suggest that time horizons be interpreted together with the diagnostic plots, especially as new time-horizon-based benchmarks are proposed or existing ones grow to include longer tasks."}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.12466","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T03:11:31Z","registered":"2026-10-09T03:11:32Z","published":null,"updated":"2026-10-12T02:59:01Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.12446","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.12446","identifiers":[{"identifier":"2610.12446","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Stephan","familyName":"Wiesendorf","name":"Wiesendorf, Stephan","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Self-intersecting sections of polar actions on simply connected manifolds"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Differential Geometry (math.DG)","lang":"en","subjectScheme":"arXiv"},{"subject":"Geometric Topology (math.GT)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Mathematics","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"57S15 (Primary), 53C12 (Secondary)","lang":"en","subjectScheme":"MSC"}],"contributors":[],"dates":[{"date":"2026-10-08T17:58:29Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-12T00:29:26Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"1","rightsList":[{"rightsUri":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","rights":"arXiv.org perpetual, non-exclusive license"}],"descriptions":[{"descriptionType":"Abstract","description":"We construct a polar action of $\\mathrm{SU}(3)$ on a closed simply connected $11$-manifold with a compact three-dimensional section that is not injectively immersed. The section is injective over the regular part and has two distinct local branches along a singular stratum. All isotropy groups are connected, and all orbits are simply connected. This gives a negative answer to the injectivity question raised by Grove and Ziller."},{"descriptionType":"Other","description":"5 pages"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.12446","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T03:11:01Z","registered":"2026-10-09T03:11:01Z","published":null,"updated":"2026-10-12T02:59:00Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.12336","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.12336","identifiers":[{"identifier":"2610.12336","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Adrian","familyName":"Hill","name":"Hill, Adrian","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Guillaume","familyName":"Dalle","name":"Dalle, Guillaume","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"asdex: Automatic Sparse Differentiation in JAX"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Mathematical Software (cs.MS)","lang":"en","subjectScheme":"arXiv"},{"subject":"Machine Learning (cs.LG)","lang":"en","subjectScheme":"arXiv"},{"subject":"Numerical Analysis (math.NA)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"FOS: Mathematics","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T17:13:09Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:30:20Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T10:46:48Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T00:52:56Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsIdentifierScheme":"SPDX","rightsUri":"https://creativecommons.org/licenses/by/4.0/legalcode","schemeUri":"https://spdx.org/licenses/","rights":"Creative Commons Attribution 4.0 International","rightsIdentifier":"cc-by-4.0"}],"descriptions":[{"descriptionType":"Abstract","description":"Many tasks in scientific computing and machine learning require the Jacobian or Hessian matrix of a function. Automatic differentiation (AD) computes these derivatives to machine precision, but materializing a dense $m \\times n$ Jacobian requires $n$ forward-mode or $m$ reverse-mode AD passes, one per column or row. For a large class of functions, each output depends on only a few inputs, making the derivative matrix sparse. Automatic sparse differentiation (ASD) exploits this structure in four steps: detection of the input-agnostic sparsity pattern, coloring of a graph to group columns or rows that can share an AD pass, compressed differentiation to compute a compressed derivative matrix with one AD pass per color, and finally decompression into the original sparsity pattern. The number of colors, and hence of AD passes, is often independent of the problem dimension: a banded Jacobian with $b$ contiguous bands, for instance, only ever requires $b$ colors, regardless of its size. asdex offers the first standalone ASD toolkit in the popular JAX ecosystem. With $\\texttt{asdex.jacobian}$ and $\\texttt{asdex.hessian}$, it provides sparse drop-in replacements for $\\texttt{jax.jacobian}$ and $\\texttt{jax.hessian}$."},{"descriptionType":"Other","description":"1 table"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.12336","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T03:08:13Z","registered":"2026-10-09T03:08:14Z","published":null,"updated":"2026-10-12T02:58:59Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.12323","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.12323","identifiers":[{"identifier":"2610.12323","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"H. F.","familyName":"Henrichs","name":"Henrichs, H. F.","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"N. P.","familyName":"Sudnik","name":"Sudnik, N. P.","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"A.","familyName":"David-Uraz","name":"David-Uraz, A.","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Rotation period of the O giant xi Persei: Coexistence of cyclic and periodic variability. A weakly magnetic candidate star"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Solar and Stellar Astrophysics (astro-ph.SR)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Physical sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T17:05:25Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:29:59Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T09:31:58Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T00:46:46Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[{"relationType":"IsVersionOf","relatedIdentifier":"10.1051/0004-6361/202557678","relatedIdentifierType":"DOI"}],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsUri":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","rights":"arXiv.org perpetual, non-exclusive license"}],"descriptions":[{"descriptionType":"Abstract","description":"OB stars exhibit line profile variability, often associated with rotation; notably, in their UV wind-sensitive lines where discrete absorption components tend to recur cyclically. We searched for periodicity in spectral regions of the O7.5III(n)((f)) star xi Persei formed very close to the star. The NIV 1718 A line was identified as the most uncontaminated spectral with a large and homogeneous available dataset is available: 307 IUE spectra over 12 years and 11 STIS spectra taken 21 years later. We also studied 322 time-resolved HeII 4686 A spectra and MOST, BRITE, and TESS space photometry, covering a time span of 13 years. We also reconsidered X-ray studies with Chandra. A CLEAN analysis and subsequent weighted least-squares fit of the flux in this region resulted in a unique period of 2.040514(20) d, attributed to rotation. The phase of maximum flux in the NIV, SiIV, Ha, and HeII line profiles coincide with the results of X-ray variability studies. This period was also found in the photometric data. Given the coherent periodic behaviour probing the region of the wind nearest the stellar surface, we propose that xi Per has an as-yet undetected weak global surface magnetic field. The sinusoidal behaviour suggested that only one magnetic pole is visible, implying an inclination of i approximately 51 deg, and therefore, 39 deg for the magnetic obliquity. We present a conceptual framework within which weak wind confinement by a global magnetic field can create a small magnetospheric disc, while allowing for the formation of more classic corotating interaction regions at higher magnetic latitudes. The periodic variations are then understood to result from the changing projected area of the magnetospheric disc as a function of rotational phase, both along the line of sight and off the stellar limb."},{"descriptionType":"Other","description":"20 pages, 20 figures"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.12323","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":1,"created":"2026-10-09T03:07:53Z","registered":"2026-10-09T03:07:54Z","published":null,"updated":"2026-10-12T02:58:58Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.12271","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.12271","identifiers":[{"identifier":"2610.12271","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Sylvain","familyName":"Carrozza","name":"Carrozza, Sylvain","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Johann","familyName":"Chevrier","name":"Chevrier, Johann","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Luca","familyName":"Lionni","name":"Lionni, Luca","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Multipartite entanglement spreads"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Mathematical Physics (math-ph)","lang":"en","subjectScheme":"arXiv"},{"subject":"High Energy Physics - Theory (hep-th)","lang":"en","subjectScheme":"arXiv"},{"subject":"Quantum Physics (quant-ph)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Physical sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T16:34:25Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-12T00:31:33Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"1","rightsList":[{"rightsIdentifierScheme":"SPDX","rightsUri":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","schemeUri":"https://spdx.org/licenses/","rights":"Creative Commons Attribution Non Commercial No Derivatives 4.0 International","rightsIdentifier":"cc-by-nc-nd-4.0"}],"descriptions":[{"descriptionType":"Abstract","description":"The entanglement structure of a bipartite pure state is characterized by its entanglement spectrum, or equivalently, by the family of Rényi-$k$ entanglement entropies with integer $k$. Taking the difference of two such entropies defines a quantity known as an entanglement spread, that is monotonous under local operations, and that vanishes if and only if the entanglement spectrum of the state is flat. We introduce a multipartite generalization of this notion which, for a fixed number $D\\geq 3$ of parties, results in a collection of maps indexed by pairs of $D$-edge-colored graphs (obeying some condition). Each member of this collection takes the form of a difference of two multipartite Rényi entanglement entropies, each associated to a local unitary polynomial invariant (known in this context as a trace-invariant), and is shown to be monotonous under local operations. We then argue that a previously introduced family of so-called hypergraph-tensor (HT) states can be understood as a multipartite counterpart to the family of flat bipartite states. Indeed, we first prove that, when $D=3$, a tripartite pure state is HT if and only if it minimizes a particular (infinite) family of entanglement spreads. Second, we embed the set of HT states into the much larger family of spectral hypergraph-tensor (SHT) states, defined by a new Ansatz we introduce. We then prove that HT states can be uniquely characterized as the minimizers of some fixed entanglement spread among SHT states, for arbitrary $D\\geq 3$. We also investigate SHT states in their own right: in particular, we characterize their orbits under local unitary transformations. Finally, along the way, the asymptotic large-$N$ expectation values of a number of entanglement spreads are computed in the Haar-random state of local dimension $N$."},{"descriptionType":"Other","description":"52 pages, 16 figures"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.12271","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T03:06:34Z","registered":"2026-10-09T03:06:35Z","published":null,"updated":"2026-10-12T02:58:57Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.12182","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.12182","identifiers":[{"identifier":"2610.12182","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Thomas","familyName":"Goudemant","name":"Goudemant, Thomas","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Aurélien","familyName":"Bobey","name":"Bobey, Aurélien","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Omar","familyName":"Hlimi","name":"Hlimi, Omar","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Marjorie","familyName":"Bellizzi","name":"Bellizzi, Marjorie","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"AI-Based On-Board Maritime Object Detection for Earth Observation Payload Data Reduction on Versal Embedded Hardware"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Computer Vision and Pattern Recognition (cs.CV)","lang":"en","subjectScheme":"arXiv"},{"subject":"Artificial Intelligence (cs.AI)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"I.4.8; I.2.10; C.3","lang":"en","subjectScheme":"ACM"}],"contributors":[],"dates":[{"date":"2026-10-08T15:48:00Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:23:45Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T09:26:28Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T00:46:20Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[{"relationType":"IsVersionOf","relatedIdentifier":"10.5281/zenodo.23242463","relatedIdentifierType":"DOI"}],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsIdentifierScheme":"SPDX","rightsUri":"https://creativecommons.org/licenses/by/4.0/legalcode","schemeUri":"https://spdx.org/licenses/","rights":"Creative Commons Attribution 4.0 International","rightsIdentifier":"cc-by-4.0"}],"descriptions":[{"descriptionType":"Abstract","description":"Very-high-resolution Earth-observation satellites acquire more data than they can store and downlink, while in maritime surveillance the vessels cover a tiny fraction of each scene. We study onboard vessel detection as a way to select what is downlinked, which reduces the data according to its content rather than coding every pixel; it is complementary to conventional onboard compression. The work follows three axes. (i) Data and algorithm: a controlled dataset is generated from 68 annotated Maxar scenes with 43 vessel classes, and a YOLOX-S detector is trained on it. (ii) Embedded deployment: the detector is quantized and deployed on the DPU of a Versal VC1902, with a limited loss of detection quality and a processing time of a few seconds per scene. (iii) Data reduction: we propose several downlink modes, from metadata only (box, class and score of each detection) to image crops around vessels, tiles holding detections, or the whole scene with a degraded background, and estimate from the measured detection errors the trade-off each offers between the vessels kept and the volume downlinked. On our dense harbor and coastal scenes, tiles keep 98% of the vessels with 29% of the scene volume, and crops 83% with 3%."},{"descriptionType":"Other","description":"8 pages. Accepted at the 10th On-Board Payload Data Compression Workshop (OBPDC 2026), Barcelona, Spain, 12-14 October 2026"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.12182","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":1,"created":"2026-10-09T03:04:18Z","registered":"2026-10-09T03:04:19Z","published":null,"updated":"2026-10-12T02:58:57Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.12165","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.12165","identifiers":[{"identifier":"2610.12165","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Xin","familyName":"Nie","name":"Nie, Xin","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"(In)finiteness of slopes for Monge-Ampère equations at flat boundary pieces"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Analysis of PDEs (math.AP)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Mathematics","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"Primary 35J96, Secondary 35B33, 35B65, 35J70, 35J75","lang":"en","subjectScheme":"MSC"}],"contributors":[],"dates":[{"date":"2026-10-08T15:40:35Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:23:09Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T02:31:31Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T00:22:58Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsIdentifierScheme":"SPDX","rightsUri":"https://creativecommons.org/licenses/by/4.0/legalcode","schemeUri":"https://spdx.org/licenses/","rights":"Creative Commons Attribution 4.0 International","rightsIdentifier":"cc-by-4.0"}],"descriptions":[{"descriptionType":"Abstract","description":"On any bounded convex domain $Ω\\subset\\mathbb{R}^n$ with a $d$-dimensional flat boundary piece $F\\subset\\partialΩ$, we consider convex solutions with zero boundary values to the Monge-Ampère equations\n $$\n \\det\\mathsf{D}^2 u= \\mathrm{dist}(\\,\\cdot\\,,\\mathrm{Aff}(F))^α,\\quad\\det\\mathsf{D}^2 u=\\mathrm{dist}(\\,\\cdot\\,,\\partialΩ)^α,\\quad \\det\\mathsf{D}^2 u=(-u)^α,\n $$ where $\\mathrm{dist}$ stands for Euclidean distance and $\\mathrm{Aff}(F)$ is the affine hull of $F$. We show that the threshold of the exponent $α\\in\\mathbb{R}$ for $u$ to have infinite slope at $F$ is $α\\leq 2d-n$. For the first two equations, we also show that no solution exists when $α\\leq 2d-2n$. Moreover, when $Ω$ satisfies the ``exterior cone condition with a $d$-dimensional ridge'' at $F$, both thresholds are sharp for the first equation, and the infinite-slope threshold is sharp for the last equation."},{"descriptionType":"Other","description":"26 pages, 4 figures"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.12165","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T03:03:53Z","registered":"2026-10-09T03:03:53Z","published":null,"updated":"2026-10-12T02:58:56Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.12151","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.12151","identifiers":[{"identifier":"2610.12151","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Yue","familyName":"Wu","name":"Wu, Yue","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Haoyu","familyName":"Wan","name":"Wan, Haoyu","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Yuan","familyName":"Tian","name":"Tian, Yuan","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Deng","familyName":"Pan","name":"Pan, Deng","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Mingwei","familyName":"Chen","name":"Chen, Mingwei","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Specialized machine learning force fields for materials dynamics"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Materials Science (cond-mat.mtrl-sci)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Physical sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T15:34:28Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:22:28Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T06:55:08Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T00:35:11Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsUri":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","rights":"arXiv.org perpetual, non-exclusive license"}],"descriptions":[{"descriptionType":"Abstract","description":"Machine learning interatomic potentials (MLIPs) are transforming atomistic simulations by accessing unprecedented length and time scales. While pretrained equivariant graph neural networks achieve robust zero-shot performance for near-equilibrium properties across broad chemical spaces, their translation to complex materials dynamics remains fundamentally challenged by out-of-distribution reactive states, representation biases, and computational scaling limits. In this Review, we examine how physics-driven specialization extends the applicability of MLIPs to complex dynamical systems. We systematically evaluate the structural trade-offs in MLIP design: the undersampling of highly strained configurations, the prohibitive computational overhead of high-order message-passing architectures, and the necessity of nonlocal interactions for open and field-coupled systems. Through four demanding application contexts - electrified interfaces, compositionally fluctuating open systems, multiphase evolution, and large-scale fracture - we establish a framework for observable-specific validation. Highlighting the complementary roles of universal foundation models and task-specific potentials, we emphasize that targeted adaptations must be rigorously benchmarked against intended observables. We conclude with a roadmap for developing physically consistent, hardware-aware force fields that seamlessly connect electronic-structure accuracy to macroscopic materials phenomena."}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.12151","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T03:03:32Z","registered":"2026-10-09T03:03:33Z","published":null,"updated":"2026-10-12T02:58:55Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.12133","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.12133","identifiers":[{"identifier":"2610.12133","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Zhiyun","familyName":"Shi","name":"Shi, Zhiyun","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Rehearse Everything, Remember Nothing: Attic-KV Rehearses What Will Be Read"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Computation and Language (cs.CL)","lang":"en","subjectScheme":"arXiv"},{"subject":"Machine Learning (cs.LG)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T15:22:50Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:21:14Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T13:19:36Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T01:02:48Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsUri":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","rights":"arXiv.org perpetual, non-exclusive license"}],"descriptions":[{"descriptionType":"Abstract","description":"Many key-value (KV) caches are compressed before anyone knows what will be asked of them: a document cached for retrieval, a prompt prefix shared across requests, the memory of a long conversation. The prevailing approach scores KV entries by rehearsal: the model rereads the context and keeps the entries it attends to, assuming that the more completely a cache rehearses its context, the better it remembers it. We show that under tight budgets this assumption backfires: rehearse everything, remember nothing. At a 3% keep ratio, rereading the whole context keeps 31.5 of 96.5 points on RULER, and on LongBench's natural-text tasks it falls below methods that rehearse nothing at all. The cause is that a cache keeps what it rehearses: rereading spreads the budget across the whole context, so the answer's own entries survive at little more than chance. Like a student before an exam, a cache remembers more by testing itself than by rereading. Two principles follow: rehearse what will be read, and rehearse as much as there is. We instantiate them as Attic-KV (Attic for short), a training-free rehearsal in which the model quizzes itself with question-answer pairs that quote the context, alongside anchor tokens in a content-adaptive amount. Changing only the rehearsal lifts three hosts that score it in three different ways: Attic alone is the best training-free method in all eight settings we test on RULER and LongBench's natural-text tasks, and plugged into the gradient-based KVgrad and the trained RestoreKV+, it raises them by up to 17.1 and 28.1 points. Its advantage grows as the budget shrinks, reaching 41.9 points over full rereading at a 3% keep ratio, and on long documents it compresses faster than rereading them."},{"descriptionType":"Other","description":"15 pages, 6 figures"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.12133","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T03:03:04Z","registered":"2026-10-09T03:03:05Z","published":null,"updated":"2026-10-12T02:58:55Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.12072","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.12072","identifiers":[{"identifier":"2610.12072","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Guozheng","familyName":"Cheng","name":"Cheng, Guozheng","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Xiang","familyName":"Fang","name":"Fang, Xiang","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Xueqing","familyName":"Ma","name":"Ma, Xueqing","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Hongli","familyName":"Zhang","name":"Zhang, Hongli","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Strict Hausdorff-dimension drop for Quartic Salem Bernoulli convolutions"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Dynamical Systems (math.DS)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Mathematics","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"Primary 28A80, Secondary 11R06, 60G50","lang":"en","subjectScheme":"MSC"}],"contributors":[],"dates":[{"date":"2026-10-08T14:50:05Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:18:24Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T13:10:48Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T01:02:11Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsUri":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","rights":"arXiv.org perpetual, non-exclusive license"}],"descriptions":[{"descriptionType":"Abstract","description":"For every quartic Salem number $β$, we prove that the equal-weight Bernoulli convolution $ν_{β^{-1}}$ has Hausdorff dimension strictly less than one. The main step converts large Fourier coefficients at geometrically separated frequencies into a deficit in the Shannon entropy of a finite convolution. A positive trigonometric product gives the entropy estimate, while the algebraic norm controls the number of distinct atoms in each spatial cell. For the two quartic Salem numbers in $(1,2)$, reciprocal differences at suitable return times produce the required Fourier coefficients. A finite block cover then gives the dimension bound. This proof is independent of numerical computation. Separate exact calculations give $\\dimHν_{β_1^{-1}}\u0026lt;1-1.4\\cdot10^{-23}$ and $\\dimHν_{β_2^{-1}}\u0026lt;1-7.8\\cdot10^{-22}$, where $β_1\u0026lt;β_2$ are the two parameters in $(1,2)$. The accompanying verification programs use rational interval arithmetic and the Python standard library."}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.12072","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T03:01:39Z","registered":"2026-10-09T03:01:40Z","published":null,"updated":"2026-10-12T02:58:54Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.12069","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.12069","identifiers":[{"identifier":"2610.12069","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Peijun","familyName":"Xu","name":"Xu, Peijun","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Chuansen","familyName":"Nie","name":"Nie, Chuansen","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Yiyang","familyName":"He","name":"He, Yiyang","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Yinuo","familyName":"Bai","name":"Bai, Yinuo","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Jingyang","familyName":"Liu","name":"Liu, Jingyang","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Kuixiang","familyName":"Shao","name":"Shao, Kuixiang","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Yuyang","familyName":"Jiao","name":"Jiao, Yuyang","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Kuanhao","familyName":"Xia","name":"Xia, Kuanhao","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Jiayi","familyName":"Zhu","name":"Zhu, Jiayi","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Zitian","familyName":"Yang","name":"Yang, Zitian","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Yanqi","familyName":"Zhang","name":"Zhang, Yanqi","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Tianye","familyName":"Tan","name":"Tan, Tianye","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Shuwei","familyName":"Di","name":"Di, Shuwei","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Junyi","familyName":"Xu","name":"Xu, Junyi","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Jingyi","familyName":"Yu","name":"Yu, Jingyi","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Jiayuan","familyName":"Gu","name":"Gu, Jiayuan","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"LIVIN: Benchmarking Spatial and Embodied Intelligence in Digital Twins of Lived-In Homes"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Computer Vision and Pattern Recognition (cs.CV)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T14:47:30Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:18:18Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T09:46:21Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T00:47:59Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsUri":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","rights":"arXiv.org perpetual, non-exclusive license"}],"descriptions":[{"descriptionType":"Abstract","description":"Realistic household simulation must capture not only diverse environments but also the lived-in object arrangements and spatial constraints that shape robot motion and interaction. Existing resources often trade off scale, real-world correspondence, and interaction readiness, leaving a gap in faithful, interactive replicas of how real homes are actually arranged. To this end, we introduce LIVIN, a benchmark for spatial and embodied intelligence built on digital twins of 30 diverse lived-in homes. These replicas preserve observed room layouts, furniture configurations, and everyday belongings. To construct them, we design a human-in-the-loop workflow comprising instance recognition, architectural reconstruction, and object generation and placement, with intermediate results reviewed and corrected by humans against the source observations at each stage. We evaluate four tasks in LIVIN: 3D detection, 3D reconstruction, navigation, and loco-manipulation. Our evaluations show that current methods remain challenged by the dense object arrangements, occlusions, limited free space, and constrained interaction regions found in realistic lived-in homes. We hope LIVIN will help advance embodied AI in real-world homes, from spatial understanding to robotic interaction, and ultimately bring embodied intelligence into everyday home environments."}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.12069","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T03:01:35Z","registered":"2026-10-09T03:01:36Z","published":null,"updated":"2026-10-12T02:58:53Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.12023","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.12023","identifiers":[{"identifier":"2610.12023","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Jonathan","familyName":"Ivey","name":"Ivey, Jonathan","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Aimee","familyName":"Liang","name":"Liang, Aimee","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Arthur Y. S.","familyName":"Wang","name":"Wang, Arthur Y. S.","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Madeline","familyName":"Mandell","name":"Mandell, Madeline","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Ziang","familyName":"Xiao","name":"Xiao, Ziang","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Anjalie","familyName":"Field","name":"Field, Anjalie","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"InterviewPlayground: A Validated Simulation Environment for Evaluating AI Interviewers"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Artificial Intelligence (cs.AI)","lang":"en","subjectScheme":"arXiv"},{"subject":"Computation and Language (cs.CL)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T14:20:46Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:15:52Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T12:49:05Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T01:00:54Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsIdentifierScheme":"SPDX","rightsUri":"https://creativecommons.org/licenses/by/4.0/legalcode","schemeUri":"https://spdx.org/licenses/","rights":"Creative Commons Attribution 4.0 International","rightsIdentifier":"cc-by-4.0"}],"descriptions":[{"descriptionType":"Abstract","description":"Increasingly, AI interviewers are being developed to elicit open-ended responses in applications like market research, public polling, preference elicitation, and social science research. However, evaluating AI interviewers is challenging because they function in extended, multi-turn interactions where they must adapt to participant behaviors. To address this need, we develop InterviewPlayground, a simulation environment for evaluating AI interviewers using simulated study participants whose behaviors are grounded in social theory. Simulated studies in InterviewPlayground produce an InterviewReportCard, which assesses the performance of AI interviewers using a suite of validated measures. To test whether our simulation-based evaluations predict performance with human participants, we conduct 15 real qualitative studies with five AI interviewers, three interview topics, and 450 human participants and compare them to simulated studies in InterviewPlayground. We find that AI interviewer performance in InterviewPlayground predicts performance in human studies with an average Pearson correlation of 0.86 across 12 measures, and the simulated interactions from InterviewPlayground reproduce key findings from behavioral analysis of AI interviewers in the human studies. Together, these findings support the validity of InterviewPlayground in assessing AI interviewer performance and examining potential failure modes. Our work contributes a simulation environment for AI interviewers supported with empirical validation, and more broadly, a roadmap for future work to develop validated, simulation-based evaluations of conversational AI systems."},{"descriptionType":"Other","description":"Preprint. 23 pages"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.12023","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T03:00:34Z","registered":"2026-10-09T03:00:35Z","published":null,"updated":"2026-10-12T02:58:52Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.12040","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.12040","identifiers":[{"identifier":"2610.12040","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Yi","familyName":"Chung","name":"Chung, Yi","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Constructing $SU(N)$ strongly coupled dark sectors by extending the Standard Model: mixed representations, flavor structure, global symmetries and various portals"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"High Energy Physics - Phenomenology (hep-ph)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Physical sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T14:29:26Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-12T00:37:37Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"1","rightsList":[{"rightsIdentifierScheme":"SPDX","rightsUri":"https://creativecommons.org/licenses/by/4.0/legalcode","schemeUri":"https://spdx.org/licenses/","rights":"Creative Commons Attribution 4.0 International","rightsIdentifier":"cc-by-4.0"}],"descriptions":[{"descriptionType":"Abstract","description":"Motivated by the potential existence of a dark QCD sector, we construct a $SU(N)$ strongly coupled dark sector by extending the Standard Model (SM) gauge group to an enlarged $SU(N+5)\\times SU(N+1)\\times U(1)$, under which the dark quark candidates naturally arises from the same multiplets as the SM fermions. The dark QCD sector from the extension inherits the rich structure of the SM, featuring three distinct properties: (1) Mixed representations: There are dark quarks of three different representations, including fundamental ($χ_f$), antisymmetric ($χ_a$), and symmetric ($χ_s$), which can be traced back to the chiral structure of the SM. (2) Flavor: Each representation features three generations, with their flavor structures and Yukawa interactions directly related to those of the SM. (3) Global symmetries: Alongside the conventional dark baryon number $D$, we identify an exotic dark baryon number $\\widetilde{D}$ from a conserved $(B-L)-\\widetilde{D}$ symmetry. These features provide novel perspectives on the structure of dark QCD sectors. Furthermore, the extension of the scalar and gauge sectors introduces various portals between the dark QCD sector and the SM sector. We systematically study these portals, including quark portal, lepton portal, Higgs and $Z$ portal, heavy $Z'$ portal, kinetic mixing portal, dipole portal, and dark pion/axion portals. With a concrete UV model, their origin become robust, providing additional guidance for experimental searches of the dark sector."},{"descriptionType":"Other","description":"55 pages, 1 figure, 3 tables"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.12040","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T03:00:56Z","registered":"2026-10-09T03:00:57Z","published":null,"updated":"2026-10-12T02:58:52Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.11991","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.11991","identifiers":[{"identifier":"2610.11991","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Dhruv","familyName":"Nevatia","name":"Nevatia, Dhruv","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"David","familyName":"Basin","name":"Basin, David","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Quantitative Verification of Infinite-State Networks"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Formal Languages and Automata Theory (cs.FL)","lang":"en","subjectScheme":"arXiv"},{"subject":"Logic in Computer Science (cs.LO)","lang":"en","subjectScheme":"arXiv"},{"subject":"Programming Languages (cs.PL)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T14:00:41Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:14:13Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T12:27:22Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T00:59:05Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsIdentifierScheme":"SPDX","rightsUri":"https://creativecommons.org/licenses/by/4.0/legalcode","schemeUri":"https://spdx.org/licenses/","rights":"Creative Commons Attribution 4.0 International","rightsIdentifier":"cc-by-4.0"}],"descriptions":[{"descriptionType":"Abstract","description":"Many network protocols and distributed systems combine recursion, unbounded local state, and quantitative behaviour such as cost, latency, or reliability. Existing decidability results for networks of pushdown systems are largely qualitative, and do not extend to quantitative analyses, which must jointly track traces and weights.\n We present a framework for the quantitative verification of acyclic networks of weighted pushdown systems. Finitely summarising a recursive network component requires collapsing the infinite family of runs obtained by pumping its nested loops, and doing so exactly, rather than by over-approximation, is a standing difficulty. We give a class of weight domains where this is possible: pumping semirings, those in which the weights accumulated by such a family collapse to a closed form; informally, the domain must be unable to count iterations. The class admits domains with infinite ascending chains, such as the arctic semiring and downward-closed languages. Over these, we give a terminating saturation algorithm computing quantitative reachability exactly, resting on two ideas: segment tree algebras, a compositional representation of runs, and thermal extensions, which symbolically separate accelerated weights so that further acceleration remains exact. We use this to compute upward and downward closures of context-free languages uniformly, and to lift the algorithm to acyclic networks over \"thin\" pumping semirings, yielding the first quantitative safety and reachability analyses for networks of pushdown systems."},{"descriptionType":"Other","description":"45 pages, 13 figures"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.11991","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T02:59:52Z","registered":"2026-10-09T02:59:53Z","published":null,"updated":"2026-10-12T02:58:51Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.11960","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.11960","identifiers":[{"identifier":"2610.11960","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Mathis","familyName":"Wetterwald","name":"Wetterwald, Mathis","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Ofer","familyName":"Shayevitz","name":"Shayevitz, Ofer","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Michèle","familyName":"Wigger","name":"Wigger, Michèle","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Estimation with Quantized Parameter Side-Information"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Information Theory (cs.IT)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T13:42:10Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-12T00:41:49Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[{"relationType":"IsVersionOf","relatedIdentifier":"10.1109/isit62367.2026.11653704","relatedIdentifierType":"DOI"}],"relatedItems":[],"sizes":[],"formats":[],"version":"1","rightsList":[{"rightsIdentifierScheme":"SPDX","rightsUri":"https://creativecommons.org/licenses/by/4.0/legalcode","schemeUri":"https://spdx.org/licenses/","rights":"Creative Commons Attribution 4.0 International","rightsIdentifier":"cc-by-4.0"}],"descriptions":[{"descriptionType":"Abstract","description":"This paper presents upper and lower bounds on the minimax risk of a parameter estimation problem where the estimator not only observes independent and identically distributed observations but also a quantized version of the parameter, where the quantization has a limitation on the number of levels, but can be optimized otherwise. Our upper and lower bounds have similar decay rates for large number of observation samples and quantization levels."},{"descriptionType":"Other","description":"5 pages, conference paper"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.11960","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":1,"created":"2026-10-09T02:59:07Z","registered":"2026-10-09T02:59:08Z","published":null,"updated":"2026-10-12T02:58:50Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.11976","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.11976","identifiers":[{"identifier":"2610.11976","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Steve","familyName":"Huntsman","name":"Huntsman, Steve","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Efficient quadratic entropy with distance sketches"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Machine Learning (stat.ML)","lang":"en","subjectScheme":"arXiv"},{"subject":"Machine Learning (cs.LG)","lang":"en","subjectScheme":"arXiv"},{"subject":"Statistics Theory (math.ST)","lang":"en","subjectScheme":"arXiv"},{"subject":"Computation (stat.CO)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"FOS: Mathematics","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"94A17 (Primary), 68W20, 65C05, 62R07 (Secondary)","lang":"en","subjectScheme":"MSC"}],"contributors":[],"dates":[{"date":"2026-10-08T13:52:24Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:13:09Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T12:28:11Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T00:59:09Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsUri":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","rights":"arXiv.org perpetual, non-exclusive license"}],"descriptions":[{"descriptionType":"Abstract","description":"We detail scalable methods for approximating the quadratic entropy $p^T d p$ for arbitrary distributions $p$ and common distances $d$ of negative type. We focus on the Euclidean and spherical geodesic cases, which both use random feature embeddings and projections to dramatically improve computational complexity within a simple framework. Amortization of a single large matrix multiplication and control variates further enable computation at large scale with low memory and runtime in situations where $d$ is held constant while $p$ varies. We demonstrate this with a comparison against direct pair sampling and bibliometric/scientometric examples on Open Graph Benchmark datasets, revealing papers, fields, and institutions with both particularly narrow and broad interdisciplinary reach from their citations and text features alone."},{"descriptionType":"Other","description":"Code for reproducing results in LaTeX comments; removed submission checklist from v1"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.11976","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T02:59:28Z","registered":"2026-10-09T02:59:29Z","published":null,"updated":"2026-10-12T02:58:50Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.11948","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.11948","identifiers":[{"identifier":"2610.11948","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Shuoyang","familyName":"Sun","name":"Sun, Shuoyang","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Kerui","familyName":"Gu","name":"Gu, Kerui","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Hao","familyName":"Fang","name":"Fang, Hao","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Shaoli","familyName":"Huang","name":"Huang, Shaoli","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Bin","familyName":"Chen","name":"Chen, Bin","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"When History Helps and Hurts: Selective History Use across Multimodal Turns"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Computation and Language (cs.CL)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T13:36:12Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:12:03Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T06:36:40Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T00:34:03Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsUri":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","rights":"arXiv.org perpetual, non-exclusive license"}],"descriptions":[{"descriptionType":"Abstract","description":"Reliable multimodal interaction depends on selective use of conversational history: an earlier question may remain relevant while its previous answer is outdated, whereas a current request may depend on historical evidence despite conflicting new observations. Existing multi-turn evaluations rarely separate these history-use demands from underlying question difficulty. To address this gap, we introduce ReTurn, a benchmark of 7,000 base tasks spanning visual and audio evidence for evaluating selective history use. For task-carrying history, Reconfirm/Reground require applying a historical question to current media while varying historical agreement; for evidence-carrying history, Retrieve/Rebind require answering a current question using historical media while varying current-media competition. Each pair preserves the target question, media, and answer. Tasks support open-ended and multiple-choice evaluation, with matched single-turn counterparts serving as answerability references. Across 13 omni-modal, vision-language, and audio-language models, median model-level open-ended accuracy falls from 93.7% with direct input to 72.3% in conversation. Behavioral probes show that high question recall can coexist with weaker task application, while competing media can redirect answers away from historical targets. Supervised adaptation yields only partial gains. ReTurn provides a controlled framework for assessing whether multimodal models select and use the historical information required by each request."}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.11948","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T02:58:52Z","registered":"2026-10-09T02:58:52Z","published":null,"updated":"2026-10-12T02:58:49Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.11947","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.11947","identifiers":[{"identifier":"2610.11947","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Gaetano","familyName":"Tedesco","name":"Tedesco, Gaetano","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Alex","familyName":"Markham","name":"Markham, Alex","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Score-Based Learning of Cluster DAGs from Interventions"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Machine Learning (stat.ML)","lang":"en","subjectScheme":"arXiv"},{"subject":"Machine Learning (cs.LG)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T13:35:04Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T10:43:08Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"1","rightsList":[{"rightsIdentifierScheme":"SPDX","rightsUri":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","schemeUri":"https://spdx.org/licenses/","rights":"Creative Commons Attribution Non Commercial Share Alike 4.0 International","rightsIdentifier":"cc-by-nc-sa-4.0"}],"descriptions":[{"descriptionType":"Abstract","description":"Graphical approaches to causal abstraction transform a low-level causal directed acyclic graph (DAG) over many measured variables into a smaller, high-level DAG whose nodes cluster the original variables and whose edges summarize the causal relations between clusters. Such cluster DAGs are easier to interpret, but learning them requires finding the clusters and recovering the edges between them. Madaleno et al. (2026) learn the interventional coarsening (the cluster DAG that merges variables the interventions cannot distinguish) in two constraint-based phases: first the clusters, then the edges. We introduce COARSE, the first score-based method for this task: it keeps the two-phase structure but, under linear Gaussian assumptions, swaps the constraint-based edge phase for a score-based one. We show that the interventions themselves identify a causal order over the clusters, and learning the edges reduces to a single local search per cluster under a cluster-level BIC score. We prove that the procedure runs in polynomial time and, provided the variables affected by each intervention are correctly identified, that it is consistent. On synthetic and real-world interventional data, COARSE matches state-of-the-art edge recovery given enough samples, with an edge phase up to two orders of magnitude faster, including on dense graphs with hundreds of nodes."}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.11947","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T02:58:50Z","registered":"2026-10-09T02:58:51Z","published":null,"updated":"2026-10-12T02:58:48Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.11832","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.11832","identifiers":[{"identifier":"2610.11832","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Ashwin","familyName":"Aravindaraj","name":"Aravindaraj, Ashwin","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Hui","familyName":"Zhu","name":"Zhu, Hui","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Adrien","familyName":"Picquenot","name":"Picquenot, Adrien","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Hsiang-Kuang","familyName":"Chang","name":"Chang, Hsiang-Kuang","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Investigating the nature of magnetic turbulence in Tycho's SNR using X-ray observation"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"High Energy Astrophysical Phenomena (astro-ph.HE)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Physical sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T12:27:34Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:06:11Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T04:14:58Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T00:28:28Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsUri":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","rights":"arXiv.org perpetual, non-exclusive license"}],"descriptions":[{"descriptionType":"Abstract","description":"Supernova remnants (SNRs) are widely regarded as the primary sources of Galactic cosmic ray acceleration and the particles are energized at the shock front of SNRs through the diffusive shock acceleration (DSA) mechanism, gaining energy by repeatedly crossing the shock. Magnetic turbulence plays a crucial role in scattering these particles back and forth, making the investigation of turbulence essential to understanding the acceleration process. In this study, we apply the two-point correlation method to derive the magnetic energy spectrum from the non-thermal X-ray flux image of Tycho's SNR. This image was obtained using Poissonian-based Generalized Morphological Component Analysis (pGMCA). The turbulence length scale observed in the resulting spectrum is shorter than the turbulence scale derived from previous studies of radio observations of Tycho's SNR. Additionally, we use the X-ray rim thickness measured across Tycho which is an indicator of magnetic field strength to estimate the magnetic energy spectrum. The turbulence scale inferred from this method is consistent with that obtained from the non-thermal X-ray flux analysis."},{"descriptionType":"Other","description":"Accepted for publication in MNRAS"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.11832","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T02:56:21Z","registered":"2026-10-09T02:56:21Z","published":null,"updated":"2026-10-12T02:58:47Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.11866","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.11866","identifiers":[{"identifier":"2610.11866","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Itsushi","familyName":"Sakata","name":"Sakata, Itsushi","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Yuta","familyName":"Miyauchi","name":"Miyauchi, Yuta","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Yoshinobu","familyName":"Kawahara","name":"Kawahara, Yoshinobu","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Understanding Latent-Dimension Scaling in Dynamical-System Learning through Spectral Reliability"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Machine Learning (cs.LG)","lang":"en","subjectScheme":"arXiv"},{"subject":"Dynamical Systems (math.DS)","lang":"en","subjectScheme":"arXiv"},{"subject":"Chaotic Dynamics (nlin.CD)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"FOS: Mathematics","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"FOS: Physical sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T12:42:27Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T11:32:47Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"1","rightsList":[{"rightsUri":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","rights":"arXiv.org perpetual, non-exclusive license"}],"descriptions":[{"descriptionType":"Abstract","description":"In deep learning, approximation theory motivates increasing representation size. We ask whether this benefit extends to dynamics learning through autoregressive prediction. We analyze the learned time evolution through the eigenstructure of Koopman operators, using relative residuals to detect spurious eigenpairs arising even as one-step error falls. For bounded Koopman operators, we show that minimal residuals over learned dictionary spaces converge pointwise to their full-space counterparts as these spaces approximate the observable space in $L^2$. Our hypothesis is that Koopman spectral reliability helps explain how consistently rollout error decreases with increasing dimension. We compare two models of a shared Koopman autoencoder trained alternately for reconstruction and latent evolution, using latent-prediction loss (one-step prediction errors in latent coordinates) or spectral-residual loss (relative residuals of candidate eigenpairs). Across six chaotic systems, both models reduced median windowed rollout error from smallest to largest dimension. The spectral-residual model achieved lower medians than the latent-prediction model for all systems and dimensions, and its median fell by a larger factor in every system. Its median decreased monotonically with dimension in four systems, against one for latent prediction. Against four baseline families, its mean valid prediction times were nearly always longer. At the largest dimension under two-stage training, we compared eigenvalue positions with each learned dictionary's residual contours. Spectral-residual eigenvalues concentrated in low-residual regions, whereas latent-prediction eigenvalues also appeared in high-residual regions, consistent with the hypothesis."}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.11866","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T02:57:05Z","registered":"2026-10-09T02:57:06Z","published":null,"updated":"2026-10-12T02:58:47Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.11759","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.11759","identifiers":[{"identifier":"2610.11759","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Hoong Chuin","familyName":"Lau","name":"Lau, Hoong Chuin","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Beyond QAOA: A Review of AI and Quantum Computing for Adaptive Combinatorial Optimization"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Quantum Physics (quant-ph)","lang":"en","subjectScheme":"arXiv"},{"subject":"Machine Learning (cs.LG)","lang":"en","subjectScheme":"arXiv"},{"subject":"Optimization and Control (math.OC)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Physical sciences","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"FOS: Mathematics","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"F.2.2; I.2.6; G.1.6","lang":"en","subjectScheme":"ACM"},{"subject":"81P68 (quantum computation), 90C27 (combinatorial optimization), 68T05 (learning)","lang":"en","subjectScheme":"MSC"}],"contributors":[],"dates":[{"date":"2026-10-08T11:44:46Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:02:47Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T12:10:30Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T00:57:23Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsIdentifierScheme":"SPDX","rightsUri":"https://creativecommons.org/licenses/by/4.0/legalcode","schemeUri":"https://spdx.org/licenses/","rights":"Creative Commons Attribution 4.0 International","rightsIdentifier":"cc-by-4.0"}],"descriptions":[{"descriptionType":"Abstract","description":"Near-term quantum approaches to combinatorial optimization are limited by qubit counts, circuit fidelity, sampling cost, and the difficulty of encoding constraints, while machine learning is increasingly used to configure and control quantum optimization workflows. We call such workflows adaptive: decisions conventionally fixed in advance, from formulation and penalties to shot budgets, backends, and whether to invoke a quantum processor at all, are made by learned policies that respond to the instance, the progress of the solve, or the hardware. This review examines three paradigms, AI for quantum optimization, quantum for AI-driven optimization, and AI-quantum co-optimization, and organizes the literature by the decision being learned rather than by application. A structured search identified a 119-paper corpus, of which 67 papers form an evidence core coded in detail. The evidence is considerably stronger for AI-assisted quantum optimization than for the reverse direction: learning already reduces quantum evaluations, improves initialization, supports decomposition and penalty control, and mitigates noise, whereas evidence that quantum computation improves learned optimizers remains largely confined to small-scale simulation. Experimental controls are thin: of 52 studies in the three paradigms, 22 include no classical baseline, the quantum contribution is fully isolated in 10 of 24 where an ablation applies, and the median largest experiment uses 16 qubits. We introduce an M0-M5 evidence hierarchy, from simulation to practical quantum advantage, and find no broadly convincing result at the highest level. We argue that scaling is increasingly a systems problem: the question is not only whether a problem fits on a quantum processor, but how classical and quantum resources should be allocated across the optimization process."},{"descriptionType":"Other","description":"36 pages, 5 figures, 7 tables; supplementary evidence matrix included as ancillary file. v2: clarified terminologies, co-optimization definition and evidence denominators; added references, minor corrections"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.11759","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T02:54:45Z","registered":"2026-10-09T02:54:45Z","published":null,"updated":"2026-10-12T02:58:46Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.11723","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.11723","identifiers":[{"identifier":"2610.11723","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Zhangbo","familyName":"Xu","name":"Xu, Zhangbo","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Ruoxi","familyName":"Zhang","name":"Zhang, Ruoxi","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Rui","familyName":"Hu","name":"Hu, Rui","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Yisong","familyName":"Wang","name":"Wang, Yisong","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Xitong","familyName":"Li","name":"Li, Xitong","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"MultiWorldBench: Do Independently Controlled Views Describe One Shared World?"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Artificial Intelligence (cs.AI)","lang":"en","subjectScheme":"arXiv"},{"subject":"Computer Vision and Pattern Recognition (cs.CV)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T11:24:34Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T01:00:46Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T07:31:21Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T00:37:14Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsUri":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","rights":"arXiv.org perpetual, non-exclusive license"}],"descriptions":[{"descriptionType":"Abstract","description":"Multiplayer world models must ensure that independently controlled views remain consistent with one shared and persistent world. We introduce MultiWorldBench, a diagnostic Minecraft benchmark containing 495 case configurations across seven task suites and ten capabilities, including independent control, cross-view motion, shared-state synchronization, persistence, structural reasoning, concurrent interaction, and delayed revisit. We evaluate Solaris, Gamma-World, and MineWorld, using Engine GT as a reference. Gamma-World achieves the highest ten-capability average among the generated systems at 21.39, followed by Solaris at 20.88 and MineWorld at 1.89, while Engine GT reaches 91.69. Gamma-World performs better on several control, shared-state, and revisit capabilities, whereas Solaris leads in cross-view motion and race-condition consistency. Nevertheless, all generated systems score at most 8.00 on state persistence and 1.33 on structural consistency, and none succeeds in spatial reasoning or building-identity preservation. Human preferences produce the same overall ranking and show strong alignment with the automatic evaluation, with a mean dimension-level Spearman correlation of 0.96. These results show that plausible individual views do not yet constitute a coherent multiplayer world."},{"descriptionType":"Other","description":"31 pages, 17 figures, 3 tables"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.11723","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T02:53:58Z","registered":"2026-10-09T02:53:58Z","published":null,"updated":"2026-10-12T02:58:45Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.11614","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.11614","identifiers":[{"identifier":"2610.11614","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Chandra","familyName":"Nair","name":"Nair, Chandra","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Aref","familyName":"Namayandeh","name":"Namayandeh, Aref","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Zhaobang","familyName":"Zhu","name":"Zhu, Zhaobang","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"From an entropic inequality for sums in abelian groups to the theorems of Ruzsa and Plünnecke"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Information Theory (cs.IT)","lang":"en","subjectScheme":"arXiv"},{"subject":"Combinatorics (math.CO)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Computer and information sciences","subjectScheme":"Fields of Science and Technology (FOS)"},{"subject":"FOS: Mathematics","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T09:55:23Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-12T00:27:37Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"1","rightsList":[{"rightsUri":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","rights":"arXiv.org perpetual, non-exclusive license"}],"descriptions":[{"descriptionType":"Abstract","description":"We give a direct information-theoretic proof of the Plünnecke--Ruzsa inequalities for finite subsets of abelian groups. The argument rests on an elementary coupling inequality proved by maximizing joint entropy, without tensor powers or asymptotic constructions. It also yields Ruzsa's sumset triangle inequality and an extension to non-abelian groups."},{"descriptionType":"Other","description":"12 pages"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.11614","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T02:51:35Z","registered":"2026-10-09T02:51:35Z","published":null,"updated":"2026-10-12T02:58:44Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.11676","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.11676","identifiers":[{"identifier":"2610.11676","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Shijin","familyName":"Deng","name":"Deng, Shijin","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Xiaochun","familyName":"Yang","name":"Yang, Xiaochun","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Pointwise Structures and Background Perturbation Analyses for Thermal Non-equilibrium Irrotational Flows in Three Space Dimensions"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"Analysis of PDEs (math.AP)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Mathematics","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T10:51:44Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-09T00:58:19Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10-09T05:35:40Z","dateType":"Submitted","dateInformation":"v2"},{"date":"2026-10-12T00:31:43Z","dateType":"Updated","dateInformation":"v2"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[],"relatedItems":[],"sizes":[],"formats":[],"version":"2","rightsList":[{"rightsUri":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","rights":"arXiv.org perpetual, non-exclusive license"}],"descriptions":[{"descriptionType":"Abstract","description":"In this paper, both the pointwise space-time structures of the solution for a three-dimensional model describing gas dynamics in thermal non-equilibrium and the corresponding background stabilities within the $L^p$ framework are investigated under the small initial perturbation assumption and the irrotationality condition. Our main tools are the modified Green's function according to the irrotationality condition, a priori energy method and a refined decay estimates of products composed of the entropy function and high-order derivatives."},{"descriptionType":"Other","description":"62 pages"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.11676","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T02:52:56Z","registered":"2026-10-09T02:52:57Z","published":null,"updated":"2026-10-12T02:58:44Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}},{"id":"10.48550/arxiv.2610.11606","type":"dois","attributes":{"doi":"10.48550/arxiv.2610.11606","identifiers":[{"identifier":"2610.11606","identifierType":"arXiv"}],"creators":[{"nameType":"Personal","givenName":"Rami Z. E.","familyName":"Alsaberi","name":"Alsaberi, Rami Z. E.","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Zachary J.","familyName":"Smeaton","name":"Smeaton, Zachary J.","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Miroslav D.","familyName":"Filipovic","name":"Filipovic, Miroslav D.","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Roland","familyName":"Kothes","name":"Kothes, Roland","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Hidetoshi","familyName":"Sano","name":"Sano, Hidetoshi","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Ahmed H.","familyName":"Abdullah","name":"Abdullah, Ahmed H.","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Dejan","familyName":"Urovsevic","name":"Urovsevic, Dejan","affiliation":[],"nameIdentifiers":[]},{"nameType":"Personal","givenName":"Sanja","familyName":"Lazarevic","name":"Lazarevic, Sanja","affiliation":[],"nameIdentifiers":[]}],"titles":[{"title":"Radio Continuum Study of One of the Brightest Large Magellanic Cloud Supernova Remnants N 132D"}],"publisher":"arXiv","container":{},"publicationYear":2026,"subjects":[{"subject":"High Energy Astrophysical Phenomena (astro-ph.HE)","lang":"en","subjectScheme":"arXiv"},{"subject":"FOS: Physical sciences","subjectScheme":"Fields of Science and Technology (FOS)"}],"contributors":[],"dates":[{"date":"2026-10-08T09:50:40Z","dateType":"Submitted","dateInformation":"v1"},{"date":"2026-10-12T00:36:37Z","dateType":"Updated","dateInformation":"v1"},{"date":"2026-10","dateType":"Available","dateInformation":"v1"}],"language":null,"types":{"schemaOrg":"CreativeWork","resourceTypeGeneral":"Preprint","citeproc":"article","bibtex":"misc","ris":"GEN","resourceType":"Article"},"relatedIdentifiers":[{"relationType":"IsVersionOf","relatedIdentifier":"10.33232/001c.172272","relatedIdentifierType":"DOI"}],"relatedItems":[],"sizes":[],"formats":[],"version":"1","rightsList":[{"rightsIdentifierScheme":"SPDX","rightsUri":"https://creativecommons.org/licenses/by/4.0/legalcode","schemeUri":"https://spdx.org/licenses/","rights":"Creative Commons Attribution 4.0 International","rightsIdentifier":"cc-by-4.0"}],"descriptions":[{"descriptionType":"Abstract","description":"We present a new radio continuum study of the Large Magellanic Cloud supernova remnant N 132D using observations from the Australia Telescope Compact Array (ATCA) and MeerKAT. The radio morphology shows a clear spatial correlation with the X-ray emission in the central and left regions of the remnant, as well as in the right portion of the shell, indicating a close connection between the thermal and non-thermal plasma components. Polarisation measurements reveal predominantly radial magnetic fields, with mean fractional polarisations of 1.2 per cent, 3.0 per cent, and 4.0 per cent at 2100, 5500, and 9000 MHz, respectively. There is also a complex structure in the Faraday Depth spectrum, showing a double-peaked profile that indicates regions with differing magnetisation properties or varying magnetic field geometry. The rotation measure derived from ATCA data has an average value of ~2 rad m^-2, with a maximum of ~338 rad m^-2. We estimate a constant partition magnetic field of ~90 microG and a minimum energy of 3 x 10^50 erg, which is in a constant partition between the energy density of electrons and the energy density of the magnetic field. The integrated radio spectrum follows a power law with a spectral index of -0.74 +- 0.01. These results provide new constraints on the magnetic field structure and energetic properties of N 132D and offer insight into particle acceleration and shock evolution in young supernova remnants."},{"descriptionType":"Other","description":"Published in the Open Journal of Astrophysics"}],"geoLocations":[],"fundingReferences":[],"url":"https://arxiv.org/abs/2610.11606","contentUrl":null,"metadataVersion":1,"schemaVersion":"http://datacite.org/schema/kernel-4","source":"mds","isActive":true,"state":"findable","reason":null,"viewCount":0,"downloadCount":0,"referenceCount":0,"citationCount":0,"partCount":0,"partOfCount":0,"versionCount":0,"versionOfCount":0,"created":"2026-10-09T02:51:24Z","registered":"2026-10-09T02:51:25Z","published":null,"updated":"2026-10-12T02:58:43Z"},"relationships":{"client":{"data":{"id":"arxiv.content","type":"clients"}}}}],"meta":{"total":3204188,"totalPages":400,"page":1},"links":{"self":"https://api.datacite.org/dois?prefix=10.48550","next":"https://api.datacite.org/dois?page%5Bnumber%5D=2\u0026page%5Bsize%5D=25\u0026prefix=10.48550"}}