SearcharxivSearch

arXiv subjects

Nikodem Tomczak

Publications and source records attributed to Nikodem Tomczak.

9 recordsLinked to original sources

RAMPART: Registry-based Agentic Memory with Priority-Aware Runtime Transformation

RAMPART is a compile-time memory model and pure in-RAM block registry for LLM-based agents. Context assembly is a programmable runtime operation where content is compiled from a structured registry under explicit policy for ordering, inclusion, and eviction. Five composable primitives (promote, gate, write, evict, rollback) act on named addressable blocks before compilation at zero prompt-token cost. Provenance tags and non-evictable authorship flags implement a permissioned memory model with block-level ownership. Controlled probes with Qwen3-8B Q4 show that compile-time placement and the structural relationship between blocks and the task query affect task success, with the cliff falling at roughly the seventh block position when the task follows the registry and the twelfth when it precedes. Grouping the critical block with content-adjacent neighbours and promoting the group as a unit lifts task success by tens of percentage points at positions where single-block placement fails. Cross-model replication on Qwen2.5-7B, Llama-3.1-8B, Mistral-7B-v0.3, and Qwen3-14B shows the content-priming effect appears at the same absolute positions across families, with magnitude varying with model strength. Block grouping raises Mistral's mean pass rate roughly fivefold at the hardest registry size, and a smaller model with the intervention can outperform a larger model without it in the mid-registry zone. Relevance gating reduces prompt cost by 67.8\% while recovering 83% of the promoted-condition success rate. Schema eviction produces 0% invocations against 100% with the schema present, a property policy-based approaches cannot guarantee by construction. Shared-registry coordination reduces inter-agent communication to a method call at zero coordination token cost.

cs.CL

CYGNET: Cypher Gate for Neural Execution Triage and Cost Containment

Language models acting as agents over knowledge graphs generate Cypher queries that fail structurally (crashing at the database) or semantically (executing but returning wrong results). We place a pre-execution gate between query generation and a production Neo4j database. The gate validates structure through a four-backend chain culminating in execution against a mirror graph at 5.6 ms median latency. Structurally broken queries are routed to a corrector that iterates structured error feedback through a language model. On seven CypherBench schemas (2348 questions, ACL 2025) the pipeline maintains generation accuracy on every model tested, confirming it operates as a safe defensive layer. The corrector achieves 81% to 95% success across five models (mean 89%). On a template-generated corpus across nine schemas the gate catches 100% of parse errors, 100% of constraint violations, and 100% of schema-reference errors in path queries with labelled endpoints, at zero false positives across 1135 queries. Property sibling-swaps where the substituted name is valid on the target label score 0%, marking the formal boundary where structural validation ends and semantic validation must begin. A planner-based cost gate flags catastrophic plan structures before execution.

cs.CL

Heterogeneous Connectivity in Sparse Networks: Fan-in Profiles, Gradient Hierarchy, and Topological Equilibria

Profiled Sparse Networks (PSN) replace uniform connectivity with deterministic, heterogeneous fan-in profiles defined by continuous, nonlinear functions, creating neurons with both dense and sparse receptive fields. We benchmark PSN across four classification datasets spanning vision and tabular domains, input dimensions from 54 to 784, and network depths of 2--3 hidden layers. At 90% sparsity, all static profiles, including the uniform random baseline, achieve accuracy within 0.2-0.6% of dense baselines on every dataset, demonstrating that heterogeneous connectivity provides no accuracy advantage when hub placement is arbitrary rather than task-aligned. This result holds across sparsity levels (80-99.9%), profile shapes (eight parametric families, lognormal, and power-law), and fan-in coefficients of variation from 0 to 2.5. Internal gradient analysis reveals that structured profiles create a 2-5x gradient concentration at hub neurons compared to the ~1x uniform distribution in random baselines, with the hierarchy strength predicted by fan-in coefficient of variation ($r = 0.93$). When PSN fan-in distributions are used to initialise RigL dynamic sparse training, lognormal profiles matched to the equilibrium fan-in distribution consistently outperform standard ERK initialisation, with advantages growing on harder tasks, achieving +0.16% on Fashion-MNIST ($p = 0.036$, $d = 1.07$), +0.43% on EMNIST, and +0.49% on Forest Cover. RigL converges to a characteristic fan-in distribution regardless of initialisation. Starting at this equilibrium allows the optimiser to refine weights rather than rearrange topology. Which neurons become hubs matters more than the degree of connectivity variance, i.e., random hub placement provides no advantage, while optimisation-driven placement does.

cs.LG

Efficient Bitcoin Meta-Protocol Transaction and Data Discovery Through nLockTime Field Repurposing

We describe the Lockchain Protocol, a lightweight Bitcoin meta-protocol that enables highly efficient transaction discovery at zero marginal block space cost, and data verification without introducing any new on-chain storage mechanism. The protocol repurposes the mandatory 4-byte nLockTime field of every Bitcoin transaction as a compact metadata header. By constraining values to an unused range of past Unix timestamps greater than or equal to 500,000,000, the field can encode a protocol signal, type, variant, and sequence identifier while remaining fully valid under Bitcoin consensus and policy rules. The primary contribution of the protocol is an efficient discovery layer. Indexers can filter candidate transactions by examining a fixed-size header field, independent of transaction payload size, and only then selectively inspect heavier data such as OP RETURN outputs or witness fields. The Lockchain Protocol applies established protocol design patterns to an under-optimised problem domain, namely transaction discovery at scale, and does not claim new cryptographic primitives or storage methods.

cs.CR

Artificial intelligence moral agent as Adam Smith's impartial spectator

Adam Smith developed a version of moral philosophy where better decisions are made by interrogating an impartial spectator within us. We discuss the possibility of using an external non-human-based substitute tool that would augment our internal mental processes and play the role of the impartial spectator. Such tool would have more knowledge about the world, be more impartial, and would provide a more encompassing perspective on moral assessment.

econ.GN

Quantifying surface wetting properties using droplet probe AFM

Surface wettability has a huge influence on its functional properties. For example, to minimize smudging, surfaces should be able to repel oil droplets. To quantify surface wettability, the most common approach is to measure the contact angles of a liquid droplet on the surface. While well-established and relatively easy to perform, contact angle measurements are crude and imprecise; moreover, they cannot spatially resolve surface heterogeneities that can contribute to surface fouling. To address these shortcomings, we report on using an Atomic Force Microscopy (AFM) technique to quantitatively measure the interaction forces between a micro-droplet and a surface with piconewton force resolution. We show how our technique can be used to spatially map topographical and chemical heterogeneities with micron resolution.

cond-mat.soft

Mapping micron-scale wetting properties of superhydrophobic surfaces

There is a huge interest in developing super-repellent surfaces for anti-fouling and heat transfer applications. To characterize the wetting properties of such surfaces, the most common approach is to place a millimetric-sized droplet and measure its contact angles. The adhesion and friction forces can then be indirectly inferred from the Furmidge's relation. While easy to implement, contact angle measurements are semi-quantitative and cannot resolve wetting variations on a surface. Here, we attach a micrometric-sized droplet to an Atomic Force Microscope cantilever to directly measure adhesion and friction forces with nanonewton force resolutions. We spatially map the micron-scale wetting properties of superhydrophobic surfaces and observe the time-resolved pinning-depinning dynamics as a droplet detaches from or moves across the surface.

cond-mat.soft

Machine learning and behavioral economics for personalized choice architecture

Behavioral economics changed the way we think about market participants and revolutionized policy-making by introducing the concept of choice architecture. However, even though effective on the level of a population, interventions from behavioral economics, nudges, are often characterized by weak generalisation as they struggle on the level of individuals. Recent developments in data science, artificial intelligence (AI) and machine learning (ML) have shown ability to alleviate some of the problems of weak generalisation by providing tools and methods that result in models with stronger predictive power. This paper aims to describe how ML and AI can work with behavioral economics to support and augment decision-making and inform policy decisions by designing personalized interventions, assuming that enough personalized traits and psychological variables can be sampled.

econ.GN

Hydration lubrication of polyzwitterionic brushes leads to nearly friction- and adhesion-free droplet motion

Recently, there has been much progress in the design and application of oil-repellent superoleophobic surfaces. Polyzwitterionic brush surfaces are of particular interest, because of their ability to repel oil under water, even in the absence of micro-/nano-structures. The origin of this underwater superoleophobicity is attributed to the presence of a stable water film beneath the oil droplet, but this had not been demonstrated experimentally. Here, using optical interferometric techniques, we show that an oil droplet effectively hydroplanes over a water film, whose thickness is between one hundred and hundreds of nanometres. In addition, using a custom-built Droplet Force Apparatus, we measured the friction and adhesion forces to be in the nN range for millimetric-sized droplets. These forces are much lower than for other classes of well-known liquid-repellent surfaces, including the lotus-effect and lubricant-infused surfaces, where the typical force is on the order of $μ$N

cond-mat.soft