Search

A symmetry preserving treatment of a vector $\otimes$ vector contact interaction (SCI) is used as the basis for calculations of the two pion transverse momentum dependent parton distribution functions (TMDs); namely, that for unpolarised valence degrees-of-freedom and the analogous Boer-Mulders (BM) function. Amongst other things, the analysis enables the following themes to be addressed: the quark current mass dependence of pion TMDs; the impact of the gauge link model on the positivity constraint that bounds the BM function relative to the unpolarised TMD; the equivalence of direct diagrammatic and light-front wave function TMD calculations; and the size of the BM shift. Interpreted astutely, these SCI results enable one to draw insightful pictures of pion TMDs., Comment: 14 pages, 9 figures, 1 table

Information from social media can provide essential information for emergency response during natural disasters in near real-time. However, it is difficult to identify the disaster-related posts among the large amounts of unstructured data available. Previous methods often use keyword filtering, topic modelling or classification-based techniques to identify such posts. Active Learning (AL) presents a promising sub-field of Machine Learning (ML) that has not been used much in the field of text classification of social media content. This study therefore investigates the potential of AL for identifying disaster-related Tweets. We compare a keyword filtering approach, a RoBERTa model fine-tuned with generic data from CrisisLex, a base RoBERTa model trained with AL and a fine-tuned RoBERTa model trained with AL regarding classification performance. For testing, data from CrisisLex and manually labelled data from the 2021 flood in Germany and the 2023 Chile forest fires were considered. The results show that generic fine-tuning combined with 10 rounds of AL outperformed all other approaches. Consequently, a broadly applicable model for the identification of disaster-related Tweets could be trained with very little labelling effort. The model can be applied to use cases beyond this study and provides a useful tool for further research in social media analysis., Comment: Submitted for the Intelligent Systems Conference (IntelliSys 2024). The version of record of this contribution is published in the Springer series Lecture Notes in Networks and Systems, and is available online at https://doi.org/10.1007/978-3-031-66428-1_8. This preprint has not undergone peer review or any post-submission improvements or corrections. 13 pages, 2 figures

When applying deep learning models in open-world scenarios, active learning (AL) strategies are crucial for identifying label candidates from a nearly infinite amount of unlabeled data. In this context, robust out-of-distribution (OOD) detection mechanisms are essential for handling data outside the target distribution of the application. However, current works investigate both problems separately. In this work, we introduce SISOM as the first unified solution for both AL and OOD detection. By leveraging feature space distance metrics SISOM combines the strengths of the currently independent tasks to solve both effectively. We conduct extensive experiments showing the problems arising when migrating between both tasks. In these evaluations SISOM underlined its effectiveness by achieving first place in two of the widely used OpenOOD benchmarks and second place in the remaining one. In AL, SISOM outperforms others and delivers top-1 performance in three benchmarks

This work presents a novel flow-based molecular communication (MC) testbed using spectral sensing and ink concentration estimation to enable real-time multi-molecule (MUMO) transmission. MUMO communication opens up crucial opportunities for increased throughput as well as implementing more complex coding, modulation, and resource allocation strategies for MC testbeds. A concentration estimator using non-invasive spectral sensing at the receiver is proposed based on a simple absorption model. We conduct in-depth channel impulse response (CIR) measurements and a preliminary communication performance evaluation. Additionally, a simple analytical model is used to check the consistency of the CIRs. The results indicate that by utilizing MUMO transmission, on-off-keying, and a simple difference detector, the testbed can achieve up to 3 bits per second for near-error-free communication, which is on par with comparable testbeds that utilize more sophisticated coding or detection methods. Our platform lays the ground for implementing MUMO communication and evaluating various physical layer and networking techniques based on multiple molecule types in future MC testbeds in real time., Comment: 6 pages, 5 figures

The trustworthiness of AI applications has been the subject of recent research and is also addressed in the EU's recently adopted AI Regulation. The currently emerging foundation models in the field of text, speech and image processing offer completely new possibilities for developing AI applications. This whitepaper shows how the trustworthiness of an AI application developed with foundation models can be evaluated and ensured. For this purpose, the application-specific, risk-based approach for testing and ensuring the trustworthiness of AI applications, as developed in the 'AI Assessment Catalog - Guideline for Trustworthy Artificial Intelligence' by Fraunhofer IAIS, is transferred to the context of foundation models. Special consideration is given to the fact that specific risks of foundation models can have an impact on the AI application and must also be taken into account when checking trustworthiness. Chapter 1 of the white paper explains the fundamental relationship between foundation models and AI applications based on them in terms of trustworthiness. Chapter 2 provides an introduction to the technical construction of foundation models and Chapter 3 shows how AI applications can be developed based on them. Chapter 4 provides an overview of the resulting risks regarding trustworthiness. Chapter 5 shows which requirements for AI applications and foundation models are to be expected according to the draft of the European Union's AI Regulation and Chapter 6 finally shows the system and procedure for meeting trustworthiness requirements., Comment: 24 pages, 11 figures

Conversational search engines such as YouChat and Microsoft Copilot use large language models (LLMs) to generate responses to queries. It is only a small step to also let the same technology insert ads within the generated responses - instead of separately placing ads next to a response. Inserted ads would be reminiscent of native advertising and product placement, both of which are very effective forms of subtle and manipulative advertising. Considering the high computational costs associated with LLMs, for which providers need to develop sustainable business models, users of conversational search engines may very well be confronted with generated native ads in the near future. In this paper, we thus take a first step to investigate whether LLMs can also be used as a countermeasure, i.e., to block generated native ads. We compile the Webis Generated Native Ads 2024 dataset of queries and generated responses with automatically inserted ads, and evaluate whether LLMs or fine-tuned sentence transformers can detect the ads. In our experiments, the investigated LLMs struggle with the task but sentence transformers achieve precision and recall values above 0.9., Comment: WWW'24 Short Papers Track; 4 pages

Active learning (AL) reduces the amount of labeled data needed to train a machine learning model by intelligently choosing which instances to label. Classic pool-based AL requires all data to be present in a datacenter, which can be challenging with the increasing amounts of data needed in deep learning. However, AL on mobile devices and robots, like autonomous cars, can filter the data from perception sensor streams before reaching the datacenter. We exploited the temporal properties for such image streams in our work and proposed the novel temporal predicted loss (TPL) method. To evaluate the stream-based setting properly, we introduced the GTA V streets and the A2D2 streets dataset and made both publicly available. Our experiments showed that our approach significantly improves the diversity of the selection while being an uncertainty-based method. As pool-based approaches are more common in perception applications, we derived a concept for comparing pool-based and stream-based AL, where TPL out-performed state-of-the-art pool- or stream-based approaches for different models. TPL demonstrated a gain of 2.5 precept points (pp) less required data while being significantly faster than pool-based methods.

Eye lens dosimetry has been an important field of research in the last decade. Dose measurements with a prototype of an active personal eye lens dosemeter based on the Dosepix detector are presented. The personal dose equivalent at $3\,$mm depth of soft tissue, $H_\text{p}(3)$, was measured in the center front of a water-filled cylinder phantom with a height and diameter of $20\,$cm. The energy dependence of the normalized response is investigated for mean photon energies between $12.4\,$keV and $248\,$keV for continuous reference radiation fields (N-series) according to ISO 4037. The response normalized to N-60 ($\overline{E}=47.9\,\text{keV}$) at $0^\circ$ angle of irradiation stays within the approval limits of IEC 61526 for angles of incidence between $-75^\circ$ and $+75^\circ$. Performance in pulsed photon fields was tested for varying dose rates from $0.1\,\frac{\text{Sv}}{\text{h}}$ up to $1000\,\frac{\text{Sv}}{\text{h}}$ and pulse durations from $1\,\text{ms}$ up to $10\,\text{s}$. The dose measurement works well within the approval limits (acc. to IEC 61526) up to $1\,\frac{\text{Sv}}{\text{h}}$. No significant influence of the pulse duration on the measured dose is found. Reproducibility measurements yield a coefficient of variation which does not exceed $1\,\%$ for two tested eye lens dosemeter prototypes., Comment: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible. 9 pages, 10 figures

The Archive Query Log (AQL) is a previously unused, comprehensive query log collected at the Internet Archive over the last 25 years. Its first version includes 356 million queries, 166 million search result pages, and 1.7 billion search results across 550 search providers. Although many query logs have been studied in the literature, the search providers that own them generally do not publish their logs to protect user privacy and vital business data. Of the few query logs publicly available, none combines size, scope, and diversity. The AQL is the first to do so, enabling research on new retrieval models and (diachronic) search engine analyses. Provided in a privacy-preserving manner, it promotes open research as well as more transparency and accountability in the search industry., Comment: SIGIR 2023 resource paper, 13 pages

Visible matter is characterised by a single mass scale; namely, the proton mass. The proton's existence and structure are supposed to be described by quantum chromodynamics (QCD); yet, absent Higgs boson couplings, chromodynamics is scale invariant. Thus, if the Standard Model is truly a part of the theory of Nature, then the proton mass is an emergent feature of QCD; and emergent hadron mass (EHM) must provide the basic link between theory and observation. Nonperturbative tools are necessary if such connections are to be made; and in this context, we sketch recent progress in the application of continuum Schwinger function methods to an array of related problems in hadron and particle physics. Special emphasis is given to the three pillars of EHM -- namely, the running gluon mass, process-independent effective charge, and running quark mass; their role in stabilising QCD; and their measurable expressions in a diverse array of observables., Comment: 65 pages, 27 figures, 4 tables. Contribution to a Special Issue of PARTICLES: "Strong Interactions in the Standard Model: Massless Bosons to Compact Stars". Version accepted for publication

In a strongly connected graph $G = (V,E)$, a cut arc (also called strong bridge) is an arc $e \in E$ whose removal makes the graph no longer strongly connected. Equivalently, there exist $u,v \in V$, such that all $u$-$v$ walks contain $e$. Cut arcs are a fundamental graph-theoretic notion, with countless applications, especially in reachability problems. In this paper we initiate the study of cut paths, as a generalisation of cut arcs, which we naturally define as those paths $P$ for which there exist $u,v \in V$, such that all $u$-$v$ walks contain $P$ as subwalk. We first prove various properties of cut paths and define their remainder structures, which we use to present a simple $O(m)$-time verification algorithm for a cut path ($|V| = n$, $|E| = m$). Secondly, we apply cut paths and their remainder structures to improve several reachability problems from bioinformatics. A walk is called safe if it is a subwalk of every node-covering closed walk of a strongly connected graph. Multi-safety is defined analogously, by considering node-covering sets of closed walks instead. We show that cut paths provide simple $O(m)$-time algorithms verifying if a walk is safe or multi-safe. For multi-safety, we present the first linear time algorithm, while for safety, we present a simple algorithm where the state-of-the-art employed complex data structures. Finally we show that the simultaneous computation of remainder structures of all subwalks of a cut path can be performed in linear time. These properties yield an $O(mn)$ algorithm outputting all maximal multi-safe walks, improving over the state-of-the-art algorithm running in time $O(m^2+n^3)$. The results of this paper only scratch the surface in the study of cut paths, and we believe a rich structure of a graph can be revealed, considering the perspective of a path, instead of just an arc.

Theory suggests that in high-energy elastic hadron+hadron scattering, $t$-channel exchange of a family of colourless crossing-odd states -- the odderon -- may generate differences between $p\bar p$ and $pp$ cross-sections in the neighbourhood of the diffractive minimum. Using a mathematical approach based on interpolation via continued fractions enhanced by statistical sampling, we develop robust comparisons between $p\bar p$ elastic differential cross-sections measured at $\surd s=1.96\,$TeV by the D0 Collaboration at the Tevatron and function-form-unbiased extrapolations to this energy of kindred $pp$ measurements at $\surd s /{\rm TeV} = 2.76, 7, 8, 13$ by the TOTEM Collaboration at the LHC and a combination of these data with earlier cross-section measurements at $\surd s/{\rm GeV} = 23.5, 30.7, 44.7, 52.8, 62.5$ made at the internal storage rings. Focusing on a domain that straddles the diffractive minimum in the $p\bar p$ and $pp$ cross-sections, we find that these two cross-sections differ at the $(2.2-2.6)\sigma$ level; hence, supply evidence with this level of significance for the existence of the odderon. If combined with evidence obtained through different experiment-theory comparisons, whose significance is reported to lie in the range $(3.4-4.6)\sigma$, one arrives at a $(4.0 - 5.2)\sigma$ signal for the odderon., Comment: 8 pages, 5 figures

Conceptually, radii are amongst the simplest Poincar\'e-invariant properties that can be associated with hadrons and light nuclei. Accurate values of these quantities are necessary so that one may judge the character of putative solutions to the strong interaction problem within the Standard Model. However, limiting their ability to serve in this role, recent measurements and new analyses of older data have revealed uncertainties and imprecisions in the radii of the proton, pion, kaon, and deuteron. In the context of radius measurement using electron + hadron elastic scattering, the past decade has shown that reliable extraction requires complete elimination of bias associated with practitioner-dependent choices of data fitting functions. Different answers to that challenge have been offered; and this perspective describes the statistical Schlessinger point method (SPM), in unifying applications to proton, pion, kaon, and deuteron radii. Grounded in analytic function theory, independent of assumptions about underlying dynamics, free from practitioner-induced bias, and applicable in the same form to diverse systems and observables, the SPM returns an objective expression of the information contained in any data under consideration. Its robust nature and versatility make it suitable for use in many branches of experiment and theory., Comment: 16 pages, 11 figures, 1 table. Review article commissioned by and accepted for publication in Chinese Physics C

We discover a correspondence between the free field and the interacting states. This correspondence is firstly given from the fact that the free propagator can be converted into a tower of propagators for massive states, when expanded with the Hermite function basis. The equivalence of propagators reveals that in this particular case the duality can naturally be regarded as the equivalence of one theory on the plane wave basis to the other on the Hermite function basis. More generally, the Hermite function basis provides an alternative quantization process with the creation/annihilation operators that correspond directly to the interacting fields. Moreover, the Hermite function basis defines an exact way of dimensional reduction. As an illustration, we apply this basis on 3+1 dimensional Yang-Mills theory with three dimensional space being reduced through the Hermite function basis, and if with only the lowest order Hermite function, the equivalent action becomes the Banks-Fischler-Shenker-Susskind (BFSS) matrix model., Comment: 7 pages, 1 figure

The diffusion of new technologies is crucial for the realization of social and economic returns to innovation. Tracking and mapping technology diffusion is, however, typically limited by the extent to which we can observe technology adoption. This study uses website texts to train a multilingual language model ensemble to map technology diffusion for the case of 3D printing. The study identifies relevant actors and their roles in the diffusion process. The results show that besides manufacturers, service provider, retailers, and information providers play an important role. The geographic distribution of adoption intensity suggests that regional 3D-printing intensity is driven by experienced lead users and the presence of technical universities. The overall adoption intensity varies by sector and firm size. These patterns indicate that the approach of using webAI provides a useful and novel tool for technology mapping which adds to existing measures based on patents or survey data.

Using a procedure based on interpolation via continued fractions supplemented by statistical sampling, we analyse proton magnetic form factor data obtained via electron+proton scattering on $Q^2 \in [0.027,0.55]\,$GeV$^2$ with the goal of determining the proton magnetic radius. The approach avoids assumptions about the function form used for data interpolation and ensuing extrapolation onto $Q^2\simeq 0$ for extraction of the form factor slope. In this way, we find $r_M = 0.817(27)\,$fm. Regarding the difference between proton electric and magnetic radii calculated in this way, extant data are seen to be compatible with the possibility that the slopes of the proton Dirac and Pauli form factors, $F_{1,2}(Q^2)$, are not truly independent observables; to wit, the difference $F_1^\prime(0)-F_2^\prime(0)/\kappa_p = [1+\kappa_p]/[4 m_p^2]$, viz. the proton Foldy term., Comment: 7 pages, 3 figures

In this paper we describe the methods we used for our submissions to the GermEval 2021 shared task on the identification of toxic, engaging, and fact-claiming comments. For all three subtasks we fine-tuned freely available transformer-based models from the Huggingface model hub. We evaluated the performance of various pre-trained models after fine-tuning on 80% of the training data with different hyperparameters and submitted predictions of the two best performing resulting models. We found that this approach worked best for subtask 3, for which we achieved an F1-score of 0.736.

Beginning with precise data on the ratio of structure functions in deep inelastic scattering (DIS) from $^3$He and $^3$H, collected on the domain $0.19 \leq x_B \leq 0.83$, where $x_B$ is the Bjorken scaling variable, we employ a robust method for extrapolating such data to arrive at a model-independent result for the $x_B=1$ value of the ratio of neutron and proton structure functions. Combining this with information obtained in analyses of DIS from nuclei, corrected for target-structure dependence, we arrive at a prediction for the proton's valence-quark ratio: $\left. d_v/u_v \right|_{x_B\to 1} = 0.230 (57)$. Requiring consistency with this result presents a challenge to many descriptions of proton structure., Comment: 6 pages, 3 figures

With the aim of extracting the pion charge radius, we analyse extant precise pion+electron elastic scattering data on $Q^2 \in [0.015,0.144]\,$GeV$^2$ using a method based on interpolation via continued fractions augmented by statistical sampling. The scheme avoids any assumptions on the form of function used for the representation of data and subsequent extrapolation onto $Q^2\simeq 0$. Combining results obtained from the two available data sets, we obtain $r_\pi = 0.640(7)\,$fm, a value $2.4\,\sigma$ below today's commonly quoted average. The tension may be relieved by collection and similar analysis of new precise data that densely cover a domain which reaches well below $Q^2 = 0.015\,$GeV$^2$. Considering available kaon+electron elastic scattering data sets, our analysis reveals that they contain insufficient information to extract an objective result for the charged-kaon radius, $r_K$. New data with much improved precision, low-$Q^2$ reach and coverage are necessary before a sound result for $r_K$ can be recorded., Comment: 5 pages, 4 figures

First investigations regarding dosimetric properties of the hybrid, pixelated, photon-counting Dosepix detector in the direct beam of a pulsed photon field (RQR8) for the personal dose equivalent $H\mathrm{_p(10)}$ are presented. The influence quantities such as pulse duration and dose rate were varied, and their responses were compared to the legal limits provided in PTB-A 23.2. The variation of pulse duration at a nearly constant dose rate of about 3.7$\,$Sv/h shows a flat response around 1.0 from 3.6$\,$s down to 2$\,$ms. A response close to 1.0 is achieved for dose rates from 0.07$\,$Sv/h to 35$\,$Sv/h for both pixel sizes. Above this dose rate, the large pixels (220$\,\mu$m edge length) are below the lower limit. The small pixels (55$\,\mu$m edge length) stay within limits up to 704$\,$Sv/h. The count rate linearity is compared to previous results, confirming the saturating count rate for high dose rates., Comment: 6 pages, 4 figures. This work was accepted for publication in IEEE Transactions on Nuclear Science

We present a novel method for extracting the proton radius from elastic electron-proton ($ep$) scattering data. The approach is based on interpolation via continued fractions augmented by statistical sampling and avoids any assumptions on the form of function used for the representation of data and subsequent extrapolation onto $Q^2\simeq 0$. Applying the method to extant modern $e p$ data sets, we find that all results are mutually consistent and, combining them, arrive at $r_p=0.847(8)\,$fm. This result compares favourably with values obtained from contemporary measurements of the Lamb shift in muonic hydrogen, transitions in electronic hydrogen, and muonic deuterium spectroscopy., Comment: 7 pages, 4 figures. Version accepted for publication in Phys. Rev. Lett

Genome assembly is a fundamental problem in Bioinformatics, requiring to reconstruct a source genome from an assembly graph built from a set of reads (short strings sequenced from the genome). A notion of genome assembly solution is that of an arc-covering walk of the graph. Since assembly graphs admit many solutions, the goal is to find what is definitely present in all solutions, or what is safe. Most practical assemblers are based on heuristics having at their core unitigs, namely paths whose internal nodes have unit in-degree and out-degree, and which are clearly safe. The long-standing open problem of finding all the safe parts of the solutions was recently solved [RECOMB 2016] yielding a 60% increase in contig length. This safe and complete genome assembly algorithm was followed by other works improving the time bounds, as well as extending the results for different notions of assembly solution. But it remained open whether one can be complete also for models of genome assembly of practical applicability. In this paper we present a universal framework for obtaining safe and complete algorithms which unify the previous results, while also allowing for easy generalisations to assembly problems including many practical aspects. This is based on a novel graph structure, called the hydrostructure of a walk, which highlights the reachability properties of the graph from the perspective of the walk. The hydrostructure allows for simple characterisations of the existing safe walks, and of their new practical versions. Almost all of our characterisations are directly adaptable to optimal verification algorithms, and simple enumeration algorithms. Most of these algorithms are also improved to optimality using an incremental computation procedure and a previous optimal algorithm of a specific model.

Given a directed graph $G$ and a pair of nodes $s$ and $t$, an \emph{$s$-$t$ bridge} of $G$ is an edge whose removal breaks all $s$-$t$ paths of $G$ (and thus appears in all $s$-$t$ paths). Computing all $s$-$t$ bridges of $G$ is a basic graph problem, solvable in linear time. In this paper, we consider a natural generalisation of this problem, with the notion of "safety" from bioinformatics. We say that a walk $W$ is \emph{safe} with respect to a set $\mathcal{W}$ of $s$-$t$ walks, if $W$ is a subwalk of all walks in $\mathcal{W}$. We start by considering the maximal safe walks when $\mathcal{W}$ consists of: all $s$-$t$ paths, all $s$-$t$ trails, or all $s$-$t$ walks of $G$. We show that the first two problems are immediate linear-time generalisations of finding all $s$-$t$ bridges, while the third problem is more involved. In particular, we show that there exists a compact representation computable in linear time, that allows outputting all maximal safe walks in time linear in their length. We further generalise these problems, by assuming that safety is defined only with respect to a subset of \emph{visible} edges. Here we prove a dichotomy between the $s$-$t$ paths and $s$-$t$ trails cases, and the $s$-$t$ walks case: the former two are NP-hard, while the latter is solvable with the same complexity as when all edges are visible. We also show that the same complexity results hold for the analogous generalisations of \emph{$s$-$t$ articulation points} (nodes appearing in all $s$-$t$ paths). We thus obtain the best possible results for natural "safety"-generalisations of these two fundamental graph problems. Moreover, our algorithms are simple and do not employ any complex data structures, making them ideal for use in practice.

Given a directed graph $G$ and a pair of nodes $s$ and $t$, an $s$-$t$ bridge of $G$ is an edge whose removal breaks all $s$-$t$ paths of $G$. Similarly, an $s$-$t$ articulation point of $G$ is a node whose removal breaks all $s$-$t$ paths of $G$. Computing the sequence of all $s$-$t$ bridges of $G$ (as well as the $s$-$t$ articulation points) is a basic graph problem, solvable in linear time using the classical min-cut algorithm. When dealing with cuts of unit size ($s$-$t$ bridges) this algorithm can be simplified to a single graph traversal from $s$ to $t$ avoiding an arbitrary $s$-$t$ path, which is interrupted at the $s$-$t$ bridges. Further, the corresponding proof is also simplified making it independent of the theory of network flows., Comment: 5 pages, 5 figures

Strangeness was discovered roughly seventy years ago, lodged in a particle now known as the kaon, $K$. Kindred to the pion, $\pi$; both states are massless in the absence of Higgs-boson couplings. Kaons and pions are Nature's most fundamental Nambu-Goldstone modes. Their properties are largely determined by the mechanisms responsible for emergent mass in the standard model, but modulations applied by the Higgs are crucial to Universe evolution. Despite their importance, little is known empirically about $K$ and $\pi$ structure. This study delivers the first parameter-free predictions for all $K$ distribution functions (DFs) and comparisons with the analogous $\pi$ distributions, i.e. the one-dimensional maps that reveal how the light-front momentum of these states is shared amongst the gluons and quarks from which they are formed. The results should stimulate improved analyses of existing data and motivate new experiments sensitive to all $K$ and $\pi$ DFs., Comment: 8 pages, 5 figures, 1 table

With discovery of the Higgs boson, science has located the source for $\lesssim 2$% of the mass of visible matter. The focus of attention can now shift to the search for the origin of the remaining $\gtrsim 98$%. The instruments at work here must be capable of simultaneously generating the 1 GeV mass-scale associated with the nucleon and ensuring that this mass-scale is completely hidden in the chiral-limit pion. This hunt for an understanding of the emergence of hadronic mass (EHM) has actually been underway for many years. What is changing are the impacts of QCD-related theory, through the elucidation of clear signals for EHM in hadron observables, and the ability of modern and planned experimental facilities to access these observables. These developments are exemplified in a discussion of the evolving understanding of pion and kaon parton distributions., Comment: 13 pages, 9 figures. Invited contribution to EPJ ST Issue "Strong Correlations in Dense Matter Physics"

A Poincar\'e-covariant quark+diquark Faddeev equation is used to compute nucleon elastic form factors on $0\leq Q^2\leq 18 \,m_N^2$ ($m_N$ is the nucleon mass) and elucidate their role as probes of emergent hadronic mass in the Standard Model. The calculations expose features of the form factors that can be tested in new generation experiments at existing facilities, e.g. a zero in $G_E^p/G_M^p$; a maximum in $G_E^n/G_M^n$; and a zero in the proton's $d$-quark Dirac form factor, $F_1^d$. Additionally, examination of the associated light-front-transverse number and anomalous magnetisation densities reveals, inter alia: a marked excess of valence $u$-quarks in the neighbourhood of the proton's centre of transverse momentum; and that the valence $d$-quark is markedly more active magnetically than either of the valence $u$-quarks. The calculations and analysis also reveal other aspects of nucleon structure that could be tested with a high-luminosity accelerator capable of delivering higher beam energies than are currently available., Comment: 14 pages, 9 figures, 1 table