# class

Published articles for class.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Beyond 4: Improved Competitive Traveling Repairperson

DevFeed: [Beyond 4: Improved Competitive Traveling Repairperson](<https://devfeed.tech/articles/beyond-4-improved-competitive-traveling-repairperson-146120.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.21943>)

Author: Bibek Maharjan, Gokarna Sharma

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [Combinatorial optimization](<https://devfeed.tech/topics/combinatorial-optimization.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [class](<https://devfeed.tech/tags/class.md>), [computer-science](<https://devfeed.tech/tags/computer-science.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [cs-dm](<https://devfeed.tech/tags/cs-dm.md>), [cs-ds](<https://devfeed.tech/tags/cs-ds.md>), [cs-ma](<https://devfeed.tech/tags/cs-ma.md>), [data-structures-and-algorithms](<https://devfeed.tech/tags/data-structures-and-algorithms.md>), [metric](<https://devfeed.tech/tags/metric.md>), [online](<https://devfeed.tech/tags/online.md>), [problems](<https://devfeed.tech/tags/problems.md>), [ratio](<https://devfeed.tech/tags/ratio.md>), [residual](<https://devfeed.tech/tags/residual.md>), [state](<https://devfeed.tech/tags/state.md>), [zero](<https://devfeed.tech/tags/zero.md>)

### AI overview

For the online traveling repairperson problem on arbitrary metrics, the paper reports a deterministic algorithm with competitive ratio 3.877, improving on the stated 4-competitive state of the art. For zero-residual instances, it reports a ratio of 3+ε for every ε>0. The abstract also says these results extend to some variants of online dial-a-ride; it does not specify which variants or give further algorithmic details.

### Source excerpt

arXiv:2611.21943v1 Announce Type: cross Abstract: With $k\geq 1$ repairpersons starting initially from a depot, we present a 3.877-competitive deterministic algorithm for the fundamental online traveling repairperson problem on an arbitrary metric. For the special class of zero-residual instances, we improve the ratio to $3+\epsilon$ for every $\epsilon>0$. We also extend these results to some variants of the related so-called online dial-a-ride problem. The state-of-the-art is the 4-competitive deterministic algorithm for both problems.

## MambaLIFT: Reference-Based Mechanism-Aware Attribution for VMamba

DevFeed: [MambaLIFT: Reference-Based Mechanism-Aware Attribution for VMamba](<https://devfeed.tech/articles/mambalift-reference-based-mechanism-aware-attribution-for-vmamba-145559.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25644>)

Author: Jintu Kakati, Niladri B. Puhan

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Mamba](<https://devfeed.tech/topics/mamba.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [attribution](<https://devfeed.tech/tags/attribution.md>), [based](<https://devfeed.tech/tags/based.md>), [block](<https://devfeed.tech/tags/block.md>), [c](<https://devfeed.tech/tags/c.md>), [class](<https://devfeed.tech/tags/class.md>), [composition](<https://devfeed.tech/tags/composition.md>), [contributions](<https://devfeed.tech/tags/contributions.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [difference](<https://devfeed.tech/tags/difference.md>), [eess-iv](<https://devfeed.tech/tags/eess-iv.md>), [effects](<https://devfeed.tech/tags/effects.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [f](<https://devfeed.tech/tags/f.md>), [faithfulness](<https://devfeed.tech/tags/faithfulness.md>), [feature](<https://devfeed.tech/tags/feature.md>), [feature-selection](<https://devfeed.tech/tags/feature-selection.md>), [floating-point](<https://devfeed.tech/tags/floating-point.md>), [mechanism](<https://devfeed.tech/tags/mechanism.md>), [reference](<https://devfeed.tech/tags/reference.md>)

### AI overview

MambaLIFT is a reference-based attribution method for VMamba that traces contributions through selective-scan injection, recurrent memory, LayerNorm, and shared pathways. It decomposes the reference-relative class-logit difference by position, block, scan direction, and mechanism. On ImageNet-1K tests of VMamba-T and VMamba-B, its attributions conserve that difference to floating-point precision. With mean-colour pixel flipping, it scores significantly higher in mean faithfulness than MambaLRP on both models and leads the evaluated methods, including Integrated Gradients with matched references. With blurred replacement, it is non-inferior to MambaLRP on VMamba-T and equivalent on VMamba-B, so the reported advantage depends on the replacement protocol. The authors caution that conservation does not show additive effects under finite interventions: the decomposition does not estimate intervention effects or establish causal validity.

### Source excerpt

arXiv:2611.25644v1 Announce Type: new Abstract: Attributing predictions of visual state-space models remains challenging because input-dependent selective dynamics couple feature selection, recurrent state propagation, and shared computational pathways. We introduce MambaLIFT, a reference-based, multiplier-first attribution framework for VMamba that propagates contributions through its computational graph using interaction-aware rules for selective-scan injection, recurrent memory, LayerNorm, and shared pathways. MambaLIFT decomposes the reference-relative class-logit difference, \(f_c(x)-f_c(x^0)\), by spatial position, VSS block, scan direction, and computational mechanism. Experiments on ImageNet-1K evaluate VMamba-T and VMamba-B, with hyperparameters selected on a calibration set and faithfulness assessed on a disjoint held-out evaluation set. MambaLIFT achieves numerical conservation to floating-point precision across audited attribution interfaces in both configurations. Under mean-colour pixel flipping, it achieves significantly higher mean faithfulness scores than MambaLRP on both configurations and the highest scores among the evaluated methods, including Integrated Gradients with matched references. Under blurred replacement, MambaLIFT is non-inferior to MambaLRP on VMamba-T and equivalent on VMamba-B, indicating that its advantage depends on the replacement protocol. Ablations on VMamba-T show that interaction allocation, temporal propagation, and pathway composition affect attribution maps. Mechanism-level analyses further show that exact relevance conservation does not imply additive effects under finite interventions: the mechanism decomposition accounts for the reference-relative logit difference but does not estimate intervention effects or establish causal validity.

## LLM GerryMandering: Separating Interactions from Additive Effects in LLM Audits

DevFeed: [LLM GerryMandering: Separating Interactions from Additive Effects in LLM Audits](<https://devfeed.tech/articles/llm-gerrymandering-separating-interactions-from-additive-effects-in-llm-audits-145681.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.26538>)

Author: George Rahul, Ronit Jahilal, Bhaskara Hanuma Vedula, Ponnurangam Kumaraguru, Pushkar Shukla

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Large Language Model](<https://devfeed.tech/topics/llm.md>), [audit](<https://devfeed.tech/topics/audit.md>), [AI Chat](<https://devfeed.tech/topics/ai-chat.md>)

Tags: [arxiv](<https://devfeed.tech/tags/arxiv.md>), [audit](<https://devfeed.tech/tags/audit.md>), [auditing](<https://devfeed.tech/tags/auditing.md>), [audits](<https://devfeed.tech/tags/audits.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [bias](<https://devfeed.tech/tags/bias.md>), [challenge](<https://devfeed.tech/tags/challenge.md>), [class](<https://devfeed.tech/tags/class.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [data](<https://devfeed.tech/tags/data.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [effects](<https://devfeed.tech/tags/effects.md>), [gender](<https://devfeed.tech/tags/gender.md>), [gerrymandering](<https://devfeed.tech/tags/gerrymandering.md>), [identity](<https://devfeed.tech/tags/identity.md>), [independent](<https://devfeed.tech/tags/independent.md>), [indian](<https://devfeed.tech/tags/indian.md>), [interaction](<https://devfeed.tech/tags/interaction.md>), [language](<https://devfeed.tech/tags/language.md>), [llm](<https://devfeed.tech/tags/llm.md>)

### AI overview

The standard subgroup criterion can label independent attribute effects as intersectional bias. Across 150 synthetic datasets with no interactions, it produced 66.1 false subgroup flags per dataset on average; a repaired version recovered 32% of planted interactions. ADDIS fits an additive model across attributes, measures each subgroup's Additive Residual Distance from its prediction, and tests it with a Freedman-Lane null. On the same benchmark it averaged 0.09 false flags per dataset and recovered 84% of planted interactions. In audits of 13 open language models using 10,000 synthetic Indian personas, the standard criterion flagged 7.1% of 738 tested subgroups on average, compared with 3.0% for ADDIS. Gender identity crossed with sexual orientation was the largest pairing in every model. Counterfactual personas also revealed a caste-class interaction in all but one model, which the observational test lacked data to detect.

### Source excerpt

arXiv:2611.26538v1 Announce Type: new Abstract: Intersectional bias arises when a model treats people who hold several marginalised identities at once differently from what their separate identities would predict. Auditing such intersectional subgroups remains a challenge: their number grows quadratically, and there is no agreed baseline for what independent attributes would predict. Without such a baseline, many existing audits flag a subgroup when it exceeds each attribute alone, a condition that attributes acting independently already satisfy. We test this standard criterion on 150 synthetic datasets built with no interaction. With the shuffle null, it flags 66.1 false subgroups per dataset on average, and at least one in every dataset. When we plant interactions of known size into these datasets, a repaired null lets the criterion recover only 32% of them. We introduce ADDIS (Additive Intersectional Screen), which fits an additive model over all attributes, scores each subgroup by its Additive Residual Distance (ARD) from that model's prediction, and tests it against a Freedman-Lane null. On our synthetic benchmark, ADDIS flags 0.09 false subgroups per dataset and recovers 84% of the same planted interactions. We then build IndiPersona, 10,000 synthetic Indian personas with six identity attributes, and audit 13 open language models. The standard criterion flags 7.1% of the 738 tested subgroups on average; ADDIS flags 3.0%. Gender identity crossed with sexual orientation is the largest pairing in every model, and counterfactual personas confirm it and additionally reveal a caste x class interaction in all but one model that the observational test lacked the data to detect. Much of what audits report as intersectional bias can thus arise from independent single-attribute effects alone, yet a small core of interactions survives.

## Long-Range Video Presentation Attack Detection: A Three-Class Benchmark Across 1-100 m and Two Sensor Types

DevFeed: [Long-Range Video Presentation Attack Detection: A Three-Class Benchmark Across 1-100 m and Two Sensor Types](<https://devfeed.tech/articles/long-range-video-presentation-attack-detection-a-three-class-benchmark-across-1-100-m-and-two-sensor-types-145009.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25108>)

Author: Lambert Igene, Mohammad Zahir Uddin Chowdhury, Afzal Hossain, Sandip Purnapatra, Peter Johnson, Stephanie Schuckers

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Benchmark](<https://devfeed.tech/topics/benchmark.md>), [Video Analytics](<https://devfeed.tech/topics/video-analytics.md>)

Tags: [attack](<https://devfeed.tech/tags/attack.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [class](<https://devfeed.tech/tags/class.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [detection](<https://devfeed.tech/tags/detection.md>), [efficientnet](<https://devfeed.tech/tags/efficientnet.md>), [presentation](<https://devfeed.tech/tags/presentation.md>), [range](<https://devfeed.tech/tags/range.md>), [sensor](<https://devfeed.tech/tags/sensor.md>), [video](<https://devfeed.tech/tags/video.md>)

### AI overview

The benchmark evaluates video-based presentation attack detection across 1-100 m, using 374,000+ frames from 261 identities captured indoors and outdoors with a DSLR and a mobile sensor. It labels clips as live, spoof, or props (occlusions) and compares MobileNetV3, MobileNet, EfficientNet, and ResNet-50. The DSLR maintains near-perfect spoof classification across distances, while mobile performance drops sharply beyond 50 m; MobileNetV3 classifies props at 55% at 75 m. EfficientNet reports the best overall result: 98.48% accuracy and 2.01% ACER. Tests on unseen attack datasets report 89-94% accuracy. The abstract identifies distance and sensor resolution as important difficulty factors; it says the dataset is planned for public release under an End-User License Agreement.

### Source excerpt

arXiv:2611.25108v1 Announce Type: new Abstract: Face presentation attack detection (PAD) systems deployed in border control and airport surveillance are constrained by a critical assumption: subjects are captured at close range, typically under one meter. No existing benchmark systematically addresses multi-distance capture, diverse environmental conditions, and concurrent spoofing and occlusion-based attacks, leaving deployed models underprepared for real-world scenarios. We introduce a video-based PAD dataset of 374,000+ frames from 261 unique identities collected across five standoff distances (1 m-100 m) under indoor and outdoor conditions using a DSLR camera (C) and a mobile sensor (M), with three-class labels: live, spoof, and props (occlusions); models are trained and evaluated on video clips rather than single frames. We fine-tune and benchmark four CNN architectures: MobileNetV3, MobileNet, EfficientNet, and ResNet-50. The higher-resolution DSLR maintains near-perfect spoof classification rate across all distances, while the lower-resolution mobile sensor degrades sharply beyond 50 m, with props classification rate dropping to 55% at 75 m for MobileNetV3. EfficientNet achieves the best overall performance (98.48% accuracy, ACER 2.01%). Generalization tests on unseen attack datasets yield 89-94% accuracy, validating cross-domain robustness. These results establish capture distance and sensor resolution as critical but underexplored axes of PAD difficulty. The dataset will be publicly released under an End-User License Agreement to support reproducible long-range PAD research.

## SplitReAlign: Partition-Aware Representation Realignment for Split Federated Unlearning

DevFeed: [SplitReAlign: Partition-Aware Representation Realignment for Split Federated Unlearning](<https://devfeed.tech/articles/splitrealign-partition-aware-representation-realignment-for-split-federated-unlearning-145038.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25301>)

Author: Jia Chen, Yecheng Lv, Xinrong Hu, Jun Bai

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>), [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Federated Learning](<https://devfeed.tech/topics/federated-learning.md>), [Representation learning](<https://devfeed.tech/topics/representation-learning.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [all](<https://devfeed.tech/tags/all.md>), [anchor](<https://devfeed.tech/tags/anchor.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [changes](<https://devfeed.tech/tags/changes.md>), [cifar-10](<https://devfeed.tech/tags/cifar-10.md>), [class](<https://devfeed.tech/tags/class.md>), [client](<https://devfeed.tech/tags/client.md>), [clients](<https://devfeed.tech/tags/clients.md>), [coupling](<https://devfeed.tech/tags/coupling.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [distributions](<https://devfeed.tech/tags/distributions.md>), [effectiveness](<https://devfeed.tech/tags/effectiveness.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [feature](<https://devfeed.tech/tags/feature.md>), [federated](<https://devfeed.tech/tags/federated.md>), [federated-learning](<https://devfeed.tech/tags/federated-learning.md>), [fixed](<https://devfeed.tech/tags/fixed.md>), [partition](<https://devfeed.tech/tags/partition.md>), [split](<https://devfeed.tech/tags/split.md>)

### AI overview

SplitReAlign addresses class-wise forgetting in split federated learning while aiming to preserve retained utility across heterogeneous client and server representations. It builds endpoint-specific discriminative subspaces around a shared semantic anchor, realigns forgotten representations, and penalizes changes outside those subspaces. Its update strategies reflect partition constraints: Client-only updates use gradients through frozen servers, Server-only guidance uses fixed client-feature statistics, and Joint updates optimize both partitions. On CIFAR-10 and CIFAR-100 with heterogeneous client distributions, it had the lowest average gap to retraining among compared methods across six settings; Server-only was closest to retraining on both datasets. The supplied text reports these results but does not provide numerical gaps or further experimental details.

### Source excerpt

arXiv:2611.25301v1 Announce Type: new Abstract: Split federated learning (SFL) distributes neural networks across clients and a server, coupling class-specific knowledge across their representations. This coupling complicates split federated unlearning (SFU), where class-wise forgetting must remove target knowledge while preserving retained utility under heterogeneous representation spaces and asymmetric update constraints. We propose SplitReAlign, a partition-aware representation realignment framework for class-wise SFU. It constructs endpoint-specific discriminative subspaces coordinated through a shared semantic anchor, selectively realigning forgotten representations while penalizing changes outside the active subspaces. To accommodate asymmetric update constraints, SplitReAlign leverages gradients through frozen servers for Client-only updates and fixed client-feature statistics for Server-only guidance, while Joint updates optimize both partitions. Experiments on CIFAR-10 and CIFAR-100 under heterogeneous client distributions demonstrate that SplitReAlign achieves the lowest average gap to retraining among all compared methods across six settings. Notably, Server-only achieves the closest agreement with retraining on both datasets, highlighting the effectiveness of partition-aware guidance under restricted updates.

## Introducing policy-based routing for AWS Transit Gateway

DevFeed: [Introducing policy-based routing for AWS Transit Gateway](<https://devfeed.tech/articles/introducing-policy-based-routing-for-aws-transit-gateway-144603.md>)

Original publisher: [Read original article](<https://aws.amazon.com/blogs/networking-and-content-delivery/introducing-policy-based-routing-for-aws-transit-gateway/>)

Author: Arshdeep Grover

Published: 2026-11-19T21:06:11Z

Content type: article

Language: en

Sources: [Networking & Content Delivery](<https://devfeed.tech/sources/networking-content-delivery.md>)

Topics: [Cloud Networking](<https://devfeed.tech/topics/cloud-networking.md>), [Amazon VPC](<https://devfeed.tech/topics/amazon-vpc.md>), [Amazon Web Services](<https://devfeed.tech/topics/aws.md>), [AWS Network Firewall](<https://devfeed.tech/topics/aws-network-firewall.md>), [Firewall](<https://devfeed.tech/topics/firewall.md>), [CIDR and subnets](<https://devfeed.tech/topics/cidr-and-subnets.md>), [AWS IAM](<https://devfeed.tech/topics/aws-iam.md>)

Tags: [advanced-300](<https://devfeed.tech/tags/advanced-300.md>), [announcements](<https://devfeed.tech/tags/announcements.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [aws](<https://devfeed.tech/tags/aws.md>), [aws-transit-gateway](<https://devfeed.tech/tags/aws-transit-gateway.md>), [based](<https://devfeed.tech/tags/based.md>), [cases](<https://devfeed.tech/tags/cases.md>), [class](<https://devfeed.tech/tags/class.md>), [console](<https://devfeed.tech/tags/console.md>), [gateway](<https://devfeed.tech/tags/gateway.md>), [ip](<https://devfeed.tech/tags/ip.md>), [policy](<https://devfeed.tech/tags/policy.md>), [port](<https://devfeed.tech/tags/port.md>), [post](<https://devfeed.tech/tags/post.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [reference](<https://devfeed.tech/tags/reference.md>), [reference-architecture](<https://devfeed.tech/tags/reference-architecture.md>), [route](<https://devfeed.tech/tags/route.md>), [routing](<https://devfeed.tech/tags/routing.md>), [setup](<https://devfeed.tech/tags/setup.md>), [source](<https://devfeed.tech/tags/source.md>), [transit](<https://devfeed.tech/tags/transit.md>)

### AI overview

AWS Transit Gateway policy-based routing (PBR) evaluates traffic against ordered rules matching any combination of source and destination CIDRs, protocol, and ports, then sends the first match to a target route table for normal destination-based forwarding. It supports path selection, segmentation, and selective inspection or bypass. Configure a policy table in the VPC console, add rules, and associate it with attachments; each attachment uses either a policy table or a route table. Unmatched traffic is dropped, and protocol- or port-based rules might not apply to fragmented packets. Plan matching return paths for stateful inspection. Associating a policy table with Site-to-Site VPN or Connect attachments stops BGP route advertisement; Direct Connect gateway attachments retain allowed-prefix advertisements. PBR is unavailable in AWS GovCloud (US) Regions and adds no charge beyond standard Transit Gateway pricing.

### Source excerpt

Policy-based routing (PBR) for AWS Transit Gateway matches traffic on its 5-tuple (source and destination IP, source and destination port, and protocol) and sends each class to a different route table. This post explains how PBR works and walks through a reference architecture, console setup, and three use cases.

## PHP 8.6 is released!

DevFeed: [PHP 8.6 is released!](<https://devfeed.tech/articles/php-8-6-is-released-145241.md>)

Original publisher: [Read original article](<https://laravel-news.com/php-8-6-release-day>)

Author: Eric L. Barnes

Published: 2026-11-19T15:50:06Z

Content type: release

Language: en

Sources: [Laravel](<https://devfeed.tech/sources/laravel.md>)

Topics: [PHP](<https://devfeed.tech/topics/php.md>), [Closure](<https://devfeed.tech/topics/closure.md>)

Tags: [clamp](<https://devfeed.tech/tags/clamp.md>), [class](<https://devfeed.tech/tags/class.md>), [deprecations](<https://devfeed.tech/tags/deprecations.md>), [function](<https://devfeed.tech/tags/function.md>), [news](<https://devfeed.tech/tags/news.md>), [php](<https://devfeed.tech/tags/php.md>), [php-8-6](<https://devfeed.tech/tags/php-8-6.md>), [property](<https://devfeed.tech/tags/property.md>), [readonly](<https://devfeed.tech/tags/readonly.md>)

### AI overview

PHP 8.6 adds partial function application, which returns a closure after some function arguments are supplied; a clamp() function that keeps a value within bounds by returning the nearest bound when needed; and a final readonly Time\Duration class with nanosecond precision, unit-specific factories, arithmetic, and comparisons. Readonly properties can now have default values, allowing fixed values to satisfy get-only interface properties. The excerpt also mentions changed defaults and deprecations but does not detail them, and says the release includes more features.

### Source excerpt

PHP 8.6 is out with partial function application, a clamp() function, a Duration class, JSON error locations, readonly property defaults, and new deprecations. The post PHP 8.6 is released! appeared first on Laravel News. Join the Laravel Newsletter to get Laravel articles like this directly in your inbox.

## PHP 8.6 is out, and here's what changes for your code

DevFeed: [PHP 8.6 is out, and here's what changes for your code](<https://devfeed.tech/articles/php-8-6-is-out-and-here-s-what-changes-for-your-code-143794.md>)

Original publisher: [Read original article](<https://www.helpnetsecurity.com/2026/11/19/php-8-6-released/>)

Author: Anamarija Pogorelec

Published: 2026-11-19T15:22:36Z

Content type: release

Language: en

Sources: [Help Net Security](<https://devfeed.tech/sources/help-net-security.md>)

Topics: [Release notes](<https://devfeed.tech/topics/release-notes.md>), [Exception](<https://devfeed.tech/topics/exception.md>), [ReactPHP](<https://devfeed.tech/topics/reactphp.md>)

Tags: [api](<https://devfeed.tech/tags/api.md>), [clamp](<https://devfeed.tech/tags/clamp.md>), [class](<https://devfeed.tech/tags/class.md>), [code](<https://devfeed.tech/tags/code.md>), [deprecated](<https://devfeed.tech/tags/deprecated.md>), [error](<https://devfeed.tech/tags/error.md>), [event-loop](<https://devfeed.tech/tags/event-loop.md>), [exception](<https://devfeed.tech/tags/exception.md>), [io](<https://devfeed.tech/tags/io.md>), [news](<https://devfeed.tech/tags/news.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [php](<https://devfeed.tech/tags/php.md>), [php-8-6](<https://devfeed.tech/tags/php-8-6.md>), [session](<https://devfeed.tech/tags/session.md>), [test](<https://devfeed.tech/tags/test.md>)

### AI overview

PHP 8.6 adds partial function application, `Time\Duration`, the `Io\Poll` polling API for event loops, and `clamp()`. It changes session defaults by enabling strict mode and HttpOnly cookies and setting SameSite to Lax; custom session handlers lacking `create_sid()` and `validateId()` are deprecated, so existing apps should test login flows before upgrading. File writes now report flush or close failures through `false`, and many invalid values raise `ValueError`; stream operations can also throw structured `StreamException`s. The release deprecates `mbstring` regex functions in favor of PCRE with `u`, several legacy type aliases, `spl_object_hash()`, and `return` in `finally`. Trimming functions now remove form feeds by default. Other additions include Sodium post-quantum key encapsulation and TLS 1.3 early data support.

### Source excerpt

PHP 8.6 has been released. The new version adds partial function application, a Time\Duration class, a polling API for event loops and a clamp() function. PHP 8.6 also changes defaults that existing apps could trip over. Sessions now start with session.use_strict_mode and session.cookie_httponly turned on and session.cookie_samesite set to Lax. Custom session handlers that don't implement both create_sid() and validateId() are deprecated. If your app relied on the old defaults, test your login flows before ... More -> The post PHP 8.6 is out, and here's what changes for your code appeared first on Help Net Security.

## PHP 8.6 Released With Partial Function Application, Other New Features

DevFeed: [PHP 8.6 Released With Partial Function Application, Other New Features](<https://devfeed.tech/articles/php-8-6-released-with-partial-function-application-other-new-features-143776.md>)

Original publisher: [Read original article](<https://www.phoronix.com/news/PHP-8.6-Released>)

Author: Michael Larabel

Published: 2026-11-19T15:16:52Z

Content type: release

Language: en

Sources: [Phoronix](<https://devfeed.tech/sources/phoronix.md>)

Topics: [PHP](<https://devfeed.tech/topics/php.md>), [function](<https://devfeed.tech/topics/function.md>)

Tags: [api](<https://devfeed.tech/tags/api.md>), [class](<https://devfeed.tech/tags/class.md>), [desktop-linux](<https://devfeed.tech/tags/desktop-linux.md>), [epoll](<https://devfeed.tech/tags/epoll.md>), [linux-benchmarking](<https://devfeed.tech/tags/linux-benchmarking.md>), [linux-hardware-benchmarks](<https://devfeed.tech/tags/linux-hardware-benchmarks.md>), [linux-hardware-reviews](<https://devfeed.tech/tags/linux-hardware-reviews.md>), [linux-how-to](<https://devfeed.tech/tags/linux-how-to.md>), [linux-performance](<https://devfeed.tech/tags/linux-performance.md>), [linux-server-benchmarks](<https://devfeed.tech/tags/linux-server-benchmarks.md>), [monitoring](<https://devfeed.tech/tags/monitoring.md>), [new-features](<https://devfeed.tech/tags/new-features.md>), [open-source-graphics](<https://devfeed.tech/tags/open-source-graphics.md>), [phoronix](<https://devfeed.tech/tags/phoronix.md>), [phoronix-test-suite](<https://devfeed.tech/tags/phoronix-test-suite.md>), [php](<https://devfeed.tech/tags/php.md>), [php-8-6](<https://devfeed.tech/tags/php-8-6.md>), [streams](<https://devfeed.tech/tags/streams.md>), [time-duration](<https://devfeed.tech/tags/time-duration.md>), [ubuntu-benchmarks](<https://devfeed.tech/tags/ubuntu-benchmarks.md>), [ubuntu-hardware](<https://devfeed.tech/tags/ubuntu-hardware.md>)

### AI overview

PHP 8.6 is available as PHP's annual feature release. It adds partial function applications, default values for readonly properties, clamp(), the \Time\Duration class, and the SortDirection enum. Its Polling API can monitor many streams at once, using platform-specific mechanisms such as epoll, kqueue, event ports, and WSAPoll.

### Source excerpt

Following today's PHP 8.2.36, PHP 8.3.37, PHP 8.4.28, and PHP 8.5.13 security releases to address multiple security issues, PHP 8.6.0 made its official debut today...

## PHP 8.6.0 released

DevFeed: [PHP 8.6.0 released](<https://devfeed.tech/articles/php-8-6-0-released-144153.md>)

Original publisher: [Read original article](<https://lwn.net/Articles/1108555/>)

Author: jzb

Published: 2026-11-19T14:43:09Z

Content type: release

Language: en

Sources: [LWN.net](<https://devfeed.tech/sources/lwn-net.md>)

Topics: [PHP](<https://devfeed.tech/topics/php.md>), [version](<https://devfeed.tech/topics/version.md>), [Release notes](<https://devfeed.tech/topics/release-notes.md>), [changelog](<https://devfeed.tech/topics/changelog.md>)

Tags: [api](<https://devfeed.tech/tags/api.md>), [changelog](<https://devfeed.tech/tags/changelog.md>), [changes](<https://devfeed.tech/tags/changes.md>), [clamp](<https://devfeed.tech/tags/clamp.md>), [class](<https://devfeed.tech/tags/class.md>), [enum](<https://devfeed.tech/tags/enum.md>), [features](<https://devfeed.tech/tags/features.md>), [function](<https://devfeed.tech/tags/function.md>), [new-features](<https://devfeed.tech/tags/new-features.md>), [php](<https://devfeed.tech/tags/php.md>), [php-8-6](<https://devfeed.tech/tags/php-8-6.md>), [release](<https://devfeed.tech/tags/release.md>), [time](<https://devfeed.tech/tags/time.md>), [time-duration](<https://devfeed.tech/tags/time-duration.md>), [version](<https://devfeed.tech/tags/version.md>), [what-s-new](<https://devfeed.tech/tags/what-s-new.md>)

### AI overview

PHP 8.6.0 has been released. The excerpt highlights a polling API, a new `clamp()` function, a `SortDirection` enum, and a `\Time\Duration` class. It directs readers to "What's new in 8.6" for feature details and the changelog for the full change list.

### Source excerpt

Version 8.6.0 of PHP has been released. Notable changes in this release include a polling API, a new clamp() function, a SortDirection enum, and a \Time\Duration class. See "What's new in 8.6" for more on new features, and the changelog for a full list of changes.

## Training-Free Domain Generation for One-Shot Federated Learning with Server-Side Pre-trained Diffusion Models

DevFeed: [Training-Free Domain Generation for One-Shot Federated Learning with Server-Side Pre-trained Diffusion Models](<https://devfeed.tech/articles/training-free-domain-generation-for-one-shot-federated-learning-with-server-side-pre-trained-diffusion-models-142722.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23908>)

Author: Yixuan Tong, Yuanguo Bi, Mingjian Zhi, Wenchao Xu, Yuan Wu

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [Federated Learning](<https://devfeed.tech/topics/federated-learning.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [ai-image-generator](<https://devfeed.tech/topics/ai-image-generator.md>), [stable-diffusion](<https://devfeed.tech/topics/stable-diffusion.md>), [Image](<https://devfeed.tech/topics/image.md>)

Tags: [adapter](<https://devfeed.tech/tags/adapter.md>), [class](<https://devfeed.tech/tags/class.md>), [classification](<https://devfeed.tech/tags/classification.md>), [classification-accuracy](<https://devfeed.tech/tags/classification-accuracy.md>), [client](<https://devfeed.tech/tags/client.md>), [communication](<https://devfeed.tech/tags/communication.md>), [costs](<https://devfeed.tech/tags/costs.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [data](<https://devfeed.tech/tags/data.md>), [diffusion](<https://devfeed.tech/tags/diffusion.md>), [diffusion-models](<https://devfeed.tech/tags/diffusion-models.md>), [distributions](<https://devfeed.tech/tags/distributions.md>), [domain](<https://devfeed.tech/tags/domain.md>), [domains](<https://devfeed.tech/tags/domains.md>), [encoder](<https://devfeed.tech/tags/encoder.md>), [entropy](<https://devfeed.tech/tags/entropy.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [federated-learning](<https://devfeed.tech/tags/federated-learning.md>), [framework](<https://devfeed.tech/tags/framework.md>), [generation](<https://devfeed.tech/tags/generation.md>), [guidance](<https://devfeed.tech/tags/guidance.md>)

### AI overview

FedDoG addresses heterogeneous client data in one-shot federated learning by using a server-side pre-trained diffusion model to generate domain-aligned synthetic data. Clients send compact domain representations extracted with a frozen image encoder; a pre-trained image-conditioning adapter uses them as visual guidance. The method adjusts conditioning strength based on domain concentration and filters generated samples for class consistency and predictive entropy. On three benchmarks, the authors report higher-quality synthetic images and better classification accuracy than existing OSFL baselines, alongside 99.9% less client upload and 91.5% less client computation time. These are reported experimental results; the excerpt gives no benchmark names or further evaluation details.

### Source excerpt

arXiv:2611.23908v1 Announce Type: new Abstract: One-shot federated learning (OSFL) has attracted increasing attention for its ability to substantially reduce communication overhead by limiting client-server interaction to a single communication round. Nevertheless, this limited interaction makes learning from heterogeneous client distributions challenging. Diffusion-based OSFL approaches seek to address this challenge by synthesizing data that approximate client distributions. However, existing diffusion-based approaches often impose substantial computational costs on clients and lack effective visual guidance to generate data aligned with client distributions. To address these limitations, we propose FedDoG, a training-free Domain Generation framework that leverages server-side pre-trained diffusion models to synthesize data aligned with client domains. FedDoG extracts compact domain representations using a frozen image encoder, substantially reducing client-side computational and communication costs. These representations are incorporated into the diffusion model through a pre-trained image-conditioning adapter, thereby providing explicit visual guidance for domain generation. To further improve the quality of synthetic data, FedDoG adapts the strength of visual conditioning according to domain concentration and filters generated samples based on class consistency and predictive entropy. Experiments on three benchmarks demonstrate that FedDoG generates higher-quality synthetic images and outperforms existing OSFL baselines in classification accuracy. Meanwhile, FedDoG reduces client upload and computation time by 99.9% and 91.5%, respectively. The code is available at https://github.com/YXTong17/FedDoG.

## PIVOT: Distribution-Preserving Multi-BitWatermarking with Minimax-Optimal Scoring

DevFeed: [PIVOT: Distribution-Preserving Multi-BitWatermarking with Minimax-Optimal Scoring](<https://devfeed.tech/articles/pivot-distribution-preserving-multi-bitwatermarking-with-minimax-optimal-scoring-143142.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.24109>)

Author: Wen Zhang, Kaiyi Pang, Minhao Bai, Shuyu Gan, Liping Zhu

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [watermarking](<https://devfeed.tech/topics/watermarking.md>), [LLM security](<https://devfeed.tech/topics/llm-security.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [attribution](<https://devfeed.tech/tags/attribution.md>), [based](<https://devfeed.tech/tags/based.md>), [class](<https://devfeed.tech/tags/class.md>), [content](<https://devfeed.tech/tags/content.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [decoding](<https://devfeed.tech/tags/decoding.md>), [detection](<https://devfeed.tech/tags/detection.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [effectiveness](<https://devfeed.tech/tags/effectiveness.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [free](<https://devfeed.tech/tags/free.md>), [generated-content](<https://devfeed.tech/tags/generated-content.md>), [generation](<https://devfeed.tech/tags/generation.md>), [generator](<https://devfeed.tech/tags/generator.md>), [guarantees](<https://devfeed.tech/tags/guarantees.md>), [hypothesis](<https://devfeed.tech/tags/hypothesis.md>), [hypothesis-testing](<https://devfeed.tech/tags/hypothesis-testing.md>), [minimax](<https://devfeed.tech/tags/minimax.md>), [stat-ap](<https://devfeed.tech/tags/stat-ap.md>), [with](<https://devfeed.tech/tags/with.md>)

### AI overview

PIVOT embeds recoverable message bits while preserving each next-token probability exactly. At each generation step, a keyed pseudorandom scalar and secret vocabulary permutation determine whether probability intervals are ordered by secret rank in forward or reverse order. This creates an opposite-signed dependence between the scalar and sampled token rank for the two bit values. A pivotal rank statistic has a null distribution independent of the unknown next-token law, enabling model-free calibration and decoding. The authors frame detection and recovery as multiple-hypothesis testing, derive a moment-robust minimax-optimal score over a relaxed moment class, and establish finite-sample recovery guarantees. Experiments on two representative language models report reliable detection and recovery while preserving the output distribution.

### Source excerpt

arXiv:2611.24109v1 Announce Type: new Abstract: As LLM-generated content becomes increasingly widespread, reliable attribution calls for multi-bit watermarks that embed recoverable messages without distorting the output distribution. We introduce PIVOT, a multi-bit watermark with model-free verification based on mirrored rank-interval sampling. At each generation step, PIVOT uses a keyed pseudorandom scalar and a secret permutation of the vocabulary. The message bit determines whether next-token probability intervals are arranged in forward or reverse secret-rank order. Sampling from these mirrored layouts preserves every token probability exactly while inducing an opposite-signed dependence between the scalar and the sampled token's secret rank. This dependence yields a pivotal rank statistic whose null distribution is invariant to the unknown next-token law, enabling model-free calibration and decoding. We formulate joint watermark detection and message recovery as a multiple-hypothesis testing problem, derive a moment-robust minimax-optimal detection score over a relaxed moment class, and establish finite-sample recovery guarantees. Extensive experiments on two representative large language models validate the effectiveness of PIVOT, demonstrating reliable watermark detection and message recovery while preserving the generator's output distribution.

## GRAFT: Graph-Regularized Prototype Fields for Realistic Test-Time Adaptation of VLMs

DevFeed: [GRAFT: Graph-Regularized Prototype Fields for Realistic Test-Time Adaptation of VLMs](<https://devfeed.tech/articles/graft-graph-regularized-prototype-fields-for-realistic-test-time-adaptation-of-vlms-143408.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23591>)

Author: Maxx Richard Rahman, Wolfgang Maass

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [vlm](<https://devfeed.tech/topics/vlm.md>), [few-shot](<https://devfeed.tech/topics/few-shot.md>)

Tags: [anchor](<https://devfeed.tech/tags/anchor.md>), [bayes](<https://devfeed.tech/tags/bayes.md>), [class](<https://devfeed.tech/tags/class.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [features](<https://devfeed.tech/tags/features.md>), [fields](<https://devfeed.tech/tags/fields.md>), [gradient](<https://devfeed.tech/tags/gradient.md>), [graph](<https://devfeed.tech/tags/graph.md>), [inference](<https://devfeed.tech/tags/inference.md>), [markov](<https://devfeed.tech/tags/markov.md>), [model](<https://devfeed.tech/tags/model.md>), [online](<https://devfeed.tech/tags/online.md>), [protocols](<https://devfeed.tech/tags/protocols.md>), [prototype](<https://devfeed.tech/tags/prototype.md>), [prototypes](<https://devfeed.tech/tags/prototypes.md>), [semantic](<https://devfeed.tech/tags/semantic.md>), [test-time-adaptation](<https://devfeed.tech/tags/test-time-adaptation.md>), [vision-language-model](<https://devfeed.tech/tags/vision-language-model.md>), [vlms](<https://devfeed.tech/tags/vlms.md>), [zero-shot](<https://devfeed.tech/tags/zero-shot.md>)

### AI overview

GRAFT addresses cases where test-time adaptation of vision-language models underperforms zero-shot classification because batches contain few classes or online streams are correlated. It represents adapted prototypes as text anchors plus class-specific displacements, partially pooled across a semantic class graph using a Gaussian Markov random field prior, with an explicit model of class presence. Inference is closed-form and gradient-free on cached features. The prior spans anchor-only shrinkage and a single global shift; absent classes are harmonic extensions of present classes, and pooling strength can be selected by empirical Bayes. The abstract reports that GRAFT improves on zero-shot classification across realistic batch and online protocols on eleven benchmarks and four ImageNet shifts, and beats anchor-based transduction when few classes are present.

### Source excerpt

arXiv:2611.23591v1 Announce Type: cross Abstract: Unlabeled test data can improve the zero-shot classifier of a vision-language model, yet transductive and test-time adaptation methods often fall below the zero-shot baseline when only a few vocabulary classes are present in a batch or when streams are correlated. We trace this failure to a shared design: every class owns independent parameters estimated from its own samples, so absent or rare classes are left at biased text anchors or fitted to foreign samples. We propose Graph-Regularized Anchor-displacement Field Transduction (GRAFT), which models the adapted prototypes as text anchors plus a displacement field that is partially pooled over a semantic class graph through a Gaussian Markov random field prior, together with an explicit class-presence model. Inference is closed-form and gradient-free on cached features. Anchor-only shrinkage and a single global shift are the two extreme settings of the prior; absent classes are provably harmonic extensions of the present ones, and the pooling strength can be chosen by empirical Bayes. Under the realistic batch and online protocols on eleven benchmarks and four ImageNet shifts, GRAFT improves over the zero-shot model in every setting and over anchor-based transduction where few classes are present.

## Exploring Agentic Visual Analytics: A Co-Evolutionary Framework of Roles and Workflows

DevFeed: [Exploring Agentic Visual Analytics: A Co-Evolutionary Framework of Roles and Workflows](<https://devfeed.tech/articles/exploring-agentic-visual-analytics-a-co-evolutionary-framework-of-roles-and-workflows-142282.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2604.15813>)

Author: Tianqi Luo, Leixian Shen, Yuyu Luo

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [Agentic AI](<https://devfeed.tech/topics/what-is-agentic-ai.md>), [agentic workflows](<https://devfeed.tech/topics/agentic-workflows.md>), [Data visualization](<https://devfeed.tech/topics/data-visualization.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [human computer interaction](<https://devfeed.tech/topics/human-computer-interaction.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [agent](<https://devfeed.tech/tags/agent.md>), [agentic](<https://devfeed.tech/tags/agentic.md>), [agents](<https://devfeed.tech/tags/agents.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [analytics](<https://devfeed.tech/tags/analytics.md>), [analytics-pipeline](<https://devfeed.tech/tags/analytics-pipeline.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [autonomous](<https://devfeed.tech/tags/autonomous.md>), [autonomous-agents](<https://devfeed.tech/tags/autonomous-agents.md>), [autonomy](<https://devfeed.tech/tags/autonomy.md>), [based](<https://devfeed.tech/tags/based.md>), [browser](<https://devfeed.tech/tags/browser.md>), [class](<https://devfeed.tech/tags/class.md>), [context](<https://devfeed.tech/tags/context.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [data](<https://devfeed.tech/tags/data.md>), [exploring](<https://devfeed.tech/tags/exploring.md>), [framework](<https://devfeed.tech/tags/framework.md>), [roles](<https://devfeed.tech/tags/roles.md>), [workflows](<https://devfeed.tech/tags/workflows.md>)

### AI overview

The paper surveys 55 agentic visual analytics systems and proposes a framework that tracks agent autonomy alongside changing human roles, from manual operators to strategic supervisors. Its taxonomy maps four agent roles--PLANNER, CREATOR, REVIEWER, and CONTEXT MANAGER--to stages of the visual analytics workflow. The authors identify recurring trade-offs across autonomy, roles, and workflow, then offer design guidelines and future research directions. The overview is based on the supplied abstract.

### Source excerpt

arXiv:2604.15813v2 Announce Type: replace Abstract: Agentic visual analytics (VA) represents an emerging class of systems in which large language model (LLM)-driven agents autonomously plan, execute, evaluate, and iterate across the full visual analytics pipeline. By shifting users from low-level tool operations to high-level analytical goals expressed through natural language, these systems are fundamentally transforming how humans interact with data. However, the rapid proliferation of such systems in recent years has outpaced our understanding of their design landscape. Two intertwined problems remain open: how do autonomous agents reshape the traditional VA pipeline, and how must human involvement adapt as agent autonomy increases? To address these questions, this paper presents a comprehensive survey of 55 primary agentic VA systems and introduces a co-evolutionary framework. This framework is essential because it jointly analyzes the progression of agent autonomy alongside the necessary shift in human roles from manual operators to strategic supervisors. Within this framework, we define a role-workflow taxonomy that aligns four key agentic roles (PLANNER, CREATOR, REVIEWER, and CONTEXT MANAGER) and maps them onto established VA pipeline stages. Our analysis uncovers recurring trade-offs along three foundational axes: autonomy levels, agentic roles, and the VA workflow. We consolidate these findings into actionable design guidelines and outline future research directions for agentic visual analytics. A web-based interactive browser of our co-evolutionary framework, including the corpus and design guidelines, is available at agenticva.github.io/AgenticVA/.

## Cascadeability and the Realization Gap: An Empirical Study of LLM-Powered Semantic Filtering

DevFeed: [Cascadeability and the Realization Gap: An Empirical Study of LLM-Powered Semantic Filtering](<https://devfeed.tech/articles/cascadeability-and-the-realization-gap-an-empirical-study-of-llm-powered-semantic-filtering-142288.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23898>)

Author: Nan Hou, Kangfei Zhao, Jiadong Xie, Jeffrey Xu Yu

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [LLM evaluation / benchmarking](<https://devfeed.tech/topics/llm-evaluation-benchmarking.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Ground truth / benchmark quality](<https://devfeed.tech/topics/ground-truth-benchmark-quality.md>)

Tags: [benchmark](<https://devfeed.tech/tags/benchmark.md>), [bottlenecks](<https://devfeed.tech/tags/bottlenecks.md>), [cascade](<https://devfeed.tech/tags/cascade.md>), [class](<https://devfeed.tech/tags/class.md>), [cost](<https://devfeed.tech/tags/cost.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [inference](<https://devfeed.tech/tags/inference.md>), [llm](<https://devfeed.tech/tags/llm.md>), [proxy](<https://devfeed.tech/tags/proxy.md>), [query-processing](<https://devfeed.tech/tags/query-processing.md>), [questions](<https://devfeed.tech/tags/questions.md>), [real-world](<https://devfeed.tech/tags/real-world.md>), [reduction](<https://devfeed.tech/tags/reduction.md>), [release](<https://devfeed.tech/tags/release.md>), [semantic](<https://devfeed.tech/tags/semantic.md>), [stage](<https://devfeed.tech/tags/stage.md>), [study](<https://devfeed.tech/tags/study.md>), [systems](<https://devfeed.tech/tags/systems.md>), [target](<https://devfeed.tech/tags/target.md>)

### AI overview

The abstract presents a benchmark of four LLM semantic-filtering systems and argues that oracle-call reduction alone does not show whether poor results stem from weak proxies or threshold calibration. It defines cascadeability as the maximum empirical oracle reduction possible from fixed proxy scores at a target accuracy, measured retrospectively with complete oracle labels. Comparing this ceiling with achieved reduction yields a realization gap that, alongside accuracy, helps distinguish proxy and calibration bottlenecks. The benchmark covers 10 real-world workloads with annotations from two LLM families; the abstract says it examines proxy quality, end-to-end performance, workload sensitivities, and component ablations, but does not report specific comparative results.

### Source excerpt

arXiv:2611.23898v1 Announce Type: new Abstract: Semantic filters enable natural language predicates over unstructured documents, but evaluating every document with a large language model (LLM) oracle is expensive. Proxy cascades reduce oracle invocations using cheaper surrogates, but oracle reduction alone cannot distinguish proxy limitations from calibration bottlenecks and establish practical efficiency. We present a unified benchmark of four representative systems, which formulate query processing as a three-stage workflow comprising proxy construction, threshold calibration, and cascade inference, using a two-threshold acceptance rule. We introduce cascadeability: the maximum empirical oracle reduction attainable from fixed proxy scores at a specified accuracy target, computed retrospectively using complete oracle labels. We investigate 8 research questions, spanning proxy quality, end-to-end performance, workload sensitivities, and component ablations, and reveal our key findings accordingly. Comparing cascadeability with achieved oracle reduction yields a realization gap that, interpreted alongside accuracy, exposes distinct proxy and calibration bottlenecks. The benchmark and diagnostics support evaluation beyond oracle reduction and motivate joint proxy-calibration design, class-sensitive quality assessment, and end-to-end cost optimization. We release a dataset-query benchmark, containing 10 real-world workloads across various domains and difficulties, with annotations of two LLM families.

## OCTR2A: Real-Time RGB-to-BEV Trajectory Projection and Forecasting at Urban Intersections

DevFeed: [OCTR2A: Real-Time RGB-to-BEV Trajectory Projection and Forecasting at Urban Intersections](<https://devfeed.tech/articles/octr2a-real-time-rgb-to-bev-trajectory-projection-and-forecasting-at-urban-intersections-142782.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.24352>)

Author: Emanuele Iacobelli, Simone Teglia, Francesco Pro, Claudia Melis Tonti, Irene Amerini

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Time Series](<https://devfeed.tech/topics/time-series.md>), [real-time](<https://devfeed.tech/topics/real-time.md>)

Tags: [architecture](<https://devfeed.tech/tags/architecture.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [blender](<https://devfeed.tech/tags/blender.md>), [camera](<https://devfeed.tech/tags/camera.md>), [cameras](<https://devfeed.tech/tags/cameras.md>), [cascade](<https://devfeed.tech/tags/cascade.md>), [class](<https://devfeed.tech/tags/class.md>), [configuration](<https://devfeed.tech/tags/configuration.md>), [consumer](<https://devfeed.tech/tags/consumer.md>), [cross](<https://devfeed.tech/tags/cross.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [deployment](<https://devfeed.tech/tags/deployment.md>), [detection](<https://devfeed.tech/tags/detection.md>), [domains](<https://devfeed.tech/tags/domains.md>), [existing](<https://devfeed.tech/tags/existing.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [forecasting](<https://devfeed.tech/tags/forecasting.md>), [projection](<https://devfeed.tech/tags/projection.md>), [real-time](<https://devfeed.tech/tags/real-time.md>), [rgb](<https://devfeed.tech/tags/rgb.md>)

### AI overview

OCTR2A reconstructs and forecasts agents' bird's-eye-view trajectories from paired opposite-corner RGB cameras, avoiding reliance at inference time on LiDAR, aerial views, HD maps, or calibrated infrastructure. Its cascade combines per-view detection and class refinement, geometric cross-camera matching, transformer-based BEV projection, and egocentric GRU forecasting. The authors introduce R3ST++, a Blender-based synthetic benchmark built from SIND trajectories, with synchronized views, cross-view correspondences, and BEV ground truth; it also supports site-specific fine-tuning. With 12 observed and 12 predicted frames at 10 Hz, the system reports projection-to-forecasting ADE/FDE of 0.144/0.140 to 0.154/0.241 meters in real time on one consumer GPU. On ground-truth BEV histories, its forecasting module improves ADE/FDE over the strongest compared methods on SIND by 66.7%/41.7%. Transfer experiments indicate R3ST++ pretraining supports adaptation to TUMTraf-V2X roadside domains with different sensing configurations.

### Source excerpt

arXiv:2611.24352v1 Announce Type: cross Abstract: Trajectory forecasting at urban intersections is often studied assuming that reliable bird's-eye-view (BEV) motion histories are available, which in practice requires costly resources such as LiDAR, aerial views, HD maps, or calibrated infrastructure. We address this upstream perception-to-forecasting problem by reconstructing and predicting agents' BEV trajectories only from paired opposite-corner RGB cameras mounted on existing urban infrastructure at variable heights at inference time. We introduce the Opposite-Corner Trajectory Reconstruction and Anticipation Architecture (OCTR2A), a modular pipeline integrating per-view detection with class refinement, geometric cross-camera matching, transformer-based BEV projection, and egocentric GRU forecasting, trained in cascade and mainly supervised with a soft multi-scale spatial-overlap loss. Since no public benchmark provides this sensing configuration, we introduce R3ST++, a Blender-based synthetic benchmark built from SIND trajectories that provides synchronized opposite-corner views, cross-view correspondences, and BEV ground truth, while also serving as a deployment-support simulator for site-specific fine-tuning. Experiments on these datasets show that, with 12 observed and 12 predicted frames at 10\,Hz, OCTR2A achieves projection~-~forecasting ADE/FDE of 0.144/0.140~-~0.154/0.241~meters in real time on a single consumer GPU. Evaluated on ground-truth BEV histories, the forecasting module improves over the strongest state-of-the-art methods on SIND by 66.7\%/41.7\% ADE/FDE. Transfer experiments on TUMTraf-V2X show that R3ST++ pretraining supports adaptation to real-world roadside domains with different sensing configurations.

## Reinforcement Learning for Large-Scale Lifelong Multi-Agent Path Finding with Shared Spatial Fields

DevFeed: [Reinforcement Learning for Large-Scale Lifelong Multi-Agent Path Finding with Shared Spatial Fields](<https://devfeed.tech/articles/reinforcement-learning-for-large-scale-lifelong-multi-agent-path-finding-with-shared-spatial-fields-143332.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.18186>)

Author: Jean Seong Bjorn Choe

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [Robot Navigation](<https://devfeed.tech/topics/robot-navigation.md>), [Multi Agent Systems](<https://devfeed.tech/topics/multi-agent-systems.md>)

Tags: [000](<https://devfeed.tech/tags/000.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [agent](<https://devfeed.tech/tags/agent.md>), [agents](<https://devfeed.tech/tags/agents.md>), [applications](<https://devfeed.tech/tags/applications.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [call](<https://devfeed.tech/tags/call.md>), [class](<https://devfeed.tech/tags/class.md>), [complete](<https://devfeed.tech/tags/complete.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [deploy](<https://devfeed.tech/tags/deploy.md>), [execution](<https://devfeed.tech/tags/execution.md>), [faster](<https://devfeed.tech/tags/faster.md>), [fields](<https://devfeed.tech/tags/fields.md>), [large](<https://devfeed.tech/tags/large.md>), [learning](<https://devfeed.tech/tags/learning.md>), [multi-agent](<https://devfeed.tech/tags/multi-agent.md>), [reinforcement-learning](<https://devfeed.tech/tags/reinforcement-learning.md>), [scale](<https://devfeed.tech/tags/scale.md>), [spatial](<https://devfeed.tech/tags/spatial.md>), [with](<https://devfeed.tech/tags/with.md>)

### AI overview

The method handles lifelong multi-agent path finding by computing one shared spatial field across the map per timestep, then using a compact goal-conditioned operator to produce each agent's movement preferences. It trains the complete policy end to end with average-reward reinforcement learning, using throughput as the reward, without planner demonstrations or a separate online path planner. One policy per layout class is trained on small maps and deployed without retraining on larger unseen layouts and agent populations. Across six layouts with 10,000 agents, reported throughput was comparable to or higher than the strongest evaluated baselines; average execution time was below 10 ms per step, over an order of magnitude faster than several established planners.

### Source excerpt

arXiv:2610.18186v2 Announce Type: replace Abstract: Large-scale applications of lifelong multi-agent path finding (LMAPF) call for computationally inexpensive movement decisions under changing traffic conditions and across varied layouts. We propose a navigation policy in which a convolutional network computes a shared spatial field over the map once per timestep and a compact goal-conditioned operator derives agents' movement preferences. The complete policy is trained end-to-end using average-reward reinforcement learning with throughput as the reward, without planner demonstrations or a separate online path planner. For structured and unstructured layouts, we train one policy per class on pools of small maps and deploy each without retraining on larger, unseen layouts and agent populations. Across six layouts with 10,000 agents, our policies achieve throughput comparable to or higher than the strongest evaluated baselines. The proposed method has an average execution time below 10 ms per step, more than an order of magnitude faster than several established planners.

## CVE-2026-63413 - Jane: Instantiation RCE via header parameter name -\> raw PHPDoc \*/ breakout (jane-php/open-api-3)

DevFeed: [CVE-2026-63413 - Jane: Instantiation RCE via header parameter name -\> raw PHPDoc \*/ breakout (jane-php/open-api-3)](<https://devfeed.tech/articles/cve-2026-63413-jane-instantiation-rce-via-header-parameter-name-raw-phpdoc-breakout-jane-php-open-api-3-141373.md>)

Original publisher: [Read original article](<https://cvefeed.io/vuln/detail/CVE-2026-63413>)

Author: CVEFEED.io; github.com

Published: 2026-11-18T22:17:22Z

Content type: news

Language: en

Sources: [Latest High/Critical Vulnerabilitiy Feed](<https://devfeed.tech/sources/latest-high-critical-vulnerabilitiy-feed.md>)

Topics: [PHPDoc](<https://devfeed.tech/topics/phpdoc.md>), [SDK](<https://devfeed.tech/topics/sdk.md>), [Swagger](<https://devfeed.tech/topics/swagger.md>), [API](<https://devfeed.tech/topics/api.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [api](<https://devfeed.tech/tags/api.md>), [application](<https://devfeed.tech/tags/application.md>), [array](<https://devfeed.tech/tags/array.md>), [class](<https://devfeed.tech/tags/class.md>), [client](<https://devfeed.tech/tags/client.md>), [comment](<https://devfeed.tech/tags/comment.md>), [cve](<https://devfeed.tech/tags/cve.md>), [cve-2026-63413](<https://devfeed.tech/tags/cve-2026-63413.md>), [exploitation](<https://devfeed.tech/tags/exploitation.md>), [fixed](<https://devfeed.tech/tags/fixed.md>), [generator](<https://devfeed.tech/tags/generator.md>), [header](<https://devfeed.tech/tags/header.md>), [janephp](<https://devfeed.tech/tags/janephp.md>), [json](<https://devfeed.tech/tags/json.md>), [json-schema](<https://devfeed.tech/tags/json-schema.md>), [open-api](<https://devfeed.tech/tags/open-api.md>), [parameter](<https://devfeed.tech/tags/parameter.md>), [php](<https://devfeed.tech/tags/php.md>), [phpdoc](<https://devfeed.tech/tags/phpdoc.md>), [rce](<https://devfeed.tech/tags/rce.md>)

### AI overview

Before 7.12.0, Jane's open-api-3 generator emitted OpenAPI header parameter names verbatim into generated PHPDoc array keys. A name containing a PHPDoc closing delimiter could break out of the comment and inject PHP into a class body, such as an __construct method that runs when the generated Client is instantiated. Exploitation requires generating a client from an attacker-influenced OpenAPI document and then using that SDK; injected code can run with the consuming application's privileges. The issue is fixed in version 7.12.0.

### Source excerpt

CVE ID :CVE-2026-63413 Published : Nov. 18, 2026, 10:17 p.m. | 59 minutes ago Description :Jane is a set of PHP libraries that generates models and API clients from JSON Schema and OpenAPI specifications. Prior to 7.12.0, the Jane open-api-3 generator emits an OpenAPI header parameter name verbatim as an array key in generated Client/Endpoint method docblocks. A header parameter name containing a PHPDoc closing delimiter can terminate the comment early and place attacker-controlled PHP in class-body position, including an __construct method that runs when the generated Client is instantiated. Exploitation requires generating a client from an attacker-influenced OpenAPI document and then using the generated SDK, and can execute arbitrary PHP with the consuming application's privileges. This issue is fixed in version 7.12.0. Severity: 9.3 | CRITICAL Visit the link for more details, such as CVSS details, affected products, timeline, and more...

## A new critical Java hole illustrates the enterprise IT visibility problem

DevFeed: [A new critical Java hole illustrates the enterprise IT visibility problem](<https://devfeed.tech/articles/a-new-critical-java-hole-illustrates-the-enterprise-it-visibility-problem-141912.md>)

Original publisher: [Read original article](<https://www.infoworld.com/article/4250407/a-new-critical-java-hole-illustrates-the-enterprise-it-visibility-problem-2.html>)

Author: Evan Schuman

Published: 2026-11-18T20:45:30Z

Content type: news

Language: en

Sources: [InfoWorld](<https://devfeed.tech/sources/infoworld.md>)

Topics: [openjdk](<https://devfeed.tech/topics/openjdk.md>), [Memory Safety](<https://devfeed.tech/topics/memory-safety.md>), [CVSS v4.0](<https://devfeed.tech/topics/cvss-v4-0.md>)

Tags: [17](<https://devfeed.tech/tags/17.md>), [all](<https://devfeed.tech/tags/all.md>), [applications](<https://devfeed.tech/tags/applications.md>), [authentication](<https://devfeed.tech/tags/authentication.md>), [base64](<https://devfeed.tech/tags/base64.md>), [bug](<https://devfeed.tech/tags/bug.md>), [bugs](<https://devfeed.tech/tags/bugs.md>), [but](<https://devfeed.tech/tags/but.md>), [calif](<https://devfeed.tech/tags/calif.md>), [can](<https://devfeed.tech/tags/can.md>), [class](<https://devfeed.tech/tags/class.md>), [code](<https://devfeed.tech/tags/code.md>), [code-execution](<https://devfeed.tech/tags/code-execution.md>), [corruption](<https://devfeed.tech/tags/corruption.md>), [critical](<https://devfeed.tech/tags/critical.md>), [enterprise](<https://devfeed.tech/tags/enterprise.md>), [enterprise-it](<https://devfeed.tech/tags/enterprise-it.md>), [it](<https://devfeed.tech/tags/it.md>), [java](<https://devfeed.tech/tags/java.md>), [java-programming-languages-security-software-development-vulnerabilities](<https://devfeed.tech/tags/java-programming-languages-security-software-development-vulnerabilities.md>), [language-en](<https://devfeed.tech/tags/language-en.md>), [programming-languages](<https://devfeed.tech/tags/programming-languages.md>), [security](<https://devfeed.tech/tags/security.md>), [software-development](<https://devfeed.tech/tags/software-development.md>), [storytype-news](<https://devfeed.tech/tags/storytype-news.md>), [visibility](<https://devfeed.tech/tags/visibility.md>), [vulnerabilities](<https://devfeed.tech/tags/vulnerabilities.md>)

### AI overview

Java4Shell (CVE-2026-114938) is a flaw in OpenJDK's x86-64 Base64 decoder: malformed input can corrupt neighboring memory, potentially exposing heap secrets or enabling remote code execution. Exploitation depends on an affected runtime, supported AVX-512 VBMI hardware, the vulnerable decoder path, and attacker-controlled input reaching it; even Java clients connecting to a malicious TLS server may be at risk. Calif rates it Critical (9.2, CVSS 4.0), while Oracle rates it High (8.1, CVSS 3.1). Exposure can differ across hardware running the same application or container, and hidden or bundled Java runtimes complicate inventory. The text says Oracle has patched its builds, but other distributions and embedded runtimes require their respective vendor fixes and workload restarts or rebuilds. It recommends identifying actual runtimes, hardware, and input paths, prioritizing identity and software delivery systems, and reviewing unexplained crashes for secrets that may need rotation.

### Source excerpt

When cybersecurity research firm Calif published details Tuesday of a potentially major Java security flaw, dubbed Java4Shell, it described an unauthenticated attacker's ability to read Java heap memory, steal private keys, tokens, and session secrets, and reach remote code execution (RCE). With Java being all-but-ubiquitous in today's enterprise, coupled with the inability of CISOs to have visibility into every instance of it in their estate, this means that the bug could be a big problem for IT. Java, which has had its fair share of cybersecurity issues lately, is well-known for safely handling memory. That is why a Java bug affecting memory management is so dangerous. Java4Shell, tracked as CVE-2026-114938, is a vulnerability in the OpenJDK x86-64 Base64 decoder that scores 9.2 in severity (Critical) under CVSS 4.0, Calif said. Oracle assigned it a lower rating of 8.1 (High) using CVSS 3.1. Calif explained in its post describing the issue that Base64 is a common way of representing binary data as text. "It is used in authentication protocols, to encode file uploads, and to deliver network messages," it wrote. "To decode Base64 faster, OpenJDK uses specialized x86-64 CPU instructions to process many bytes at once. We discovered a bug in optimized machine-level code that lets malformed input overwrite neighboring memory. With careful exploitation, the corruption can reveal sensitive memory, as Heartbleed did, or lead to remote code execution." It said that the corruption can be triggered by a string of just 64 "A" characters followed by a single equals sign (=); in older OpenJDK 17 versions, 128 "A" characters are required before the equals sign. "Memory corruption is the most common class of vulnerability on the internet," Calif said. "But one of Java's biggest selling points is memory safety. Java manages memory on developers' behalf and checks memory accesses, protecting applications from the memory-corruption bugs common in other software. But like PHP and many

## X-LocVul: An Evidence-Propagation Audit of Cascaded C/C++ Vulnerability Detection, Localization, and Explanation

DevFeed: [X-LocVul: An Evidence-Propagation Audit of Cascaded C/C++ Vulnerability Detection, Localization, and Explanation](<https://devfeed.tech/articles/x-locvul-an-evidence-propagation-audit-of-cascaded-c-c-vulnerability-detection-localization-and-explanation-139585.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.21626>)

Author: Hoang-Phuong-Linh Le, Quyet-Thang Huynh

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Software Engineering](<https://devfeed.tech/sources/arxiv-software-engineering.md>)

Topics: [audit](<https://devfeed.tech/topics/audit.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [reproducibility](<https://devfeed.tech/topics/reproducibility.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [account](<https://devfeed.tech/tags/account.md>), [after](<https://devfeed.tech/tags/after.md>), [all](<https://devfeed.tech/tags/all.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [audit](<https://devfeed.tech/tags/audit.md>), [but](<https://devfeed.tech/tags/but.md>), [c](<https://devfeed.tech/tags/c.md>), [c-c-plus-plus](<https://devfeed.tech/tags/c-c-plus-plus.md>), [c-plus-plus](<https://devfeed.tech/tags/c-plus-plus.md>), [can](<https://devfeed.tech/tags/can.md>), [cases](<https://devfeed.tech/tags/cases.md>), [cause](<https://devfeed.tech/tags/cause.md>), [class](<https://devfeed.tech/tags/class.md>), [components](<https://devfeed.tech/tags/components.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [detection](<https://devfeed.tech/tags/detection.md>), [localization](<https://devfeed.tech/tags/localization.md>), [vulnerability](<https://devfeed.tech/tags/vulnerability.md>), [vulnerability-detection](<https://devfeed.tech/tags/vulnerability-detection.md>)

### AI overview

X-LocVul audits how evidence moves through a C/C++ vulnerability pipeline combining UniXCoder, CodeT5, and Qwen2.5-Coder. Under duplication and temporal-leakage controls, true-CWE supervision was statistically indistinguishable from shuffled-CWE supervision on PR-AUC, MCC, and vulnerable-class F1. Generated statements failed exact source matching in 90.83% of cases; fuzzy projection achieved 83.79% Top-1 accuracy, 1.59 points above semantic projection, though its advantage over raw ranking was not established. In a masked two-rater study of 50 paired cases, predicted lines improved evidence support, while predicted CWEs improved no endpoint. Oracle evidence improved evidence support and CWE consistency, but not corrected root-cause quality; unsupported claims remained common. Chronological testing retained ranking signal (ROC-AUC 0.782; PR-AUC 0.110), but a transferred threshold produced zero recall and F1. Public E4 scores regenerate all 15 tests, while missing manifests, final prompts, and profiler logs limit stronger reproducibility claims.

### Source excerpt

arXiv:2611.21626v1 Announce Type: new Abstract: Developer-facing vulnerability analysis should link a function-level warning to a source location and a supported explanation. Cascaded systems can propagate weak evidence despite plausible components. We present X-LocVul, a measurement-first audit of a modular C/C++ detector-localizer-explainer pipeline combining UniXCoder, CodeT5, and Qwen2.5-Coder. We test whether evidence passed across stages is useful, merely source-resident, or misleading. Under duplication and temporal-leakage controls, UniXCoder has higher point estimates than CodeBERT, but true-CWE supervision is statistically indistinguishable from a shuffled-CWE control on PR-AUC, MCC, and vulnerable-class F1. Raw generated statements fail exact source matching in 90.83% of cases. Fuzzy projection reaches 83.79% Top-1 accuracy and exceeds semantic projection by 1.59 percentage points, although its advantage over raw ranking is not established. In a randomized, condition-label-masked two-rater evaluation of 50 paired cases, a predicted line improves evidence support, whereas a predicted CWE improves no endpoint. Oracle evidence improves evidence support (Holm-adjusted p=0.00453) and CWE consistency (p=3.49 x 10^-7), but not root-cause quality after correction (p=0.250); unsupported claims remain common. A chronological stress test retains ranking signal (ROC-AUC 0.782; PR-AUC 0.110), while the transferred threshold yields zero recall and F1. The contribution is not a state-of-the-art claim, but an auditable account of evidence construction, transfer, and consumption. It separates source residency from localization correctness, auxiliary labels from semantic supervision, and predicted evidence from useful evidence. Public E4 scores regenerate all 15 tests; missing manifests, final prompts, and profiler logs bound stronger reproducibility claims.

## Semantic Prism: Generative Segmentation with an Explicit Semantic-Image Interface

DevFeed: [Semantic Prism: Generative Segmentation with an Explicit Semantic-Image Interface](<https://devfeed.tech/articles/semantic-prism-generative-segmentation-with-an-explicit-semantic-image-interface-139802.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2608.11537>)

Author: Weize Cai, Yongqi Dong, Zhida Shao, Zixin Fu, Xiaoxi Hu

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Image processing](<https://devfeed.tech/topics/image-processing.md>), [Image](<https://devfeed.tech/topics/image.md>)

Tags: [alignment](<https://devfeed.tech/tags/alignment.md>), [boundary](<https://devfeed.tech/tags/boundary.md>), [c](<https://devfeed.tech/tags/c.md>), [capacity](<https://devfeed.tech/tags/capacity.md>), [class](<https://devfeed.tech/tags/class.md>), [color](<https://devfeed.tech/tags/color.md>), [combines](<https://devfeed.tech/tags/combines.md>), [condition](<https://devfeed.tech/tags/condition.md>), [conditional](<https://devfeed.tech/tags/conditional.md>), [context](<https://devfeed.tech/tags/context.md>), [crop](<https://devfeed.tech/tags/crop.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [decoding](<https://devfeed.tech/tags/decoding.md>), [define](<https://devfeed.tech/tags/define.md>), [denoising](<https://devfeed.tech/tags/denoising.md>), [eess-iv](<https://devfeed.tech/tags/eess-iv.md>), [generative](<https://devfeed.tech/tags/generative.md>), [image](<https://devfeed.tech/tags/image.md>), [interface](<https://devfeed.tech/tags/interface.md>), [semantic](<https://devfeed.tech/tags/semantic.md>)

### AI overview

Semantic Prism improves road-scene segmentation by refining the class logits decoded from a generated semantic RGB image. A generator adapted from a diffusion-distilled backbone produces that image in one denoising update per crop; distances to a fixed class-color codebook yield interface logits and pixel probabilities. Hierarchical Generator Evidence Alignment (HGEA) uses aligned multilevel VAE features alongside the input, generated image, and probabilities to correct the logits. On Cityscapes' 500-image validation set, it reaches 72.07% mean mIoU, 11.39 points above direct-interface decoding; capacity-matched ablations favor multilevel refinement over flat or single-level alternatives. The Cityscapes-trained model gets 46.89% mIoU on ACDC without target-domain adaptation, while a separately trained BDD100K model gets 62.22% on its 1,000-image validation set. Contextual Interface Hierarchy Disagreement (C-IHD) ranks pixel errors without an extra network pass; across three datasets it improves AUPR over maximum-softmax uncertainty with predictions fixed. On ACDC, AUPR rises from 0.6580 to 0.7557.

### Source excerpt

arXiv:2608.11537v2 Announce Type: replace-cross Abstract: Conditional image generators can render segmentation maps as semantic RGB images, but color drift and boundary mixing can undermine direct decoding. We present Semantic Prism, a framework that combines an explicit semantic-image interface with hierarchical refinement for road-scene segmentation. A generator adapted from a diffusion-distilled backbone produces a semantic RGB image with a single denoising update per crop. Distances to a fixed class-color codebook define interface logits and pixelwise class probabilities. Hierarchical Generator Evidence Alignment (HGEA) combines spatially aligned multilevel features from the VAE encoder of the generator with the input image, generated semantic image, and interface probabilities to predict additive corrections to these logits. Contextual Interface Hierarchy Disagreement (C-IHD) combines pointwise uncertainty, local context, and interface-refinement disagreement in a fixed score for ranking pixel errors, without an auxiliary predictor or an additional network pass. On the 500-image Cityscapes validation set, Semantic Prism achieves 72.07% mean mIoU, improving on direct-interface decoding by 11.39 percentage points. Extensive capacity-matched ablations show higher mean mIoU for multilevel refinement than for flat and single-level alternatives. The Cityscapes-trained model transfers to ACDC Dataset, achieving 46.89% mIoU without target-domain adaptation. Beyond Cityscapes, on BDD100K dataset, a separately trained model achieves 62.22% mIoU on its full 1,000-image validation set. Across the 3 evaluated datasets, C-IHD improves pixel-error area under the AUPR over uncertainty derived from maximum softmax probability, with segmentation predictions held fixed for each comparison. In particular, on ACDC, AUPR increases from 0.6580 to 0.7557, demonstrating that Semantic Prism presents more effective error ranking under adverse-condition domain shift.

## MAGIC-SSCIL: Manifold Anchoring and Geometric Incremental Calibration for Semi-Supervised Class Incremental Learning

DevFeed: [MAGIC-SSCIL: Manifold Anchoring and Geometric Incremental Calibration for Semi-Supervised Class Incremental Learning](<https://devfeed.tech/articles/magic-sscil-manifold-anchoring-and-geometric-incremental-calibration-for-semi-supervised-class-incremental-learning-141590.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2608.07586>)

Author: Yousef Abdi, Mohammad Asadpour, Yousef Seyfari

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [few-shot](<https://devfeed.tech/topics/few-shot.md>)

Tags: [class](<https://devfeed.tech/tags/class.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cub](<https://devfeed.tech/tags/cub.md>), [features](<https://devfeed.tech/tags/features.md>), [fine](<https://devfeed.tech/tags/fine.md>), [graph](<https://devfeed.tech/tags/graph.md>), [incremental](<https://devfeed.tech/tags/incremental.md>), [learning](<https://devfeed.tech/tags/learning.md>), [magic](<https://devfeed.tech/tags/magic.md>), [model](<https://devfeed.tech/tags/model.md>), [nearest-neighbor](<https://devfeed.tech/tags/nearest-neighbor.md>), [phantom](<https://devfeed.tech/tags/phantom.md>), [resnet](<https://devfeed.tech/tags/resnet.md>), [semi](<https://devfeed.tech/tags/semi.md>), [statistics](<https://devfeed.tech/tags/statistics.md>)

### AI overview

MAGIC improves exemplar-free semi-supervised class-incremental learning by propagating labels across a k-nearest-neighbor graph of frozen features, then using propagated confidence both to weight unlabeled loss and, through Soft-Weighted Geometry Calibration, to refine Gaussian class statistics used for replay. In frozen ResNet-18 experiments on CIFAR-100, CUB-200, and ImageNet-R with 1%, 5%, and 10% labels, it gained from unlabeled data in all nine tested settings, with the largest gains at 1%, and led on CUB-200 at every label ratio. At 1%, it matched the best ImageNet-R result and trailed TACLE by 2.2 points on CIFAR-100. Ablations attribute most of the gain to weighted statistics rather than the loss; at 1% labels, graph pseudo-labels were more accurate than the model's at equal coverage, while a fixed 0.95 confidence threshold removed most of the gain. At higher label ratios, backbone-adapting or full-covariance baselines overtook MAGIC on CIFAR-100 and ImageNet-R.

### Source excerpt

arXiv:2608.07586v2 Announce Type: replace-cross Abstract: Exemplar-free semi-supervised class-incremental learning (SSCIL) asks a model to learn new classes from a few labeled and many unlabeled images without storing past data. A common recipe replays old classes from stored Gaussian statistics and pseudo-labels unlabeled data with a confidence threshold. With one or two labels per class, however, the model's confidence is a poor guide to which pseudo-labels are right, so the statistics that replay depends on rest on few or noisy samples. We propose MAGIC (Manifold Anchoring and Geometric Incremental Calibration), which propagates labels over a k-nearest-neighbor graph of frozen features and uses the propagated confidences as weights in the unlabeled loss and, through Soft-Weighted Geometry Calibration (SWGC), in the class statistics from which phantom features replay old classes. With a frozen ResNet-18 on CIFAR-100, CUB-200, and ImageNet-R at 1%, 5%, and 10% labels, we compare MAGIC with nine supervised class-incremental methods equipped with FixMatch and two native SSCIL methods. MAGIC gains from unlabeled data in all nine settings, most at 1%, and leads on fine-grained CUB-200 at every ratio; at 1% it is level with the best on ImageNet-R and 2.2 points behind the native SSCIL method TACLE on CIFAR-100. Experiments inside MAGIC show that most of this gain flows through the weighted statistics, not the loss, that at 1% labels graph pseudo-labels are more accurate than the model's own at equal coverage, and that a fixed threshold of 0.95 removes most of the gain. At higher ratios, baselines that adapt the backbone or model full covariances overtake MAGIC on CIFAR-100 and ImageNet-R.

## Automating credit card fraud detection with Google BigQuery ML and Fivetran

DevFeed: [Automating credit card fraud detection with Google BigQuery ML and Fivetran](<https://devfeed.tech/articles/automating-credit-card-fraud-detection-with-google-bigquery-ml-and-fivetran-140197.md>)

Original publisher: [Read original article](<https://wf.fivetran.com/blog/automating-credit-card-fraud-detection-with-google-bigquery-ml-and-fivetran>)

Author: Kelly Kohlleffel

Published: 2026-11-18T04:42:41Z

Content type: tutorial

Language: en

Sources: [Fivetran Blog](<https://devfeed.tech/sources/fivetran-blog.md>)

Topics: [BigQuery](<https://devfeed.tech/topics/bigquery.md>), [data-engineering](<https://devfeed.tech/topics/data-engineering.md>), [online-fraud-prevention](<https://devfeed.tech/topics/online-fraud-prevention.md>), [etl](<https://devfeed.tech/topics/etl.md>)

Tags: [automated](<https://devfeed.tech/tags/automated.md>), [bigquery](<https://devfeed.tech/tags/bigquery.md>), [cdc](<https://devfeed.tech/tags/cdc.md>), [change-detection](<https://devfeed.tech/tags/change-detection.md>), [class](<https://devfeed.tech/tags/class.md>), [classification](<https://devfeed.tech/tags/classification.md>), [cloud-data-warehouse](<https://devfeed.tech/tags/cloud-data-warehouse.md>), [connectors](<https://devfeed.tech/tags/connectors.md>), [credit-card](<https://devfeed.tech/tags/credit-card.md>), [data-integration](<https://devfeed.tech/tags/data-integration.md>), [data-movement](<https://devfeed.tech/tags/data-movement.md>), [data-privacy](<https://devfeed.tech/tags/data-privacy.md>), [database](<https://devfeed.tech/tags/database.md>), [databases](<https://devfeed.tech/tags/databases.md>), [fivetran](<https://devfeed.tech/tags/fivetran.md>), [fraud](<https://devfeed.tech/tags/fraud.md>), [fraud-detection](<https://devfeed.tech/tags/fraud-detection.md>), [ml](<https://devfeed.tech/tags/ml.md>)

### AI overview

The article demonstrates moving a SQL Server credit card transactions table into BigQuery with Fivetran, then training and querying a fraud classifier with BigQuery ML. It selects a single schema and table, configures log-free change detection, and allows schema changes to sync automatically. Fivetran supports incremental updates and defaults to six-hour polling, configurable from one minute to 24 hours; the described setup uses TLS in transit and AES256 for data temporarily stored by the service. The example dataset has 284,807 transactions and 492 fraud cases. Its logistic regression model applies a log transform to Amount, uses Class as the label, enables automatic class weights for imbalance, and splits data sequentially by Time. ML.PREDICT returns predicted class probabilities alongside transaction amount and actual Class for a selected timestamp.

### Source excerpt

Exploring fraud detection with automated data integration in a cloud data warehouse: part two of two.

## Amazon and Google will together own nearly 30% of Anthropic after its IPO

DevFeed: [Amazon and Google will together own nearly 30% of Anthropic after its IPO](<https://devfeed.tech/articles/amazon-and-google-will-together-own-nearly-30-of-anthropic-after-its-ipo-138593.md>)

Original publisher: [Read original article](<https://techcrunch.com/2026/11/17/amazon-and-google-will-together-own-nearly-30-of-anthropic-after-its-ipo/>)

Author: Julie Bort

Published: 2026-11-17T22:29:05Z

Content type: news

Language: en

Sources: [TechCrunch | AI News & Artificial Intelligence](<https://devfeed.tech/sources/techcrunch-ai-news-artificial-intelligence.md>)

Topics: [amazon](<https://devfeed.tech/topics/amazon.md>), [Google](<https://devfeed.tech/topics/google.md>), [Claude](<https://devfeed.tech/topics/claude.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [amazon](<https://devfeed.tech/tags/amazon.md>), [amd](<https://devfeed.tech/tags/amd.md>), [anthropic](<https://devfeed.tech/tags/anthropic.md>), [aws](<https://devfeed.tech/tags/aws.md>), [broadcom](<https://devfeed.tech/tags/broadcom.md>), [class](<https://devfeed.tech/tags/class.md>), [claude](<https://devfeed.tech/tags/claude.md>), [claude-code](<https://devfeed.tech/tags/claude-code.md>), [cloud](<https://devfeed.tech/tags/cloud.md>), [cloud-services](<https://devfeed.tech/tags/cloud-services.md>), [code](<https://devfeed.tech/tags/code.md>), [company](<https://devfeed.tech/tags/company.md>), [conversion](<https://devfeed.tech/tags/conversion.md>), [equity](<https://devfeed.tech/tags/equity.md>), [google](<https://devfeed.tech/tags/google.md>), [investment](<https://devfeed.tech/tags/investment.md>), [investors](<https://devfeed.tech/tags/investors.md>), [ipo](<https://devfeed.tech/tags/ipo.md>), [microsoft](<https://devfeed.tech/tags/microsoft.md>), [notes](<https://devfeed.tech/tags/notes.md>), [tc](<https://devfeed.tech/tags/tc.md>)

### AI overview

Anthropic disclosed that Amazon will hold 14.7% of the company after converting some promissory notes into non-voting shares in the IPO; it retains billions of dollars in notes that, if converted now, would raise its stake to 23.8%. Those shares can receive dividends and convert to voting Class A shares when sold. Google will hold 13.7% in non-voting shares from note conversions and an IPO private placement. The filing also describes a $26 billion stock purchase commitment from AMD, Broadcom, Google, Micron, Microsoft, Nvidia and TSMC Partners; Google and Nvidia each agreed to buy $10 billion. Amazon's separate AWS revenue from Anthropic's cloud spending commitment is not included in these ownership figures.

### Source excerpt

Amazon will own just under 15% of Anthropic after the IPO, with the option to go much higher. Google is a close second with holdings of nearly 14%.

[Next page](<https://devfeed.tech/tags/class.md?cursor=WyIyMDI2LTExLTE3VDIyOjI5OjA1KzAwOjAwIiwgIjQyOTU5YWE0LWI5OTMtNDE2NS04MWNkLTE5YjczYThhYWMzYyJd>)