Paper Citation Record · LEDGER

Finding Planted Cycles in a Random Graph

As of 21 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2511.04058.

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

pith.paper-citation-record.v1
2511.04058 v2

Coverage vector

measured 26 of 26 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T23:57:55.019367Z

measured 26 of 26 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

26 of 26 outbound references displayed

verified exact0
verified fuzzy0
unresolved26
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e93f1ee2-914b-435c-86e2-c59bde20b36c · outbound

This paper cites Finding a large hidden clique in a random graph.Random Structures & Algorithms, 13(3-4):457–466, 1998.

Finding Planted Cycles in a Random Graph Finding a large hidden clique in a random graph.Random Structures & Algorithms, 13(3-4):457–466, 1998

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:53.039104Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8bd44219-5e5d-46ac-9121-b903d7b772f6 · outbound

This paper cites Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs.

Finding Planted Cycles in a Random Graph Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:53.168703Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89adc43a-b5da-4b06-89c0-5044a3277278 · outbound

This paper cites A note on long cycles in sparse random graphs.Electronic Journal of Combinatorics, 30(2), 2023.

Finding Planted Cycles in a Random Graph A note on long cycles in sparse random graphs.Electronic Journal of Combinatorics, 30(2), 2023

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:53.254560Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 60dac7c3-b57d-4584-85eb-679f6b419c52 · outbound

This paper cites A scaling limit for the length of the longest cycle in a sparse random graph.

Finding Planted Cycles in a Random Graph A scaling limit for the length of the longest cycle in a sparse random graph

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:53.331302Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00ad5f5b-02c5-4610-a3f8-6c39abd4eb44 · outbound

This paper cites A nearly tight sum-of-squares lower bound for the planted clique problem.SIAM Journal on Computing, 48(2):687–735, 2019.

Finding Planted Cycles in a Random Graph A nearly tight sum-of-squares lower bound for the planted clique problem.SIAM Journal on Computing, 48(2):687–735, 2019

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:53.418427Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a4fa0b1c-953b-4d7c-8056-b8a5c301b7e1 · outbound

This paper cites Springer, 1998.

Finding Planted Cycles in a Random Graph Springer, 1998

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:53.553998Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c8dde355-3271-46da-b8da-d1426ea53635 · outbound

This paper cites Long cycles in sparse random graphs.Graph Theory and Combinatorics (Cambridge, 1983), Academic Press, London, pages 59–64, 1984.

Finding Planted Cycles in a Random Graph Long cycles in sparse random graphs.Graph Theory and Combinatorics (Cambridge, 1983), Academic Press, London, pages 59–64, 1984

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:53.613857Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d63385e7-0000-47c7-92a0-e81a880097c0 · outbound

This paper cites Statistical and computational phase transitions in group testing.

Finding Planted Cycles in a Random Graph Statistical and computational phase transitions in group testing

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:53.672426Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d0d67d1-5b8d-4454-8661-f1b3d72fe117 · outbound

This paper cites The planted matching problem: Sharp threshold and infinite-order phase transition.Probability Theory and Related Fields, pages 1–71, 2023.

Finding Planted Cycles in a Random Graph The planted matching problem: Sharp threshold and infinite-order phase transition.Probability Theory and Related Fields, pages 1–71, 2023

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:53.761328Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c5360d9-01eb-4a79-8cd6-ef56e3b90057 · outbound

This paper cites an unresolved cited work.

Finding Planted Cycles in a Random Graph Unresolved cited work

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:53.842650Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e467b4fb-1ce6-4bfa-ac23-ace27ef0c490 · outbound

This paper cites On the evolution of random graphs.Publ.

Finding Planted Cycles in a Random Graph On the evolution of random graphs.Publ

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:53.935083Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 615c626f-2d14-40be-a99c-a8ee26b1e46f · outbound

This paper cites On large matchings and cycles in sparse random graphs.Discrete Mathematics, 59(3):243–256, 1986.

Finding Planted Cycles in a Random Graph On large matchings and cycles in sparse random graphs.Discrete Mathematics, 59(3):243–256, 1986

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:54.057993Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0466ad49-e97a-4706-a692-96bfee93fb64 · outbound

This paper cites Phase Transitions in Planted k-Factor Recovery.

Finding Planted Cycles in a Random Graph Phase Transitions in Planted k-Factor Recovery

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:54.164560Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fbf779d1-068b-45f8-b568-4b78e7fbc6eb · outbound

This paper cites Large cliques elude the metropolis process.Random Structures & Algorithms, 3(4):347–359, 1992.

Finding Planted Cycles in a Random Graph Large cliques elude the metropolis process.Random Structures & Algorithms, 3(4):347–359, 1992

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:54.255331Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed26f6be-9154-4d42-8c35-9d9e5449987c · outbound

This paper cites The probabilistic analysis of some combinatorial search algorithms.

Finding Planted Cycles in a Random Graph The probabilistic analysis of some combinatorial search algorithms

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:54.359706Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 596afbcd-33ab-4032-9833-59d579759c00 · outbound

This paper cites Moves without forbidden transitions in a graph.Matematick` y Časopis, 18(1):76–80, 1968.

Finding Planted Cycles in a Random Graph Moves without forbidden transitions in a graph.Matematick` y Časopis, 18(1):76–80, 1968

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:54.408013Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 601a6a7c-7b04-41d0-955a-67a1816ff5d7 · outbound

This paper cites Long paths and cycles in random subgraphs of graphs with large minimum degree.Random Structures & Algorithms, 46(2):320–345, 2015.

Finding Planted Cycles in a Random Graph Long paths and cycles in random subgraphs of graphs with large minimum degree.Random Structures & Algorithms, 46(2):320–345, 2015

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:54.508946Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6ec9e13c-21ed-4c28-a20d-e71b783c2127 · outbound

This paper cites Expected complexity of graph partitioning problems.Discrete Applied Mathematics, 57(2-3):193– 212, 1995.

Finding Planted Cycles in a Random Graph Expected complexity of graph partitioning problems.Discrete Applied Mathematics, 57(2-3):193– 212, 1995

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:54.570859Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 34e7766c-1289-40af-be4f-164aebbe9703 · outbound

This paper cites Detection-recovery gap for planted dense cycles.

Finding Planted Cycles in a Random Graph Detection-recovery gap for planted dense cycles

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:54.641402Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 702a6c92-f999-4a96-a5de-c2816478b521 · outbound

This paper cites Information-theoretic thresholds for planted dense cycles.

Finding Planted Cycles in a Random Graph Information-theoretic thresholds for planted dense cycles

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:54.698938Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0e2a0811-21c6-4f84-a56f-8091ebe74dc7 · outbound

This paper cites The planted matching problem: Phase transitions and exact results.The Annals of Applied Probability, 31(6):2663–2720, 2021.

Finding Planted Cycles in a Random Graph The planted matching problem: Phase transitions and exact results.The Annals of Applied Probability, 31(6):2663–2720, 2021

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:54.756172Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dff2341c-6b40-4b54-89c5-453f4c827417 · outbound

This paper cites Sharp thresholds in inference of planted subgraphs.

Finding Planted Cycles in a Random Graph Sharp thresholds in inference of planted subgraphs

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:54.778019Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fc44ba0b-a54d-4eec-b742-f58faa48bb56 · outbound

This paper cites The All-or-Nothing phenomenon in sparse tensor PCA.Advances in Neural Information Processing Systems, 33:17674–17684, 2020.

Finding Planted Cycles in a Random Graph The All-or-Nothing phenomenon in sparse tensor PCA.Advances in Neural Information Processing Systems, 33:17674–17684, 2020

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:54.839857Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2f0a0ed7-ec66-4e26-abf8-69ddb72745f3 · outbound

This paper cites The all-or-nothing phenomenon in sparse linear regression.Mathe- matical Statistics and Learning, 3(3):259–313, 2021.

Finding Planted Cycles in a Random Graph The all-or-nothing phenomenon in sparse linear regression.Mathe- matical Statistics and Learning, 3(3):259–313, 2021

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:54.899238Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 674602bd-10ce-48b4-bfcd-da6f4755fe04 · outbound

This paper cites On the All-or-Nothing behavior of Bernoulli group testing.IEEE Journal on Selected Areas in Information Theory, 1(3):669–680, 2020.

Finding Planted Cycles in a Random Graph On the All-or-Nothing behavior of Bernoulli group testing.IEEE Journal on Selected Areas in Information Theory, 1(3):669–680, 2020

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:54.998341Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bbb5ec4c-4cc6-466f-be7c-186e80f5d452 · outbound

This paper cites an unresolved cited work.

Finding Planted Cycles in a Random Graph Unresolved cited work

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-03T23:57:55.019367Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.