Tootfinder

trec_web: TREC WT10g (2003)
A web graph network originally constructed in 2003 as a testbed for information-retrieval techniques, including web search engines. Distributed by University of Glasgow.
This network has 1601787 nodes and 8063026 edges.
Tags: Informational, Web graph, Unweighted
https://netw…

trec_web: TREC WT10g (2003)
A web graph network originally constructed in 2003 as a testbed for information-retrieval techniques, including web search engines. Distributed by University of Glasgow.
This network has 1601787 nodes and 8063026 edges.
Tags: Informational, Web graph, Unweighted
https://netw…

This https://arxiv.org/abs/1311.1765 has been replaced.
link: https://scholar.google.com/scholar?q=a<…

The $(\leq 6)$-half-reconstructibility of digraphs
Let $G=(V,A)$ be a digraph. With every subset $X$ of $V$, we associate the subdigraph $G[X]=(X,A\cap (X\times X))$ of $G$ induced by $X$. Given a positive integer $k$, a digraph $G$ is $(\leq k)$-half-reconstructible if it is determined up to duality by its subdigraphs of cardinality $\leq k$. In 2003, J. Dammak characterized the $(\leq k)$-half-reconstructible finite digraphs, for $k\in \{7,8,9,10,11\}$. N. El Amri, extended J. Dammak's characterization to infinite digraphs. In this paper, we …

Regularity and compactness for critical points of degenerate polyconvex energies
André Guerra, Riccardo Tione
https://arXiv.org/abs/2401.16315 https://

Regularity and compactness for critical points of degenerate polyconvex energies
We study Lipschitz critical points of the energy $\int_Ωg(\det D u) \, d x$ in two dimensions, where $g$ is a strictly convex function. We prove that the Jacobian of any Lipschitz critical point is constant, and that the Jacobians of sequences of approximately critical points converge strongly. The latter result answers in particular an open problem posed by Kirchheim, Müller and Šverák in 2003.

This https://arxiv.org/abs/2003.07769 has been replaced.
link: https://scholar.google.com/scholar?q=a

Testing the nature of Gauss-Bonnet gravity by four-dimensional rotating black hole shadow
The recent discovery of the novel four-dimensional static and spherically symmetric Gauss-Bonnet black hole provides a promising bed to test Gauss-Bonnet gravity by using astronomical observations [Phys. Rev. Lett. 124, 081301 (2020)]. In this paper, we first obtain the rotating Gauss-Bonnet black hole solution by using the Newman-Janis algorithm, and then study the shadow cast by the nonrotating and rotating candidate Gauss-Bonnet black holes. The result indicates that positive metric paramete…

When he died, his family discovered 50 years of cartooning output: the secret comics of Frank Johnson are published
When shipping clerk and former musician Frank Johnson died in Chicago in 1979 at the age of 67, his family was shocked to discover 2,300 pages of comics in bound notebooks that apparently nobody knew about. When his widow passed away in 2003, the notebooks were put up for sale, and comics expert Dan Nadel happened upon them (according to editor Chris Byrne).
What Na…

When he died, his family discovered 50 years of cartooning output: the secret comics of Frank Johnson are published
When shipping clerk and former musician Frank Johnson died in Chicago in 1979 at the age of 67, his family was shocked to discover 2,300 pages of comics in bound…

Chiefs win Super Bowl LVIII, becoming first NFL team since 2003-04 Patriots to win back-to-back Super Bowls

https://www.cbssports.com/nfl/news/…

Chiefs win Super Bowl LVIII, becoming first NFL team since 2003-04 Patriots to win back-to-back Super Bowls
Andy Reid's team has achieved yet another milestone

This https://arxiv.org/abs/1311.1765 has been replaced.
link: https://scholar.google.com/scholar?q=a<…

The $(\leq 6)$-half-reconstructibility of digraphs
Let $G=(V,A)$ be a digraph. With every subset $X$ of $V$, we associate the subdigraph $G[X]=(X,A\cap (X\times X))$ of $G$ induced by $X$. Given a positive integer $k$, a digraph $G$ is $(\leq k)$-half-reconstructible if it is determined up to duality by its subdigraphs of cardinality $\leq k$. In 2003, J. Dammak characterized the $(\leq k)$-half-reconstructible finite digraphs, for $k\in \{7,8,9,10,11\}$. N. El Amri, extended J. Dammak's characterization to infinite digraphs. In this paper, we …

dutch_school: Dutch school friendships (2003)
A series of snapshots of the friendships among freshmen at secondary school in The Netherlands, in 2003-2004. Friendship ties were surveyed four times, at three month intervals. The direction of an edge indicates that student i is friends with student j. Missing data is coded as 0 or 10. Metadata includes sex, age, ethnicity, and religion.
This network has 26 nodes and 170 edges.
Tags: Social, Offline, Unweighted, Metadata, Temp…

trec_web: TREC WT10g (2003)
A web graph network originally constructed in 2003 as a testbed for information-retrieval techniques, including web search engines. Distributed by University of Glasgow.
This network has 1601787 nodes and 8063026 edges.
Tags: Informational, Web graph, Unweighted
https://netw…