Paper Citation Record · LEDGER

Using dense graph limit theory to count cocycles of random simplicial complexes

As of 15 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 1 inbound Pith citation observation for arXiv:2509.06559.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2509.06559 v1

Coverage vector

measured 56 of 56 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T23:40:03.872006Z

measured 57 of 57 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-04T08:50:01.849595Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

56 of 56 outbound references displayed

verified exact0
verified fuzzy42
unresolved14
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3bbc31b5-0f6f-4ec7-9fa2-b044c919a4b6 · outbound

This paper cites The continuum random tree I.The Annals of Probability, 19(1):1 – 28, 1991.

Using dense graph limit theory to count cocycles of random simplicial complexes The continuum random tree I.The Annals of Probability, 19(1):1 – 28, 1991

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.584294Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 01837088-9e50-47cc-82c2-f0e6eb04d4c3 · outbound

This paper cites The continuum random tree II.

Using dense graph limit theory to count cocycles of random simplicial complexes The continuum random tree II

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.573663Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 5c42a576-96f6-470c-a027-6fdd0b0fcdf3 · outbound

This paper cites The continuum random tree III.The Annals of Probability, pages 248–289, 1993.

Using dense graph limit theory to count cocycles of random simplicial complexes The continuum random tree III.The Annals of Probability, pages 248–289, 1993

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.562062Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation cde6e3b7-eb2f-40ec-9af0-4f07779f893a · outbound

This paper cites The satisfiability threshold for random linear equations.Combinatorica, 40(2):179–235, 2020.

Using dense graph limit theory to count cocycles of random simplicial complexes The satisfiability threshold for random linear equations.Combinatorica, 40(2):179–235, 2020

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.550209Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 5df1974b-6a71-45d0-a969-111c75bd765d · outbound

This paper cites Topology of random geometric complexes: a survey.

Using dense graph limit theory to count cocycles of random simplicial complexes Topology of random geometric complexes: a survey

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.538512Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation eb8d54f2-b14b-40b4-b346-b34b0f0ce84f · outbound

This paper cites Random simplicial complexes: models and phe- nomena.

Using dense graph limit theory to count cocycles of random simplicial complexes Random simplicial complexes: models and phe- nomena

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.526884Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 0ac630cb-49a8-4689-b420-d762257e7e0e · outbound

This paper cites Counting graph homomorphisms.

Using dense graph limit theory to count cocycles of random simplicial complexes Counting graph homomorphisms

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.514953Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 847fa2ed-9845-4b12-b412-73cc7618374b · outbound

This paper cites Convergent sequences of dense graphs i: Subgraph frequencies, metric properties and testing.Advances in Mathematics, 219(6):1801–1851, 2008.

Using dense graph limit theory to count cocycles of random simplicial complexes Convergent sequences of dense graphs i: Subgraph frequencies, metric properties and testing.Advances in Mathematics, 219(6):1801–1851, 2008

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.504401Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation e4849c54-53c8-469c-8329-50eccebdc34d · outbound

This paper cites Convergent sequences of dense graphs ii.

Using dense graph limit theory to count cocycles of random simplicial complexes Convergent sequences of dense graphs ii

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-04T23:40:03.716491Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation da6283d3-2179-441c-aac2-33c70eb5e497 · outbound

This paper cites The large deviation principle for the Erdős- Rényi random graph.European Journal of Combinatorics, 32(7):1000–1017, 2011.

Using dense graph limit theory to count cocycles of random simplicial complexes The large deviation principle for the Erdős- Rényi random graph.European Journal of Combinatorics, 32(7):1000–1017, 2011

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.487671Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation e5b81474-2bfd-4daa-a44e-dcacefcdebdf · outbound

This paper cites Vanishing of cohomology groups of random simplicial complexes.Random Structures & Algorithms, 56(2):461–500, 2020.

Using dense graph limit theory to count cocycles of random simplicial complexes Vanishing of cohomology groups of random simplicial complexes.Random Structures & Algorithms, 56(2):461–500, 2020

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.477077Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 324272d9-e523-493b-998e-aecafdd05dcd · outbound

This paper cites Large deviations techniques and applications.

Using dense graph limit theory to count cocycles of random simplicial complexes Large deviations techniques and applications

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.466129Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 150d597d-6d10-478d-a951-cb4b2bb13df5 · outbound

This paper cites Graph limits and exchangeable random graphs.Ren- diconti di Matematica e delle sue Applicazioni.

Using dense graph limit theory to count cocycles of random simplicial complexes Graph limits and exchangeable random graphs.Ren- diconti di Matematica e delle sue Applicazioni

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.455308Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 036b3855-6cb4-4edf-8fc4-d05f99e07131 · outbound

This paper cites Homologyofmulti-parameterrandomsimplicialcomplexes.Discrete & Computational Geometry, 62(1):87–127, 2019.

Using dense graph limit theory to count cocycles of random simplicial complexes Homologyofmulti-parameterrandomsimplicialcomplexes.Discrete & Computational Geometry, 62(1):87–127, 2019

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.445136Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 3442840b-2140-4385-ab99-b0351d91b918 · outbound

This paper cites Reflection positivity, rank connectivity, andhomomorphismofgraphs.Journal of the American Mathematical Society, 20(1):37–51, 2007.

Using dense graph limit theory to count cocycles of random simplicial complexes Reflection positivity, rank connectivity, andhomomorphismofgraphs.Journal of the American Mathematical Society, 20(1):37–51, 2007

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.433578Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation f340b9a4-db48-4078-b846-516e913b8469 · outbound

This paper cites Quick approximation to matrices and applications.Com- binatorica, 19(2):175–220, 1999.

Using dense graph limit theory to count cocycles of random simplicial complexes Quick approximation to matrices and applications.Com- binatorica, 19(2):175–220, 1999

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.420083Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 9d465629-f4ed-4173-8c4e-21125cca2af7 · outbound

This paper cites Random labelled trees and their branching networks.Journal of the Australian Mathematical Society, 30(2):229–237, 1980.

Using dense graph limit theory to count cocycles of random simplicial complexes Random labelled trees and their branching networks.Journal of the Australian Mathematical Society, 30(2):229–237, 1980

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-04T23:40:03.744848Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1a6a3706-b35d-4136-b8f5-e5dcced1d56a · outbound

This paper cites Algebraic topology, 2000.

Using dense graph limit theory to count cocycles of random simplicial complexes Algebraic topology, 2000

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.402802Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation a2e78f33-b18b-4d33-a0d9-f02919841339 · outbound

This paper cites The threshold for integer homology in random d-complexes.Discrete & Computational Geometry, 57:810–823, 2017.

Using dense graph limit theory to count cocycles of random simplicial complexes The threshold for integer homology in random d-complexes.Discrete & Computational Geometry, 57:810–823, 2017

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.392719Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation f6858258-37fe-4977-93e2-8fbbbed40ab1 · outbound

This paper cites Determinantal processes and independence.Probability Surveys, 3:206–229, 2006.

Using dense graph limit theory to count cocycles of random simplicial complexes Determinantal processes and independence.Probability Surveys, 3:206–229, 2006

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-04T23:40:03.754958Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08edd824-013c-4d89-ac7f-ac3ffd0c09c9 · outbound

This paper cites Sharp vanishing thresholds for cohomology of random flag complexes.

Using dense graph limit theory to count cocycles of random simplicial complexes Sharp vanishing thresholds for cohomology of random flag complexes

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.374640Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 5faea396-efd2-4111-96bd-cf735b68b386 · outbound

This paper cites Cohen–Lenstra heuristics for torsion in homology of random complexes.Experimental Mathematics, 29(3):347–359, 2020.

Using dense graph limit theory to count cocycles of random simplicial complexes Cohen–Lenstra heuristics for torsion in homology of random complexes.Experimental Mathematics, 29(3):347–359, 2020

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.362091Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 7cfc0ba0-d40a-4a86-a1d5-3f7ea9037e6b · outbound

This paper cites Topology and geometry of random 2-dimensional hypertrees.Discrete & Computational Geometry, 67(4):1229–1244, 2022.

Using dense graph limit theory to count cocycles of random simplicial complexes Topology and geometry of random 2-dimensional hypertrees.Discrete & Computational Geometry, 67(4):1229–1244, 2022

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.350338Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 69685445-e462-4791-9f45-1da1a6848f2e · outbound

This paper cites Inside the critical window for cohomology of random k-complexes.Random Structures & Algorithms, 48(1):102–124, 2016.

Using dense graph limit theory to count cocycles of random simplicial complexes Inside the critical window for cohomology of random k-complexes.Random Structures & Algorithms, 48(1):102–124, 2016

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.338950Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 7fc725f2-5cd2-4979-a76a-a4f1bff37469 · outbound

This paper cites Enumeration ofQ-acyclic simplicial complexes.Israel Journal of Mathematics, 45:337–351, 1983.

Using dense graph limit theory to count cocycles of random simplicial complexes Enumeration ofQ-acyclic simplicial complexes.Israel Journal of Mathematics, 45:337–351, 1983

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.326088Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 9b71da69-2403-4d9f-afbb-6ef6fb4c09b2 · outbound

This paper cites Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes.Random Structures & Algorithms, 60(1):68– 105, 2022.

Using dense graph limit theory to count cocycles of random simplicial complexes Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes.Random Structures & Algorithms, 60(1):68– 105, 2022

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.313562Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 41fa8562-f7da-4e2a-bab8-da90ca2dbe41 · outbound

This paper cites Multigraph limits and exchangeability.Acta Mathe- matica Hungarica, 130:1–34, 2011.

Using dense graph limit theory to count cocycles of random simplicial complexes Multigraph limits and exchangeability.Acta Mathe- matica Hungarica, 130:1–34, 2011

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.301058Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 49a7a055-07c2-47a7-9d87-9b7164fe0fba · outbound

This paper cites Uniqueness of Banach space valued graphons.Journal of Math- ematical Analysis and Applications, 474(1):413–440, 2019.

Using dense graph limit theory to count cocycles of random simplicial complexes Uniqueness of Banach space valued graphons.Journal of Math- ematical Analysis and Applications, 474(1):413–440, 2019

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.288794Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation bbf1de76-ec4e-4fee-9744-a482bb24dc49 · outbound

This paper cites Multigraph limits, un- bounded kernels, and Banach space decorated graphs.Journal of Functional Analysis, 282(2):109284, 2022.

Using dense graph limit theory to count cocycles of random simplicial complexes Multigraph limits, un- bounded kernels, and Banach space decorated graphs.Journal of Functional Analysis, 282(2):109284, 2022

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.276736Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation a9201dee-16b9-4e33-8b3b-bd9979f37720 · outbound

This paper cites Distribution of the cokernels of determinantal row-sparse matrices.arXiv preprint arXiv:2505.11700, 2025.

Using dense graph limit theory to count cocycles of random simplicial complexes Distribution of the cokernels of determinantal row-sparse matrices.arXiv preprint arXiv:2505.11700, 2025

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-04T23:40:03.787043Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 16454ee3-0ef0-4184-8049-6f5ce3a03456 · outbound

This paper cites Homological connectivity of random 2-complexes.

Using dense graph limit theory to count cocycles of random simplicial complexes Homological connectivity of random 2-complexes

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-04T23:40:03.790122Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aa8988e4-89d7-4de3-86a0-747e141dbe30 · outbound

This paper cites On the phase transition in random simplicial complexes.

Using dense graph limit theory to count cocycles of random simplicial complexes On the phase transition in random simplicial complexes

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-04T23:40:03.793281Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ab1b96d-d096-46bf-a70a-1e4bed7057a6 · outbound

This paper cites Enumeration and randomized constructions of hypertrees.

Using dense graph limit theory to count cocycles of random simplicial complexes Enumeration and randomized constructions of hypertrees

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-04T23:40:03.796397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56de0d4a-3287-4ff4-af04-89439496a891 · outbound

This paper cites The rank of connection matrices and the dimension of graph algebras.

Using dense graph limit theory to count cocycles of random simplicial complexes The rank of connection matrices and the dimension of graph algebras

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.243719Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 68f6a288-9d4d-4877-bd73-a72805c73227 · outbound

This paper cites American Mathematical Soc., 2012.

Using dense graph limit theory to count cocycles of random simplicial complexes American Mathematical Soc., 2012

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-04T23:40:03.802705Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fe404740-9f31-47f4-956f-3ce9bdabe3df · outbound

This paper cites Generalized quasirandom graphs.Journal of Combinatorial Theory, Series B, 98(1):146–163, 2008.

Using dense graph limit theory to count cocycles of random simplicial complexes Generalized quasirandom graphs.Journal of Combinatorial Theory, Series B, 98(1):146–163, 2008

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.224531Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 150f260b-9238-4d7e-8176-0ad1432f00ac · outbound

This paper cites Limits of dense graph sequences.Journal of Combina- torial Theory, Series B, 96(6):933–957, 2006.

Using dense graph limit theory to count cocycles of random simplicial complexes Limits of dense graph sequences.Journal of Combina- torial Theory, Series B, 96(6):933–957, 2006

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.212699Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation c847fe70-598a-4a34-9d69-394507ee2b15 · outbound

This paper cites Szemerédi’s lemma for the analyst.GAFA Geometric And Functional Analysis, 17:252–270, 2007.

Using dense graph limit theory to count cocycles of random simplicial complexes Szemerédi’s lemma for the analyst.GAFA Geometric And Functional Analysis, 17:252–270, 2007

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.199970Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 3f26b323-e5a8-41d9-8d03-f2cb13fbc6c2 · outbound

This paper cites Contractors and connectors of graph algebras.Journal of Graph Theory, 60(1):11–30, 2009.

Using dense graph limit theory to count cocycles of random simplicial complexes Contractors and connectors of graph algebras.Journal of Graph Theory, 60(1):11–30, 2009

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.188777Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation c1f9c148-0fd4-4532-876c-6cbaaf506b88 · outbound

This paper cites Limits of compact decorated graphs.

Using dense graph limit theory to count cocycles of random simplicial complexes Limits of compact decorated graphs

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-04T23:40:03.819619Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aa55c1e1-1a55-47a8-932d-f586ae46789d · outbound

This paper cites Testing properties of graphs and functions.Israel Journal of Mathematics, 178(1):113–156, 2010.

Using dense graph limit theory to count cocycles of random simplicial complexes Testing properties of graphs and functions.Israel Journal of Mathematics, 178(1):113–156, 2010

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.176371Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 928367ef-7d52-4575-a946-163ea06abd86 · outbound

This paper cites Integral homology of random simplicial complexes.

Using dense graph limit theory to count cocycles of random simplicial complexes Integral homology of random simplicial complexes

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-04T23:40:03.826554Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fcc1d139-e2d6-4e04-b8ae-c905011545cf · outbound

This paper cites Determinantal probability measures.Publications Mathématiques de l’IHÉS, 98:167–212, 2003.

Using dense graph limit theory to count cocycles of random simplicial complexes Determinantal probability measures.Publications Mathématiques de l’IHÉS, 98:167–212, 2003

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.157152Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation b97e1db5-b827-42c0-92b2-f77b9f35f627 · outbound

This paper cites Randomcomplexesandℓ 2-Bettinumbers.Journal of Topology and Analysis, 1(02):153–175, 2009.

Using dense graph limit theory to count cocycles of random simplicial complexes Randomcomplexesandℓ 2-Bettinumbers.Journal of Topology and Analysis, 1(02):153–175, 2009

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.145629Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 62bca616-fa02-4f7a-aa34-46cdf91df585 · outbound

This paper cites Cambridge University Press, 2017.

Using dense graph limit theory to count cocycles of random simplicial complexes Cambridge University Press, 2017

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-04T23:40:03.836150Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 54a28841-4fff-40ea-9744-a225379e6a2b · outbound

This paper cites Homological connectivity of random k-dimensional complexes.Random Structures & Algorithms, 34(3):408–417, 2009.

Using dense graph limit theory to count cocycles of random simplicial complexes Homological connectivity of random k-dimensional complexes.Random Structures & Algorithms, 34(3):408–417, 2009

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.127075Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 997ff468-f857-48ed-a254-8d5f65ab8797 · outbound

This paper cites The local weak limit of k-dimensional hypertrees.Transactions of the American Mathematical Society, 375(9):6127–6154, 2022.

Using dense graph limit theory to count cocycles of random simplicial complexes The local weak limit of k-dimensional hypertrees.Transactions of the American Mathematical Society, 375(9):6127–6154, 2022

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-04T23:40:03.842439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3991fd78-baa5-435e-8c48-fe01e105c83b · outbound

This paper cites The $2$-torsion of determinantal hypertrees is not Cohen-Lenstra.

Using dense graph limit theory to count cocycles of random simplicial complexes The $2$-torsion of determinantal hypertrees is not Cohen-Lenstra

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-04T23:40:03.845663Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 28d40546-4b44-4904-96e8-927d6d1ec952 · outbound

This paper cites Coboundary expansion for the union of determinantal hypertrees.Ran- dom Structures & Algorithms, 65(4):896–914, 2024.

Using dense graph limit theory to count cocycles of random simplicial complexes Coboundary expansion for the union of determinantal hypertrees.Ran- dom Structures & Algorithms, 65(4):896–914, 2024

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.110168Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 4aed65d8-bf46-454c-ad9a-f7ffc0753a42 · outbound

This paper cites Bounds on the mod 2 homology of random 2-dimensional determinantal hypertrees.Combinatorica, 45(2):17, 2025.

Using dense graph limit theory to count cocycles of random simplicial complexes Bounds on the mod 2 homology of random 2-dimensional determinantal hypertrees.Combinatorica, 45(2):17, 2025

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.098327Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 9e590117-6511-455f-9bca-096c9441f3b6 · outbound

This paper cites Cohen–Lenstra distribution for sparse matrices with determinantal bi- asing.International Mathematics Research Notices, 2025(3), 2025.

Using dense graph limit theory to count cocycles of random simplicial complexes Cohen–Lenstra distribution for sparse matrices with determinantal bi- asing.International Mathematics Research Notices, 2025(3), 2025

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.087142Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation ca9fcb52-32de-4030-9820-53c25080646a · outbound

This paper cites The homology torsion growth of determinantal hypertrees.

Using dense graph limit theory to count cocycles of random simplicial complexes The homology torsion growth of determinantal hypertrees

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-04T23:40:03.858916Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4c4cdf3-6078-4e6d-be6c-7cf794242021 · outbound

This paper cites Distribution of labelled trees by diameter.

Using dense graph limit theory to count cocycles of random simplicial complexes Distribution of labelled trees by diameter

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.076737Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 39a2f4c9-aaf7-4309-b87e-1a8b5b29daf1 · outbound

This paper cites Regular partitions of graphs.

Using dense graph limit theory to count cocycles of random simplicial complexes Regular partitions of graphs

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.065753Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 025bec2b-9341-4b9c-b9c3-2089e99dce27 · outbound

This paper cites Simplex links in determinantal hypertrees.Journal of Applied and Computational Topology, pages 1–26, 2024.

Using dense graph limit theory to count cocycles of random simplicial complexes Simplex links in determinantal hypertrees.Journal of Applied and Computational Topology, pages 1–26, 2024

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.054320Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation c358434e-dfd4-4f2c-8633-88d40fb48fea · outbound

This paper cites Probability theory for random groups arising in number theory.

Using dense graph limit theory to count cocycles of random simplicial complexes Probability theory for random groups arising in number theory

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-08-04T23:40:04.042225Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Pith citing papers

Observation ff460cd2-8e81-4c17-8170-26ac753e034e · inbound

Local limits of determinantal processes cites this paper.

Local limits of determinantal processes Using dense graph limit theory to count cocycles of random simplicial complexes

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-04T08:50:01.849595Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.